]> git.ipfire.org Git - thirdparty/mdadm.git/blob - super-ddf.c
projects / thirdparty / mdadm.git / blob
? search:


769eded3bba8a8926aa6c64766fbb79fed3bd68b
[thirdparty/mdadm.git] / super-ddf.c
1 /*
2 * mdadm - manage Linux "md" devices aka RAID arrays.
3 *
4 * Copyright (C) 2006-2014 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 taken 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 #include <stddef.h>
34
35 /* a non-official T10 name for creation GUIDs */
36 static char T10[] = "Linux-MD";
37
38 /* DDF timestamps are 1980 based, so we need to add
39 * second-in-decade-of-seventies to convert to linux timestamps.
40 * 10 years with 2 leap years.
41 */
42 #define DECADE (3600*24*(365*10+2))
43 unsigned long crc32(
44 unsigned long crc,
45 const unsigned char *buf,
46 unsigned len);
47
48 #define DDF_NOTFOUND (~0U)
49 #define DDF_CONTAINER (DDF_NOTFOUND-1)
50
51 /* Default for safe_mode_delay. Same value as for IMSM.
52 */
53 static const int DDF_SAFE_MODE_DELAY = 4000;
54
55 /* The DDF metadata handling.
56 * DDF metadata lives at the end of the device.
57 * The last 512 byte block provides an 'anchor' which is used to locate
58 * the rest of the metadata which usually lives immediately behind the anchor.
59 *
60 * Note:
61 * - all multibyte numeric fields are bigendian.
62 * - all strings are space padded.
63 *
64 */
65
66 typedef struct __be16 {
67 __u16 _v16;
68 } be16;
69 #define be16_eq(x, y) ((x)._v16 == (y)._v16)
70 #define be16_and(x, y) ((x)._v16 & (y)._v16)
71 #define be16_or(x, y) ((x)._v16 | (y)._v16)
72 #define be16_clear(x, y) ((x)._v16 &= ~(y)._v16)
73 #define be16_set(x, y) ((x)._v16 |= (y)._v16)
74
75 typedef struct __be32 {
76 __u32 _v32;
77 } be32;
78 #define be32_eq(x, y) ((x)._v32 == (y)._v32)
79
80 typedef struct __be64 {
81 __u64 _v64;
82 } be64;
83 #define be64_eq(x, y) ((x)._v64 == (y)._v64)
84
85 #define be16_to_cpu(be) __be16_to_cpu((be)._v16)
86 static inline be16 cpu_to_be16(__u16 x)
87 {
88 be16 be = { ._v16 = __cpu_to_be16(x) };
89 return be;
90 }
91
92 #define be32_to_cpu(be) __be32_to_cpu((be)._v32)
93 static inline be32 cpu_to_be32(__u32 x)
94 {
95 be32 be = { ._v32 = __cpu_to_be32(x) };
96 return be;
97 }
98
99 #define be64_to_cpu(be) __be64_to_cpu((be)._v64)
100 static inline be64 cpu_to_be64(__u64 x)
101 {
102 be64 be = { ._v64 = __cpu_to_be64(x) };
103 return be;
104 }
105
106 /* Primary Raid Level (PRL) */
107 #define DDF_RAID0 0x00
108 #define DDF_RAID1 0x01
109 #define DDF_RAID3 0x03
110 #define DDF_RAID4 0x04
111 #define DDF_RAID5 0x05
112 #define DDF_RAID1E 0x11
113 #define DDF_JBOD 0x0f
114 #define DDF_CONCAT 0x1f
115 #define DDF_RAID5E 0x15
116 #define DDF_RAID5EE 0x25
117 #define DDF_RAID6 0x06
118
119 /* Raid Level Qualifier (RLQ) */
120 #define DDF_RAID0_SIMPLE 0x00
121 #define DDF_RAID1_SIMPLE 0x00 /* just 2 devices in this plex */
122 #define DDF_RAID1_MULTI 0x01 /* exactly 3 devices in this plex */
123 #define DDF_RAID3_0 0x00 /* parity in first extent */
124 #define DDF_RAID3_N 0x01 /* parity in last extent */
125 #define DDF_RAID4_0 0x00 /* parity in first extent */
126 #define DDF_RAID4_N 0x01 /* parity in last extent */
127 /* these apply to raid5e and raid5ee as well */
128 #define DDF_RAID5_0_RESTART 0x00 /* same as 'right asymmetric' - layout 1 */
129 #define DDF_RAID6_0_RESTART 0x01 /* raid6 different from raid5 here!!! */
130 #define DDF_RAID5_N_RESTART 0x02 /* same as 'left asymmetric' - layout 0 */
131 #define DDF_RAID5_N_CONTINUE 0x03 /* same as 'left symmetric' - layout 2 */
132
133 #define DDF_RAID1E_ADJACENT 0x00 /* raid10 nearcopies==2 */
134 #define DDF_RAID1E_OFFSET 0x01 /* raid10 offsetcopies==2 */
135
136 /* Secondary RAID Level (SRL) */
137 #define DDF_2STRIPED 0x00 /* This is weirder than RAID0 !! */
138 #define DDF_2MIRRORED 0x01
139 #define DDF_2CONCAT 0x02
140 #define DDF_2SPANNED 0x03 /* This is also weird - be careful */
141
142 /* Magic numbers */
143 #define DDF_HEADER_MAGIC cpu_to_be32(0xDE11DE11)
144 #define DDF_CONTROLLER_MAGIC cpu_to_be32(0xAD111111)
145 #define DDF_PHYS_RECORDS_MAGIC cpu_to_be32(0x22222222)
146 #define DDF_PHYS_DATA_MAGIC cpu_to_be32(0x33333333)
147 #define DDF_VIRT_RECORDS_MAGIC cpu_to_be32(0xDDDDDDDD)
148 #define DDF_VD_CONF_MAGIC cpu_to_be32(0xEEEEEEEE)
149 #define DDF_SPARE_ASSIGN_MAGIC cpu_to_be32(0x55555555)
150 #define DDF_VU_CONF_MAGIC cpu_to_be32(0x88888888)
151 #define DDF_VENDOR_LOG_MAGIC cpu_to_be32(0x01dBEEF0)
152 #define DDF_BBM_LOG_MAGIC cpu_to_be32(0xABADB10C)
153
154 #define DDF_GUID_LEN 24
155 #define DDF_REVISION_0 "01.00.00"
156 #define DDF_REVISION_2 "01.02.00"
157
158 struct ddf_header {
159 be32 magic; /* DDF_HEADER_MAGIC */
160 be32 crc;
161 char guid[DDF_GUID_LEN];
162 char revision[8]; /* 01.02.00 */
163 be32 seq; /* starts at '1' */
164 be32 timestamp;
165 __u8 openflag;
166 __u8 foreignflag;
167 __u8 enforcegroups;
168 __u8 pad0; /* 0xff */
169 __u8 pad1[12]; /* 12 * 0xff */
170 /* 64 bytes so far */
171 __u8 header_ext[32]; /* reserved: fill with 0xff */
172 be64 primary_lba;
173 be64 secondary_lba;
174 __u8 type;
175 __u8 pad2[3]; /* 0xff */
176 be32 workspace_len; /* sectors for vendor space -
177 * at least 32768(sectors) */
178 be64 workspace_lba;
179 be16 max_pd_entries; /* one of 15, 63, 255, 1023, 4095 */
180 be16 max_vd_entries; /* 2^(4,6,8,10,12)-1 : i.e. as above */
181 be16 max_partitions; /* i.e. max num of configuration
182 record entries per disk */
183 be16 config_record_len; /* 1 +ROUNDUP(max_primary_element_entries
184 *12/512) */
185 be16 max_primary_element_entries; /* 16, 64, 256, 1024, or 4096 */
186 __u8 pad3[54]; /* 0xff */
187 /* 192 bytes so far */
188 be32 controller_section_offset;
189 be32 controller_section_length;
190 be32 phys_section_offset;
191 be32 phys_section_length;
192 be32 virt_section_offset;
193 be32 virt_section_length;
194 be32 config_section_offset;
195 be32 config_section_length;
196 be32 data_section_offset;
197 be32 data_section_length;
198 be32 bbm_section_offset;
199 be32 bbm_section_length;
200 be32 diag_space_offset;
201 be32 diag_space_length;
202 be32 vendor_offset;
203 be32 vendor_length;
204 /* 256 bytes so far */
205 __u8 pad4[256]; /* 0xff */
206 };
207
208 /* type field */
209 #define DDF_HEADER_ANCHOR 0x00
210 #define DDF_HEADER_PRIMARY 0x01
211 #define DDF_HEADER_SECONDARY 0x02
212
213 /* The content of the 'controller section' - global scope */
214 struct ddf_controller_data {
215 be32 magic; /* DDF_CONTROLLER_MAGIC */
216 be32 crc;
217 char guid[DDF_GUID_LEN];
218 struct controller_type {
219 be16 vendor_id;
220 be16 device_id;
221 be16 sub_vendor_id;
222 be16 sub_device_id;
223 } type;
224 char product_id[16];
225 __u8 pad[8]; /* 0xff */
226 __u8 vendor_data[448];
227 };
228
229 /* The content of phys_section - global scope */
230 struct phys_disk {
231 be32 magic; /* DDF_PHYS_RECORDS_MAGIC */
232 be32 crc;
233 be16 used_pdes; /* This is a counter, not a max - the list
234 * of used entries may not be dense */
235 be16 max_pdes;
236 __u8 pad[52];
237 struct phys_disk_entry {
238 char guid[DDF_GUID_LEN];
239 be32 refnum;
240 be16 type;
241 be16 state;
242 be64 config_size; /* DDF structures must be after here */
243 char path[18]; /* Another horrible structure really
244 * but is "used for information
245 * purposes only" */
246 __u8 pad[6];
247 } entries[0];
248 };
249
250 /* phys_disk_entry.type is a bitmap - bigendian remember */
251 #define DDF_Forced_PD_GUID 1
252 #define DDF_Active_in_VD 2
253 #define DDF_Global_Spare 4 /* VD_CONF records are ignored */
254 #define DDF_Spare 8 /* overrides Global_spare */
255 #define DDF_Foreign 16
256 #define DDF_Legacy 32 /* no DDF on this device */
257
258 #define DDF_Interface_mask 0xf00
259 #define DDF_Interface_SCSI 0x100
260 #define DDF_Interface_SAS 0x200
261 #define DDF_Interface_SATA 0x300
262 #define DDF_Interface_FC 0x400
263
264 /* phys_disk_entry.state is a bigendian bitmap */
265 #define DDF_Online 1
266 #define DDF_Failed 2 /* overrides 1,4,8 */
267 #define DDF_Rebuilding 4
268 #define DDF_Transition 8
269 #define DDF_SMART 16
270 #define DDF_ReadErrors 32
271 #define DDF_Missing 64
272
273 /* The content of the virt_section global scope */
274 struct virtual_disk {
275 be32 magic; /* DDF_VIRT_RECORDS_MAGIC */
276 be32 crc;
277 be16 populated_vdes;
278 be16 max_vdes;
279 __u8 pad[52];
280 struct virtual_entry {
281 char guid[DDF_GUID_LEN];
282 be16 unit;
283 __u16 pad0; /* 0xffff */
284 be16 guid_crc;
285 be16 type;
286 __u8 state;
287 __u8 init_state;
288 __u8 pad1[14];
289 char name[16];
290 } entries[0];
291 };
292
293 /* virtual_entry.type is a bitmap - bigendian */
294 #define DDF_Shared 1
295 #define DDF_Enforce_Groups 2
296 #define DDF_Unicode 4
297 #define DDF_Owner_Valid 8
298
299 /* virtual_entry.state is a bigendian bitmap */
300 #define DDF_state_mask 0x7
301 #define DDF_state_optimal 0x0
302 #define DDF_state_degraded 0x1
303 #define DDF_state_deleted 0x2
304 #define DDF_state_missing 0x3
305 #define DDF_state_failed 0x4
306 #define DDF_state_part_optimal 0x5
307
308 #define DDF_state_morphing 0x8
309 #define DDF_state_inconsistent 0x10
310
311 /* virtual_entry.init_state is a bigendian bitmap */
312 #define DDF_initstate_mask 0x03
313 #define DDF_init_not 0x00
314 #define DDF_init_quick 0x01 /* initialisation is progress.
315 * i.e. 'state_inconsistent' */
316 #define DDF_init_full 0x02
317
318 #define DDF_access_mask 0xc0
319 #define DDF_access_rw 0x00
320 #define DDF_access_ro 0x80
321 #define DDF_access_blocked 0xc0
322
323 /* The content of the config_section - local scope
324 * It has multiple records each config_record_len sectors
325 * They can be vd_config or spare_assign
326 */
327
328 struct vd_config {
329 be32 magic; /* DDF_VD_CONF_MAGIC */
330 be32 crc;
331 char guid[DDF_GUID_LEN];
332 be32 timestamp;
333 be32 seqnum;
334 __u8 pad0[24];
335 be16 prim_elmnt_count;
336 __u8 chunk_shift; /* 0 == 512, 1==1024 etc */
337 __u8 prl;
338 __u8 rlq;
339 __u8 sec_elmnt_count;
340 __u8 sec_elmnt_seq;
341 __u8 srl;
342 be64 blocks; /* blocks per component could be different
343 * on different component devices...(only
344 * for concat I hope) */
345 be64 array_blocks; /* blocks in array */
346 __u8 pad1[8];
347 be32 spare_refs[8]; /* This is used to detect missing spares.
348 * As we don't have an interface for that
349 * the values are ignored.
350 */
351 __u8 cache_pol[8];
352 __u8 bg_rate;
353 __u8 pad2[3];
354 __u8 pad3[52];
355 __u8 pad4[192];
356 __u8 v0[32]; /* reserved- 0xff */
357 __u8 v1[32]; /* reserved- 0xff */
358 __u8 v2[16]; /* reserved- 0xff */
359 __u8 v3[16]; /* reserved- 0xff */
360 __u8 vendor[32];
361 be32 phys_refnum[0]; /* refnum of each disk in sequence */
362 /*__u64 lba_offset[0]; LBA offset in each phys. Note extents in a
363 bvd are always the same size */
364 };
365 #define LBA_OFFSET(ddf, vd) ((be64 *) &(vd)->phys_refnum[(ddf)->mppe])
366
367 /* vd_config.cache_pol[7] is a bitmap */
368 #define DDF_cache_writeback 1 /* else writethrough */
369 #define DDF_cache_wadaptive 2 /* only applies if writeback */
370 #define DDF_cache_readahead 4
371 #define DDF_cache_radaptive 8 /* only if doing read-ahead */
372 #define DDF_cache_ifnobatt 16 /* even to write cache if battery is poor */
373 #define DDF_cache_wallowed 32 /* enable write caching */
374 #define DDF_cache_rallowed 64 /* enable read caching */
375
376 struct spare_assign {
377 be32 magic; /* DDF_SPARE_ASSIGN_MAGIC */
378 be32 crc;
379 be32 timestamp;
380 __u8 reserved[7];
381 __u8 type;
382 be16 populated; /* SAEs used */
383 be16 max; /* max SAEs */
384 __u8 pad[8];
385 struct spare_assign_entry {
386 char guid[DDF_GUID_LEN];
387 be16 secondary_element;
388 __u8 pad[6];
389 } spare_ents[0];
390 };
391 /* spare_assign.type is a bitmap */
392 #define DDF_spare_dedicated 0x1 /* else global */
393 #define DDF_spare_revertible 0x2 /* else committable */
394 #define DDF_spare_active 0x4 /* else not active */
395 #define DDF_spare_affinity 0x8 /* enclosure affinity */
396
397 /* The data_section contents - local scope */
398 struct disk_data {
399 be32 magic; /* DDF_PHYS_DATA_MAGIC */
400 be32 crc;
401 char guid[DDF_GUID_LEN];
402 be32 refnum; /* crc of some magic drive data ... */
403 __u8 forced_ref; /* set when above was not result of magic */
404 __u8 forced_guid; /* set if guid was forced rather than magic */
405 __u8 vendor[32];
406 __u8 pad[442];
407 };
408
409 /* bbm_section content */
410 struct bad_block_log {
411 be32 magic;
412 be32 crc;
413 be16 entry_count;
414 be32 spare_count;
415 __u8 pad[10];
416 be64 first_spare;
417 struct mapped_block {
418 be64 defective_start;
419 be32 replacement_start;
420 be16 remap_count;
421 __u8 pad[2];
422 } entries[0];
423 };
424
425 /* Struct for internally holding ddf structures */
426 /* The DDF structure stored on each device is potentially
427 * quite different, as some data is global and some is local.
428 * The global data is:
429 * - ddf header
430 * - controller_data
431 * - Physical disk records
432 * - Virtual disk records
433 * The local data is:
434 * - Configuration records
435 * - Physical Disk data section
436 * ( and Bad block and vendor which I don't care about yet).
437 *
438 * The local data is parsed into separate lists as it is read
439 * and reconstructed for writing. This means that we only need
440 * to make config changes once and they are automatically
441 * propagated to all devices.
442 * The global (config and disk data) records are each in a list
443 * of separate data structures. When writing we find the entry
444 * or entries applicable to the particular device.
445 */
446 struct ddf_super {
447 struct ddf_header anchor, primary, secondary;
448 struct ddf_controller_data controller;
449 struct ddf_header *active;
450 struct phys_disk *phys;
451 struct virtual_disk *virt;
452 char *conf;
453 int pdsize, vdsize;
454 unsigned int max_part, mppe, conf_rec_len;
455 int currentdev;
456 int updates_pending;
457 struct vcl {
458 union {
459 char space[512];
460 struct {
461 struct vcl *next;
462 unsigned int vcnum; /* index into ->virt */
463 /* For an array with a secondary level there are
464 * multiple vd_config structures, all with the same
465 * guid but with different sec_elmnt_seq.
466 * One of these structures is in 'conf' below.
467 * The others are in other_bvds, not in any
468 * particular order.
469 */
470 struct vd_config **other_bvds;
471 __u64 *block_sizes; /* NULL if all the same */
472 };
473 };
474 struct vd_config conf;
475 } *conflist, *currentconf;
476 struct dl {
477 union {
478 char space[512];
479 struct {
480 struct dl *next;
481 int major, minor;
482 char *devname;
483 int fd;
484 unsigned long long size; /* sectors */
485 be64 primary_lba; /* sectors */
486 be64 secondary_lba; /* sectors */
487 be64 workspace_lba; /* sectors */
488 int pdnum; /* index in ->phys */
489 struct spare_assign *spare;
490 void *mdupdate; /* hold metadata update */
491
492 /* These fields used by auto-layout */
493 int raiddisk; /* slot to fill in autolayout */
494 __u64 esize;
495 int displayed;
496 };
497 };
498 struct disk_data disk;
499 struct vcl *vlist[0]; /* max_part in size */
500 } *dlist, *add_list;
501 };
502
503 static int load_super_ddf_all(struct supertype *st, int fd,
504 void **sbp, char *devname);
505 static int get_svd_state(const struct ddf_super *, const struct vcl *);
506 static int
507 validate_geometry_ddf_container(struct supertype *st,
508 int level, int layout, int raiddisks,
509 int chunk, unsigned long long size,
510 unsigned long long data_offset,
511 char *dev, unsigned long long *freesize,
512 int verbose);
513
514 static int validate_geometry_ddf_bvd(struct supertype *st,
515 int level, int layout, int raiddisks,
516 int *chunk, unsigned long long size,
517 unsigned long long data_offset,
518 char *dev, unsigned long long *freesize,
519 int verbose);
520
521 static void free_super_ddf(struct supertype *st);
522 static int all_ff(const char *guid);
523 static unsigned int get_pd_index_from_refnum(const struct vcl *vc,
524 be32 refnum, unsigned int nmax,
525 const struct vd_config **bvd,
526 unsigned int *idx);
527 static void getinfo_super_ddf(struct supertype *st, struct mdinfo *info, char *map);
528 static void uuid_from_ddf_guid(const char *guid, int uuid[4]);
529 static void uuid_from_super_ddf(struct supertype *st, int uuid[4]);
530 static void _ddf_array_name(char *name, const struct ddf_super *ddf, int i);
531 static void getinfo_super_ddf_bvd(struct supertype *st, struct mdinfo *info, char *map);
532 static int init_super_ddf_bvd(struct supertype *st,
533 mdu_array_info_t *info,
534 unsigned long long size,
535 char *name, char *homehost,
536 int *uuid, unsigned long long data_offset);
537
538 #if DEBUG
539 static void pr_state(struct ddf_super *ddf, const char *msg)
540 {
541 unsigned int i;
542 dprintf("%s: ", msg);
543 for (i = 0; i < be16_to_cpu(ddf->active->max_vd_entries); i++) {
544 if (all_ff(ddf->virt->entries[i].guid))
545 continue;
546 dprintf_cont("%u(s=%02x i=%02x) ", i,
547 ddf->virt->entries[i].state,
548 ddf->virt->entries[i].init_state);
549 }
550 dprintf_cont("\n");
551 }
552 #else
553 static void pr_state(const struct ddf_super *ddf, const char *msg) {}
554 #endif
555
556 static void _ddf_set_updates_pending(struct ddf_super *ddf, struct vd_config *vc,
557 const char *func)
558 {
559 if (vc) {
560 vc->timestamp = cpu_to_be32(time(0)-DECADE);
561 vc->seqnum = cpu_to_be32(be32_to_cpu(vc->seqnum) + 1);
562 }
563 if (ddf->updates_pending)
564 return;
565 ddf->updates_pending = 1;
566 ddf->active->seq = cpu_to_be32((be32_to_cpu(ddf->active->seq)+1));
567 pr_state(ddf, func);
568 }
569
570 #define ddf_set_updates_pending(x,v) _ddf_set_updates_pending((x), (v), __func__)
571
572 static be32 calc_crc(void *buf, int len)
573 {
574 /* crcs are always at the same place as in the ddf_header */
575 struct ddf_header *ddf = buf;
576 be32 oldcrc = ddf->crc;
577 __u32 newcrc;
578 ddf->crc = cpu_to_be32(0xffffffff);
579
580 newcrc = crc32(0, buf, len);
581 ddf->crc = oldcrc;
582 /* The crc is stored (like everything) bigendian, so convert
583 * here for simplicity
584 */
585 return cpu_to_be32(newcrc);
586 }
587
588 #define DDF_INVALID_LEVEL 0xff
589 #define DDF_NO_SECONDARY 0xff
590 static int err_bad_md_layout(const mdu_array_info_t *array)
591 {
592 pr_err("RAID%d layout %x with %d disks is unsupported for DDF\n",
593 array->level, array->layout, array->raid_disks);
594 return -1;
595 }
596
597 static int layout_md2ddf(const mdu_array_info_t *array,
598 struct vd_config *conf)
599 {
600 be16 prim_elmnt_count = cpu_to_be16(array->raid_disks);
601 __u8 prl = DDF_INVALID_LEVEL, rlq = 0;
602 __u8 sec_elmnt_count = 1;
603 __u8 srl = DDF_NO_SECONDARY;
604
605 switch (array->level) {
606 case LEVEL_LINEAR:
607 prl = DDF_CONCAT;
608 break;
609 case 0:
610 rlq = DDF_RAID0_SIMPLE;
611 prl = DDF_RAID0;
612 break;
613 case 1:
614 switch (array->raid_disks) {
615 case 2:
616 rlq = DDF_RAID1_SIMPLE;
617 break;
618 case 3:
619 rlq = DDF_RAID1_MULTI;
620 break;
621 default:
622 return err_bad_md_layout(array);
623 }
624 prl = DDF_RAID1;
625 break;
626 case 4:
627 if (array->layout != 0)
628 return err_bad_md_layout(array);
629 rlq = DDF_RAID4_N;
630 prl = DDF_RAID4;
631 break;
632 case 5:
633 switch (array->layout) {
634 case ALGORITHM_LEFT_ASYMMETRIC:
635 rlq = DDF_RAID5_N_RESTART;
636 break;
637 case ALGORITHM_RIGHT_ASYMMETRIC:
638 rlq = DDF_RAID5_0_RESTART;
639 break;
640 case ALGORITHM_LEFT_SYMMETRIC:
641 rlq = DDF_RAID5_N_CONTINUE;
642 break;
643 case ALGORITHM_RIGHT_SYMMETRIC:
644 /* not mentioned in standard */
645 default:
646 return err_bad_md_layout(array);
647 }
648 prl = DDF_RAID5;
649 break;
650 case 6:
651 switch (array->layout) {
652 case ALGORITHM_ROTATING_N_RESTART:
653 rlq = DDF_RAID5_N_RESTART;
654 break;
655 case ALGORITHM_ROTATING_ZERO_RESTART:
656 rlq = DDF_RAID6_0_RESTART;
657 break;
658 case ALGORITHM_ROTATING_N_CONTINUE:
659 rlq = DDF_RAID5_N_CONTINUE;
660 break;
661 default:
662 return err_bad_md_layout(array);
663 }
664 prl = DDF_RAID6;
665 break;
666 case 10:
667 if (array->raid_disks % 2 == 0 && array->layout == 0x102) {
668 rlq = DDF_RAID1_SIMPLE;
669 prim_elmnt_count = cpu_to_be16(2);
670 sec_elmnt_count = array->raid_disks / 2;
671 srl = DDF_2SPANNED;
672 prl = DDF_RAID1;
673 } else if (array->raid_disks % 3 == 0 &&
674 array->layout == 0x103) {
675 rlq = DDF_RAID1_MULTI;
676 prim_elmnt_count = cpu_to_be16(3);
677 sec_elmnt_count = array->raid_disks / 3;
678 srl = DDF_2SPANNED;
679 prl = DDF_RAID1;
680 } else if (array->layout == 0x201) {
681 prl = DDF_RAID1E;
682 rlq = DDF_RAID1E_OFFSET;
683 } else if (array->layout == 0x102) {
684 prl = DDF_RAID1E;
685 rlq = DDF_RAID1E_ADJACENT;
686 } else
687 return err_bad_md_layout(array);
688 break;
689 default:
690 return err_bad_md_layout(array);
691 }
692 conf->prl = prl;
693 conf->prim_elmnt_count = prim_elmnt_count;
694 conf->rlq = rlq;
695 conf->srl = srl;
696 conf->sec_elmnt_count = sec_elmnt_count;
697 return 0;
698 }
699
700 static int err_bad_ddf_layout(const struct vd_config *conf)
701 {
702 pr_err("DDF RAID %u qualifier %u with %u disks is unsupported\n",
703 conf->prl, conf->rlq, be16_to_cpu(conf->prim_elmnt_count));
704 return -1;
705 }
706
707 static int layout_ddf2md(const struct vd_config *conf,
708 mdu_array_info_t *array)
709 {
710 int level = LEVEL_UNSUPPORTED;
711 int layout = 0;
712 int raiddisks = be16_to_cpu(conf->prim_elmnt_count);
713
714 if (conf->sec_elmnt_count > 1) {
715 /* see also check_secondary() */
716 if (conf->prl != DDF_RAID1 ||
717 (conf->srl != DDF_2STRIPED && conf->srl != DDF_2SPANNED)) {
718 pr_err("Unsupported secondary RAID level %u/%u\n",
719 conf->prl, conf->srl);
720 return -1;
721 }
722 if (raiddisks == 2 && conf->rlq == DDF_RAID1_SIMPLE)
723 layout = 0x102;
724 else if (raiddisks == 3 && conf->rlq == DDF_RAID1_MULTI)
725 layout = 0x103;
726 else
727 return err_bad_ddf_layout(conf);
728 raiddisks *= conf->sec_elmnt_count;
729 level = 10;
730 goto good;
731 }
732
733 switch (conf->prl) {
734 case DDF_CONCAT:
735 level = LEVEL_LINEAR;
736 break;
737 case DDF_RAID0:
738 if (conf->rlq != DDF_RAID0_SIMPLE)
739 return err_bad_ddf_layout(conf);
740 level = 0;
741 break;
742 case DDF_RAID1:
743 if (!((conf->rlq == DDF_RAID1_SIMPLE && raiddisks == 2) ||
744 (conf->rlq == DDF_RAID1_MULTI && raiddisks == 3)))
745 return err_bad_ddf_layout(conf);
746 level = 1;
747 break;
748 case DDF_RAID1E:
749 if (conf->rlq == DDF_RAID1E_ADJACENT)
750 layout = 0x102;
751 else if (conf->rlq == DDF_RAID1E_OFFSET)
752 layout = 0x201;
753 else
754 return err_bad_ddf_layout(conf);
755 level = 10;
756 break;
757 case DDF_RAID4:
758 if (conf->rlq != DDF_RAID4_N)
759 return err_bad_ddf_layout(conf);
760 level = 4;
761 break;
762 case DDF_RAID5:
763 switch (conf->rlq) {
764 case DDF_RAID5_N_RESTART:
765 layout = ALGORITHM_LEFT_ASYMMETRIC;
766 break;
767 case DDF_RAID5_0_RESTART:
768 layout = ALGORITHM_RIGHT_ASYMMETRIC;
769 break;
770 case DDF_RAID5_N_CONTINUE:
771 layout = ALGORITHM_LEFT_SYMMETRIC;
772 break;
773 default:
774 return err_bad_ddf_layout(conf);
775 }
776 level = 5;
777 break;
778 case DDF_RAID6:
779 switch (conf->rlq) {
780 case DDF_RAID5_N_RESTART:
781 layout = ALGORITHM_ROTATING_N_RESTART;
782 break;
783 case DDF_RAID6_0_RESTART:
784 layout = ALGORITHM_ROTATING_ZERO_RESTART;
785 break;
786 case DDF_RAID5_N_CONTINUE:
787 layout = ALGORITHM_ROTATING_N_CONTINUE;
788 break;
789 default:
790 return err_bad_ddf_layout(conf);
791 }
792 level = 6;
793 break;
794 default:
795 return err_bad_ddf_layout(conf);
796 };
797
798 good:
799 array->level = level;
800 array->layout = layout;
801 array->raid_disks = raiddisks;
802 return 0;
803 }
804
805 static int load_ddf_header(int fd, unsigned long long lba,
806 unsigned long long size,
807 int type,
808 struct ddf_header *hdr, struct ddf_header *anchor)
809 {
810 /* read a ddf header (primary or secondary) from fd/lba
811 * and check that it is consistent with anchor
812 * Need to check:
813 * magic, crc, guid, rev, and LBA's header_type, and
814 * everything after header_type must be the same
815 */
816 if (lba >= size-1)
817 return 0;
818
819 if (lseek64(fd, lba<<9, 0) < 0)
820 return 0;
821
822 if (read(fd, hdr, 512) != 512)
823 return 0;
824
825 if (!be32_eq(hdr->magic, DDF_HEADER_MAGIC)) {
826 pr_err("bad header magic\n");
827 return 0;
828 }
829 if (!be32_eq(calc_crc(hdr, 512), hdr->crc)) {
830 pr_err("bad CRC\n");
831 return 0;
832 }
833 if (memcmp(anchor->guid, hdr->guid, DDF_GUID_LEN) != 0 ||
834 memcmp(anchor->revision, hdr->revision, 8) != 0 ||
835 !be64_eq(anchor->primary_lba, hdr->primary_lba) ||
836 !be64_eq(anchor->secondary_lba, hdr->secondary_lba) ||
837 hdr->type != type ||
838 memcmp(anchor->pad2, hdr->pad2, 512 -
839 offsetof(struct ddf_header, pad2)) != 0) {
840 pr_err("header mismatch\n");
841 return 0;
842 }
843
844 /* Looks good enough to me... */
845 return 1;
846 }
847
848 static void *load_section(int fd, struct ddf_super *super, void *buf,
849 be32 offset_be, be32 len_be, int check)
850 {
851 unsigned long long offset = be32_to_cpu(offset_be);
852 unsigned long long len = be32_to_cpu(len_be);
853 int dofree = (buf == NULL);
854
855 if (check)
856 if (len != 2 && len != 8 && len != 32 &&
857 len != 128 && len != 512)
858 return NULL;
859
860 if (len > 1024)
861 return NULL;
862 if (!buf && posix_memalign(&buf, 512, len<<9) != 0)
863 buf = NULL;
864
865 if (!buf)
866 return NULL;
867
868 if (super->active->type == 1)
869 offset += be64_to_cpu(super->active->primary_lba);
870 else
871 offset += be64_to_cpu(super->active->secondary_lba);
872
873 if ((unsigned long long)lseek64(fd, offset<<9, 0) != (offset<<9)) {
874 if (dofree)
875 free(buf);
876 return NULL;
877 }
878 if ((unsigned long long)read(fd, buf, len<<9) != (len<<9)) {
879 if (dofree)
880 free(buf);
881 return NULL;
882 }
883 return buf;
884 }
885
886 static int load_ddf_headers(int fd, struct ddf_super *super, char *devname)
887 {
888 unsigned long long dsize;
889
890 get_dev_size(fd, NULL, &dsize);
891
892 if (lseek64(fd, dsize-512, 0) < 0) {
893 if (devname)
894 pr_err("Cannot seek to anchor block on %s: %s\n",
895 devname, strerror(errno));
896 return 1;
897 }
898 if (read(fd, &super->anchor, 512) != 512) {
899 if (devname)
900 pr_err("Cannot read anchor block on %s: %s\n",
901 devname, strerror(errno));
902 return 1;
903 }
904 if (!be32_eq(super->anchor.magic, DDF_HEADER_MAGIC)) {
905 if (devname)
906 pr_err("no DDF anchor found on %s\n",
907 devname);
908 return 2;
909 }
910 if (!be32_eq(calc_crc(&super->anchor, 512), super->anchor.crc)) {
911 if (devname)
912 pr_err("bad CRC on anchor on %s\n",
913 devname);
914 return 2;
915 }
916 if (memcmp(super->anchor.revision, DDF_REVISION_0, 8) != 0 &&
917 memcmp(super->anchor.revision, DDF_REVISION_2, 8) != 0) {
918 if (devname)
919 pr_err("can only support super revision %.8s and earlier, not %.8s on %s\n",
920 DDF_REVISION_2, super->anchor.revision,devname);
921 return 2;
922 }
923 super->active = NULL;
924 if (load_ddf_header(fd, be64_to_cpu(super->anchor.primary_lba),
925 dsize >> 9, 1,
926 &super->primary, &super->anchor) == 0) {
927 if (devname)
928 pr_err("Failed to load primary DDF header on %s\n", devname);
929 } else
930 super->active = &super->primary;
931
932 if (load_ddf_header(fd, be64_to_cpu(super->anchor.secondary_lba),
933 dsize >> 9, 2,
934 &super->secondary, &super->anchor)) {
935 if (super->active == NULL
936 || (be32_to_cpu(super->primary.seq)
937 < be32_to_cpu(super->secondary.seq) &&
938 !super->secondary.openflag)
939 || (be32_to_cpu(super->primary.seq)
940 == be32_to_cpu(super->secondary.seq) &&
941 super->primary.openflag && !super->secondary.openflag)
942 )
943 super->active = &super->secondary;
944 } else if (devname &&
945 be64_to_cpu(super->anchor.secondary_lba) != ~(__u64)0)
946 pr_err("Failed to load secondary DDF header on %s\n",
947 devname);
948 if (super->active == NULL)
949 return 2;
950 return 0;
951 }
952
953 static int load_ddf_global(int fd, struct ddf_super *super, char *devname)
954 {
955 void *ok;
956 ok = load_section(fd, super, &super->controller,
957 super->active->controller_section_offset,
958 super->active->controller_section_length,
959 0);
960 super->phys = load_section(fd, super, NULL,
961 super->active->phys_section_offset,
962 super->active->phys_section_length,
963 1);
964 super->pdsize = be32_to_cpu(super->active->phys_section_length) * 512;
965
966 super->virt = load_section(fd, super, NULL,
967 super->active->virt_section_offset,
968 super->active->virt_section_length,
969 1);
970 super->vdsize = be32_to_cpu(super->active->virt_section_length) * 512;
971 if (!ok ||
972 !super->phys ||
973 !super->virt) {
974 free(super->phys);
975 free(super->virt);
976 super->phys = NULL;
977 super->virt = NULL;
978 return 2;
979 }
980 super->conflist = NULL;
981 super->dlist = NULL;
982
983 super->max_part = be16_to_cpu(super->active->max_partitions);
984 super->mppe = be16_to_cpu(super->active->max_primary_element_entries);
985 super->conf_rec_len = be16_to_cpu(super->active->config_record_len);
986 return 0;
987 }
988
989 #define DDF_UNUSED_BVD 0xff
990 static int alloc_other_bvds(const struct ddf_super *ddf, struct vcl *vcl)
991 {
992 unsigned int n_vds = vcl->conf.sec_elmnt_count - 1;
993 unsigned int i, vdsize;
994 void *p;
995 if (n_vds == 0) {
996 vcl->other_bvds = NULL;
997 return 0;
998 }
999 vdsize = ddf->conf_rec_len * 512;
1000 if (posix_memalign(&p, 512, n_vds *
1001 (vdsize + sizeof(struct vd_config *))) != 0)
1002 return -1;
1003 vcl->other_bvds = (struct vd_config **) (p + n_vds * vdsize);
1004 for (i = 0; i < n_vds; i++) {
1005 vcl->other_bvds[i] = p + i * vdsize;
1006 memset(vcl->other_bvds[i], 0, vdsize);
1007 vcl->other_bvds[i]->sec_elmnt_seq = DDF_UNUSED_BVD;
1008 }
1009 return 0;
1010 }
1011
1012 static void add_other_bvd(struct vcl *vcl, struct vd_config *vd,
1013 unsigned int len)
1014 {
1015 int i;
1016 for (i = 0; i < vcl->conf.sec_elmnt_count-1; i++)
1017 if (vcl->other_bvds[i]->sec_elmnt_seq == vd->sec_elmnt_seq)
1018 break;
1019
1020 if (i < vcl->conf.sec_elmnt_count-1) {
1021 if (be32_to_cpu(vd->seqnum) <=
1022 be32_to_cpu(vcl->other_bvds[i]->seqnum))
1023 return;
1024 } else {
1025 for (i = 0; i < vcl->conf.sec_elmnt_count-1; i++)
1026 if (vcl->other_bvds[i]->sec_elmnt_seq == DDF_UNUSED_BVD)
1027 break;
1028 if (i == vcl->conf.sec_elmnt_count-1) {
1029 pr_err("no space for sec level config %u, count is %u\n",
1030 vd->sec_elmnt_seq, vcl->conf.sec_elmnt_count);
1031 return;
1032 }
1033 }
1034 memcpy(vcl->other_bvds[i], vd, len);
1035 }
1036
1037 static int load_ddf_local(int fd, struct ddf_super *super,
1038 char *devname, int keep)
1039 {
1040 struct dl *dl;
1041 struct stat stb;
1042 char *conf;
1043 unsigned int i;
1044 unsigned int confsec;
1045 int vnum;
1046 unsigned int max_virt_disks =
1047 be16_to_cpu(super->active->max_vd_entries);
1048 unsigned long long dsize;
1049
1050 /* First the local disk info */
1051 if (posix_memalign((void**)&dl, 512,
1052 sizeof(*dl) +
1053 (super->max_part) * sizeof(dl->vlist[0])) != 0) {
1054 pr_err("could not allocate disk info buffer\n");
1055 return 1;
1056 }
1057
1058 load_section(fd, super, &dl->disk,
1059 super->active->data_section_offset,
1060 super->active->data_section_length,
1061 0);
1062 dl->devname = devname ? xstrdup(devname) : NULL;
1063
1064 fstat(fd, &stb);
1065 dl->major = major(stb.st_rdev);
1066 dl->minor = minor(stb.st_rdev);
1067 dl->next = super->dlist;
1068 dl->fd = keep ? fd : -1;
1069
1070 dl->size = 0;
1071 if (get_dev_size(fd, devname, &dsize))
1072 dl->size = dsize >> 9;
1073 /* If the disks have different sizes, the LBAs will differ
1074 * between phys disks.
1075 * At this point here, the values in super->active must be valid
1076 * for this phys disk. */
1077 dl->primary_lba = super->active->primary_lba;
1078 dl->secondary_lba = super->active->secondary_lba;
1079 dl->workspace_lba = super->active->workspace_lba;
1080 dl->spare = NULL;
1081 for (i = 0 ; i < super->max_part ; i++)
1082 dl->vlist[i] = NULL;
1083 super->dlist = dl;
1084 dl->pdnum = -1;
1085 for (i = 0; i < be16_to_cpu(super->active->max_pd_entries); i++)
1086 if (memcmp(super->phys->entries[i].guid,
1087 dl->disk.guid, DDF_GUID_LEN) == 0)
1088 dl->pdnum = i;
1089
1090 /* Now the config list. */
1091 /* 'conf' is an array of config entries, some of which are
1092 * probably invalid. Those which are good need to be copied into
1093 * the conflist
1094 */
1095
1096 conf = load_section(fd, super, super->conf,
1097 super->active->config_section_offset,
1098 super->active->config_section_length,
1099 0);
1100 super->conf = conf;
1101 vnum = 0;
1102 for (confsec = 0;
1103 confsec < be32_to_cpu(super->active->config_section_length);
1104 confsec += super->conf_rec_len) {
1105 struct vd_config *vd =
1106 (struct vd_config *)((char*)conf + confsec*512);
1107 struct vcl *vcl;
1108
1109 if (be32_eq(vd->magic, DDF_SPARE_ASSIGN_MAGIC)) {
1110 if (dl->spare)
1111 continue;
1112 if (posix_memalign((void**)&dl->spare, 512,
1113 super->conf_rec_len*512) != 0) {
1114 pr_err("could not allocate spare info buf\n");
1115 return 1;
1116 }
1117
1118 memcpy(dl->spare, vd, super->conf_rec_len*512);
1119 continue;
1120 }
1121 if (!be32_eq(vd->magic, DDF_VD_CONF_MAGIC))
1122 /* Must be vendor-unique - I cannot handle those */
1123 continue;
1124
1125 for (vcl = super->conflist; vcl; vcl = vcl->next) {
1126 if (memcmp(vcl->conf.guid,
1127 vd->guid, DDF_GUID_LEN) == 0)
1128 break;
1129 }
1130
1131 if (vcl) {
1132 dl->vlist[vnum++] = vcl;
1133 if (vcl->other_bvds != NULL &&
1134 vcl->conf.sec_elmnt_seq != vd->sec_elmnt_seq) {
1135 add_other_bvd(vcl, vd, super->conf_rec_len*512);
1136 continue;
1137 }
1138 if (be32_to_cpu(vd->seqnum) <=
1139 be32_to_cpu(vcl->conf.seqnum))
1140 continue;
1141 } else {
1142 if (posix_memalign((void**)&vcl, 512,
1143 (super->conf_rec_len*512 +
1144 offsetof(struct vcl, conf))) != 0) {
1145 pr_err("could not allocate vcl buf\n");
1146 return 1;
1147 }
1148 vcl->next = super->conflist;
1149 vcl->block_sizes = NULL; /* FIXME not for CONCAT */
1150 vcl->conf.sec_elmnt_count = vd->sec_elmnt_count;
1151 if (alloc_other_bvds(super, vcl) != 0) {
1152 pr_err("could not allocate other bvds\n");
1153 free(vcl);
1154 return 1;
1155 };
1156 super->conflist = vcl;
1157 dl->vlist[vnum++] = vcl;
1158 }
1159 memcpy(&vcl->conf, vd, super->conf_rec_len*512);
1160 for (i=0; i < max_virt_disks ; i++)
1161 if (memcmp(super->virt->entries[i].guid,
1162 vcl->conf.guid, DDF_GUID_LEN)==0)
1163 break;
1164 if (i < max_virt_disks)
1165 vcl->vcnum = i;
1166 }
1167
1168 return 0;
1169 }
1170
1171 static int load_super_ddf(struct supertype *st, int fd,
1172 char *devname)
1173 {
1174 unsigned long long dsize;
1175 struct ddf_super *super;
1176 int rv;
1177
1178 if (get_dev_size(fd, devname, &dsize) == 0)
1179 return 1;
1180
1181 if (test_partition(fd))
1182 /* DDF is not allowed on partitions */
1183 return 1;
1184
1185 /* 32M is a lower bound */
1186 if (dsize <= 32*1024*1024) {
1187 if (devname)
1188 pr_err("%s is too small for ddf: size is %llu sectors.\n",
1189 devname, dsize>>9);
1190 return 1;
1191 }
1192 if (dsize & 511) {
1193 if (devname)
1194 pr_err("%s is an odd size for ddf: size is %llu bytes.\n",
1195 devname, dsize);
1196 return 1;
1197 }
1198
1199 free_super_ddf(st);
1200
1201 if (posix_memalign((void**)&super, 512, sizeof(*super))!= 0) {
1202 pr_err("malloc of %zu failed.\n",
1203 sizeof(*super));
1204 return 1;
1205 }
1206 memset(super, 0, sizeof(*super));
1207
1208 rv = load_ddf_headers(fd, super, devname);
1209 if (rv) {
1210 free(super);
1211 return rv;
1212 }
1213
1214 /* Have valid headers and have chosen the best. Let's read in the rest*/
1215
1216 rv = load_ddf_global(fd, super, devname);
1217
1218 if (rv) {
1219 if (devname)
1220 pr_err("Failed to load all information sections on %s\n", devname);
1221 free(super);
1222 return rv;
1223 }
1224
1225 rv = load_ddf_local(fd, super, devname, 0);
1226
1227 if (rv) {
1228 if (devname)
1229 pr_err("Failed to load all information sections on %s\n", devname);
1230 free(super);
1231 return rv;
1232 }
1233
1234 /* Should possibly check the sections .... */
1235
1236 st->sb = super;
1237 if (st->ss == NULL) {
1238 st->ss = &super_ddf;
1239 st->minor_version = 0;
1240 st->max_devs = 512;
1241 }
1242 return 0;
1243
1244 }
1245
1246 static void free_super_ddf(struct supertype *st)
1247 {
1248 struct ddf_super *ddf = st->sb;
1249 if (ddf == NULL)
1250 return;
1251 free(ddf->phys);
1252 free(ddf->virt);
1253 free(ddf->conf);
1254 while (ddf->conflist) {
1255 struct vcl *v = ddf->conflist;
1256 ddf->conflist = v->next;
1257 if (v->block_sizes)
1258 free(v->block_sizes);
1259 if (v->other_bvds)
1260 /*
1261 v->other_bvds[0] points to beginning of buffer,
1262 see alloc_other_bvds()
1263 */
1264 free(v->other_bvds[0]);
1265 free(v);
1266 }
1267 while (ddf->dlist) {
1268 struct dl *d = ddf->dlist;
1269 ddf->dlist = d->next;
1270 if (d->fd >= 0)
1271 close(d->fd);
1272 if (d->spare)
1273 free(d->spare);
1274 free(d);
1275 }
1276 while (ddf->add_list) {
1277 struct dl *d = ddf->add_list;
1278 ddf->add_list = d->next;
1279 if (d->fd >= 0)
1280 close(d->fd);
1281 if (d->spare)
1282 free(d->spare);
1283 free(d);
1284 }
1285 free(ddf);
1286 st->sb = NULL;
1287 }
1288
1289 static struct supertype *match_metadata_desc_ddf(char *arg)
1290 {
1291 /* 'ddf' only supports containers */
1292 struct supertype *st;
1293 if (strcmp(arg, "ddf") != 0 &&
1294 strcmp(arg, "default") != 0
1295 )
1296 return NULL;
1297
1298 st = xcalloc(1, sizeof(*st));
1299 st->ss = &super_ddf;
1300 st->max_devs = 512;
1301 st->minor_version = 0;
1302 st->sb = NULL;
1303 return st;
1304 }
1305
1306 static mapping_t ddf_state[] = {
1307 { "Optimal", 0},
1308 { "Degraded", 1},
1309 { "Deleted", 2},
1310 { "Missing", 3},
1311 { "Failed", 4},
1312 { "Partially Optimal", 5},
1313 { "-reserved-", 6},
1314 { "-reserved-", 7},
1315 { NULL, 0}
1316 };
1317
1318 static mapping_t ddf_init_state[] = {
1319 { "Not Initialised", 0},
1320 { "QuickInit in Progress", 1},
1321 { "Fully Initialised", 2},
1322 { "*UNKNOWN*", 3},
1323 { NULL, 0}
1324 };
1325 static mapping_t ddf_access[] = {
1326 { "Read/Write", 0},
1327 { "Reserved", 1},
1328 { "Read Only", 2},
1329 { "Blocked (no access)", 3},
1330 { NULL ,0}
1331 };
1332
1333 static mapping_t ddf_level[] = {
1334 { "RAID0", DDF_RAID0},
1335 { "RAID1", DDF_RAID1},
1336 { "RAID3", DDF_RAID3},
1337 { "RAID4", DDF_RAID4},
1338 { "RAID5", DDF_RAID5},
1339 { "RAID1E",DDF_RAID1E},
1340 { "JBOD", DDF_JBOD},
1341 { "CONCAT",DDF_CONCAT},
1342 { "RAID5E",DDF_RAID5E},
1343 { "RAID5EE",DDF_RAID5EE},
1344 { "RAID6", DDF_RAID6},
1345 { NULL, 0}
1346 };
1347 static mapping_t ddf_sec_level[] = {
1348 { "Striped", DDF_2STRIPED},
1349 { "Mirrored", DDF_2MIRRORED},
1350 { "Concat", DDF_2CONCAT},
1351 { "Spanned", DDF_2SPANNED},
1352 { NULL, 0}
1353 };
1354
1355 static int all_ff(const char *guid)
1356 {
1357 int i;
1358 for (i = 0; i < DDF_GUID_LEN; i++)
1359 if (guid[i] != (char)0xff)
1360 return 0;
1361 return 1;
1362 }
1363
1364 static const char *guid_str(const char *guid)
1365 {
1366 static char buf[DDF_GUID_LEN*2+1];
1367 int i;
1368 char *p = buf;
1369 for (i = 0; i < DDF_GUID_LEN; i++) {
1370 unsigned char c = guid[i];
1371 if (c >= 32 && c < 127)
1372 p += sprintf(p, "%c", c);
1373 else
1374 p += sprintf(p, "%02x", c);
1375 }
1376 *p = '\0';
1377 return (const char *) buf;
1378 }
1379
1380 static void print_guid(char *guid, int tstamp)
1381 {
1382 /* A GUIDs are part (or all) ASCII and part binary.
1383 * They tend to be space padded.
1384 * We print the GUID in HEX, then in parentheses add
1385 * any initial ASCII sequence, and a possible
1386 * time stamp from bytes 16-19
1387 */
1388 int l = DDF_GUID_LEN;
1389 int i;
1390
1391 for (i=0 ; i<DDF_GUID_LEN ; i++) {
1392 if ((i&3)==0 && i != 0) printf(":");
1393 printf("%02X", guid[i]&255);
1394 }
1395
1396 printf("\n (");
1397 while (l && guid[l-1] == ' ')
1398 l--;
1399 for (i=0 ; i<l ; i++) {
1400 if (guid[i] >= 0x20 && guid[i] < 0x7f)
1401 fputc(guid[i], stdout);
1402 else
1403 break;
1404 }
1405 if (tstamp) {
1406 time_t then = __be32_to_cpu(*(__u32*)(guid+16)) + DECADE;
1407 char tbuf[100];
1408 struct tm *tm;
1409 tm = localtime(&then);
1410 strftime(tbuf, 100, " %D %T",tm);
1411 fputs(tbuf, stdout);
1412 }
1413 printf(")");
1414 }
1415
1416 static void examine_vd(int n, struct ddf_super *sb, char *guid)
1417 {
1418 int crl = sb->conf_rec_len;
1419 struct vcl *vcl;
1420
1421 for (vcl = sb->conflist ; vcl ; vcl = vcl->next) {
1422 unsigned int i;
1423 struct vd_config *vc = &vcl->conf;
1424
1425 if (!be32_eq(calc_crc(vc, crl*512), vc->crc))
1426 continue;
1427 if (memcmp(vc->guid, guid, DDF_GUID_LEN) != 0)
1428 continue;
1429
1430 /* Ok, we know about this VD, let's give more details */
1431 printf(" Raid Devices[%d] : %d (", n,
1432 be16_to_cpu(vc->prim_elmnt_count));
1433 for (i = 0; i < be16_to_cpu(vc->prim_elmnt_count); i++) {
1434 int j;
1435 int cnt = be16_to_cpu(sb->phys->max_pdes);
1436 for (j=0; j<cnt; j++)
1437 if (be32_eq(vc->phys_refnum[i],
1438 sb->phys->entries[j].refnum))
1439 break;
1440 if (i) printf(" ");
1441 if (j < cnt)
1442 printf("%d", j);
1443 else
1444 printf("--");
1445 printf("@%lluK", (unsigned long long) be64_to_cpu(LBA_OFFSET(sb, vc)[i])/2);
1446 }
1447 printf(")\n");
1448 if (vc->chunk_shift != 255)
1449 printf(" Chunk Size[%d] : %d sectors\n", n,
1450 1 << vc->chunk_shift);
1451 printf(" Raid Level[%d] : %s\n", n,
1452 map_num(ddf_level, vc->prl)?:"-unknown-");
1453 if (vc->sec_elmnt_count != 1) {
1454 printf(" Secondary Position[%d] : %d of %d\n", n,
1455 vc->sec_elmnt_seq, vc->sec_elmnt_count);
1456 printf(" Secondary Level[%d] : %s\n", n,
1457 map_num(ddf_sec_level, vc->srl) ?: "-unknown-");
1458 }
1459 printf(" Device Size[%d] : %llu\n", n,
1460 be64_to_cpu(vc->blocks)/2);
1461 printf(" Array Size[%d] : %llu\n", n,
1462 be64_to_cpu(vc->array_blocks)/2);
1463 }
1464 }
1465
1466 static void examine_vds(struct ddf_super *sb)
1467 {
1468 int cnt = be16_to_cpu(sb->virt->populated_vdes);
1469 unsigned int i;
1470 printf(" Virtual Disks : %d\n", cnt);
1471
1472 for (i = 0; i < be16_to_cpu(sb->virt->max_vdes); i++) {
1473 struct virtual_entry *ve = &sb->virt->entries[i];
1474 if (all_ff(ve->guid))
1475 continue;
1476 printf("\n");
1477 printf(" VD GUID[%d] : ", i); print_guid(ve->guid, 1);
1478 printf("\n");
1479 printf(" unit[%d] : %d\n", i, be16_to_cpu(ve->unit));
1480 printf(" state[%d] : %s, %s%s\n", i,
1481 map_num(ddf_state, ve->state & 7),
1482 (ve->state & DDF_state_morphing) ? "Morphing, ": "",
1483 (ve->state & DDF_state_inconsistent)? "Not Consistent" : "Consistent");
1484 printf(" init state[%d] : %s\n", i,
1485 map_num(ddf_init_state, ve->init_state&DDF_initstate_mask));
1486 printf(" access[%d] : %s\n", i,
1487 map_num(ddf_access, (ve->init_state & DDF_access_mask) >> 6));
1488 printf(" Name[%d] : %.16s\n", i, ve->name);
1489 examine_vd(i, sb, ve->guid);
1490 }
1491 if (cnt) printf("\n");
1492 }
1493
1494 static void examine_pds(struct ddf_super *sb)
1495 {
1496 int cnt = be16_to_cpu(sb->phys->max_pdes);
1497 int i;
1498 struct dl *dl;
1499 int unlisted = 0;
1500 printf(" Physical Disks : %d\n", cnt);
1501 printf(" Number RefNo Size Device Type/State\n");
1502
1503 for (dl = sb->dlist; dl; dl = dl->next)
1504 dl->displayed = 0;
1505
1506 for (i=0 ; i<cnt ; i++) {
1507 struct phys_disk_entry *pd = &sb->phys->entries[i];
1508 int type = be16_to_cpu(pd->type);
1509 int state = be16_to_cpu(pd->state);
1510
1511 if (be32_to_cpu(pd->refnum) == 0xffffffff)
1512 /* Not in use */
1513 continue;
1514 //printf(" PD GUID[%d] : ", i); print_guid(pd->guid, 0);
1515 //printf("\n");
1516 printf(" %3d %08x ", i,
1517 be32_to_cpu(pd->refnum));
1518 printf("%8lluK ",
1519 be64_to_cpu(pd->config_size)>>1);
1520 for (dl = sb->dlist; dl ; dl = dl->next) {
1521 if (be32_eq(dl->disk.refnum, pd->refnum)) {
1522 char *dv = map_dev(dl->major, dl->minor, 0);
1523 if (dv) {
1524 printf("%-15s", dv);
1525 break;
1526 }
1527 }
1528 }
1529 if (!dl)
1530 printf("%15s","");
1531 else
1532 dl->displayed = 1;
1533 printf(" %s%s%s%s%s",
1534 (type&2) ? "active":"",
1535 (type&4) ? "Global-Spare":"",
1536 (type&8) ? "spare" : "",
1537 (type&16)? ", foreign" : "",
1538 (type&32)? "pass-through" : "");
1539 if (state & DDF_Failed)
1540 /* This over-rides these three */
1541 state &= ~(DDF_Online|DDF_Rebuilding|DDF_Transition);
1542 printf("/%s%s%s%s%s%s%s",
1543 (state&1)? "Online": "Offline",
1544 (state&2)? ", Failed": "",
1545 (state&4)? ", Rebuilding": "",
1546 (state&8)? ", in-transition": "",
1547 (state&16)? ", SMART-errors": "",
1548 (state&32)? ", Unrecovered-Read-Errors": "",
1549 (state&64)? ", Missing" : "");
1550 printf("\n");
1551 }
1552 for (dl = sb->dlist; dl; dl = dl->next) {
1553 char *dv;
1554 if (dl->displayed)
1555 continue;
1556 if (!unlisted)
1557 printf(" Physical disks not in metadata!:\n");
1558 unlisted = 1;
1559 dv = map_dev(dl->major, dl->minor, 0);
1560 printf(" %08x %s\n", be32_to_cpu(dl->disk.refnum),
1561 dv ? dv : "-unknown-");
1562 }
1563 if (unlisted)
1564 printf("\n");
1565 }
1566
1567 static void examine_super_ddf(struct supertype *st, char *homehost)
1568 {
1569 struct ddf_super *sb = st->sb;
1570
1571 printf(" Magic : %08x\n", be32_to_cpu(sb->anchor.magic));
1572 printf(" Version : %.8s\n", sb->anchor.revision);
1573 printf("Controller GUID : "); print_guid(sb->controller.guid, 0);
1574 printf("\n");
1575 printf(" Container GUID : "); print_guid(sb->anchor.guid, 1);
1576 printf("\n");
1577 printf(" Seq : %08x\n", be32_to_cpu(sb->active->seq));
1578 printf(" Redundant hdr : %s\n", (be32_eq(sb->secondary.magic,
1579 DDF_HEADER_MAGIC)
1580 ?"yes" : "no"));
1581 examine_vds(sb);
1582 examine_pds(sb);
1583 }
1584
1585 static unsigned int get_vd_num_of_subarray(struct supertype *st)
1586 {
1587 /*
1588 * Figure out the VD number for this supertype.
1589 * Returns DDF_CONTAINER for the container itself,
1590 * and DDF_NOTFOUND on error.
1591 */
1592 struct ddf_super *ddf = st->sb;
1593 struct mdinfo *sra;
1594 char *sub, *end;
1595 unsigned int vcnum;
1596
1597 if (*st->container_devnm == '\0')
1598 return DDF_CONTAINER;
1599
1600 sra = sysfs_read(-1, st->devnm, GET_VERSION);
1601 if (!sra || sra->array.major_version != -1 ||
1602 sra->array.minor_version != -2 ||
1603 !is_subarray(sra->text_version))
1604 return DDF_NOTFOUND;
1605
1606 sub = strchr(sra->text_version + 1, '/');
1607 if (sub != NULL)
1608 vcnum = strtoul(sub + 1, &end, 10);
1609 if (sub == NULL || *sub == '\0' || *end != '\0' ||
1610 vcnum >= be16_to_cpu(ddf->active->max_vd_entries))
1611 return DDF_NOTFOUND;
1612
1613 return vcnum;
1614 }
1615
1616 static void brief_examine_super_ddf(struct supertype *st, int verbose)
1617 {
1618 /* We just write a generic DDF ARRAY entry
1619 */
1620 struct mdinfo info;
1621 char nbuf[64];
1622 getinfo_super_ddf(st, &info, NULL);
1623 fname_from_uuid(st, &info, nbuf, ':');
1624
1625 printf("ARRAY metadata=ddf UUID=%s\n", nbuf + 5);
1626 }
1627
1628 static void brief_examine_subarrays_ddf(struct supertype *st, int verbose)
1629 {
1630 /* We write a DDF ARRAY member entry for each vd, identifying container
1631 * by uuid and member by unit number and uuid.
1632 */
1633 struct ddf_super *ddf = st->sb;
1634 struct mdinfo info;
1635 unsigned int i;
1636 char nbuf[64];
1637 getinfo_super_ddf(st, &info, NULL);
1638 fname_from_uuid(st, &info, nbuf, ':');
1639
1640 for (i = 0; i < be16_to_cpu(ddf->virt->max_vdes); i++) {
1641 struct virtual_entry *ve = &ddf->virt->entries[i];
1642 struct vcl vcl;
1643 char nbuf1[64];
1644 char namebuf[17];
1645 if (all_ff(ve->guid))
1646 continue;
1647 memcpy(vcl.conf.guid, ve->guid, DDF_GUID_LEN);
1648 ddf->currentconf =&vcl;
1649 vcl.vcnum = i;
1650 uuid_from_super_ddf(st, info.uuid);
1651 fname_from_uuid(st, &info, nbuf1, ':');
1652 _ddf_array_name(namebuf, ddf, i);
1653 printf("ARRAY%s%s container=%s member=%d UUID=%s\n",
1654 namebuf[0] == '\0' ? "" : " /dev/md/", namebuf,
1655 nbuf+5, i, nbuf1+5);
1656 }
1657 }
1658
1659 static void export_examine_super_ddf(struct supertype *st)
1660 {
1661 struct mdinfo info;
1662 char nbuf[64];
1663 getinfo_super_ddf(st, &info, NULL);
1664 fname_from_uuid(st, &info, nbuf, ':');
1665 printf("MD_METADATA=ddf\n");
1666 printf("MD_LEVEL=container\n");
1667 printf("MD_UUID=%s\n", nbuf+5);
1668 printf("MD_DEVICES=%u\n",
1669 be16_to_cpu(((struct ddf_super *)st->sb)->phys->used_pdes));
1670 }
1671
1672 static int copy_metadata_ddf(struct supertype *st, int from, int to)
1673 {
1674 void *buf;
1675 unsigned long long dsize, offset;
1676 int bytes;
1677 struct ddf_header *ddf;
1678 int written = 0;
1679
1680 /* The meta consists of an anchor, a primary, and a secondary.
1681 * This all lives at the end of the device.
1682 * So it is easiest to find the earliest of primary and
1683 * secondary, and copy everything from there.
1684 *
1685 * Anchor is 512 from end. It contains primary_lba and secondary_lba
1686 * we choose one of those
1687 */
1688
1689 if (posix_memalign(&buf, 4096, 4096) != 0)
1690 return 1;
1691
1692 if (!get_dev_size(from, NULL, &dsize))
1693 goto err;
1694
1695 if (lseek64(from, dsize-512, 0) < 0)
1696 goto err;
1697 if (read(from, buf, 512) != 512)
1698 goto err;
1699 ddf = buf;
1700 if (!be32_eq(ddf->magic, DDF_HEADER_MAGIC) ||
1701 !be32_eq(calc_crc(ddf, 512), ddf->crc) ||
1702 (memcmp(ddf->revision, DDF_REVISION_0, 8) != 0 &&
1703 memcmp(ddf->revision, DDF_REVISION_2, 8) != 0))
1704 goto err;
1705
1706 offset = dsize - 512;
1707 if ((be64_to_cpu(ddf->primary_lba) << 9) < offset)
1708 offset = be64_to_cpu(ddf->primary_lba) << 9;
1709 if ((be64_to_cpu(ddf->secondary_lba) << 9) < offset)
1710 offset = be64_to_cpu(ddf->secondary_lba) << 9;
1711
1712 bytes = dsize - offset;
1713
1714 if (lseek64(from, offset, 0) < 0 ||
1715 lseek64(to, offset, 0) < 0)
1716 goto err;
1717 while (written < bytes) {
1718 int n = bytes - written;
1719 if (n > 4096)
1720 n = 4096;
1721 if (read(from, buf, n) != n)
1722 goto err;
1723 if (write(to, buf, n) != n)
1724 goto err;
1725 written += n;
1726 }
1727 free(buf);
1728 return 0;
1729 err:
1730 free(buf);
1731 return 1;
1732 }
1733
1734 static void detail_super_ddf(struct supertype *st, char *homehost)
1735 {
1736 struct ddf_super *sb = st->sb;
1737 int cnt = be16_to_cpu(sb->virt->populated_vdes);
1738
1739 printf(" Container GUID : "); print_guid(sb->anchor.guid, 1);
1740 printf("\n");
1741 printf(" Seq : %08x\n", be32_to_cpu(sb->active->seq));
1742 printf(" Virtual Disks : %d\n", cnt);
1743 printf("\n");
1744 }
1745
1746 static const char *vendors_with_variable_volume_UUID[] = {
1747 "LSI ",
1748 };
1749
1750 static int volume_id_is_reliable(const struct ddf_super *ddf)
1751 {
1752 int n = ARRAY_SIZE(vendors_with_variable_volume_UUID);
1753 int i;
1754 for (i = 0; i < n; i++)
1755 if (!memcmp(ddf->controller.guid,
1756 vendors_with_variable_volume_UUID[i], 8))
1757 return 0;
1758 return 1;
1759 }
1760
1761 static void uuid_of_ddf_subarray(const struct ddf_super *ddf,
1762 unsigned int vcnum, int uuid[4])
1763 {
1764 char buf[DDF_GUID_LEN+18], sha[20], *p;
1765 struct sha1_ctx ctx;
1766 if (volume_id_is_reliable(ddf)) {
1767 uuid_from_ddf_guid(ddf->virt->entries[vcnum].guid, uuid);
1768 return;
1769 }
1770 /*
1771 * Some fake RAID BIOSes (in particular, LSI ones) change the
1772 * VD GUID at every boot. These GUIDs are not suitable for
1773 * identifying an array. Luckily the header GUID appears to
1774 * remain constant.
1775 * We construct a pseudo-UUID from the header GUID and those
1776 * properties of the subarray that we expect to remain constant.
1777 */
1778 memset(buf, 0, sizeof(buf));
1779 p = buf;
1780 memcpy(p, ddf->anchor.guid, DDF_GUID_LEN);
1781 p += DDF_GUID_LEN;
1782 memcpy(p, ddf->virt->entries[vcnum].name, 16);
1783 p += 16;
1784 *((__u16 *) p) = vcnum;
1785 sha1_init_ctx(&ctx);
1786 sha1_process_bytes(buf, sizeof(buf), &ctx);
1787 sha1_finish_ctx(&ctx, sha);
1788 memcpy(uuid, sha, 4*4);
1789 }
1790
1791 static void brief_detail_super_ddf(struct supertype *st)
1792 {
1793 struct mdinfo info;
1794 char nbuf[64];
1795 struct ddf_super *ddf = st->sb;
1796 unsigned int vcnum = get_vd_num_of_subarray(st);
1797 if (vcnum == DDF_CONTAINER)
1798 uuid_from_super_ddf(st, info.uuid);
1799 else if (vcnum == DDF_NOTFOUND)
1800 return;
1801 else
1802 uuid_of_ddf_subarray(ddf, vcnum, info.uuid);
1803 fname_from_uuid(st, &info, nbuf,':');
1804 printf(" UUID=%s", nbuf + 5);
1805 }
1806
1807 static int match_home_ddf(struct supertype *st, char *homehost)
1808 {
1809 /* It matches 'this' host if the controller is a
1810 * Linux-MD controller with vendor_data matching
1811 * the hostname. It would be nice if we could
1812 * test against controller found in /sys or somewhere...
1813 */
1814 struct ddf_super *ddf = st->sb;
1815 unsigned int len;
1816
1817 if (!homehost)
1818 return 0;
1819 len = strlen(homehost);
1820
1821 return (memcmp(ddf->controller.guid, T10, 8) == 0 &&
1822 len < sizeof(ddf->controller.vendor_data) &&
1823 memcmp(ddf->controller.vendor_data, homehost,len) == 0 &&
1824 ddf->controller.vendor_data[len] == 0);
1825 }
1826
1827 static int find_index_in_bvd(const struct ddf_super *ddf,
1828 const struct vd_config *conf, unsigned int n,
1829 unsigned int *n_bvd)
1830 {
1831 /*
1832 * Find the index of the n-th valid physical disk in this BVD.
1833 * Unused entries can be sprinkled in with the used entries,
1834 * but don't count.
1835 */
1836 unsigned int i, j;
1837 for (i = 0, j = 0;
1838 i < ddf->mppe && j < be16_to_cpu(conf->prim_elmnt_count);
1839 i++) {
1840 if (be32_to_cpu(conf->phys_refnum[i]) != 0xffffffff) {
1841 if (n == j) {
1842 *n_bvd = i;
1843 return 1;
1844 }
1845 j++;
1846 }
1847 }
1848 dprintf("couldn't find BVD member %u (total %u)\n",
1849 n, be16_to_cpu(conf->prim_elmnt_count));
1850 return 0;
1851 }
1852
1853 /* Given a member array instance number, and a raid disk within that instance,
1854 * find the vd_config structure. The offset of the given disk in the phys_refnum
1855 * table is returned in n_bvd.
1856 * For two-level members with a secondary raid level the vd_config for
1857 * the appropriate BVD is returned.
1858 * The return value is always &vlc->conf, where vlc is returned in last pointer.
1859 */
1860 static struct vd_config *find_vdcr(struct ddf_super *ddf, unsigned int inst,
1861 unsigned int n,
1862 unsigned int *n_bvd, struct vcl **vcl)
1863 {
1864 struct vcl *v;
1865
1866 for (v = ddf->conflist; v; v = v->next) {
1867 unsigned int nsec, ibvd = 0;
1868 struct vd_config *conf;
1869 if (inst != v->vcnum)
1870 continue;
1871 conf = &v->conf;
1872 if (conf->sec_elmnt_count == 1) {
1873 if (find_index_in_bvd(ddf, conf, n, n_bvd)) {
1874 *vcl = v;
1875 return conf;
1876 } else
1877 goto bad;
1878 }
1879 if (v->other_bvds == NULL) {
1880 pr_err("BUG: other_bvds is NULL, nsec=%u\n",
1881 conf->sec_elmnt_count);
1882 goto bad;
1883 }
1884 nsec = n / be16_to_cpu(conf->prim_elmnt_count);
1885 if (conf->sec_elmnt_seq != nsec) {
1886 for (ibvd = 1; ibvd < conf->sec_elmnt_count; ibvd++) {
1887 if (v->other_bvds[ibvd-1]->sec_elmnt_seq
1888 == nsec)
1889 break;
1890 }
1891 if (ibvd == conf->sec_elmnt_count)
1892 goto bad;
1893 conf = v->other_bvds[ibvd-1];
1894 }
1895 if (!find_index_in_bvd(ddf, conf,
1896 n - nsec*conf->sec_elmnt_count, n_bvd))
1897 goto bad;
1898 dprintf("found disk %u as member %u in bvd %d of array %u\n",
1899 n, *n_bvd, ibvd, inst);
1900 *vcl = v;
1901 return conf;
1902 }
1903 bad:
1904 pr_err("Could't find disk %d in array %u\n", n, inst);
1905 return NULL;
1906 }
1907
1908 static int find_phys(const struct ddf_super *ddf, be32 phys_refnum)
1909 {
1910 /* Find the entry in phys_disk which has the given refnum
1911 * and return it's index
1912 */
1913 unsigned int i;
1914 for (i = 0; i < be16_to_cpu(ddf->phys->max_pdes); i++)
1915 if (be32_eq(ddf->phys->entries[i].refnum, phys_refnum))
1916 return i;
1917 return -1;
1918 }
1919
1920 static void uuid_from_ddf_guid(const char *guid, int uuid[4])
1921 {
1922 char buf[20];
1923 struct sha1_ctx ctx;
1924 sha1_init_ctx(&ctx);
1925 sha1_process_bytes(guid, DDF_GUID_LEN, &ctx);
1926 sha1_finish_ctx(&ctx, buf);
1927 memcpy(uuid, buf, 4*4);
1928 }
1929
1930 static void uuid_from_super_ddf(struct supertype *st, int uuid[4])
1931 {
1932 /* The uuid returned here is used for:
1933 * uuid to put into bitmap file (Create, Grow)
1934 * uuid for backup header when saving critical section (Grow)
1935 * comparing uuids when re-adding a device into an array
1936 * In these cases the uuid required is that of the data-array,
1937 * not the device-set.
1938 * uuid to recognise same set when adding a missing device back
1939 * to an array. This is a uuid for the device-set.
1940 *
1941 * For each of these we can make do with a truncated
1942 * or hashed uuid rather than the original, as long as
1943 * everyone agrees.
1944 * In the case of SVD we assume the BVD is of interest,
1945 * though that might be the case if a bitmap were made for
1946 * a mirrored SVD - worry about that later.
1947 * So we need to find the VD configuration record for the
1948 * relevant BVD and extract the GUID and Secondary_Element_Seq.
1949 * The first 16 bytes of the sha1 of these is used.
1950 */
1951 struct ddf_super *ddf = st->sb;
1952 struct vcl *vcl = ddf->currentconf;
1953
1954 if (vcl)
1955 uuid_of_ddf_subarray(ddf, vcl->vcnum, uuid);
1956 else
1957 uuid_from_ddf_guid(ddf->anchor.guid, uuid);
1958 }
1959
1960 static void getinfo_super_ddf(struct supertype *st, struct mdinfo *info, char *map)
1961 {
1962 struct ddf_super *ddf = st->sb;
1963 int map_disks = info->array.raid_disks;
1964 __u32 *cptr;
1965
1966 if (ddf->currentconf) {
1967 getinfo_super_ddf_bvd(st, info, map);
1968 return;
1969 }
1970 memset(info, 0, sizeof(*info));
1971
1972 info->array.raid_disks = be16_to_cpu(ddf->phys->used_pdes);
1973 info->array.level = LEVEL_CONTAINER;
1974 info->array.layout = 0;
1975 info->array.md_minor = -1;
1976 cptr = (__u32 *)(ddf->anchor.guid + 16);
1977 info->array.ctime = DECADE + __be32_to_cpu(*cptr);
1978
1979 info->array.chunk_size = 0;
1980 info->container_enough = 1;
1981
1982 info->disk.major = 0;
1983 info->disk.minor = 0;
1984 if (ddf->dlist) {
1985 struct phys_disk_entry *pde = NULL;
1986 info->disk.number = be32_to_cpu(ddf->dlist->disk.refnum);
1987 info->disk.raid_disk = find_phys(ddf, ddf->dlist->disk.refnum);
1988
1989 info->data_offset = be64_to_cpu(ddf->phys->
1990 entries[info->disk.raid_disk].
1991 config_size);
1992 info->component_size = ddf->dlist->size - info->data_offset;
1993 if (info->disk.raid_disk >= 0)
1994 pde = ddf->phys->entries + info->disk.raid_disk;
1995 if (pde &&
1996 !(be16_to_cpu(pde->state) & DDF_Failed) &&
1997 !(be16_to_cpu(pde->state) & DDF_Missing))
1998 info->disk.state = (1 << MD_DISK_SYNC) | (1 << MD_DISK_ACTIVE);
1999 else
2000 info->disk.state = 1 << MD_DISK_FAULTY;
2001
2002 } else {
2003 /* There should always be a dlist, but just in case...*/
2004 info->disk.number = -1;
2005 info->disk.raid_disk = -1;
2006 info->disk.state = (1 << MD_DISK_SYNC) | (1 << MD_DISK_ACTIVE);
2007 }
2008 info->events = be32_to_cpu(ddf->active->seq);
2009 info->array.utime = DECADE + be32_to_cpu(ddf->active->timestamp);
2010
2011 info->recovery_start = MaxSector;
2012 info->reshape_active = 0;
2013 info->recovery_blocked = 0;
2014 info->name[0] = 0;
2015
2016 info->array.major_version = -1;
2017 info->array.minor_version = -2;
2018 strcpy(info->text_version, "ddf");
2019 info->safe_mode_delay = 0;
2020
2021 uuid_from_super_ddf(st, info->uuid);
2022
2023 if (map) {
2024 int i, e = 0;
2025 int max = be16_to_cpu(ddf->phys->max_pdes);
2026 for (i = e = 0 ; i < map_disks ; i++, e++) {
2027 while (e < max &&
2028 be32_to_cpu(ddf->phys->entries[e].refnum) == 0xffffffff)
2029 e++;
2030 if (i < info->array.raid_disks && e < max &&
2031 !(be16_to_cpu(ddf->phys->entries[e].state) &
2032 DDF_Failed))
2033 map[i] = 1;
2034 else
2035 map[i] = 0;
2036 }
2037 }
2038 }
2039
2040 /* size of name must be at least 17 bytes! */
2041 static void _ddf_array_name(char *name, const struct ddf_super *ddf, int i)
2042 {
2043 int j;
2044 memcpy(name, ddf->virt->entries[i].name, 16);
2045 name[16] = 0;
2046 for(j = 0; j < 16; j++)
2047 if (name[j] == ' ')
2048 name[j] = 0;
2049 }
2050
2051 static void getinfo_super_ddf_bvd(struct supertype *st, struct mdinfo *info, char *map)
2052 {
2053 struct ddf_super *ddf = st->sb;
2054 struct vcl *vc = ddf->currentconf;
2055 int cd = ddf->currentdev;
2056 int n_prim;
2057 int j;
2058 struct dl *dl = NULL;
2059 int map_disks = info->array.raid_disks;
2060 __u32 *cptr;
2061 struct vd_config *conf;
2062
2063 memset(info, 0, sizeof(*info));
2064 if (layout_ddf2md(&vc->conf, &info->array) == -1)
2065 return;
2066 info->array.md_minor = -1;
2067 cptr = (__u32 *)(vc->conf.guid + 16);
2068 info->array.ctime = DECADE + __be32_to_cpu(*cptr);
2069 info->array.utime = DECADE + be32_to_cpu(vc->conf.timestamp);
2070 info->array.chunk_size = 512 << vc->conf.chunk_shift;
2071 info->custom_array_size = be64_to_cpu(vc->conf.array_blocks);
2072
2073 conf = &vc->conf;
2074 n_prim = be16_to_cpu(conf->prim_elmnt_count);
2075 if (conf->sec_elmnt_count > 1 && cd >= n_prim) {
2076 int ibvd = cd / n_prim - 1;
2077 cd %= n_prim;
2078 conf = vc->other_bvds[ibvd];
2079 }
2080
2081 if (cd >= 0 && (unsigned)cd < ddf->mppe) {
2082 info->data_offset =
2083 be64_to_cpu(LBA_OFFSET(ddf, conf)[cd]);
2084 if (vc->block_sizes)
2085 info->component_size = vc->block_sizes[cd];
2086 else
2087 info->component_size = be64_to_cpu(conf->blocks);
2088
2089 for (dl = ddf->dlist; dl ; dl = dl->next)
2090 if (be32_eq(dl->disk.refnum, conf->phys_refnum[cd]))
2091 break;
2092 }
2093
2094 info->disk.major = 0;
2095 info->disk.minor = 0;
2096 info->disk.state = 0;
2097 if (dl && dl->pdnum >= 0) {
2098 info->disk.major = dl->major;
2099 info->disk.minor = dl->minor;
2100 info->disk.raid_disk = cd + conf->sec_elmnt_seq
2101 * be16_to_cpu(conf->prim_elmnt_count);
2102 info->disk.number = dl->pdnum;
2103 info->disk.state = 0;
2104 if (info->disk.number >= 0 &&
2105 (be16_to_cpu(ddf->phys->entries[info->disk.number].state) & DDF_Online) &&
2106 !(be16_to_cpu(ddf->phys->entries[info->disk.number].state) & DDF_Failed))
2107 info->disk.state = (1<<MD_DISK_SYNC)|(1<<MD_DISK_ACTIVE);
2108 info->events = be32_to_cpu(ddf->active->seq);
2109 }
2110
2111 info->container_member = ddf->currentconf->vcnum;
2112
2113 info->recovery_start = MaxSector;
2114 info->resync_start = 0;
2115 info->reshape_active = 0;
2116 info->recovery_blocked = 0;
2117 if (!(ddf->virt->entries[info->container_member].state &
2118 DDF_state_inconsistent) &&
2119 (ddf->virt->entries[info->container_member].init_state &
2120 DDF_initstate_mask) == DDF_init_full)
2121 info->resync_start = MaxSector;
2122
2123 uuid_from_super_ddf(st, info->uuid);
2124
2125 info->array.major_version = -1;
2126 info->array.minor_version = -2;
2127 sprintf(info->text_version, "/%s/%d",
2128 st->container_devnm,
2129 info->container_member);
2130 info->safe_mode_delay = DDF_SAFE_MODE_DELAY;
2131
2132 _ddf_array_name(info->name, ddf, info->container_member);
2133
2134 if (map)
2135 for (j = 0; j < map_disks; j++) {
2136 map[j] = 0;
2137 if (j < info->array.raid_disks) {
2138 int i = find_phys(ddf, vc->conf.phys_refnum[j]);
2139 if (i >= 0 &&
2140 (be16_to_cpu(ddf->phys->entries[i].state)
2141 & DDF_Online) &&
2142 !(be16_to_cpu(ddf->phys->entries[i].state)
2143 & DDF_Failed))
2144 map[i] = 1;
2145 }
2146 }
2147 }
2148
2149 static int update_super_ddf(struct supertype *st, struct mdinfo *info,
2150 char *update,
2151 char *devname, int verbose,
2152 int uuid_set, char *homehost)
2153 {
2154 /* For 'assemble' and 'force' we need to return non-zero if any
2155 * change was made. For others, the return value is ignored.
2156 * Update options are:
2157 * force-one : This device looks a bit old but needs to be included,
2158 * update age info appropriately.
2159 * assemble: clear any 'faulty' flag to allow this device to
2160 * be assembled.
2161 * force-array: Array is degraded but being forced, mark it clean
2162 * if that will be needed to assemble it.
2163 *
2164 * newdev: not used ????
2165 * grow: Array has gained a new device - this is currently for
2166 * linear only
2167 * resync: mark as dirty so a resync will happen.
2168 * uuid: Change the uuid of the array to match what is given
2169 * homehost: update the recorded homehost
2170 * name: update the name - preserving the homehost
2171 * _reshape_progress: record new reshape_progress position.
2172 *
2173 * Following are not relevant for this version:
2174 * sparc2.2 : update from old dodgey metadata
2175 * super-minor: change the preferred_minor number
2176 * summaries: update redundant counters.
2177 */
2178 int rv = 0;
2179 // struct ddf_super *ddf = st->sb;
2180 // struct vd_config *vd = find_vdcr(ddf, info->container_member);
2181 // struct virtual_entry *ve = find_ve(ddf);
2182
2183 /* we don't need to handle "force-*" or "assemble" as
2184 * there is no need to 'trick' the kernel. When the metadata is
2185 * first updated to activate the array, all the implied modifications
2186 * will just happen.
2187 */
2188
2189 if (strcmp(update, "grow") == 0) {
2190 /* FIXME */
2191 } else if (strcmp(update, "resync") == 0) {
2192 // info->resync_checkpoint = 0;
2193 } else if (strcmp(update, "homehost") == 0) {
2194 /* homehost is stored in controller->vendor_data,
2195 * or it is when we are the vendor
2196 */
2197 // if (info->vendor_is_local)
2198 // strcpy(ddf->controller.vendor_data, homehost);
2199 rv = -1;
2200 } else if (strcmp(update, "name") == 0) {
2201 /* name is stored in virtual_entry->name */
2202 // memset(ve->name, ' ', 16);
2203 // strncpy(ve->name, info->name, 16);
2204 rv = -1;
2205 } else if (strcmp(update, "_reshape_progress") == 0) {
2206 /* We don't support reshape yet */
2207 } else if (strcmp(update, "assemble") == 0 ) {
2208 /* Do nothing, just succeed */
2209 rv = 0;
2210 } else
2211 rv = -1;
2212
2213 // update_all_csum(ddf);
2214
2215 return rv;
2216 }
2217
2218 static void make_header_guid(char *guid)
2219 {
2220 be32 stamp;
2221 /* Create a DDF Header of Virtual Disk GUID */
2222
2223 /* 24 bytes of fiction required.
2224 * first 8 are a 'vendor-id' - "Linux-MD"
2225 * next 8 are controller type.. how about 0X DEAD BEEF 0000 0000
2226 * Remaining 8 random number plus timestamp
2227 */
2228 memcpy(guid, T10, sizeof(T10));
2229 stamp = cpu_to_be32(0xdeadbeef);
2230 memcpy(guid+8, &stamp, 4);
2231 stamp = cpu_to_be32(0);
2232 memcpy(guid+12, &stamp, 4);
2233 stamp = cpu_to_be32(time(0) - DECADE);
2234 memcpy(guid+16, &stamp, 4);
2235 stamp._v32 = random32();
2236 memcpy(guid+20, &stamp, 4);
2237 }
2238
2239 static unsigned int find_unused_vde(const struct ddf_super *ddf)
2240 {
2241 unsigned int i;
2242 for (i = 0; i < be16_to_cpu(ddf->virt->max_vdes); i++) {
2243 if (all_ff(ddf->virt->entries[i].guid))
2244 return i;
2245 }
2246 return DDF_NOTFOUND;
2247 }
2248
2249 static unsigned int find_vde_by_name(const struct ddf_super *ddf,
2250 const char *name)
2251 {
2252 unsigned int i;
2253 if (name == NULL)
2254 return DDF_NOTFOUND;
2255 for (i = 0; i < be16_to_cpu(ddf->virt->max_vdes); i++) {
2256 if (all_ff(ddf->virt->entries[i].guid))
2257 continue;
2258 if (!strncmp(name, ddf->virt->entries[i].name,
2259 sizeof(ddf->virt->entries[i].name)))
2260 return i;
2261 }
2262 return DDF_NOTFOUND;
2263 }
2264
2265 static unsigned int find_vde_by_guid(const struct ddf_super *ddf,
2266 const char *guid)
2267 {
2268 unsigned int i;
2269 if (guid == NULL || all_ff(guid))
2270 return DDF_NOTFOUND;
2271 for (i = 0; i < be16_to_cpu(ddf->virt->max_vdes); i++)
2272 if (!memcmp(ddf->virt->entries[i].guid, guid, DDF_GUID_LEN))
2273 return i;
2274 return DDF_NOTFOUND;
2275 }
2276
2277 static int init_super_ddf(struct supertype *st,
2278 mdu_array_info_t *info,
2279 struct shape *s, char *name, char *homehost,
2280 int *uuid, unsigned long long data_offset)
2281 {
2282 /* This is primarily called by Create when creating a new array.
2283 * We will then get add_to_super called for each component, and then
2284 * write_init_super called to write it out to each device.
2285 * For DDF, Create can create on fresh devices or on a pre-existing
2286 * array.
2287 * To create on a pre-existing array a different method will be called.
2288 * This one is just for fresh drives.
2289 *
2290 * We need to create the entire 'ddf' structure which includes:
2291 * DDF headers - these are easy.
2292 * Controller data - a Sector describing this controller .. not that
2293 * this is a controller exactly.
2294 * Physical Disk Record - one entry per device, so
2295 * leave plenty of space.
2296 * Virtual Disk Records - again, just leave plenty of space.
2297 * This just lists VDs, doesn't give details.
2298 * Config records - describe the VDs that use this disk
2299 * DiskData - describes 'this' device.
2300 * BadBlockManagement - empty
2301 * Diag Space - empty
2302 * Vendor Logs - Could we put bitmaps here?
2303 *
2304 */
2305 struct ddf_super *ddf;
2306 char hostname[17];
2307 int hostlen;
2308 int max_phys_disks, max_virt_disks;
2309 unsigned long long sector;
2310 int clen;
2311 int i;
2312 int pdsize, vdsize;
2313 struct phys_disk *pd;
2314 struct virtual_disk *vd;
2315
2316 if (st->sb)
2317 return init_super_ddf_bvd(st, info, s->size, name, homehost, uuid,
2318 data_offset);
2319
2320 if (posix_memalign((void**)&ddf, 512, sizeof(*ddf)) != 0) {
2321 pr_err("could not allocate superblock\n");
2322 return 0;
2323 }
2324 memset(ddf, 0, sizeof(*ddf));
2325 st->sb = ddf;
2326
2327 if (info == NULL) {
2328 /* zeroing superblock */
2329 return 0;
2330 }
2331
2332 /* At least 32MB *must* be reserved for the ddf. So let's just
2333 * start 32MB from the end, and put the primary header there.
2334 * Don't do secondary for now.
2335 * We don't know exactly where that will be yet as it could be
2336 * different on each device. So just set up the lengths.
2337 */
2338
2339 ddf->anchor.magic = DDF_HEADER_MAGIC;
2340 make_header_guid(ddf->anchor.guid);
2341
2342 memcpy(ddf->anchor.revision, DDF_REVISION_2, 8);
2343 ddf->anchor.seq = cpu_to_be32(1);
2344 ddf->anchor.timestamp = cpu_to_be32(time(0) - DECADE);
2345 ddf->anchor.openflag = 0xFF;
2346 ddf->anchor.foreignflag = 0;
2347 ddf->anchor.enforcegroups = 0; /* Is this best?? */
2348 ddf->anchor.pad0 = 0xff;
2349 memset(ddf->anchor.pad1, 0xff, 12);
2350 memset(ddf->anchor.header_ext, 0xff, 32);
2351 ddf->anchor.primary_lba = cpu_to_be64(~(__u64)0);
2352 ddf->anchor.secondary_lba = cpu_to_be64(~(__u64)0);
2353 ddf->anchor.type = DDF_HEADER_ANCHOR;
2354 memset(ddf->anchor.pad2, 0xff, 3);
2355 ddf->anchor.workspace_len = cpu_to_be32(32768); /* Must be reserved */
2356 /* Put this at bottom of 32M reserved.. */
2357 ddf->anchor.workspace_lba = cpu_to_be64(~(__u64)0);
2358 max_phys_disks = 1023; /* Should be enough, 4095 is also allowed */
2359 ddf->anchor.max_pd_entries = cpu_to_be16(max_phys_disks);
2360 max_virt_disks = 255; /* 15, 63, 255, 1024, 4095 are all allowed */
2361 ddf->anchor.max_vd_entries = cpu_to_be16(max_virt_disks);
2362 ddf->max_part = 64;
2363 ddf->anchor.max_partitions = cpu_to_be16(ddf->max_part);
2364 ddf->mppe = 256; /* 16, 64, 256, 1024, 4096 are all allowed */
2365 ddf->conf_rec_len = 1 + ROUND_UP(ddf->mppe * (4+8), 512)/512;
2366 ddf->anchor.config_record_len = cpu_to_be16(ddf->conf_rec_len);
2367 ddf->anchor.max_primary_element_entries = cpu_to_be16(ddf->mppe);
2368 memset(ddf->anchor.pad3, 0xff, 54);
2369 /* Controller section is one sector long immediately
2370 * after the ddf header */
2371 sector = 1;
2372 ddf->anchor.controller_section_offset = cpu_to_be32(sector);
2373 ddf->anchor.controller_section_length = cpu_to_be32(1);
2374 sector += 1;
2375
2376 /* phys is 8 sectors after that */
2377 pdsize = ROUND_UP(sizeof(struct phys_disk) +
2378 sizeof(struct phys_disk_entry)*max_phys_disks,
2379 512);
2380 switch(pdsize/512) {
2381 case 2: case 8: case 32: case 128: case 512: break;
2382 default: abort();
2383 }
2384 ddf->anchor.phys_section_offset = cpu_to_be32(sector);
2385 ddf->anchor.phys_section_length =
2386 cpu_to_be32(pdsize/512); /* max_primary_element_entries/8 */
2387 sector += pdsize/512;
2388
2389 /* virt is another 32 sectors */
2390 vdsize = ROUND_UP(sizeof(struct virtual_disk) +
2391 sizeof(struct virtual_entry) * max_virt_disks,
2392 512);
2393 switch(vdsize/512) {
2394 case 2: case 8: case 32: case 128: case 512: break;
2395 default: abort();
2396 }
2397 ddf->anchor.virt_section_offset = cpu_to_be32(sector);
2398 ddf->anchor.virt_section_length =
2399 cpu_to_be32(vdsize/512); /* max_vd_entries/8 */
2400 sector += vdsize/512;
2401
2402 clen = ddf->conf_rec_len * (ddf->max_part+1);
2403 ddf->anchor.config_section_offset = cpu_to_be32(sector);
2404 ddf->anchor.config_section_length = cpu_to_be32(clen);
2405 sector += clen;
2406
2407 ddf->anchor.data_section_offset = cpu_to_be32(sector);
2408 ddf->anchor.data_section_length = cpu_to_be32(1);
2409 sector += 1;
2410
2411 ddf->anchor.bbm_section_length = cpu_to_be32(0);
2412 ddf->anchor.bbm_section_offset = cpu_to_be32(0xFFFFFFFF);
2413 ddf->anchor.diag_space_length = cpu_to_be32(0);
2414 ddf->anchor.diag_space_offset = cpu_to_be32(0xFFFFFFFF);
2415 ddf->anchor.vendor_length = cpu_to_be32(0);
2416 ddf->anchor.vendor_offset = cpu_to_be32(0xFFFFFFFF);
2417
2418 memset(ddf->anchor.pad4, 0xff, 256);
2419
2420 memcpy(&ddf->primary, &ddf->anchor, 512);
2421 memcpy(&ddf->secondary, &ddf->anchor, 512);
2422
2423 ddf->primary.openflag = 1; /* I guess.. */
2424 ddf->primary.type = DDF_HEADER_PRIMARY;
2425
2426 ddf->secondary.openflag = 1; /* I guess.. */
2427 ddf->secondary.type = DDF_HEADER_SECONDARY;
2428
2429 ddf->active = &ddf->primary;
2430
2431 ddf->controller.magic = DDF_CONTROLLER_MAGIC;
2432
2433 /* 24 more bytes of fiction required.
2434 * first 8 are a 'vendor-id' - "Linux-MD"
2435 * Remaining 16 are serial number.... maybe a hostname would do?
2436 */
2437 memcpy(ddf->controller.guid, T10, sizeof(T10));
2438 gethostname(hostname, sizeof(hostname));
2439 hostname[sizeof(hostname) - 1] = 0;
2440 hostlen = strlen(hostname);
2441 memcpy(ddf->controller.guid + 24 - hostlen, hostname, hostlen);
2442 for (i = strlen(T10) ; i+hostlen < 24; i++)
2443 ddf->controller.guid[i] = ' ';
2444
2445 ddf->controller.type.vendor_id = cpu_to_be16(0xDEAD);
2446 ddf->controller.type.device_id = cpu_to_be16(0xBEEF);
2447 ddf->controller.type.sub_vendor_id = cpu_to_be16(0);
2448 ddf->controller.type.sub_device_id = cpu_to_be16(0);
2449 memcpy(ddf->controller.product_id, "What Is My PID??", 16);
2450 memset(ddf->controller.pad, 0xff, 8);
2451 memset(ddf->controller.vendor_data, 0xff, 448);
2452 if (homehost && strlen(homehost) < 440)
2453 strcpy((char*)ddf->controller.vendor_data, homehost);
2454
2455 if (posix_memalign((void**)&pd, 512, pdsize) != 0) {
2456 pr_err("could not allocate pd\n");
2457 return 0;
2458 }
2459 ddf->phys = pd;
2460 ddf->pdsize = pdsize;
2461
2462 memset(pd, 0xff, pdsize);
2463 memset(pd, 0, sizeof(*pd));
2464 pd->magic = DDF_PHYS_RECORDS_MAGIC;
2465 pd->used_pdes = cpu_to_be16(0);
2466 pd->max_pdes = cpu_to_be16(max_phys_disks);
2467 memset(pd->pad, 0xff, 52);
2468 for (i = 0; i < max_phys_disks; i++)
2469 memset(pd->entries[i].guid, 0xff, DDF_GUID_LEN);
2470
2471 if (posix_memalign((void**)&vd, 512, vdsize) != 0) {
2472 pr_err("could not allocate vd\n");
2473 return 0;
2474 }
2475 ddf->virt = vd;
2476 ddf->vdsize = vdsize;
2477 memset(vd, 0, vdsize);
2478 vd->magic = DDF_VIRT_RECORDS_MAGIC;
2479 vd->populated_vdes = cpu_to_be16(0);
2480 vd->max_vdes = cpu_to_be16(max_virt_disks);
2481 memset(vd->pad, 0xff, 52);
2482
2483 for (i=0; i<max_virt_disks; i++)
2484 memset(&vd->entries[i], 0xff, sizeof(struct virtual_entry));
2485
2486 st->sb = ddf;
2487 ddf_set_updates_pending(ddf, NULL);
2488 return 1;
2489 }
2490
2491 static int chunk_to_shift(int chunksize)
2492 {
2493 return ffs(chunksize/512)-1;
2494 }
2495
2496 struct extent {
2497 unsigned long long start, size;
2498 };
2499 static int cmp_extent(const void *av, const void *bv)
2500 {
2501 const struct extent *a = av;
2502 const struct extent *b = bv;
2503 if (a->start < b->start)
2504 return -1;
2505 if (a->start > b->start)
2506 return 1;
2507 return 0;
2508 }
2509
2510 static struct extent *get_extents(struct ddf_super *ddf, struct dl *dl)
2511 {
2512 /* Find a list of used extents on the given physical device
2513 * (dnum) of the given ddf.
2514 * Return a malloced array of 'struct extent'
2515 */
2516 struct extent *rv;
2517 int n = 0;
2518 unsigned int i;
2519 __u16 state;
2520
2521 if (dl->pdnum < 0)
2522 return NULL;
2523 state = be16_to_cpu(ddf->phys->entries[dl->pdnum].state);
2524
2525 if ((state & (DDF_Online|DDF_Failed|DDF_Missing)) != DDF_Online)
2526 return NULL;
2527
2528 rv = xmalloc(sizeof(struct extent) * (ddf->max_part + 2));
2529
2530 for (i = 0; i < ddf->max_part; i++) {
2531 const struct vd_config *bvd;
2532 unsigned int ibvd;
2533 struct vcl *v = dl->vlist[i];
2534 if (v == NULL ||
2535 get_pd_index_from_refnum(v, dl->disk.refnum, ddf->mppe,
2536 &bvd, &ibvd) == DDF_NOTFOUND)
2537 continue;
2538 rv[n].start = be64_to_cpu(LBA_OFFSET(ddf, bvd)[ibvd]);
2539 rv[n].size = be64_to_cpu(bvd->blocks);
2540 n++;
2541 }
2542 qsort(rv, n, sizeof(*rv), cmp_extent);
2543
2544 rv[n].start = be64_to_cpu(ddf->phys->entries[dl->pdnum].config_size);
2545 rv[n].size = 0;
2546 return rv;
2547 }
2548
2549 static unsigned long long find_space(
2550 struct ddf_super *ddf, struct dl *dl,
2551 unsigned long long data_offset,
2552 unsigned long long *size)
2553 {
2554 /* Find if the requested amount of space is available.
2555 * If it is, return start.
2556 * If not, set *size to largest space.
2557 * If data_offset != INVALID_SECTORS, then the space must start
2558 * at this location.
2559 */
2560 struct extent *e = get_extents(ddf, dl);
2561 int i = 0;
2562 unsigned long long pos = 0;
2563 unsigned long long max_size = 0;
2564
2565 if (!e) {
2566 *size = 0;
2567 return INVALID_SECTORS;
2568 }
2569 do {
2570 unsigned long long esize = e[i].start - pos;
2571 if (data_offset != INVALID_SECTORS &&
2572 pos <= data_offset &&
2573 e[i].start > data_offset) {
2574 pos = data_offset;
2575 esize = e[i].start - pos;
2576 }
2577 if (data_offset != INVALID_SECTORS &&
2578 pos != data_offset) {
2579 i++;
2580 continue;
2581 }
2582 if (esize >= *size) {
2583 /* Found! */
2584 free(e);
2585 return pos;
2586 }
2587 if (esize > max_size)
2588 max_size = esize;
2589 pos = e[i].start + e[i].size;
2590 i++;
2591 } while (e[i-1].size);
2592 *size = max_size;
2593 free(e);
2594 return INVALID_SECTORS;
2595 }
2596
2597 static int init_super_ddf_bvd(struct supertype *st,
2598 mdu_array_info_t *info,
2599 unsigned long long size,
2600 char *name, char *homehost,
2601 int *uuid, unsigned long long data_offset)
2602 {
2603 /* We are creating a BVD inside a pre-existing container.
2604 * so st->sb is already set.
2605 * We need to create a new vd_config and a new virtual_entry
2606 */
2607 struct ddf_super *ddf = st->sb;
2608 unsigned int venum, i;
2609 struct virtual_entry *ve;
2610 struct vcl *vcl;
2611 struct vd_config *vc;
2612
2613 if (find_vde_by_name(ddf, name) != DDF_NOTFOUND) {
2614 pr_err("This ddf already has an array called %s\n", name);
2615 return 0;
2616 }
2617 venum = find_unused_vde(ddf);
2618 if (venum == DDF_NOTFOUND) {
2619 pr_err("Cannot find spare slot for virtual disk\n");
2620 return 0;
2621 }
2622 ve = &ddf->virt->entries[venum];
2623
2624 /* A Virtual Disk GUID contains the T10 Vendor ID, controller type,
2625 * timestamp, random number
2626 */
2627 make_header_guid(ve->guid);
2628 ve->unit = cpu_to_be16(info->md_minor);
2629 ve->pad0 = 0xFFFF;
2630 ve->guid_crc._v16 = crc32(0, (unsigned char *)ddf->anchor.guid,
2631 DDF_GUID_LEN);
2632 ve->type = cpu_to_be16(0);
2633 ve->state = DDF_state_degraded; /* Will be modified as devices are added */
2634 if (info->state & 1) /* clean */
2635 ve->init_state = DDF_init_full;
2636 else
2637 ve->init_state = DDF_init_not;
2638
2639 memset(ve->pad1, 0xff, 14);
2640 memset(ve->name, ' ', 16);
2641 if (name)
2642 strncpy(ve->name, name, 16);
2643 ddf->virt->populated_vdes =
2644 cpu_to_be16(be16_to_cpu(ddf->virt->populated_vdes)+1);
2645
2646 /* Now create a new vd_config */
2647 if (posix_memalign((void**)&vcl, 512,
2648 (offsetof(struct vcl, conf) + ddf->conf_rec_len * 512)) != 0) {
2649 pr_err("could not allocate vd_config\n");
2650 return 0;
2651 }
2652 vcl->vcnum = venum;
2653 vcl->block_sizes = NULL; /* FIXME not for CONCAT */
2654 vc = &vcl->conf;
2655
2656 vc->magic = DDF_VD_CONF_MAGIC;
2657 memcpy(vc->guid, ve->guid, DDF_GUID_LEN);
2658 vc->timestamp = cpu_to_be32(time(0)-DECADE);
2659 vc->seqnum = cpu_to_be32(1);
2660 memset(vc->pad0, 0xff, 24);
2661 vc->chunk_shift = chunk_to_shift(info->chunk_size);
2662 if (layout_md2ddf(info, vc) == -1 ||
2663 be16_to_cpu(vc->prim_elmnt_count) > ddf->mppe) {
2664 pr_err("unsupported RAID level/layout %d/%d with %d disks\n",
2665 info->level, info->layout, info->raid_disks);
2666 free(vcl);
2667 return 0;
2668 }
2669 vc->sec_elmnt_seq = 0;
2670 if (alloc_other_bvds(ddf, vcl) != 0) {
2671 pr_err("could not allocate other bvds\n");
2672 free(vcl);
2673 return 0;
2674 }
2675 vc->blocks = cpu_to_be64(size * 2);
2676 vc->array_blocks = cpu_to_be64(
2677 calc_array_size(info->level, info->raid_disks, info->layout,
2678 info->chunk_size, size * 2));
2679 memset(vc->pad1, 0xff, 8);
2680 vc->spare_refs[0] = cpu_to_be32(0xffffffff);
2681 vc->spare_refs[1] = cpu_to_be32(0xffffffff);
2682 vc->spare_refs[2] = cpu_to_be32(0xffffffff);
2683 vc->spare_refs[3] = cpu_to_be32(0xffffffff);
2684 vc->spare_refs[4] = cpu_to_be32(0xffffffff);
2685 vc->spare_refs[5] = cpu_to_be32(0xffffffff);
2686 vc->spare_refs[6] = cpu_to_be32(0xffffffff);
2687 vc->spare_refs[7] = cpu_to_be32(0xffffffff);
2688 memset(vc->cache_pol, 0, 8);
2689 vc->bg_rate = 0x80;
2690 memset(vc->pad2, 0xff, 3);
2691 memset(vc->pad3, 0xff, 52);
2692 memset(vc->pad4, 0xff, 192);
2693 memset(vc->v0, 0xff, 32);
2694 memset(vc->v1, 0xff, 32);
2695 memset(vc->v2, 0xff, 16);
2696 memset(vc->v3, 0xff, 16);
2697 memset(vc->vendor, 0xff, 32);
2698
2699 memset(vc->phys_refnum, 0xff, 4*ddf->mppe);
2700 memset(vc->phys_refnum+ddf->mppe, 0x00, 8*ddf->mppe);
2701
2702 for (i = 1; i < vc->sec_elmnt_count; i++) {
2703 memcpy(vcl->other_bvds[i-1], vc, ddf->conf_rec_len * 512);
2704 vcl->other_bvds[i-1]->sec_elmnt_seq = i;
2705 }
2706
2707 vcl->next = ddf->conflist;
2708 ddf->conflist = vcl;
2709 ddf->currentconf = vcl;
2710 ddf_set_updates_pending(ddf, NULL);
2711 return 1;
2712 }
2713
2714 static void add_to_super_ddf_bvd(struct supertype *st,
2715 mdu_disk_info_t *dk, int fd, char *devname,
2716 unsigned long long data_offset)
2717 {
2718 /* fd and devname identify a device within the ddf container (st).
2719 * dk identifies a location in the new BVD.
2720 * We need to find suitable free space in that device and update
2721 * the phys_refnum and lba_offset for the newly created vd_config.
2722 * We might also want to update the type in the phys_disk
2723 * section.
2724 *
2725 * Alternately: fd == -1 and we have already chosen which device to
2726 * use and recorded in dlist->raid_disk;
2727 */
2728 struct dl *dl;
2729 struct ddf_super *ddf = st->sb;
2730 struct vd_config *vc;
2731 unsigned int i;
2732 unsigned long long blocks, pos;
2733 unsigned int raid_disk = dk->raid_disk;
2734
2735 if (fd == -1) {
2736 for (dl = ddf->dlist; dl ; dl = dl->next)
2737 if (dl->raiddisk == dk->raid_disk)
2738 break;
2739 } else {
2740 for (dl = ddf->dlist; dl ; dl = dl->next)
2741 if (dl->major == dk->major &&
2742 dl->minor == dk->minor)
2743 break;
2744 }
2745 if (!dl || dl->pdnum < 0 || ! (dk->state & (1<<MD_DISK_SYNC)))
2746 return;
2747
2748 vc = &ddf->currentconf->conf;
2749 if (vc->sec_elmnt_count > 1) {
2750 unsigned int n = be16_to_cpu(vc->prim_elmnt_count);
2751 if (raid_disk >= n)
2752 vc = ddf->currentconf->other_bvds[raid_disk / n - 1];
2753 raid_disk %= n;
2754 }
2755
2756 blocks = be64_to_cpu(vc->blocks);
2757 if (ddf->currentconf->block_sizes)
2758 blocks = ddf->currentconf->block_sizes[dk->raid_disk];
2759
2760 pos = find_space(ddf, dl, data_offset, &blocks);
2761 if (pos == INVALID_SECTORS)
2762 return;
2763
2764 ddf->currentdev = dk->raid_disk;
2765 vc->phys_refnum[raid_disk] = dl->disk.refnum;
2766 LBA_OFFSET(ddf, vc)[raid_disk] = cpu_to_be64(pos);
2767
2768 for (i = 0; i < ddf->max_part ; i++)
2769 if (dl->vlist[i] == NULL)
2770 break;
2771 if (i == ddf->max_part)
2772 return;
2773 dl->vlist[i] = ddf->currentconf;
2774
2775 if (fd >= 0)
2776 dl->fd = fd;
2777 if (devname)
2778 dl->devname = devname;
2779
2780 /* Check if we can mark array as optimal yet */
2781 i = ddf->currentconf->vcnum;
2782 ddf->virt->entries[i].state =
2783 (ddf->virt->entries[i].state & ~DDF_state_mask)
2784 | get_svd_state(ddf, ddf->currentconf);
2785 be16_clear(ddf->phys->entries[dl->pdnum].type,
2786 cpu_to_be16(DDF_Global_Spare));
2787 be16_set(ddf->phys->entries[dl->pdnum].type,
2788 cpu_to_be16(DDF_Active_in_VD));
2789 dprintf("added disk %d/%08x to VD %d/%s as disk %d\n",
2790 dl->pdnum, be32_to_cpu(dl->disk.refnum),
2791 ddf->currentconf->vcnum, guid_str(vc->guid),
2792 dk->raid_disk);
2793 ddf_set_updates_pending(ddf, vc);
2794 }
2795
2796 static unsigned int find_unused_pde(const struct ddf_super *ddf)
2797 {
2798 unsigned int i;
2799 for (i = 0; i < be16_to_cpu(ddf->phys->max_pdes); i++) {
2800 if (all_ff(ddf->phys->entries[i].guid))
2801 return i;
2802 }
2803 return DDF_NOTFOUND;
2804 }
2805
2806 static void _set_config_size(struct phys_disk_entry *pde, const struct dl *dl)
2807 {
2808 __u64 cfs, t;
2809 cfs = min(dl->size - 32*1024*2ULL, be64_to_cpu(dl->primary_lba));
2810 t = be64_to_cpu(dl->secondary_lba);
2811 if (t != ~(__u64)0)
2812 cfs = min(cfs, t);
2813 /*
2814 * Some vendor DDF structures interpret workspace_lba
2815 * very differently than we do: Make a sanity check on the value.
2816 */
2817 t = be64_to_cpu(dl->workspace_lba);
2818 if (t < cfs) {
2819 __u64 wsp = cfs - t;
2820 if (wsp > 1024*1024*2ULL && wsp > dl->size / 16) {
2821 pr_err("%x:%x: workspace size 0x%llx too big, ignoring\n",
2822 dl->major, dl->minor, (unsigned long long)wsp);
2823 } else
2824 cfs = t;
2825 }
2826 pde->config_size = cpu_to_be64(cfs);
2827 dprintf("%x:%x config_size %llx, DDF structure is %llx blocks\n",
2828 dl->major, dl->minor,
2829 (unsigned long long)cfs, (unsigned long long)(dl->size-cfs));
2830 }
2831
2832 /* Add a device to a container, either while creating it or while
2833 * expanding a pre-existing container
2834 */
2835 static int add_to_super_ddf(struct supertype *st,
2836 mdu_disk_info_t *dk, int fd, char *devname,
2837 unsigned long long data_offset)
2838 {
2839 struct ddf_super *ddf = st->sb;
2840 struct dl *dd;
2841 time_t now;
2842 struct tm *tm;
2843 unsigned long long size;
2844 struct phys_disk_entry *pde;
2845 unsigned int n, i;
2846 struct stat stb;
2847 __u32 *tptr;
2848
2849 if (ddf->currentconf) {
2850 add_to_super_ddf_bvd(st, dk, fd, devname, data_offset);
2851 return 0;
2852 }
2853
2854 /* This is device numbered dk->number. We need to create
2855 * a phys_disk entry and a more detailed disk_data entry.
2856 */
2857 fstat(fd, &stb);
2858 n = find_unused_pde(ddf);
2859 if (n == DDF_NOTFOUND) {
2860 pr_err("No free slot in array, cannot add disk\n");
2861 return 1;
2862 }
2863 pde = &ddf->phys->entries[n];
2864 get_dev_size(fd, NULL, &size);
2865 if (size <= 32*1024*1024) {
2866 pr_err("device size must be at least 32MB\n");
2867 return 1;
2868 }
2869 size >>= 9;
2870
2871 if (posix_memalign((void**)&dd, 512,
2872 sizeof(*dd) + sizeof(dd->vlist[0]) * ddf->max_part) != 0) {
2873 pr_err("could allocate buffer for new disk, aborting\n");
2874 return 1;
2875 }
2876 dd->major = major(stb.st_rdev);
2877 dd->minor = minor(stb.st_rdev);
2878 dd->devname = devname;
2879 dd->fd = fd;
2880 dd->spare = NULL;
2881
2882 dd->disk.magic = DDF_PHYS_DATA_MAGIC;
2883 now = time(0);
2884 tm = localtime(&now);
2885 sprintf(dd->disk.guid, "%8s%04d%02d%02d",
2886 T10, tm->tm_year+1900, tm->tm_mon+1, tm->tm_mday);
2887 tptr = (__u32 *)(dd->disk.guid + 16);
2888 *tptr++ = random32();
2889 *tptr = random32();
2890
2891 do {
2892 /* Cannot be bothered finding a CRC of some irrelevant details*/
2893 dd->disk.refnum._v32 = random32();
2894 for (i = be16_to_cpu(ddf->active->max_pd_entries);
2895 i > 0; i--)
2896 if (be32_eq(ddf->phys->entries[i-1].refnum,
2897 dd->disk.refnum))
2898 break;
2899 } while (i > 0);
2900
2901 dd->disk.forced_ref = 1;
2902 dd->disk.forced_guid = 1;
2903 memset(dd->disk.vendor, ' ', 32);
2904 memcpy(dd->disk.vendor, "Linux", 5);
2905 memset(dd->disk.pad, 0xff, 442);
2906 for (i = 0; i < ddf->max_part ; i++)
2907 dd->vlist[i] = NULL;
2908
2909 dd->pdnum = n;
2910
2911 if (st->update_tail) {
2912 int len = (sizeof(struct phys_disk) +
2913 sizeof(struct phys_disk_entry));
2914 struct phys_disk *pd;
2915
2916 pd = xmalloc(len);
2917 pd->magic = DDF_PHYS_RECORDS_MAGIC;
2918 pd->used_pdes = cpu_to_be16(n);
2919 pde = &pd->entries[0];
2920 dd->mdupdate = pd;
2921 } else
2922 ddf->phys->used_pdes = cpu_to_be16(
2923 1 + be16_to_cpu(ddf->phys->used_pdes));
2924
2925 memcpy(pde->guid, dd->disk.guid, DDF_GUID_LEN);
2926 pde->refnum = dd->disk.refnum;
2927 pde->type = cpu_to_be16(DDF_Forced_PD_GUID | DDF_Global_Spare);
2928 pde->state = cpu_to_be16(DDF_Online);
2929 dd->size = size;
2930 /*
2931 * If there is already a device in dlist, try to reserve the same
2932 * amount of workspace. Otherwise, use 32MB.
2933 * We checked disk size above already.
2934 */
2935 #define __calc_lba(new, old, lba, mb) do { \
2936 unsigned long long dif; \
2937 if ((old) != NULL) \
2938 dif = (old)->size - be64_to_cpu((old)->lba); \
2939 else \
2940 dif = (new)->size; \
2941 if ((new)->size > dif) \
2942 (new)->lba = cpu_to_be64((new)->size - dif); \
2943 else \
2944 (new)->lba = cpu_to_be64((new)->size - (mb*1024*2)); \
2945 } while (0)
2946 __calc_lba(dd, ddf->dlist, workspace_lba, 32);
2947 __calc_lba(dd, ddf->dlist, primary_lba, 16);
2948 if (ddf->dlist == NULL ||
2949 be64_to_cpu(ddf->dlist->secondary_lba) != ~(__u64)0)
2950 __calc_lba(dd, ddf->dlist, secondary_lba, 32);
2951 _set_config_size(pde, dd);
2952
2953 sprintf(pde->path, "%17.17s","Information: nil") ;
2954 memset(pde->pad, 0xff, 6);
2955
2956 if (st->update_tail) {
2957 dd->next = ddf->add_list;
2958 ddf->add_list = dd;
2959 } else {
2960 dd->next = ddf->dlist;
2961 ddf->dlist = dd;
2962 ddf_set_updates_pending(ddf, NULL);
2963 }
2964
2965 return 0;
2966 }
2967
2968 static int remove_from_super_ddf(struct supertype *st, mdu_disk_info_t *dk)
2969 {
2970 struct ddf_super *ddf = st->sb;
2971 struct dl *dl;
2972
2973 /* mdmon has noticed that this disk (dk->major/dk->minor) has
2974 * disappeared from the container.
2975 * We need to arrange that it disappears from the metadata and
2976 * internal data structures too.
2977 * Most of the work is done by ddf_process_update which edits
2978 * the metadata and closes the file handle and attaches the memory
2979 * where free_updates will free it.
2980 */
2981 for (dl = ddf->dlist; dl ; dl = dl->next)
2982 if (dl->major == dk->major &&
2983 dl->minor == dk->minor)
2984 break;
2985 if (!dl || dl->pdnum < 0)
2986 return -1;
2987
2988 if (st->update_tail) {
2989 int len = (sizeof(struct phys_disk) +
2990 sizeof(struct phys_disk_entry));
2991 struct phys_disk *pd;
2992
2993 pd = xmalloc(len);
2994 pd->magic = DDF_PHYS_RECORDS_MAGIC;
2995 pd->used_pdes = cpu_to_be16(dl->pdnum);
2996 pd->entries[0].state = cpu_to_be16(DDF_Missing);
2997 append_metadata_update(st, pd, len);
2998 }
2999 return 0;
3000 }
3001
3002 /*
3003 * This is the write_init_super method for a ddf container. It is
3004 * called when creating a container or adding another device to a
3005 * container.
3006 */
3007
3008 static int __write_ddf_structure(struct dl *d, struct ddf_super *ddf, __u8 type)
3009 {
3010 unsigned long long sector;
3011 struct ddf_header *header;
3012 int fd, i, n_config, conf_size, buf_size;
3013 int ret = 0;
3014 char *conf;
3015
3016 fd = d->fd;
3017
3018 switch (type) {
3019 case DDF_HEADER_PRIMARY:
3020 header = &ddf->primary;
3021 sector = be64_to_cpu(header->primary_lba);
3022 break;
3023 case DDF_HEADER_SECONDARY:
3024 header = &ddf->secondary;
3025 sector = be64_to_cpu(header->secondary_lba);
3026 break;
3027 default:
3028 return 0;
3029 }
3030 if (sector == ~(__u64)0)
3031 return 0;
3032
3033 header->type = type;
3034 header->openflag = 1;
3035 header->crc = calc_crc(header, 512);
3036
3037 lseek64(fd, sector<<9, 0);
3038 if (write(fd, header, 512) < 0)
3039 goto out;
3040
3041 ddf->controller.crc = calc_crc(&ddf->controller, 512);
3042 if (write(fd, &ddf->controller, 512) < 0)
3043 goto out;
3044
3045 ddf->phys->crc = calc_crc(ddf->phys, ddf->pdsize);
3046 if (write(fd, ddf->phys, ddf->pdsize) < 0)
3047 goto out;
3048 ddf->virt->crc = calc_crc(ddf->virt, ddf->vdsize);
3049 if (write(fd, ddf->virt, ddf->vdsize) < 0)
3050 goto out;
3051
3052 /* Now write lots of config records. */
3053 n_config = ddf->max_part;
3054 conf_size = ddf->conf_rec_len * 512;
3055 conf = ddf->conf;
3056 buf_size = conf_size * (n_config + 1);
3057 if (!conf) {
3058 if (posix_memalign((void**)&conf, 512, buf_size) != 0)
3059 goto out;
3060 ddf->conf = conf;
3061 }
3062 for (i = 0 ; i <= n_config ; i++) {
3063 struct vcl *c;
3064 struct vd_config *vdc = NULL;
3065 if (i == n_config) {
3066 c = (struct vcl *)d->spare;
3067 if (c)
3068 vdc = &c->conf;
3069 } else {
3070 unsigned int dummy;
3071 c = d->vlist[i];
3072 if (c)
3073 get_pd_index_from_refnum(
3074 c, d->disk.refnum,
3075 ddf->mppe,
3076 (const struct vd_config **)&vdc,
3077 &dummy);
3078 }
3079 if (vdc) {
3080 dprintf("writing conf record %i on disk %08x for %s/%u\n",
3081 i, be32_to_cpu(d->disk.refnum),
3082 guid_str(vdc->guid),
3083 vdc->sec_elmnt_seq);
3084 vdc->crc = calc_crc(vdc, conf_size);
3085 memcpy(conf + i*conf_size, vdc, conf_size);
3086 } else
3087 memset(conf + i*conf_size, 0xff, conf_size);
3088 }
3089 if (write(fd, conf, buf_size) != buf_size)
3090 goto out;
3091
3092 d->disk.crc = calc_crc(&d->disk, 512);
3093 if (write(fd, &d->disk, 512) < 0)
3094 goto out;
3095
3096 ret = 1;
3097 out:
3098 header->openflag = 0;
3099 header->crc = calc_crc(header, 512);
3100
3101 lseek64(fd, sector<<9, 0);
3102 if (write(fd, header, 512) < 0)
3103 ret = 0;
3104
3105 return ret;
3106 }
3107
3108 static int _write_super_to_disk(struct ddf_super *ddf, struct dl *d)
3109 {
3110 unsigned long long size;
3111 int fd = d->fd;
3112 if (fd < 0)
3113 return 0;
3114
3115 /* We need to fill in the primary, (secondary) and workspace
3116 * lba's in the headers, set their checksums,
3117 * Also checksum phys, virt....
3118 *
3119 * Then write everything out, finally the anchor is written.
3120 */
3121 get_dev_size(fd, NULL, &size);
3122 size /= 512;
3123 memcpy(&ddf->anchor, ddf->active, 512);
3124 if (be64_to_cpu(d->workspace_lba) != 0ULL)
3125 ddf->anchor.workspace_lba = d->workspace_lba;
3126 else
3127 ddf->anchor.workspace_lba =
3128 cpu_to_be64(size - 32*1024*2);
3129 if (be64_to_cpu(d->primary_lba) != 0ULL)
3130 ddf->anchor.primary_lba = d->primary_lba;
3131 else
3132 ddf->anchor.primary_lba =
3133 cpu_to_be64(size - 16*1024*2);
3134 if (be64_to_cpu(d->secondary_lba) != 0ULL)
3135 ddf->anchor.secondary_lba = d->secondary_lba;
3136 else
3137 ddf->anchor.secondary_lba =
3138 cpu_to_be64(size - 32*1024*2);
3139 ddf->anchor.timestamp = cpu_to_be32(time(0) - DECADE);
3140 memcpy(&ddf->primary, &ddf->anchor, 512);
3141 memcpy(&ddf->secondary, &ddf->anchor, 512);
3142
3143 ddf->anchor.type = DDF_HEADER_ANCHOR;
3144 ddf->anchor.openflag = 0xFF; /* 'open' means nothing */
3145 ddf->anchor.seq = cpu_to_be32(0xFFFFFFFF); /* no sequencing in anchor */
3146 ddf->anchor.crc = calc_crc(&ddf->anchor, 512);
3147
3148 if (!__write_ddf_structure(d, ddf, DDF_HEADER_PRIMARY))
3149 return 0;
3150
3151 if (!__write_ddf_structure(d, ddf, DDF_HEADER_SECONDARY))
3152 return 0;
3153
3154 lseek64(fd, (size-1)*512, SEEK_SET);
3155 if (write(fd, &ddf->anchor, 512) < 0)
3156 return 0;
3157
3158 return 1;
3159 }
3160
3161 static int __write_init_super_ddf(struct supertype *st)
3162 {
3163 struct ddf_super *ddf = st->sb;
3164 struct dl *d;
3165 int attempts = 0;
3166 int successes = 0;
3167
3168 pr_state(ddf, __func__);
3169
3170 /* try to write updated metadata,
3171 * if we catch a failure move on to the next disk
3172 */
3173 for (d = ddf->dlist; d; d=d->next) {
3174 attempts++;
3175 successes += _write_super_to_disk(ddf, d);
3176 }
3177
3178 return attempts != successes;
3179 }
3180
3181 static int write_init_super_ddf(struct supertype *st)
3182 {
3183 struct ddf_super *ddf = st->sb;
3184 struct vcl *currentconf = ddf->currentconf;
3185
3186 /* We are done with currentconf - reset it so st refers to the container */
3187 ddf->currentconf = NULL;
3188
3189 if (st->update_tail) {
3190 /* queue the virtual_disk and vd_config as metadata updates */
3191 struct virtual_disk *vd;
3192 struct vd_config *vc;
3193 int len, tlen;
3194 unsigned int i;
3195
3196 if (!currentconf) {
3197 /* Must be adding a physical disk to the container */
3198 int len = (sizeof(struct phys_disk) +
3199 sizeof(struct phys_disk_entry));
3200
3201 /* adding a disk to the container. */
3202 if (!ddf->add_list)
3203 return 0;
3204
3205 append_metadata_update(st, ddf->add_list->mdupdate, len);
3206 ddf->add_list->mdupdate = NULL;
3207 return 0;
3208 }
3209
3210 /* Newly created VD */
3211
3212 /* First the virtual disk. We have a slightly fake header */
3213 len = sizeof(struct virtual_disk) + sizeof(struct virtual_entry);
3214 vd = xmalloc(len);
3215 *vd = *ddf->virt;
3216 vd->entries[0] = ddf->virt->entries[currentconf->vcnum];
3217 vd->populated_vdes = cpu_to_be16(currentconf->vcnum);
3218 append_metadata_update(st, vd, len);
3219
3220 /* Then the vd_config */
3221 len = ddf->conf_rec_len * 512;
3222 tlen = len * currentconf->conf.sec_elmnt_count;
3223 vc = xmalloc(tlen);
3224 memcpy(vc, &currentconf->conf, len);
3225 for (i = 1; i < currentconf->conf.sec_elmnt_count; i++)
3226 memcpy((char *)vc + i*len, currentconf->other_bvds[i-1],
3227 len);
3228 append_metadata_update(st, vc, tlen);
3229
3230 return 0;
3231 } else {
3232 struct dl *d;
3233 if (!currentconf)
3234 for (d = ddf->dlist; d; d=d->next)
3235 while (Kill(d->devname, NULL, 0, -1, 1) == 0);
3236 /* Note: we don't close the fd's now, but a subsequent
3237 * ->free_super() will
3238 */
3239 return __write_init_super_ddf(st);
3240 }
3241 }
3242
3243 static __u64 avail_size_ddf(struct supertype *st, __u64 devsize,
3244 unsigned long long data_offset)
3245 {
3246 /* We must reserve the last 32Meg */
3247 if (devsize <= 32*1024*2)
3248 return 0;
3249 return devsize - 32*1024*2;
3250 }
3251
3252 static int reserve_space(struct supertype *st, int raiddisks,
3253 unsigned long long size, int chunk,
3254 unsigned long long data_offset,
3255 unsigned long long *freesize)
3256 {
3257 /* Find 'raiddisks' spare extents at least 'size' big (but
3258 * only caring about multiples of 'chunk') and remember
3259 * them. If size==0, find the largest size possible.
3260 * Report available size in *freesize
3261 * If space cannot be found, fail.
3262 */
3263 struct dl *dl;
3264 struct ddf_super *ddf = st->sb;
3265 int cnt = 0;
3266
3267 for (dl = ddf->dlist; dl ; dl=dl->next) {
3268 dl->raiddisk = -1;
3269 dl->esize = 0;
3270 }
3271 /* Now find largest extent on each device */
3272 for (dl = ddf->dlist ; dl ; dl=dl->next) {
3273 unsigned long long minsize = ULLONG_MAX;
3274
3275 find_space(ddf, dl, data_offset, &minsize);
3276 if (minsize >= size && minsize >= (unsigned)chunk) {
3277 cnt++;
3278 dl->esize = minsize;
3279 }
3280 }
3281 if (cnt < raiddisks) {
3282 pr_err("not enough devices with space to create array.\n");
3283 return 0; /* No enough free spaces large enough */
3284 }
3285 if (size == 0) {
3286 /* choose the largest size of which there are at least 'raiddisk' */
3287 for (dl = ddf->dlist ; dl ; dl=dl->next) {
3288 struct dl *dl2;
3289 if (dl->esize <= size)
3290 continue;
3291 /* This is bigger than 'size', see if there are enough */
3292 cnt = 0;
3293 for (dl2 = ddf->dlist; dl2 ; dl2=dl2->next)
3294 if (dl2->esize >= dl->esize)
3295 cnt++;
3296 if (cnt >= raiddisks)
3297 size = dl->esize;
3298 }
3299 if (chunk) {
3300 size = size / chunk;
3301 size *= chunk;
3302 }
3303 *freesize = size;
3304 if (size < 32) {
3305 pr_err("not enough spare devices to create array.\n");
3306 return 0;
3307 }
3308 }
3309 /* We have a 'size' of which there are enough spaces.
3310 * We simply do a first-fit */
3311 cnt = 0;
3312 for (dl = ddf->dlist ; dl && cnt < raiddisks ; dl=dl->next) {
3313 if (dl->esize < size)
3314 continue;
3315
3316 dl->raiddisk = cnt;
3317 cnt++;
3318 }
3319 return 1;
3320 }
3321
3322 static int validate_geometry_ddf(struct supertype *st,
3323 int level, int layout, int raiddisks,
3324 int *chunk, unsigned long long size,
3325 unsigned long long data_offset,
3326 char *dev, unsigned long long *freesize,
3327 int consistency_policy, int verbose)
3328 {
3329 int fd;
3330 struct mdinfo *sra;
3331 int cfd;
3332
3333 /* ddf potentially supports lots of things, but it depends on
3334 * what devices are offered (and maybe kernel version?)
3335 * If given unused devices, we will make a container.
3336 * If given devices in a container, we will make a BVD.
3337 * If given BVDs, we make an SVD, changing all the GUIDs in the process.
3338 */
3339
3340 if (*chunk == UnSet)
3341 *chunk = DEFAULT_CHUNK;
3342
3343 if (level == LEVEL_NONE)
3344 level = LEVEL_CONTAINER;
3345 if (level == LEVEL_CONTAINER) {
3346 /* Must be a fresh device to add to a container */
3347 return validate_geometry_ddf_container(st, level, layout,
3348 raiddisks, *chunk,
3349 size, data_offset, dev,
3350 freesize,
3351 verbose);
3352 }
3353
3354 if (!dev) {
3355 mdu_array_info_t array = {
3356 .level = level,
3357 .layout = layout,
3358 .raid_disks = raiddisks
3359 };
3360 struct vd_config conf;
3361 if (layout_md2ddf(&array, &conf) == -1) {
3362 if (verbose)
3363 pr_err("DDF does not support level %d /layout %d arrays with %d disks\n",
3364 level, layout, raiddisks);
3365 return 0;
3366 }
3367 /* Should check layout? etc */
3368
3369 if (st->sb && freesize) {
3370 /* --create was given a container to create in.
3371 * So we need to check that there are enough
3372 * free spaces and return the amount of space.
3373 * We may as well remember which drives were
3374 * chosen so that add_to_super/getinfo_super
3375 * can return them.
3376 */
3377 return reserve_space(st, raiddisks, size, *chunk,
3378 data_offset, freesize);
3379 }
3380 return 1;
3381 }
3382
3383 if (st->sb) {
3384 /* A container has already been opened, so we are
3385 * creating in there. Maybe a BVD, maybe an SVD.
3386 * Should make a distinction one day.
3387 */
3388 return validate_geometry_ddf_bvd(st, level, layout, raiddisks,
3389 chunk, size, data_offset, dev,
3390 freesize,
3391 verbose);
3392 }
3393 /* This is the first device for the array.
3394 * If it is a container, we read it in and do automagic allocations,
3395 * no other devices should be given.
3396 * Otherwise it must be a member device of a container, and we
3397 * do manual allocation.
3398 * Later we should check for a BVD and make an SVD.
3399 */
3400 fd = open(dev, O_RDONLY|O_EXCL, 0);
3401 if (fd >= 0) {
3402 close(fd);
3403 /* Just a bare device, no good to us */
3404 if (verbose)
3405 pr_err("ddf: Cannot create this array on device %s - a container is required.\n",
3406 dev);
3407 return 0;
3408 }
3409 if (errno != EBUSY || (fd = open(dev, O_RDONLY, 0)) < 0) {
3410 if (verbose)
3411 pr_err("ddf: Cannot open %s: %s\n",
3412 dev, strerror(errno));
3413 return 0;
3414 }
3415 /* Well, it is in use by someone, maybe a 'ddf' container. */
3416 cfd = open_container(fd);
3417 if (cfd < 0) {
3418 close(fd);
3419 if (verbose)
3420 pr_err("ddf: Cannot use %s: %s\n",
3421 dev, strerror(EBUSY));
3422 return 0;
3423 }
3424 sra = sysfs_read(cfd, NULL, GET_VERSION);
3425 close(fd);
3426 if (sra && sra->array.major_version == -1 &&
3427 strcmp(sra->text_version, "ddf") == 0) {
3428 /* This is a member of a ddf container. Load the container
3429 * and try to create a bvd
3430 */
3431 struct ddf_super *ddf;
3432 if (load_super_ddf_all(st, cfd, (void **)&ddf, NULL) == 0) {
3433 st->sb = ddf;
3434 strcpy(st->container_devnm, fd2devnm(cfd));
3435 close(cfd);
3436 return validate_geometry_ddf_bvd(st, level, layout,
3437 raiddisks, chunk, size,
3438 data_offset,
3439 dev, freesize,
3440 verbose);
3441 }
3442 close(cfd);
3443 } else /* device may belong to a different container */
3444 return 0;
3445
3446 return 1;
3447 }
3448
3449 static int
3450 validate_geometry_ddf_container(struct supertype *st,
3451 int level, int layout, int raiddisks,
3452 int chunk, unsigned long long size,
3453 unsigned long long data_offset,
3454 char *dev, unsigned long long *freesize,
3455 int verbose)
3456 {
3457 int fd;
3458 unsigned long long ldsize;
3459
3460 if (level != LEVEL_CONTAINER)
3461 return 0;
3462 if (!dev)
3463 return 1;
3464
3465 fd = open(dev, O_RDONLY|O_EXCL, 0);
3466 if (fd < 0) {
3467 if (verbose)
3468 pr_err("ddf: Cannot open %s: %s\n",
3469 dev, strerror(errno));
3470 return 0;
3471 }
3472 if (!get_dev_size(fd, dev, &ldsize)) {
3473 close(fd);
3474 return 0;
3475 }
3476 close(fd);
3477
3478 *freesize = avail_size_ddf(st, ldsize >> 9, INVALID_SECTORS);
3479 if (*freesize == 0)
3480 return 0;
3481
3482 return 1;
3483 }
3484
3485 static int validate_geometry_ddf_bvd(struct supertype *st,
3486 int level, int layout, int raiddisks,
3487 int *chunk, unsigned long long size,
3488 unsigned long long data_offset,
3489 char *dev, unsigned long long *freesize,
3490 int verbose)
3491 {
3492 dev_t rdev;
3493 struct ddf_super *ddf = st->sb;
3494 struct dl *dl;
3495 unsigned long long maxsize;
3496 /* ddf/bvd supports lots of things, but not containers */
3497 if (level == LEVEL_CONTAINER) {
3498 if (verbose)
3499 pr_err("DDF cannot create a container within an container\n");
3500 return 0;
3501 }
3502 /* We must have the container info already read in. */
3503 if (!ddf)
3504 return 0;
3505
3506 if (!dev) {
3507 /* General test: make sure there is space for
3508 * 'raiddisks' device extents of size 'size'.
3509 */
3510 unsigned long long minsize = size;
3511 int dcnt = 0;
3512 if (minsize == 0)
3513 minsize = 8;
3514 for (dl = ddf->dlist; dl ; dl = dl->next) {
3515 if (find_space(ddf, dl, data_offset, &minsize)
3516 != INVALID_SECTORS)
3517 dcnt++;
3518 }
3519 if (dcnt < raiddisks) {
3520 if (verbose)
3521 pr_err("ddf: Not enough devices with space for this array (%d < %d)\n",
3522 dcnt, raiddisks);
3523 return 0;
3524 }
3525 return 1;
3526 }
3527 /* This device must be a member of the set */
3528 if (!stat_is_blkdev(dev, &rdev))
3529 return 0;
3530 for (dl = ddf->dlist ; dl ; dl = dl->next) {
3531 if (dl->major == (int)major(rdev) &&
3532 dl->minor == (int)minor(rdev))
3533 break;
3534 }
3535 if (!dl) {
3536 if (verbose)
3537 pr_err("ddf: %s is not in the same DDF set\n",
3538 dev);
3539 return 0;
3540 }
3541 maxsize = ULLONG_MAX;
3542 find_space(ddf, dl, data_offset, &maxsize);
3543 *freesize = maxsize;
3544
3545 return 1;
3546 }
3547
3548 static int load_super_ddf_all(struct supertype *st, int fd,
3549 void **sbp, char *devname)
3550 {
3551 struct mdinfo *sra;
3552 struct ddf_super *super;
3553 struct mdinfo *sd, *best = NULL;
3554 int bestseq = 0;
3555 int seq;
3556 char nm[20];
3557 int dfd;
3558
3559 sra = sysfs_read(fd, NULL, GET_LEVEL|GET_VERSION|GET_DEVS|GET_STATE);
3560 if (!sra)
3561 return 1;
3562 if (sra->array.major_version != -1 ||
3563 sra->array.minor_version != -2 ||
3564 strcmp(sra->text_version, "ddf") != 0)
3565 return 1;
3566
3567 if (posix_memalign((void**)&super, 512, sizeof(*super)) != 0)
3568 return 1;
3569 memset(super, 0, sizeof(*super));
3570
3571 /* first, try each device, and choose the best ddf */
3572 for (sd = sra->devs ; sd ; sd = sd->next) {
3573 int rv;
3574 sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor);
3575 dfd = dev_open(nm, O_RDONLY);
3576 if (dfd < 0)
3577 return 2;
3578 rv = load_ddf_headers(dfd, super, NULL);
3579 close(dfd);
3580 if (rv == 0) {
3581 seq = be32_to_cpu(super->active->seq);
3582 if (super->active->openflag)
3583 seq--;
3584 if (!best || seq > bestseq) {
3585 bestseq = seq;
3586 best = sd;
3587 }
3588 }
3589 }
3590 if (!best)
3591 return 1;
3592 /* OK, load this ddf */
3593 sprintf(nm, "%d:%d", best->disk.major, best->disk.minor);
3594 dfd = dev_open(nm, O_RDONLY);
3595 if (dfd < 0)
3596 return 1;
3597 load_ddf_headers(dfd, super, NULL);
3598 load_ddf_global(dfd, super, NULL);
3599 close(dfd);
3600 /* Now we need the device-local bits */
3601 for (sd = sra->devs ; sd ; sd = sd->next) {
3602 int rv;
3603
3604 sprintf(nm, "%d:%d", sd->disk.major, sd->disk.minor);
3605 dfd = dev_open(nm, O_RDWR);
3606 if (dfd < 0)
3607 return 2;
3608 rv = load_ddf_headers(dfd, super, NULL);
3609 if (rv == 0)
3610 rv = load_ddf_local(dfd, super, NULL, 1);
3611 if (rv)
3612 return 1;
3613 }
3614
3615 *sbp = super;
3616 if (st->ss == NULL) {
3617 st->ss = &super_ddf;
3618 st->minor_version = 0;
3619 st->max_devs = 512;
3620 }
3621 strcpy(st->container_devnm, fd2devnm(fd));
3622 return 0;
3623 }
3624
3625 static int load_container_ddf(struct supertype *st, int fd,
3626 char *devname)
3627 {
3628 return load_super_ddf_all(st, fd, &st->sb, devname);
3629 }
3630
3631 static int check_secondary(const struct vcl *vc)
3632 {
3633 const struct vd_config *conf = &vc->conf;
3634 int i;
3635
3636 /* The only DDF secondary RAID level md can support is
3637 * RAID 10, if the stripe sizes and Basic volume sizes
3638 * are all equal.
3639 * Other configurations could in theory be supported by exposing
3640 * the BVDs to user space and using device mapper for the secondary
3641 * mapping. So far we don't support that.
3642 */
3643
3644 __u64 sec_elements[4] = {0, 0, 0, 0};
3645 #define __set_sec_seen(n) (sec_elements[(n)>>6] |= (1<<((n)&63)))
3646 #define __was_sec_seen(n) ((sec_elements[(n)>>6] & (1<<((n)&63))) != 0)
3647
3648 if (vc->other_bvds == NULL) {
3649 pr_err("No BVDs for secondary RAID found\n");
3650 return -1;
3651 }
3652 if (conf->prl != DDF_RAID1) {
3653 pr_err("Secondary RAID level only supported for mirrored BVD\n");
3654 return -1;
3655 }
3656 if (conf->srl != DDF_2STRIPED && conf->srl != DDF_2SPANNED) {
3657 pr_err("Secondary RAID level %d is unsupported\n",
3658 conf->srl);
3659 return -1;
3660 }
3661 __set_sec_seen(conf->sec_elmnt_seq);
3662 for (i = 0; i < conf->sec_elmnt_count-1; i++) {
3663 const struct vd_config *bvd = vc->other_bvds[i];
3664 if (bvd->sec_elmnt_seq == DDF_UNUSED_BVD)
3665 continue;
3666 if (bvd->srl != conf->srl) {
3667 pr_err("Inconsistent secondary RAID level across BVDs\n");
3668 return -1;
3669 }
3670 if (bvd->prl != conf->prl) {
3671 pr_err("Different RAID levels for BVDs are unsupported\n");
3672 return -1;
3673 }
3674 if (!be16_eq(bvd->prim_elmnt_count, conf->prim_elmnt_count)) {
3675 pr_err("All BVDs must have the same number of primary elements\n");
3676 return -1;
3677 }
3678 if (bvd->chunk_shift != conf->chunk_shift) {
3679 pr_err("Different strip sizes for BVDs are unsupported\n");
3680 return -1;
3681 }
3682 if (!be64_eq(bvd->array_blocks, conf->array_blocks)) {
3683 pr_err("Different BVD sizes are unsupported\n");
3684 return -1;
3685 }
3686 __set_sec_seen(bvd->sec_elmnt_seq);
3687 }
3688 for (i = 0; i < conf->sec_elmnt_count; i++) {
3689 if (!__was_sec_seen(i)) {
3690 /* pr_err("BVD %d is missing\n", i); */
3691 return -1;
3692 }
3693 }
3694 return 0;
3695 }
3696
3697 static unsigned int get_pd_index_from_refnum(const struct vcl *vc,
3698 be32 refnum, unsigned int nmax,
3699 const struct vd_config **bvd,
3700 unsigned int *idx)
3701 {
3702 unsigned int i, j, n, sec, cnt;
3703
3704 cnt = be16_to_cpu(vc->conf.prim_elmnt_count);
3705 sec = (vc->conf.sec_elmnt_count == 1 ? 0 : vc->conf.sec_elmnt_seq);
3706
3707 for (i = 0, j = 0 ; i < nmax ; i++) {
3708 /* j counts valid entries for this BVD */
3709 if (be32_eq(vc->conf.phys_refnum[i], refnum)) {
3710 *bvd = &vc->conf;
3711 *idx = i;
3712 return sec * cnt + j;
3713 }
3714 if (be32_to_cpu(vc->conf.phys_refnum[i]) != 0xffffffff)
3715 j++;
3716 }
3717 if (vc->other_bvds == NULL)
3718 goto bad;
3719
3720 for (n = 1; n < vc->conf.sec_elmnt_count; n++) {
3721 struct vd_config *vd = vc->other_bvds[n-1];
3722 sec = vd->sec_elmnt_seq;
3723 if (sec == DDF_UNUSED_BVD)
3724 continue;
3725 for (i = 0, j = 0 ; i < nmax ; i++) {
3726 if (be32_eq(vd->phys_refnum[i], refnum)) {
3727 *bvd = vd;
3728 *idx = i;
3729 return sec * cnt + j;
3730 }
3731 if (be32_to_cpu(vd->phys_refnum[i]) != 0xffffffff)
3732 j++;
3733 }
3734 }
3735 bad:
3736 *bvd = NULL;
3737 return DDF_NOTFOUND;
3738 }
3739
3740 static struct mdinfo *container_content_ddf(struct supertype *st, char *subarray)
3741 {
3742 /* Given a container loaded by load_super_ddf_all,
3743 * extract information about all the arrays into
3744 * an mdinfo tree.
3745 *
3746 * For each vcl in conflist: create an mdinfo, fill it in,
3747 * then look for matching devices (phys_refnum) in dlist
3748 * and create appropriate device mdinfo.
3749 */
3750 struct ddf_super *ddf = st->sb;
3751 struct mdinfo *rest = NULL;
3752 struct vcl *vc;
3753
3754 for (vc = ddf->conflist ; vc ; vc=vc->next) {
3755 unsigned int i;
3756 struct mdinfo *this;
3757 char *ep;
3758 __u32 *cptr;
3759 unsigned int pd;
3760
3761 if (subarray &&
3762 (strtoul(subarray, &ep, 10) != vc->vcnum ||
3763 *ep != '\0'))
3764 continue;
3765
3766 if (vc->conf.sec_elmnt_count > 1) {
3767 if (check_secondary(vc) != 0)
3768 continue;
3769 }
3770
3771 this = xcalloc(1, sizeof(*this));
3772 this->next = rest;
3773 rest = this;
3774
3775 if (layout_ddf2md(&vc->conf, &this->array))
3776 continue;
3777 this->array.md_minor = -1;
3778 this->array.major_version = -1;
3779 this->array.minor_version = -2;
3780 this->safe_mode_delay = DDF_SAFE_MODE_DELAY;
3781 cptr = (__u32 *)(vc->conf.guid + 16);
3782 this->array.ctime = DECADE + __be32_to_cpu(*cptr);
3783 this->array.utime = DECADE +
3784 be32_to_cpu(vc->conf.timestamp);
3785 this->array.chunk_size = 512 << vc->conf.chunk_shift;
3786
3787 i = vc->vcnum;
3788 if ((ddf->virt->entries[i].state & DDF_state_inconsistent) ||
3789 (ddf->virt->entries[i].init_state & DDF_initstate_mask) !=
3790 DDF_init_full) {
3791 this->array.state = 0;
3792 this->resync_start = 0;
3793 } else {
3794 this->array.state = 1;
3795 this->resync_start = MaxSector;
3796 }
3797 _ddf_array_name(this->name, ddf, i);
3798 memset(this->uuid, 0, sizeof(this->uuid));
3799 this->component_size = be64_to_cpu(vc->conf.blocks);
3800 this->array.size = this->component_size / 2;
3801 this->container_member = i;
3802
3803 ddf->currentconf = vc;
3804 uuid_from_super_ddf(st, this->uuid);
3805 if (!subarray)
3806 ddf->currentconf = NULL;
3807
3808 sprintf(this->text_version, "/%s/%d",
3809 st->container_devnm, this->container_member);
3810
3811 for (pd = 0; pd < be16_to_cpu(ddf->phys->max_pdes); pd++) {
3812 struct mdinfo *dev;
3813 struct dl *d;
3814 const struct vd_config *bvd;
3815 unsigned int iphys;
3816 int stt;
3817
3818 if (be32_to_cpu(ddf->phys->entries[pd].refnum)
3819 == 0xFFFFFFFF)
3820 continue;
3821
3822 stt = be16_to_cpu(ddf->phys->entries[pd].state);
3823 if ((stt & (DDF_Online|DDF_Failed|DDF_Rebuilding))
3824 != DDF_Online)
3825 continue;
3826
3827 i = get_pd_index_from_refnum(
3828 vc, ddf->phys->entries[pd].refnum,
3829 ddf->mppe, &bvd, &iphys);
3830 if (i == DDF_NOTFOUND)
3831 continue;
3832
3833 this->array.working_disks++;
3834
3835 for (d = ddf->dlist; d ; d=d->next)
3836 if (be32_eq(d->disk.refnum,
3837 ddf->phys->entries[pd].refnum))
3838 break;
3839 if (d == NULL)
3840 /* Haven't found that one yet, maybe there are others */
3841 continue;
3842
3843 dev = xcalloc(1, sizeof(*dev));
3844 dev->next = this->devs;
3845 this->devs = dev;
3846
3847 dev->disk.number = be32_to_cpu(d->disk.refnum);
3848 dev->disk.major = d->major;
3849 dev->disk.minor = d->minor;
3850 dev->disk.raid_disk = i;
3851 dev->disk.state = (1<<MD_DISK_SYNC)|(1<<MD_DISK_ACTIVE);
3852 dev->recovery_start = MaxSector;
3853
3854 dev->events = be32_to_cpu(ddf->active->seq);
3855 dev->data_offset =
3856 be64_to_cpu(LBA_OFFSET(ddf, bvd)[iphys]);
3857 dev->component_size = be64_to_cpu(bvd->blocks);
3858 if (d->devname)
3859 strcpy(dev->name, d->devname);
3860 }
3861 }
3862 return rest;
3863 }
3864
3865 static int store_super_ddf(struct supertype *st, int fd)
3866 {
3867 struct ddf_super *ddf = st->sb;
3868 unsigned long long dsize;
3869 void *buf;
3870 int rc;
3871
3872 if (!ddf)
3873 return 1;
3874
3875 if (!get_dev_size(fd, NULL, &dsize))
3876 return 1;
3877
3878 if (ddf->dlist || ddf->conflist) {
3879 struct stat sta;
3880 struct dl *dl;
3881 int ofd, ret;
3882
3883 if (fstat(fd, &sta) == -1 || !S_ISBLK(sta.st_mode)) {
3884 pr_err("file descriptor for invalid device\n");
3885 return 1;
3886 }
3887 for (dl = ddf->dlist; dl; dl = dl->next)
3888 if (dl->major == (int)major(sta.st_rdev) &&
3889 dl->minor == (int)minor(sta.st_rdev))
3890 break;
3891 if (!dl) {
3892 pr_err("couldn't find disk %d/%d\n",
3893 (int)major(sta.st_rdev),
3894 (int)minor(sta.st_rdev));
3895 return 1;
3896 }
3897 ofd = dl->fd;
3898 dl->fd = fd;
3899 ret = (_write_super_to_disk(ddf, dl) != 1);
3900 dl->fd = ofd;
3901 return ret;
3902 }
3903
3904 if (posix_memalign(&buf, 512, 512) != 0)
3905 return 1;
3906 memset(buf, 0, 512);
3907
3908 lseek64(fd, dsize-512, 0);
3909 rc = write(fd, buf, 512);
3910 free(buf);
3911 if (rc < 0)
3912 return 1;
3913 return 0;
3914 }
3915
3916 static int compare_super_ddf(struct supertype *st, struct supertype *tst)
3917 {
3918 /*
3919 * return:
3920 * 0 same, or first was empty, and second was copied
3921 * 1 second had wrong magic number - but that isn't possible
3922 * 2 wrong uuid
3923 * 3 wrong other info
3924 */
3925 struct ddf_super *first = st->sb;
3926 struct ddf_super *second = tst->sb;
3927 struct dl *dl1, *dl2;
3928 struct vcl *vl1, *vl2;
3929 unsigned int max_vds, max_pds, pd, vd;
3930
3931 if (!first) {
3932 st->sb = tst->sb;
3933 tst->sb = NULL;
3934 return 0;
3935 }
3936
3937 if (memcmp(first->anchor.guid, second->anchor.guid, DDF_GUID_LEN) != 0)
3938 return 2;
3939
3940 /* It is only OK to compare info in the anchor. Anything else
3941 * could be changing due to a reconfig so must be ignored.
3942 * guid really should be enough anyway.
3943 */
3944
3945 if (!be32_eq(first->active->seq, second->active->seq)) {
3946 dprintf("sequence number mismatch %u<->%u\n",
3947 be32_to_cpu(first->active->seq),
3948 be32_to_cpu(second->active->seq));
3949 return 0;
3950 }
3951
3952 /*
3953 * At this point we are fairly sure that the meta data matches.
3954 * But the new disk may contain additional local data.
3955 * Add it to the super block.
3956 */
3957 max_vds = be16_to_cpu(first->active->max_vd_entries);
3958 max_pds = be16_to_cpu(first->phys->max_pdes);
3959 for (vl2 = second->conflist; vl2; vl2 = vl2->next) {
3960 for (vl1 = first->conflist; vl1; vl1 = vl1->next)
3961 if (!memcmp(vl1->conf.guid, vl2->conf.guid,
3962 DDF_GUID_LEN))
3963 break;
3964 if (vl1) {
3965 if (vl1->other_bvds != NULL &&
3966 vl1->conf.sec_elmnt_seq !=
3967 vl2->conf.sec_elmnt_seq) {
3968 dprintf("adding BVD %u\n",
3969 vl2->conf.sec_elmnt_seq);
3970 add_other_bvd(vl1, &vl2->conf,
3971 first->conf_rec_len*512);
3972 }
3973 continue;
3974 }
3975
3976 if (posix_memalign((void **)&vl1, 512,
3977 (first->conf_rec_len*512 +
3978 offsetof(struct vcl, conf))) != 0) {
3979 pr_err("could not allocate vcl buf\n");
3980 return 3;
3981 }
3982
3983 vl1->next = first->conflist;
3984 vl1->block_sizes = NULL;
3985 memcpy(&vl1->conf, &vl2->conf, first->conf_rec_len*512);
3986 if (alloc_other_bvds(first, vl1) != 0) {
3987 pr_err("could not allocate other bvds\n");
3988 free(vl1);
3989 return 3;
3990 }
3991 for (vd = 0; vd < max_vds; vd++)
3992 if (!memcmp(first->virt->entries[vd].guid,
3993 vl1->conf.guid, DDF_GUID_LEN))
3994 break;
3995 vl1->vcnum = vd;
3996 dprintf("added config for VD %u\n", vl1->vcnum);
3997 first->conflist = vl1;
3998 }
3999
4000 for (dl2 = second->dlist; dl2; dl2 = dl2->next) {
4001 for (dl1 = first->dlist; dl1; dl1 = dl1->next)
4002 if (be32_eq(dl1->disk.refnum, dl2->disk.refnum))
4003 break;
4004 if (dl1)
4005 continue;
4006
4007 if (posix_memalign((void **)&dl1, 512,
4008 sizeof(*dl1) + (first->max_part) * sizeof(dl1->vlist[0]))
4009 != 0) {
4010 pr_err("could not allocate disk info buffer\n");
4011 return 3;
4012 }
4013 memcpy(dl1, dl2, sizeof(*dl1));
4014 dl1->mdupdate = NULL;
4015 dl1->next = first->dlist;
4016 dl1->fd = -1;
4017 for (pd = 0; pd < max_pds; pd++)
4018 if (be32_eq(first->phys->entries[pd].refnum,
4019 dl1->disk.refnum))
4020 break;
4021 dl1->pdnum = pd < max_pds ? (int)pd : -1;
4022 if (dl2->spare) {
4023 if (posix_memalign((void **)&dl1->spare, 512,
4024 first->conf_rec_len*512) != 0) {
4025 pr_err("could not allocate spare info buf\n");
4026 return 3;
4027 }
4028 memcpy(dl1->spare, dl2->spare, first->conf_rec_len*512);
4029 }
4030 for (vd = 0 ; vd < first->max_part ; vd++) {
4031 if (!dl2->vlist[vd]) {
4032 dl1->vlist[vd] = NULL;
4033 continue;
4034 }
4035 for (vl1 = first->conflist; vl1; vl1 = vl1->next) {
4036 if (!memcmp(vl1->conf.guid,
4037 dl2->vlist[vd]->conf.guid,
4038 DDF_GUID_LEN))
4039 break;
4040 dl1->vlist[vd] = vl1;
4041 }
4042 }
4043 first->dlist = dl1;
4044 dprintf("added disk %d: %08x\n", dl1->pdnum,
4045 be32_to_cpu(dl1->disk.refnum));
4046 }
4047
4048 return 0;
4049 }
4050
4051 /*
4052 * A new array 'a' has been started which claims to be instance 'inst'
4053 * within container 'c'.
4054 * We need to confirm that the array matches the metadata in 'c' so
4055 * that we don't corrupt any metadata.
4056 */
4057 static int ddf_open_new(struct supertype *c, struct active_array *a, char *inst)
4058 {
4059 struct ddf_super *ddf = c->sb;
4060 int n = atoi(inst);
4061 struct mdinfo *dev;
4062 struct dl *dl;
4063 static const char faulty[] = "faulty";
4064
4065 if (all_ff(ddf->virt->entries[n].guid)) {
4066 pr_err("subarray %d doesn't exist\n", n);
4067 return -ENODEV;
4068 }
4069 dprintf("new subarray %d, GUID: %s\n", n,
4070 guid_str(ddf->virt->entries[n].guid));
4071 for (dev = a->info.devs; dev; dev = dev->next) {
4072 for (dl = ddf->dlist; dl; dl = dl->next)
4073 if (dl->major == dev->disk.major &&
4074 dl->minor == dev->disk.minor)
4075 break;
4076 if (!dl || dl->pdnum < 0) {
4077 pr_err("device %d/%d of subarray %d not found in meta data\n",
4078 dev->disk.major, dev->disk.minor, n);
4079 return -1;
4080 }
4081 if ((be16_to_cpu(ddf->phys->entries[dl->pdnum].state) &
4082 (DDF_Online|DDF_Missing|DDF_Failed)) != DDF_Online) {
4083 pr_err("new subarray %d contains broken device %d/%d (%02x)\n",
4084 n, dl->major, dl->minor,
4085 be16_to_cpu(ddf->phys->entries[dl->pdnum].state));
4086 if (write(dev->state_fd, faulty, sizeof(faulty)-1) !=
4087 sizeof(faulty) - 1)
4088 pr_err("Write to state_fd failed\n");
4089 dev->curr_state = DS_FAULTY;
4090 }
4091 }
4092 a->info.container_member = n;
4093 return 0;
4094 }
4095
4096 static void handle_missing(struct ddf_super *ddf, struct active_array *a, int inst)
4097 {
4098 /* This member array is being activated. If any devices
4099 * are missing they must now be marked as failed.
4100 */
4101 struct vd_config *vc;
4102 unsigned int n_bvd;
4103 struct vcl *vcl;
4104 struct dl *dl;
4105 int pd;
4106 int n;
4107 int state;
4108
4109 for (n = 0; ; n++) {
4110 vc = find_vdcr(ddf, inst, n, &n_bvd, &vcl);
4111 if (!vc)
4112 break;
4113 for (dl = ddf->dlist; dl; dl = dl->next)
4114 if (be32_eq(dl->disk.refnum, vc->phys_refnum[n_bvd]))
4115 break;
4116 if (dl)
4117 /* Found this disk, so not missing */
4118 continue;
4119
4120 /* Mark the device as failed/missing. */
4121 pd = find_phys(ddf, vc->phys_refnum[n_bvd]);
4122 if (pd >= 0 && be16_and(ddf->phys->entries[pd].state,
4123 cpu_to_be16(DDF_Online))) {
4124 be16_clear(ddf->phys->entries[pd].state,
4125 cpu_to_be16(DDF_Online));
4126 be16_set(ddf->phys->entries[pd].state,
4127 cpu_to_be16(DDF_Failed|DDF_Missing));
4128 vc->phys_refnum[n_bvd] = cpu_to_be32(0);
4129 ddf_set_updates_pending(ddf, vc);
4130 }
4131
4132 /* Mark the array as Degraded */
4133 state = get_svd_state(ddf, vcl);
4134 if (ddf->virt->entries[inst].state !=
4135 ((ddf->virt->entries[inst].state & ~DDF_state_mask)
4136 | state)) {
4137 ddf->virt->entries[inst].state =
4138 (ddf->virt->entries[inst].state & ~DDF_state_mask)
4139 | state;
4140 a->check_degraded = 1;
4141 ddf_set_updates_pending(ddf, vc);
4142 }
4143 }
4144 }
4145
4146 /*
4147 * The array 'a' is to be marked clean in the metadata.
4148 * If '->resync_start' is not ~(unsigned long long)0, then the array is only
4149 * clean up to the point (in sectors). If that cannot be recorded in the
4150 * metadata, then leave it as dirty.
4151 *
4152 * For DDF, we need to clear the DDF_state_inconsistent bit in the
4153 * !global! virtual_disk.virtual_entry structure.
4154 */
4155 static int ddf_set_array_state(struct active_array *a, int consistent)
4156 {
4157 struct ddf_super *ddf = a->container->sb;
4158 int inst = a->info.container_member;
4159 int old = ddf->virt->entries[inst].state;
4160 if (consistent == 2) {
4161 handle_missing(ddf, a, inst);
4162 consistent = 1;
4163 if (!is_resync_complete(&a->info))
4164 consistent = 0;
4165 }
4166 if (consistent)
4167 ddf->virt->entries[inst].state &= ~DDF_state_inconsistent;
4168 else
4169 ddf->virt->entries[inst].state |= DDF_state_inconsistent;
4170 if (old != ddf->virt->entries[inst].state)
4171 ddf_set_updates_pending(ddf, NULL);
4172
4173 old = ddf->virt->entries[inst].init_state;
4174 ddf->virt->entries[inst].init_state &= ~DDF_initstate_mask;
4175 if (is_resync_complete(&a->info))
4176 ddf->virt->entries[inst].init_state |= DDF_init_full;
4177 else if (a->info.resync_start == 0)
4178 ddf->virt->entries[inst].init_state |= DDF_init_not;
4179 else
4180 ddf->virt->entries[inst].init_state |= DDF_init_quick;
4181 if (old != ddf->virt->entries[inst].init_state)
4182 ddf_set_updates_pending(ddf, NULL);
4183
4184 dprintf("ddf mark %d/%s (%d) %s %llu\n", inst,
4185 guid_str(ddf->virt->entries[inst].guid), a->curr_state,
4186 consistent?"clean":"dirty",
4187 a->info.resync_start);
4188 return consistent;
4189 }
4190
4191 static int get_bvd_state(const struct ddf_super *ddf,
4192 const struct vd_config *vc)
4193 {
4194 unsigned int i, n_bvd, working = 0;
4195 unsigned int n_prim = be16_to_cpu(vc->prim_elmnt_count);
4196 int pd, st, state;
4197 char *avail = xcalloc(1, n_prim);
4198 mdu_array_info_t array;
4199
4200 layout_ddf2md(vc, &array);
4201
4202 for (i = 0; i < n_prim; i++) {
4203 if (!find_index_in_bvd(ddf, vc, i, &n_bvd))
4204 continue;
4205 pd = find_phys(ddf, vc->phys_refnum[n_bvd]);
4206 if (pd < 0)
4207 continue;
4208 st = be16_to_cpu(ddf->phys->entries[pd].state);
4209 if ((st & (DDF_Online|DDF_Failed|DDF_Rebuilding))
4210 == DDF_Online) {
4211 working++;
4212 avail[i] = 1;
4213 }
4214 }
4215
4216 state = DDF_state_degraded;
4217 if (working == n_prim)
4218 state = DDF_state_optimal;
4219 else
4220 switch (vc->prl) {
4221 case DDF_RAID0:
4222 case DDF_CONCAT:
4223 case DDF_JBOD:
4224 state = DDF_state_failed;
4225 break;
4226 case DDF_RAID1:
4227 if (working == 0)
4228 state = DDF_state_failed;
4229 else if (working >= 2)
4230 state = DDF_state_part_optimal;
4231 break;
4232 case DDF_RAID1E:
4233 if (!enough(10, n_prim, array.layout, 1, avail))
4234 state = DDF_state_failed;
4235 break;
4236 case DDF_RAID4:
4237 case DDF_RAID5:
4238 if (working < n_prim - 1)
4239 state = DDF_state_failed;
4240 break;
4241 case DDF_RAID6:
4242 if (working < n_prim - 2)
4243 state = DDF_state_failed;
4244 else if (working == n_prim - 1)
4245 state = DDF_state_part_optimal;
4246 break;
4247 }
4248 return state;
4249 }
4250
4251 static int secondary_state(int state, int other, int seclevel)
4252 {
4253 if (state == DDF_state_optimal && other == DDF_state_optimal)
4254 return DDF_state_optimal;
4255 if (seclevel == DDF_2MIRRORED) {
4256 if (state == DDF_state_optimal || other == DDF_state_optimal)
4257 return DDF_state_part_optimal;
4258 if (state == DDF_state_failed && other == DDF_state_failed)
4259 return DDF_state_failed;
4260 return DDF_state_degraded;
4261 } else {
4262 if (state == DDF_state_failed || other == DDF_state_failed)
4263 return DDF_state_failed;
4264 if (state == DDF_state_degraded || other == DDF_state_degraded)
4265 return DDF_state_degraded;
4266 return DDF_state_part_optimal;
4267 }
4268 }
4269
4270 static int get_svd_state(const struct ddf_super *ddf, const struct vcl *vcl)
4271 {
4272 int state = get_bvd_state(ddf, &vcl->conf);
4273 unsigned int i;
4274 for (i = 1; i < vcl->conf.sec_elmnt_count; i++) {
4275 state = secondary_state(
4276 state,
4277 get_bvd_state(ddf, vcl->other_bvds[i-1]),
4278 vcl->conf.srl);
4279 }
4280 return state;
4281 }
4282
4283 /*
4284 * The state of each disk is stored in the global phys_disk structure
4285 * in phys_disk.entries[n].state.
4286 * This makes various combinations awkward.
4287 * - When a device fails in any array, it must be failed in all arrays
4288 * that include a part of this device.
4289 * - When a component is rebuilding, we cannot include it officially in the
4290 * array unless this is the only array that uses the device.
4291 *
4292 * So: when transitioning:
4293 * Online -> failed, just set failed flag. monitor will propagate
4294 * spare -> online, the device might need to be added to the array.
4295 * spare -> failed, just set failed. Don't worry if in array or not.
4296 */
4297 static void ddf_set_disk(struct active_array *a, int n, int state)
4298 {
4299 struct ddf_super *ddf = a->container->sb;
4300 unsigned int inst = a->info.container_member, n_bvd;
4301 struct vcl *vcl;
4302 struct vd_config *vc = find_vdcr(ddf, inst, (unsigned int)n,
4303 &n_bvd, &vcl);
4304 int pd;
4305 struct mdinfo *mdi;
4306 struct dl *dl;
4307 int update = 0;
4308
4309 dprintf("%d to %x\n", n, state);
4310 if (vc == NULL) {
4311 dprintf("ddf: cannot find instance %d!!\n", inst);
4312 return;
4313 }
4314 /* Find the matching slot in 'info'. */
4315 for (mdi = a->info.devs; mdi; mdi = mdi->next)
4316 if (mdi->disk.raid_disk == n)
4317 break;
4318 if (!mdi) {
4319 pr_err("cannot find raid disk %d\n", n);
4320 return;
4321 }
4322
4323 /* and find the 'dl' entry corresponding to that. */
4324 for (dl = ddf->dlist; dl; dl = dl->next)
4325 if (mdi->state_fd >= 0 &&
4326 mdi->disk.major == dl->major &&
4327 mdi->disk.minor == dl->minor)
4328 break;
4329 if (!dl) {
4330 pr_err("cannot find raid disk %d (%d/%d)\n",
4331 n, mdi->disk.major, mdi->disk.minor);
4332 return;
4333 }
4334
4335 pd = find_phys(ddf, vc->phys_refnum[n_bvd]);
4336 if (pd < 0 || pd != dl->pdnum) {
4337 /* disk doesn't currently exist or has changed.
4338 * If it is now in_sync, insert it. */
4339 dprintf("phys disk not found for %d: %d/%d ref %08x\n",
4340 dl->pdnum, dl->major, dl->minor,
4341 be32_to_cpu(dl->disk.refnum));
4342 dprintf("array %u disk %u ref %08x pd %d\n",
4343 inst, n_bvd,
4344 be32_to_cpu(vc->phys_refnum[n_bvd]), pd);
4345 if ((state & DS_INSYNC) && ! (state & DS_FAULTY) &&
4346 dl->pdnum >= 0) {
4347 pd = dl->pdnum;
4348 vc->phys_refnum[n_bvd] = dl->disk.refnum;
4349 LBA_OFFSET(ddf, vc)[n_bvd] =
4350 cpu_to_be64(mdi->data_offset);
4351 be16_clear(ddf->phys->entries[pd].type,
4352 cpu_to_be16(DDF_Global_Spare));
4353 be16_set(ddf->phys->entries[pd].type,
4354 cpu_to_be16(DDF_Active_in_VD));
4355 update = 1;
4356 }
4357 } else {
4358 be16 old = ddf->phys->entries[pd].state;
4359 if (state & DS_FAULTY)
4360 be16_set(ddf->phys->entries[pd].state,
4361 cpu_to_be16(DDF_Failed));
4362 if (state & DS_INSYNC) {
4363 be16_set(ddf->phys->entries[pd].state,
4364 cpu_to_be16(DDF_Online));
4365 be16_clear(ddf->phys->entries[pd].state,
4366 cpu_to_be16(DDF_Rebuilding));
4367 }
4368 if (!be16_eq(old, ddf->phys->entries[pd].state))
4369 update = 1;
4370 }
4371
4372 dprintf("ddf: set_disk %d (%08x) to %x->%02x\n", n,
4373 be32_to_cpu(dl->disk.refnum), state,
4374 be16_to_cpu(ddf->phys->entries[pd].state));
4375
4376 /* Now we need to check the state of the array and update
4377 * virtual_disk.entries[n].state.
4378 * It needs to be one of "optimal", "degraded", "failed".
4379 * I don't understand 'deleted' or 'missing'.
4380 */
4381 state = get_svd_state(ddf, vcl);
4382
4383 if (ddf->virt->entries[inst].state !=
4384 ((ddf->virt->entries[inst].state & ~DDF_state_mask)
4385 | state)) {
4386 ddf->virt->entries[inst].state =
4387 (ddf->virt->entries[inst].state & ~DDF_state_mask)
4388 | state;
4389 update = 1;
4390 }
4391 if (update)
4392 ddf_set_updates_pending(ddf, vc);
4393 }
4394
4395 static void ddf_sync_metadata(struct supertype *st)
4396 {
4397 /*
4398 * Write all data to all devices.
4399 * Later, we might be able to track whether only local changes
4400 * have been made, or whether any global data has been changed,
4401 * but ddf is sufficiently weird that it probably always
4402 * changes global data ....
4403 */
4404 struct ddf_super *ddf = st->sb;
4405 if (!ddf->updates_pending)
4406 return;
4407 ddf->updates_pending = 0;
4408 __write_init_super_ddf(st);
4409 dprintf("ddf: sync_metadata\n");
4410 }
4411
4412 static int del_from_conflist(struct vcl **list, const char *guid)
4413 {
4414 struct vcl **p;
4415 int found = 0;
4416 for (p = list; p && *p; p = &((*p)->next))
4417 if (!memcmp((*p)->conf.guid, guid, DDF_GUID_LEN)) {
4418 found = 1;
4419 *p = (*p)->next;
4420 }
4421 return found;
4422 }
4423
4424 static int _kill_subarray_ddf(struct ddf_super *ddf, const char *guid)
4425 {
4426 struct dl *dl;
4427 unsigned int vdnum, i;
4428 vdnum = find_vde_by_guid(ddf, guid);
4429 if (vdnum == DDF_NOTFOUND) {
4430 pr_err("could not find VD %s\n", guid_str(guid));
4431 return -1;
4432 }
4433 if (del_from_conflist(&ddf->conflist, guid) == 0) {
4434 pr_err("could not find conf %s\n", guid_str(guid));
4435 return -1;
4436 }
4437 for (dl = ddf->dlist; dl; dl = dl->next)
4438 for (i = 0; i < ddf->max_part; i++)
4439 if (dl->vlist[i] != NULL &&
4440 !memcmp(dl->vlist[i]->conf.guid, guid,
4441 DDF_GUID_LEN))
4442 dl->vlist[i] = NULL;
4443 memset(ddf->virt->entries[vdnum].guid, 0xff, DDF_GUID_LEN);
4444 dprintf("deleted %s\n", guid_str(guid));
4445 return 0;
4446 }
4447
4448 static int kill_subarray_ddf(struct supertype *st)
4449 {
4450 struct ddf_super *ddf = st->sb;
4451 /*
4452 * currentconf is set in container_content_ddf,
4453 * called with subarray arg
4454 */
4455 struct vcl *victim = ddf->currentconf;
4456 struct vd_config *conf;
4457 unsigned int vdnum;
4458
4459 ddf->currentconf = NULL;
4460 if (!victim) {
4461 pr_err("nothing to kill\n");
4462 return -1;
4463 }
4464 conf = &victim->conf;
4465 vdnum = find_vde_by_guid(ddf, conf->guid);
4466 if (vdnum == DDF_NOTFOUND) {
4467 pr_err("could not find VD %s\n", guid_str(conf->guid));
4468 return -1;
4469 }
4470 if (st->update_tail) {
4471 struct virtual_disk *vd;
4472 int len = sizeof(struct virtual_disk)
4473 + sizeof(struct virtual_entry);
4474 vd = xmalloc(len);
4475 if (vd == NULL) {
4476 pr_err("failed to allocate %d bytes\n", len);
4477 return -1;
4478 }
4479 memset(vd, 0 , len);
4480 vd->magic = DDF_VIRT_RECORDS_MAGIC;
4481 vd->populated_vdes = cpu_to_be16(0);
4482 memcpy(vd->entries[0].guid, conf->guid, DDF_GUID_LEN);
4483 /* we use DDF_state_deleted as marker */
4484 vd->entries[0].state = DDF_state_deleted;
4485 append_metadata_update(st, vd, len);
4486 } else {
4487 _kill_subarray_ddf(ddf, conf->guid);
4488 ddf_set_updates_pending(ddf, NULL);
4489 ddf_sync_metadata(st);
4490 }
4491 return 0;
4492 }
4493
4494 static void copy_matching_bvd(struct ddf_super *ddf,
4495 struct vd_config *conf,
4496 const struct metadata_update *update)
4497 {
4498 unsigned int mppe =
4499 be16_to_cpu(ddf->anchor.max_primary_element_entries);
4500 unsigned int len = ddf->conf_rec_len * 512;
4501 char *p;
4502 struct vd_config *vc;
4503 for (p = update->buf; p < update->buf + update->len; p += len) {
4504 vc = (struct vd_config *) p;
4505 if (vc->sec_elmnt_seq == conf->sec_elmnt_seq) {
4506 memcpy(conf->phys_refnum, vc->phys_refnum,
4507 mppe * (sizeof(__u32) + sizeof(__u64)));
4508 return;
4509 }
4510 }
4511 pr_err("no match for BVD %d of %s in update\n",
4512 conf->sec_elmnt_seq, guid_str(conf->guid));
4513 }
4514
4515 static void ddf_process_phys_update(struct supertype *st,
4516 struct metadata_update *update)
4517 {
4518 struct ddf_super *ddf = st->sb;
4519 struct phys_disk *pd;
4520 unsigned int ent;
4521
4522 pd = (struct phys_disk*)update->buf;
4523 ent = be16_to_cpu(pd->used_pdes);
4524 if (ent >= be16_to_cpu(ddf->phys->max_pdes))
4525 return;
4526 if (be16_and(pd->entries[0].state, cpu_to_be16(DDF_Missing))) {
4527 struct dl **dlp;
4528 /* removing this disk. */
4529 be16_set(ddf->phys->entries[ent].state,
4530 cpu_to_be16(DDF_Missing));
4531 for (dlp = &ddf->dlist; *dlp; dlp = &(*dlp)->next) {
4532 struct dl *dl = *dlp;
4533 if (dl->pdnum == (signed)ent) {
4534 close(dl->fd);
4535 dl->fd = -1;
4536 *dlp = dl->next;
4537 update->space = dl->devname;
4538 *(void**)dl = update->space_list;
4539 update->space_list = (void**)dl;
4540 break;
4541 }
4542 }
4543 ddf_set_updates_pending(ddf, NULL);
4544 return;
4545 }
4546 if (!all_ff(ddf->phys->entries[ent].guid))
4547 return;
4548 ddf->phys->entries[ent] = pd->entries[0];
4549 ddf->phys->used_pdes = cpu_to_be16
4550 (1 + be16_to_cpu(ddf->phys->used_pdes));
4551 ddf_set_updates_pending(ddf, NULL);
4552 if (ddf->add_list) {
4553 struct active_array *a;
4554 struct dl *al = ddf->add_list;
4555 ddf->add_list = al->next;
4556
4557 al->next = ddf->dlist;
4558 ddf->dlist = al;
4559
4560 /* As a device has been added, we should check
4561 * for any degraded devices that might make
4562 * use of this spare */
4563 for (a = st->arrays ; a; a=a->next)
4564 a->check_degraded = 1;
4565 }
4566 }
4567
4568 static void ddf_process_virt_update(struct supertype *st,
4569 struct metadata_update *update)
4570 {
4571 struct ddf_super *ddf = st->sb;
4572 struct virtual_disk *vd;
4573 unsigned int ent;
4574
4575 vd = (struct virtual_disk*)update->buf;
4576
4577 if (vd->entries[0].state == DDF_state_deleted) {
4578 if (_kill_subarray_ddf(ddf, vd->entries[0].guid))
4579 return;
4580 } else {
4581 ent = find_vde_by_guid(ddf, vd->entries[0].guid);
4582 if (ent != DDF_NOTFOUND) {
4583 dprintf("VD %s exists already in slot %d\n",
4584 guid_str(vd->entries[0].guid),
4585 ent);
4586 return;
4587 }
4588 ent = find_unused_vde(ddf);
4589 if (ent == DDF_NOTFOUND)
4590 return;
4591 ddf->virt->entries[ent] = vd->entries[0];
4592 ddf->virt->populated_vdes =
4593 cpu_to_be16(
4594 1 + be16_to_cpu(
4595 ddf->virt->populated_vdes));
4596 dprintf("added VD %s in slot %d(s=%02x i=%02x)\n",
4597 guid_str(vd->entries[0].guid), ent,
4598 ddf->virt->entries[ent].state,
4599 ddf->virt->entries[ent].init_state);
4600 }
4601 ddf_set_updates_pending(ddf, NULL);
4602 }
4603
4604 static void ddf_remove_failed(struct ddf_super *ddf)
4605 {
4606 /* Now remove any 'Failed' devices that are not part
4607 * of any VD. They will have the Transition flag set.
4608 * Once done, we need to update all dl->pdnum numbers.
4609 */
4610 unsigned int pdnum;
4611 unsigned int pd2 = 0;
4612 struct dl *dl;
4613
4614 for (pdnum = 0; pdnum < be16_to_cpu(ddf->phys->max_pdes);
4615 pdnum++) {
4616 if (be32_to_cpu(ddf->phys->entries[pdnum].refnum) ==
4617 0xFFFFFFFF)
4618 continue;
4619 if (be16_and(ddf->phys->entries[pdnum].state,
4620 cpu_to_be16(DDF_Failed)) &&
4621 be16_and(ddf->phys->entries[pdnum].state,
4622 cpu_to_be16(DDF_Transition))) {
4623 /* skip this one unless in dlist*/
4624 for (dl = ddf->dlist; dl; dl = dl->next)
4625 if (dl->pdnum == (int)pdnum)
4626 break;
4627 if (!dl)
4628 continue;
4629 }
4630 if (pdnum == pd2)
4631 pd2++;
4632 else {
4633 ddf->phys->entries[pd2] =
4634 ddf->phys->entries[pdnum];
4635 for (dl = ddf->dlist; dl; dl = dl->next)
4636 if (dl->pdnum == (int)pdnum)
4637 dl->pdnum = pd2;
4638 pd2++;
4639 }
4640 }
4641 ddf->phys->used_pdes = cpu_to_be16(pd2);
4642 while (pd2 < pdnum) {
4643 memset(ddf->phys->entries[pd2].guid, 0xff,
4644 DDF_GUID_LEN);
4645 pd2++;
4646 }
4647 }
4648
4649 static void ddf_update_vlist(struct ddf_super *ddf, struct dl *dl)
4650 {
4651 struct vcl *vcl;
4652 unsigned int vn = 0;
4653 int in_degraded = 0;
4654
4655 if (dl->pdnum < 0)
4656 return;
4657 for (vcl = ddf->conflist; vcl ; vcl = vcl->next) {
4658 unsigned int dn, ibvd;
4659 const struct vd_config *conf;
4660 int vstate;
4661 dn = get_pd_index_from_refnum(vcl,
4662 dl->disk.refnum,
4663 ddf->mppe,
4664 &conf, &ibvd);
4665 if (dn == DDF_NOTFOUND)
4666 continue;
4667 dprintf("dev %d/%08x has %s (sec=%u) at %d\n",
4668 dl->pdnum,
4669 be32_to_cpu(dl->disk.refnum),
4670 guid_str(conf->guid),
4671 conf->sec_elmnt_seq, vn);
4672 /* Clear the Transition flag */
4673 if (be16_and
4674 (ddf->phys->entries[dl->pdnum].state,
4675 cpu_to_be16(DDF_Failed)))
4676 be16_clear(ddf->phys
4677 ->entries[dl->pdnum].state,
4678 cpu_to_be16(DDF_Transition));
4679 dl->vlist[vn++] = vcl;
4680 vstate = ddf->virt->entries[vcl->vcnum].state
4681 & DDF_state_mask;
4682 if (vstate == DDF_state_degraded ||
4683 vstate == DDF_state_part_optimal)
4684 in_degraded = 1;
4685 }
4686 while (vn < ddf->max_part)
4687 dl->vlist[vn++] = NULL;
4688 if (dl->vlist[0]) {
4689 be16_clear(ddf->phys->entries[dl->pdnum].type,
4690 cpu_to_be16(DDF_Global_Spare));
4691 if (!be16_and(ddf->phys
4692 ->entries[dl->pdnum].type,
4693 cpu_to_be16(DDF_Active_in_VD))) {
4694 be16_set(ddf->phys
4695 ->entries[dl->pdnum].type,
4696 cpu_to_be16(DDF_Active_in_VD));
4697 if (in_degraded)
4698 be16_set(ddf->phys
4699 ->entries[dl->pdnum]
4700 .state,
4701 cpu_to_be16
4702 (DDF_Rebuilding));
4703 }
4704 }
4705 if (dl->spare) {
4706 be16_clear(ddf->phys->entries[dl->pdnum].type,
4707 cpu_to_be16(DDF_Global_Spare));
4708 be16_set(ddf->phys->entries[dl->pdnum].type,
4709 cpu_to_be16(DDF_Spare));
4710 }
4711 if (!dl->vlist[0] && !dl->spare) {
4712 be16_set(ddf->phys->entries[dl->pdnum].type,
4713 cpu_to_be16(DDF_Global_Spare));
4714 be16_clear(ddf->phys->entries[dl->pdnum].type,
4715 cpu_to_be16(DDF_Spare));
4716 be16_clear(ddf->phys->entries[dl->pdnum].type,
4717 cpu_to_be16(DDF_Active_in_VD));
4718 }
4719 }
4720
4721 static void ddf_process_conf_update(struct supertype *st,
4722 struct metadata_update *update)
4723 {
4724 struct ddf_super *ddf = st->sb;
4725 struct vd_config *vc;
4726 struct vcl *vcl;
4727 struct dl *dl;
4728 unsigned int ent;
4729 unsigned int pdnum, len;
4730
4731 vc = (struct vd_config*)update->buf;
4732 len = ddf->conf_rec_len * 512;
4733 if ((unsigned int)update->len != len * vc->sec_elmnt_count) {
4734 pr_err("%s: insufficient data (%d) for %u BVDs\n",
4735 guid_str(vc->guid), update->len,
4736 vc->sec_elmnt_count);
4737 return;
4738 }
4739 for (vcl = ddf->conflist; vcl ; vcl = vcl->next)
4740 if (memcmp(vcl->conf.guid, vc->guid, DDF_GUID_LEN) == 0)
4741 break;
4742 dprintf("conf update for %s (%s)\n",
4743 guid_str(vc->guid), (vcl ? "old" : "new"));
4744 if (vcl) {
4745 /* An update, just copy the phys_refnum and lba_offset
4746 * fields
4747 */
4748 unsigned int i;
4749 unsigned int k;
4750 copy_matching_bvd(ddf, &vcl->conf, update);
4751 for (k = 0; k < be16_to_cpu(vc->prim_elmnt_count); k++)
4752 dprintf("BVD %u has %08x at %llu\n", 0,
4753 be32_to_cpu(vcl->conf.phys_refnum[k]),
4754 be64_to_cpu(LBA_OFFSET(ddf,
4755 &vcl->conf)[k]));
4756 for (i = 1; i < vc->sec_elmnt_count; i++) {
4757 copy_matching_bvd(ddf, vcl->other_bvds[i-1],
4758 update);
4759 for (k = 0; k < be16_to_cpu(
4760 vc->prim_elmnt_count); k++)
4761 dprintf("BVD %u has %08x at %llu\n", i,
4762 be32_to_cpu
4763 (vcl->other_bvds[i-1]->
4764 phys_refnum[k]),
4765 be64_to_cpu
4766 (LBA_OFFSET
4767 (ddf,
4768 vcl->other_bvds[i-1])[k]));
4769 }
4770 } else {
4771 /* A new VD_CONF */
4772 unsigned int i;
4773 if (!update->space)
4774 return;
4775 vcl = update->space;
4776 update->space = NULL;
4777 vcl->next = ddf->conflist;
4778 memcpy(&vcl->conf, vc, len);
4779 ent = find_vde_by_guid(ddf, vc->guid);
4780 if (ent == DDF_NOTFOUND)
4781 return;
4782 vcl->vcnum = ent;
4783 ddf->conflist = vcl;
4784 for (i = 1; i < vc->sec_elmnt_count; i++)
4785 memcpy(vcl->other_bvds[i-1],
4786 update->buf + len * i, len);
4787 }
4788 /* Set DDF_Transition on all Failed devices - to help
4789 * us detect those that are no longer in use
4790 */
4791 for (pdnum = 0; pdnum < be16_to_cpu(ddf->phys->max_pdes);
4792 pdnum++)
4793 if (be16_and(ddf->phys->entries[pdnum].state,
4794 cpu_to_be16(DDF_Failed)))
4795 be16_set(ddf->phys->entries[pdnum].state,
4796 cpu_to_be16(DDF_Transition));
4797
4798 /* Now make sure vlist is correct for each dl. */
4799 for (dl = ddf->dlist; dl; dl = dl->next)
4800 ddf_update_vlist(ddf, dl);
4801 ddf_remove_failed(ddf);
4802
4803 ddf_set_updates_pending(ddf, vc);
4804 }
4805
4806 static void ddf_process_update(struct supertype *st,
4807 struct metadata_update *update)
4808 {
4809 /* Apply this update to the metadata.
4810 * The first 4 bytes are a DDF_*_MAGIC which guides
4811 * our actions.
4812 * Possible update are:
4813 * DDF_PHYS_RECORDS_MAGIC
4814 * Add a new physical device or remove an old one.
4815 * Changes to this record only happen implicitly.
4816 * used_pdes is the device number.
4817 * DDF_VIRT_RECORDS_MAGIC
4818 * Add a new VD. Possibly also change the 'access' bits.
4819 * populated_vdes is the entry number.
4820 * DDF_VD_CONF_MAGIC
4821 * New or updated VD. the VIRT_RECORD must already
4822 * exist. For an update, phys_refnum and lba_offset
4823 * (at least) are updated, and the VD_CONF must
4824 * be written to precisely those devices listed with
4825 * a phys_refnum.
4826 * DDF_SPARE_ASSIGN_MAGIC
4827 * replacement Spare Assignment Record... but for which device?
4828 *
4829 * So, e.g.:
4830 * - to create a new array, we send a VIRT_RECORD and
4831 * a VD_CONF. Then assemble and start the array.
4832 * - to activate a spare we send a VD_CONF to add the phys_refnum
4833 * and offset. This will also mark the spare as active with
4834 * a spare-assignment record.
4835 */
4836 be32 *magic = (be32 *)update->buf;
4837
4838 dprintf("Process update %x\n", be32_to_cpu(*magic));
4839
4840 if (be32_eq(*magic, DDF_PHYS_RECORDS_MAGIC)) {
4841 if (update->len == (sizeof(struct phys_disk) +
4842 sizeof(struct phys_disk_entry)))
4843 ddf_process_phys_update(st, update);
4844 } else if (be32_eq(*magic, DDF_VIRT_RECORDS_MAGIC)) {
4845 if (update->len == (sizeof(struct virtual_disk) +
4846 sizeof(struct virtual_entry)))
4847 ddf_process_virt_update(st, update);
4848 } else if (be32_eq(*magic, DDF_VD_CONF_MAGIC)) {
4849 ddf_process_conf_update(st, update);
4850 }
4851 /* case DDF_SPARE_ASSIGN_MAGIC */
4852 }
4853
4854 static int ddf_prepare_update(struct supertype *st,
4855 struct metadata_update *update)
4856 {
4857 /* This update arrived at managemon.
4858 * We are about to pass it to monitor.
4859 * If a malloc is needed, do it here.
4860 */
4861 struct ddf_super *ddf = st->sb;
4862 be32 *magic;
4863 if (update->len < 4)
4864 return 0;
4865 magic = (be32 *)update->buf;
4866 if (be32_eq(*magic, DDF_VD_CONF_MAGIC)) {
4867 struct vcl *vcl;
4868 struct vd_config *conf;
4869 if (update->len < (int)sizeof(*conf))
4870 return 0;
4871 conf = (struct vd_config *) update->buf;
4872 if (posix_memalign(&update->space, 512,
4873 offsetof(struct vcl, conf)
4874 + ddf->conf_rec_len * 512) != 0) {
4875 update->space = NULL;
4876 return 0;
4877 }
4878 vcl = update->space;
4879 vcl->conf.sec_elmnt_count = conf->sec_elmnt_count;
4880 if (alloc_other_bvds(ddf, vcl) != 0) {
4881 free(update->space);
4882 update->space = NULL;
4883 return 0;
4884 }
4885 }
4886 return 1;
4887 }
4888
4889 /*
4890 * Check degraded state of a RAID10.
4891 * returns 2 for good, 1 for degraded, 0 for failed, and -1 for error
4892 */
4893 static int raid10_degraded(struct mdinfo *info)
4894 {
4895 int n_prim, n_bvds;
4896 int i;
4897 struct mdinfo *d;
4898 char *found;
4899 int ret = -1;
4900
4901 n_prim = info->array.layout & ~0x100;
4902 n_bvds = info->array.raid_disks / n_prim;
4903 found = xmalloc(n_bvds);
4904 if (found == NULL)
4905 return ret;
4906 memset(found, 0, n_bvds);
4907 for (d = info->devs; d; d = d->next) {
4908 i = d->disk.raid_disk / n_prim;
4909 if (i >= n_bvds) {
4910 pr_err("BUG: invalid raid disk\n");
4911 goto out;
4912 }
4913 if (d->state_fd > 0)
4914 found[i]++;
4915 }
4916 ret = 2;
4917 for (i = 0; i < n_bvds; i++)
4918 if (!found[i]) {
4919 dprintf("BVD %d/%d failed\n", i, n_bvds);
4920 ret = 0;
4921 goto out;
4922 } else if (found[i] < n_prim) {
4923 dprintf("BVD %d/%d degraded\n", i, n_bvds);
4924 ret = 1;
4925 }
4926 out:
4927 free(found);
4928 return ret;
4929 }
4930
4931 /*
4932 * Check if the array 'a' is degraded but not failed.
4933 * If it is, find as many spares as are available and needed and
4934 * arrange for their inclusion.
4935 * We only choose devices which are not already in the array,
4936 * and prefer those with a spare-assignment to this array.
4937 * Otherwise we choose global spares - assuming always that
4938 * there is enough room.
4939 * For each spare that we assign, we return an 'mdinfo' which
4940 * describes the position for the device in the array.
4941 * We also add to 'updates' a DDF_VD_CONF_MAGIC update with
4942 * the new phys_refnum and lba_offset values.
4943 *
4944 * Only worry about BVDs at the moment.
4945 */
4946 static struct mdinfo *ddf_activate_spare(struct active_array *a,
4947 struct metadata_update **updates)
4948 {
4949 int working = 0;
4950 struct mdinfo *d;
4951 struct ddf_super *ddf = a->container->sb;
4952 int global_ok = 0;
4953 struct mdinfo *rv = NULL;
4954 struct mdinfo *di;
4955 struct metadata_update *mu;
4956 struct dl *dl;
4957 int i;
4958 unsigned int j;
4959 struct vcl *vcl;
4960 struct vd_config *vc;
4961 unsigned int n_bvd;
4962
4963 for (d = a->info.devs ; d ; d = d->next) {
4964 if ((d->curr_state & DS_FAULTY) &&
4965 d->state_fd >= 0)
4966 /* wait for Removal to happen */
4967 return NULL;
4968 if (d->state_fd >= 0)
4969 working ++;
4970 }
4971
4972 dprintf("working=%d (%d) level=%d\n", working,
4973 a->info.array.raid_disks,
4974 a->info.array.level);
4975 if (working == a->info.array.raid_disks)
4976 return NULL; /* array not degraded */
4977 switch (a->info.array.level) {
4978 case 1:
4979 if (working == 0)
4980 return NULL; /* failed */
4981 break;
4982 case 4:
4983 case 5:
4984 if (working < a->info.array.raid_disks - 1)
4985 return NULL; /* failed */
4986 break;
4987 case 6:
4988 if (working < a->info.array.raid_disks - 2)
4989 return NULL; /* failed */
4990 break;
4991 case 10:
4992 if (raid10_degraded(&a->info) < 1)
4993 return NULL;
4994 break;
4995 default: /* concat or stripe */
4996 return NULL; /* failed */
4997 }
4998
4999 /* For each slot, if it is not working, find a spare */
5000 dl = ddf->dlist;
5001 for (i = 0; i < a->info.array.raid_disks; i++) {
5002 for (d = a->info.devs ; d ; d = d->next)
5003 if (d->disk.raid_disk == i)
5004 break;
5005 dprintf("found %d: %p %x\n", i, d, d?d->curr_state:0);
5006 if (d && (d->state_fd >= 0))
5007 continue;
5008
5009 /* OK, this device needs recovery. Find a spare */
5010 again:
5011 for ( ; dl ; dl = dl->next) {
5012 unsigned long long esize;
5013 unsigned long long pos;
5014 struct mdinfo *d2;
5015 int is_global = 0;
5016 int is_dedicated = 0;
5017 be16 state;
5018
5019 if (dl->pdnum < 0)
5020 continue;
5021 state = ddf->phys->entries[dl->pdnum].state;
5022 if (be16_and(state,
5023 cpu_to_be16(DDF_Failed|DDF_Missing)) ||
5024 !be16_and(state,
5025 cpu_to_be16(DDF_Online)))
5026 continue;
5027
5028 /* If in this array, skip */
5029 for (d2 = a->info.devs ; d2 ; d2 = d2->next)
5030 if (d2->state_fd >= 0 &&
5031 d2->disk.major == dl->major &&
5032 d2->disk.minor == dl->minor) {
5033 dprintf("%x:%x (%08x) already in array\n",
5034 dl->major, dl->minor,
5035 be32_to_cpu(dl->disk.refnum));
5036 break;
5037 }
5038 if (d2)
5039 continue;
5040 if (be16_and(ddf->phys->entries[dl->pdnum].type,
5041 cpu_to_be16(DDF_Spare))) {
5042 /* Check spare assign record */
5043 if (dl->spare) {
5044 if (dl->spare->type & DDF_spare_dedicated) {
5045 /* check spare_ents for guid */
5046 unsigned int j;
5047 for (j = 0 ;
5048 j < be16_to_cpu
5049 (dl->spare
5050 ->populated);
5051 j++) {
5052 if (memcmp(dl->spare->spare_ents[j].guid,
5053 ddf->virt->entries[a->info.container_member].guid,
5054 DDF_GUID_LEN) == 0)
5055 is_dedicated = 1;
5056 }
5057 } else
5058 is_global = 1;
5059 }
5060 } else if (be16_and(ddf->phys->entries[dl->pdnum].type,
5061 cpu_to_be16(DDF_Global_Spare))) {
5062 is_global = 1;
5063 } else if (!be16_and(ddf->phys
5064 ->entries[dl->pdnum].state,
5065 cpu_to_be16(DDF_Failed))) {
5066 /* we can possibly use some of this */
5067 is_global = 1;
5068 }
5069 if ( ! (is_dedicated ||
5070 (is_global && global_ok))) {
5071 dprintf("%x:%x not suitable: %d %d\n", dl->major, dl->minor,
5072 is_dedicated, is_global);
5073 continue;
5074 }
5075
5076 /* We are allowed to use this device - is there space?
5077 * We need a->info.component_size sectors */
5078 esize = a->info.component_size;
5079 pos = find_space(ddf, dl, INVALID_SECTORS, &esize);
5080
5081 if (esize < a->info.component_size) {
5082 dprintf("%x:%x has no room: %llu %llu\n",
5083 dl->major, dl->minor,
5084 esize, a->info.component_size);
5085 /* No room */
5086 continue;
5087 }
5088
5089 /* Cool, we have a device with some space at pos */
5090 di = xcalloc(1, sizeof(*di));
5091 di->disk.number = i;
5092 di->disk.raid_disk = i;
5093 di->disk.major = dl->major;
5094 di->disk.minor = dl->minor;
5095 di->disk.state = 0;
5096 di->recovery_start = 0;
5097 di->data_offset = pos;
5098 di->component_size = a->info.component_size;
5099 di->next = rv;
5100 rv = di;
5101 dprintf("%x:%x (%08x) to be %d at %llu\n",
5102 dl->major, dl->minor,
5103 be32_to_cpu(dl->disk.refnum), i, pos);
5104
5105 break;
5106 }
5107 if (!dl && ! global_ok) {
5108 /* not enough dedicated spares, try global */
5109 global_ok = 1;
5110 dl = ddf->dlist;
5111 goto again;
5112 }
5113 }
5114
5115 if (!rv)
5116 /* No spares found */
5117 return rv;
5118 /* Now 'rv' has a list of devices to return.
5119 * Create a metadata_update record to update the
5120 * phys_refnum and lba_offset values
5121 */
5122 vc = find_vdcr(ddf, a->info.container_member, rv->disk.raid_disk,
5123 &n_bvd, &vcl);
5124 if (vc == NULL)
5125 return NULL;
5126
5127 mu = xmalloc(sizeof(*mu));
5128 if (posix_memalign(&mu->space, 512, sizeof(struct vcl)) != 0) {
5129 free(mu);
5130 mu = NULL;
5131 }
5132
5133 mu->len = ddf->conf_rec_len * 512 * vcl->conf.sec_elmnt_count;
5134 mu->buf = xmalloc(mu->len);
5135 mu->space = NULL;
5136 mu->space_list = NULL;
5137 mu->next = *updates;
5138 memcpy(mu->buf, &vcl->conf, ddf->conf_rec_len * 512);
5139 for (j = 1; j < vcl->conf.sec_elmnt_count; j++)
5140 memcpy(mu->buf + j * ddf->conf_rec_len * 512,
5141 vcl->other_bvds[j-1], ddf->conf_rec_len * 512);
5142
5143 vc = (struct vd_config*)mu->buf;
5144 for (di = rv ; di ; di = di->next) {
5145 unsigned int i_sec, i_prim;
5146 i_sec = di->disk.raid_disk
5147 / be16_to_cpu(vcl->conf.prim_elmnt_count);
5148 i_prim = di->disk.raid_disk
5149 % be16_to_cpu(vcl->conf.prim_elmnt_count);
5150 vc = (struct vd_config *)(mu->buf
5151 + i_sec * ddf->conf_rec_len * 512);
5152 for (dl = ddf->dlist; dl; dl = dl->next)
5153 if (dl->major == di->disk.major &&
5154 dl->minor == di->disk.minor)
5155 break;
5156 if (!dl || dl->pdnum < 0) {
5157 pr_err("BUG: can't find disk %d (%d/%d)\n",
5158 di->disk.raid_disk,
5159 di->disk.major, di->disk.minor);
5160 return NULL;
5161 }
5162 vc->phys_refnum[i_prim] = ddf->phys->entries[dl->pdnum].refnum;
5163 LBA_OFFSET(ddf, vc)[i_prim] = cpu_to_be64(di->data_offset);
5164 dprintf("BVD %u gets %u: %08x at %llu\n", i_sec, i_prim,
5165 be32_to_cpu(vc->phys_refnum[i_prim]),
5166 be64_to_cpu(LBA_OFFSET(ddf, vc)[i_prim]));
5167 }
5168 *updates = mu;
5169 return rv;
5170 }
5171
5172 static int ddf_level_to_layout(int level)
5173 {
5174 switch(level) {
5175 case 0:
5176 case 1:
5177 return 0;
5178 case 5:
5179 return ALGORITHM_LEFT_SYMMETRIC;
5180 case 6:
5181 return ALGORITHM_ROTATING_N_CONTINUE;
5182 case 10:
5183 return 0x102;
5184 default:
5185 return UnSet;
5186 }
5187 }
5188
5189 static void default_geometry_ddf(struct supertype *st, int *level, int *layout, int *chunk)
5190 {
5191 if (level && *level == UnSet)
5192 *level = LEVEL_CONTAINER;
5193
5194 if (level && layout && *layout == UnSet)
5195 *layout = ddf_level_to_layout(*level);
5196 }
5197
5198 struct superswitch super_ddf = {
5199 .examine_super = examine_super_ddf,
5200 .brief_examine_super = brief_examine_super_ddf,
5201 .brief_examine_subarrays = brief_examine_subarrays_ddf,
5202 .export_examine_super = export_examine_super_ddf,
5203 .detail_super = detail_super_ddf,
5204 .brief_detail_super = brief_detail_super_ddf,
5205 .validate_geometry = validate_geometry_ddf,
5206 .write_init_super = write_init_super_ddf,
5207 .add_to_super = add_to_super_ddf,
5208 .remove_from_super = remove_from_super_ddf,
5209 .load_container = load_container_ddf,
5210 .copy_metadata = copy_metadata_ddf,
5211 .kill_subarray = kill_subarray_ddf,
5212 .match_home = match_home_ddf,
5213 .uuid_from_super= uuid_from_super_ddf,
5214 .getinfo_super = getinfo_super_ddf,
5215 .update_super = update_super_ddf,
5216
5217 .avail_size = avail_size_ddf,
5218
5219 .compare_super = compare_super_ddf,
5220
5221 .load_super = load_super_ddf,
5222 .init_super = init_super_ddf,
5223 .store_super = store_super_ddf,
5224 .free_super = free_super_ddf,
5225 .match_metadata_desc = match_metadata_desc_ddf,
5226 .container_content = container_content_ddf,
5227 .default_geometry = default_geometry_ddf,
5228
5229 .external = 1,
5230
5231 /* for mdmon */
5232 .open_new = ddf_open_new,
5233 .set_array_state= ddf_set_array_state,
5234 .set_disk = ddf_set_disk,
5235 .sync_metadata = ddf_sync_metadata,
5236 .process_update = ddf_process_update,
5237 .prepare_update = ddf_prepare_update,
5238 .activate_spare = ddf_activate_spare,
5239 .name = "ddf",
5240 };
Unnamed repository; edit this file 'description' to name the repository.