2 * mdadm - manage Linux "md" devices aka RAID arrays.
4 * Copyright (C) 2006-2009 Neil Brown <neilb@suse.de>
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.
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.
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
22 * Email: <neilb@suse.de>
28 /* To restripe, we read from old geometry to a buffer, and
29 * read from buffer to new geometry.
30 * When reading, we might have missing devices and so could need
32 * When writing, we need to create correct parity and Q.
36 int geo_map(int block
, unsigned long long stripe
, int raid_disks
,
37 int level
, int layout
)
39 /* On the given stripe, find which disk in the array will have
40 * block numbered 'block'.
41 * '-1' means the parity block.
42 * '-2' means the Q syndrome.
46 /* layout is not relevant for raid0 and raid4 */
51 switch(level
*100 + layout
) {
54 case 500 + ALGORITHM_PARITY_N
:
55 /* raid 4 isn't messed around by parity blocks */
57 return raid_disks
-1; /* parity block */
59 case 500 + ALGORITHM_LEFT_ASYMMETRIC
:
60 pd
= (raid_disks
-1) - stripe
% raid_disks
;
61 if (block
== -1) return pd
;
66 case 500 + ALGORITHM_RIGHT_ASYMMETRIC
:
67 pd
= stripe
% raid_disks
;
68 if (block
== -1) return pd
;
73 case 500 + ALGORITHM_LEFT_SYMMETRIC
:
74 pd
= (raid_disks
- 1) - stripe
% raid_disks
;
75 if (block
== -1) return pd
;
76 return (pd
+ 1 + block
) % raid_disks
;
78 case 500 + ALGORITHM_RIGHT_SYMMETRIC
:
79 pd
= stripe
% raid_disks
;
80 if (block
== -1) return pd
;
81 return (pd
+ 1 + block
) % raid_disks
;
83 case 500 + ALGORITHM_PARITY_0
:
86 case 600 + ALGORITHM_PARITY_N_6
:
88 return raid_disks
- 1;
90 return raid_disks
- 2; /* parity block */
92 case 600 + ALGORITHM_LEFT_ASYMMETRIC_6
:
94 return raid_disks
- 1;
96 pd
= (raid_disks
-1) - stripe
% raid_disks
;
97 if (block
== -1) return pd
;
102 case 600 + ALGORITHM_RIGHT_ASYMMETRIC_6
:
104 return raid_disks
- 1;
106 pd
= stripe
% raid_disks
;
107 if (block
== -1) return pd
;
112 case 600 + ALGORITHM_LEFT_SYMMETRIC_6
:
114 return raid_disks
- 1;
116 pd
= (raid_disks
- 1) - stripe
% raid_disks
;
117 if (block
== -1) return pd
;
118 return (pd
+ 1 + block
) % raid_disks
;
120 case 600 + ALGORITHM_RIGHT_SYMMETRIC_6
:
122 return raid_disks
- 1;
124 pd
= stripe
% raid_disks
;
125 if (block
== -1) return pd
;
126 return (pd
+ 1 + block
) % raid_disks
;
128 case 600 + ALGORITHM_PARITY_0_6
:
130 return raid_disks
- 1;
133 case 600 + ALGORITHM_PARITY_0
:
140 case 600 + ALGORITHM_LEFT_ASYMMETRIC
:
141 pd
= raid_disks
- 1 - (stripe
% raid_disks
);
142 if (block
== -1) return pd
;
143 if (block
== -2) return (pd
+1) % raid_disks
;
144 if (pd
== raid_disks
- 1)
150 case 600 + ALGORITHM_ROTATING_ZERO_RESTART
:
151 /* Different order for calculating Q, otherwize same as ... */
152 case 600 + ALGORITHM_RIGHT_ASYMMETRIC
:
153 pd
= stripe
% raid_disks
;
154 if (block
== -1) return pd
;
155 if (block
== -2) return (pd
+1) % raid_disks
;
156 if (pd
== raid_disks
- 1)
162 case 600 + ALGORITHM_LEFT_SYMMETRIC
:
163 pd
= raid_disks
- 1 - (stripe
% raid_disks
);
164 if (block
== -1) return pd
;
165 if (block
== -2) return (pd
+1) % raid_disks
;
166 return (pd
+ 2 + block
) % raid_disks
;
168 case 600 + ALGORITHM_RIGHT_SYMMETRIC
:
169 pd
= stripe
% raid_disks
;
170 if (block
== -1) return pd
;
171 if (block
== -2) return (pd
+1) % raid_disks
;
172 return (pd
+ 2 + block
) % raid_disks
;
174 case 600 + ALGORITHM_ROTATING_N_RESTART
:
175 /* Same a left_asymmetric, by first stripe is
176 * D D D P Q rather than
179 pd
= raid_disks
- 1 - ((stripe
+ 1) % raid_disks
);
180 if (block
== -1) return pd
;
181 if (block
== -2) return (pd
+1) % raid_disks
;
182 if (pd
== raid_disks
- 1)
188 case 600 + ALGORITHM_ROTATING_N_CONTINUE
:
189 /* Same as left_symmetric but Q is before P */
190 pd
= raid_disks
- 1 - (stripe
% raid_disks
);
191 if (block
== -1) return pd
;
192 if (block
== -2) return (pd
+raid_disks
-1) % raid_disks
;
193 return (pd
+ 1 + block
) % raid_disks
;
198 int is_ddf(int layout
)
204 case ALGORITHM_ROTATING_N_CONTINUE
:
205 case ALGORITHM_ROTATING_N_RESTART
:
206 case ALGORITHM_ROTATING_ZERO_RESTART
:
211 void xor_blocks(char *target
, char **sources
, int disks
, int size
)
214 /* Amazingly inefficient... */
215 for (i
=0; i
<size
; i
++) {
217 for (j
=0 ; j
<disks
; j
++)
223 void qsyndrome(uint8_t *p
, uint8_t *q
, uint8_t **sources
, int disks
, int size
)
226 uint8_t wq0
, wp0
, wd0
, w10
, w20
;
227 for ( d
= 0; d
< size
; d
++) {
228 wq0
= wp0
= sources
[disks
-1][d
];
229 for ( z
= disks
-2 ; z
>= 0 ; z
-- ) {
232 w20
= (wq0
&0x80) ? 0xff : 0x00;
233 w10
= (wq0
<< 1) & 0xff;
244 * The following was taken from linux/drivers/md/mktables.c, and modified
245 * to create in-memory tables rather than C code
247 static uint8_t gfmul(uint8_t a
, uint8_t b
)
254 a
= (a
<< 1) ^ (a
& 0x80 ? 0x1d : 0);
261 static uint8_t gfpow(uint8_t a
, int b
)
279 int tables_ready
= 0;
280 uint8_t raid6_gfmul
[256][256];
281 uint8_t raid6_gfexp
[256];
282 uint8_t raid6_gfinv
[256];
283 uint8_t raid6_gfexi
[256];
284 uint8_t raid6_gflog
[256];
285 uint8_t raid6_gfilog
[256];
286 void make_tables(void)
292 /* Compute multiplication table */
293 for (i
= 0; i
< 256; i
++)
294 for (j
= 0; j
< 256; j
++)
295 raid6_gfmul
[i
][j
] = gfmul(i
, j
);
297 /* Compute power-of-2 table (exponent) */
299 for (i
= 0; i
< 256; i
++) {
303 v
= 0; /* For entry 255, not a real entry */
306 /* Compute inverse table x^-1 == x^254 */
307 for (i
= 0; i
< 256; i
++)
308 raid6_gfinv
[i
] = gfpow(i
, 254);
310 /* Compute inv(2^x + 1) (exponent-xor-inverse) table */
311 for (i
= 0; i
< 256; i
++)
312 raid6_gfexi
[i
] = raid6_gfinv
[raid6_gfexp
[i
] ^ 1];
314 /* Compute log and inverse log */
315 /* Modified code from:
316 * http://web.eecs.utk.edu/~plank/plank/papers/CS-96-332.html
320 raid6_gfilog
[255] = 0;
322 for (log
= 0; log
< 255; log
++) {
323 raid6_gflog
[b
] = (uint8_t) log
;
324 raid6_gfilog
[log
] = (uint8_t) b
;
326 if (b
& 256) b
= b
^ 0435;
335 void ensure_zero_has_size(int chunk_size
)
337 if (zero
== NULL
|| chunk_size
> zero_size
) {
340 zero
= xcalloc(1, chunk_size
);
341 zero_size
= chunk_size
;
345 /* Following was taken from linux/drivers/md/raid6recov.c */
347 /* Recover two failed data blocks. */
348 void raid6_2data_recov(int disks
, size_t bytes
, int faila
, int failb
,
351 uint8_t *p
, *q
, *dp
, *dq
;
353 const uint8_t *pbmul
; /* P multiplier table for B data */
354 const uint8_t *qmul
; /* Q multiplier table (for both) */
359 /* Compute syndrome with zero for the missing data pages
360 Use the dead data pages as temporary storage for
361 delta p and delta q */
367 qsyndrome(dp
, dq
, ptrs
, disks
-2, bytes
);
369 /* Restore pointer table */
373 /* Now, pick the proper data tables */
374 pbmul
= raid6_gfmul
[raid6_gfexi
[failb
-faila
]];
375 qmul
= raid6_gfmul
[raid6_gfinv
[raid6_gfexp
[faila
]^raid6_gfexp
[failb
]]];
381 *dq
++ = db
= pbmul
[px
] ^ qx
; /* Reconstructed B */
382 *dp
++ = db
^ px
; /* Reconstructed A */
387 /* Recover failure of one data block plus the P block */
388 void raid6_datap_recov(int disks
, size_t bytes
, int faila
, uint8_t **ptrs
)
391 const uint8_t *qmul
; /* Q multiplier table */
396 /* Compute syndrome with zero for the missing data page
397 Use the dead data page as temporary storage for delta q */
401 qsyndrome(p
, dq
, ptrs
, disks
-2, bytes
);
403 /* Restore pointer table */
406 /* Now, pick the proper data tables */
407 qmul
= raid6_gfmul
[raid6_gfinv
[raid6_gfexp
[faila
]]];
411 *p
++ ^= *dq
= qmul
[*q
^ *dq
];
416 /* Try to find out if a specific disk has a problem */
417 int raid6_check_disks(int data_disks
, int start
, int chunk_size
,
418 int level
, int layout
, int diskP
, int diskQ
,
419 char *p
, char *q
, char **stripes
)
424 int curr_broken_disk
= -1;
425 int prev_broken_disk
= -1;
426 int broken_status
= 0;
428 for(i
= 0; i
< chunk_size
; i
++) {
429 Px
= (uint8_t)stripes
[diskP
][i
] ^ (uint8_t)p
[i
];
430 Qx
= (uint8_t)stripes
[diskQ
][i
] ^ (uint8_t)q
[i
];
432 if((Px
!= 0) && (Qx
== 0))
433 curr_broken_disk
= diskP
;
435 if((Px
== 0) && (Qx
!= 0))
436 curr_broken_disk
= diskQ
;
438 if((Px
!= 0) && (Qx
!= 0)) {
439 data_id
= (raid6_gflog
[Qx
] - raid6_gflog
[Px
]);
440 if(data_id
< 0) data_id
+= 255;
441 diskD
= geo_map(data_id
, start
/chunk_size
,
442 data_disks
+ 2, level
, layout
);
443 curr_broken_disk
= diskD
;
446 if((Px
== 0) && (Qx
== 0))
447 curr_broken_disk
= curr_broken_disk
;
449 if(curr_broken_disk
>= data_disks
+ 2)
452 switch(broken_status
) {
454 if(curr_broken_disk
!= -1) {
455 prev_broken_disk
= curr_broken_disk
;
461 if(curr_broken_disk
!= prev_broken_disk
)
467 curr_broken_disk
= prev_broken_disk
= -2;
472 return curr_broken_disk
;
475 /*******************************************************************************
476 * Function: save_stripes
478 * Function reads data (only data without P and Q) from array and writes
479 * it to buf and opcjonaly to backup files
481 * source : A list of 'fds' of the active disks.
483 * offsets : A list of offsets on disk belonging
484 * to the array [bytes]
485 * raid_disks : geometry: number of disks in the array
486 * chunk_size : geometry: chunk size [bytes]
487 * level : geometry: RAID level
488 * layout : geometry: layout
489 * nwrites : number of backup files
490 * dest : A list of 'fds' for mirrored targets
491 * (e.g. backup files). They are already seeked to right
492 * (write) location. If NULL, data will be wrote
494 * start : start address of data to read (must be stripe-aligned)
496 * length - : length of data to read (must be stripe-aligned)
498 * buf : buffer for data. It is large enough to hold
499 * one stripe. It is stripe aligned
503 ******************************************************************************/
504 int save_stripes(int *source
, unsigned long long *offsets
,
505 int raid_disks
, int chunk_size
, int level
, int layout
,
506 int nwrites
, int *dest
,
507 unsigned long long start
, unsigned long long length
,
511 int data_disks
= raid_disks
- (level
== 0 ? 0 : level
<=5 ? 1 : 2);
514 unsigned long long length_test
;
518 ensure_zero_has_size(chunk_size
);
520 len
= data_disks
* chunk_size
;
521 length_test
= length
/ len
;
524 if (length
!= length_test
) {
525 dprintf("Error: save_stripes(): Data are not alligned. EXIT\n");
526 dprintf("\tArea for saving stripes (length) = %llu\n", length
);
527 dprintf("\tWork step (len) = %i\n", len
);
528 dprintf("\tExpected save area (length_test) = %llu\n",
535 int fdisk
[3], fblock
[3];
536 for (disk
= 0; disk
< raid_disks
; disk
++) {
537 unsigned long long offset
;
540 offset
= (start
/chunk_size
/data_disks
)*chunk_size
;
541 dnum
= geo_map(disk
< data_disks
? disk
: data_disks
- disk
- 1,
542 start
/chunk_size
/data_disks
,
543 raid_disks
, level
, layout
);
544 if (dnum
< 0) abort();
545 if (source
[dnum
] < 0 ||
546 lseek64(source
[dnum
], offsets
[dnum
]+offset
, 0) < 0 ||
547 read(source
[dnum
], buf
+disk
* chunk_size
, chunk_size
)
550 fdisk
[failed
] = dnum
;
551 fblock
[failed
] = disk
;
555 if (failed
== 0 || fblock
[0] >= data_disks
)
556 /* all data disks are good */
558 else if (failed
== 1 || fblock
[1] >= data_disks
+1) {
559 /* one failed data disk and good parity */
560 char *bufs
[data_disks
];
561 for (i
=0; i
< data_disks
; i
++)
563 bufs
[i
] = buf
+ data_disks
*chunk_size
;
565 bufs
[i
] = buf
+ i
*chunk_size
;
567 xor_blocks(buf
+ fblock
[0]*chunk_size
,
568 bufs
, data_disks
, chunk_size
);
569 } else if (failed
> 2 || level
!= 6)
570 /* too much failure */
573 /* RAID6 computations needed. */
574 uint8_t *bufs
[data_disks
+4];
577 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
578 raid_disks
, level
, layout
);
579 qdisk
= geo_map(-2, start
/chunk_size
/data_disks
,
580 raid_disks
, level
, layout
);
581 if (is_ddf(layout
)) {
582 /* q over 'raid_disks' blocks, in device order.
583 * 'p' and 'q' get to be all zero
585 for (i
= 0; i
< raid_disks
; i
++)
587 for (i
= 0; i
< data_disks
; i
++) {
588 int dnum
= geo_map(i
,
589 start
/chunk_size
/data_disks
,
590 raid_disks
, level
, layout
);
592 /* i is the logical block number, so is index to 'buf'.
593 * dnum is physical disk number
594 * and thus the syndrome number.
597 bufs
[snum
] = (uint8_t*)buf
+ chunk_size
* i
;
599 syndrome_disks
= raid_disks
;
601 /* for md, q is over 'data_disks' blocks,
602 * starting immediately after 'q'
603 * Note that for the '_6' variety, the p block
604 * makes a hole that we need to be careful of.
608 for (j
= 0; j
< raid_disks
; j
++) {
609 int dnum
= (qdisk
+ 1 + j
) % raid_disks
;
610 if (dnum
== disk
|| dnum
== qdisk
)
612 for (i
= 0; i
< data_disks
; i
++)
614 start
/chunk_size
/data_disks
,
615 raid_disks
, level
, layout
) == dnum
)
617 /* i is the logical block number, so is index to 'buf'.
618 * dnum is physical disk number
619 * snum is syndrome disk for which 0 is immediately after Q
621 bufs
[snum
] = (uint8_t*)buf
+ chunk_size
* i
;
630 syndrome_disks
= data_disks
;
633 /* Place P and Q blocks at end of bufs */
634 bufs
[syndrome_disks
] = (uint8_t*)buf
+ chunk_size
* data_disks
;
635 bufs
[syndrome_disks
+1] = (uint8_t*)buf
+ chunk_size
* (data_disks
+1);
637 if (fblock
[1] == data_disks
)
638 /* One data failed, and parity failed */
639 raid6_datap_recov(syndrome_disks
+2, chunk_size
,
642 if (fdisk
[0] > fdisk
[1]) {
647 /* Two data blocks failed, P,Q OK */
648 raid6_2data_recov(syndrome_disks
+2, chunk_size
,
649 fdisk
[0], fdisk
[1], bufs
);
653 for (i
= 0; i
< nwrites
; i
++)
654 if (write(dest
[i
], buf
, len
) != len
)
657 /* build next stripe in buffer */
668 * A list of 'fds' of the active disks. Some may be '-1' for not-available.
669 * A geometry: raid_disks, chunk_size, level, layout
670 * An 'fd' to read from. It is already seeked to the right (Read) location.
671 * A start and length.
672 * The length must be a multiple of the stripe size.
674 * We build a full stripe in memory and then write it out.
675 * We assume that there are enough working devices.
677 int restore_stripes(int *dest
, unsigned long long *offsets
,
678 int raid_disks
, int chunk_size
, int level
, int layout
,
679 int source
, unsigned long long read_offset
,
680 unsigned long long start
, unsigned long long length
,
684 char **stripes
= xmalloc(raid_disks
* sizeof(char*));
685 char **blocks
= xmalloc(raid_disks
* sizeof(char*));
689 int data_disks
= raid_disks
- (level
== 0 ? 0 : level
<= 5 ? 1 : 2);
691 if (posix_memalign((void**)&stripe_buf
, 4096, raid_disks
* chunk_size
))
694 if (zero
== NULL
|| chunk_size
> zero_size
) {
697 zero
= xcalloc(1, chunk_size
);
698 zero_size
= chunk_size
;
701 if (stripe_buf
== NULL
|| stripes
== NULL
|| blocks
== NULL
706 for (i
= 0; i
< raid_disks
; i
++)
707 stripes
[i
] = stripe_buf
+ i
* chunk_size
;
709 unsigned int len
= data_disks
* chunk_size
;
710 unsigned long long offset
;
717 for (i
= 0; i
< data_disks
; i
++) {
718 int disk
= geo_map(i
, start
/chunk_size
/data_disks
,
719 raid_disks
, level
, layout
);
720 if (src_buf
== NULL
) {
722 if (lseek64(source
, read_offset
, 0) !=
723 (off64_t
)read_offset
) {
729 chunk_size
) != chunk_size
) {
734 /* read from input buffer */
735 memcpy(stripes
[disk
],
736 src_buf
+ read_offset
,
739 read_offset
+= chunk_size
;
741 /* We have the data, now do the parity */
742 offset
= (start
/chunk_size
/data_disks
) * chunk_size
;
746 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
747 raid_disks
, level
, layout
);
748 for (i
= 0; i
< data_disks
; i
++)
749 blocks
[i
] = stripes
[(disk
+1+i
) % raid_disks
];
750 xor_blocks(stripes
[disk
], blocks
, data_disks
, chunk_size
);
753 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
754 raid_disks
, level
, layout
);
755 qdisk
= geo_map(-2, start
/chunk_size
/data_disks
,
756 raid_disks
, level
, layout
);
757 if (is_ddf(layout
)) {
758 /* q over 'raid_disks' blocks, in device order.
759 * 'p' and 'q' get to be all zero
761 for (i
= 0; i
< raid_disks
; i
++)
762 if (i
== disk
|| i
== qdisk
)
763 blocks
[i
] = (char*)zero
;
765 blocks
[i
] = stripes
[i
];
766 syndrome_disks
= raid_disks
;
768 /* for md, q is over 'data_disks' blocks,
769 * starting immediately after 'q'
771 for (i
= 0; i
< data_disks
; i
++)
772 blocks
[i
] = stripes
[(qdisk
+1+i
) % raid_disks
];
774 syndrome_disks
= data_disks
;
776 qsyndrome((uint8_t*)stripes
[disk
],
777 (uint8_t*)stripes
[qdisk
],
779 syndrome_disks
, chunk_size
);
782 for (i
=0; i
< raid_disks
; i
++)
785 offsets
[i
]+offset
, 0) < 0) {
789 if (write(dest
[i
], stripes
[i
],
790 chunk_size
) != chunk_size
) {
809 int test_stripes(int *source
, unsigned long long *offsets
,
810 int raid_disks
, int chunk_size
, int level
, int layout
,
811 unsigned long long start
, unsigned long long length
)
813 /* ready the data and p (and q) blocks, and check we got them right */
814 char *stripe_buf
= xmalloc(raid_disks
* chunk_size
);
815 char **stripes
= xmalloc(raid_disks
* sizeof(char*));
816 char **blocks
= xmalloc(raid_disks
* sizeof(char*));
817 char *p
= xmalloc(chunk_size
);
818 char *q
= xmalloc(chunk_size
);
822 int data_disks
= raid_disks
- (level
== 5 ? 1: 2);
827 for ( i
= 0 ; i
< raid_disks
; i
++)
828 stripes
[i
] = stripe_buf
+ i
* chunk_size
;
833 for (i
= 0 ; i
< raid_disks
; i
++) {
834 lseek64(source
[i
], offsets
[i
]+start
, 0);
835 read(source
[i
], stripes
[i
], chunk_size
);
837 for (i
= 0 ; i
< data_disks
; i
++) {
838 int disk
= geo_map(i
, start
/chunk_size
, raid_disks
,
840 blocks
[i
] = stripes
[disk
];
841 printf("%d->%d\n", i
, disk
);
845 qsyndrome(p
, q
, (uint8_t**)blocks
, data_disks
, chunk_size
);
846 diskP
= geo_map(-1, start
/chunk_size
, raid_disks
,
848 if (memcmp(p
, stripes
[diskP
], chunk_size
) != 0) {
849 printf("P(%d) wrong at %llu\n", diskP
,
852 diskQ
= geo_map(-2, start
/chunk_size
, raid_disks
,
854 if (memcmp(q
, stripes
[diskQ
], chunk_size
) != 0) {
855 printf("Q(%d) wrong at %llu\n", diskQ
,
858 disk
= raid6_check_disks(data_disks
, start
, chunk_size
,
859 level
, layout
, diskP
, diskQ
,
862 printf("Possible failed disk: %d\n", disk
);
865 printf("Failure detected, but disk unknown\n");
869 length
-= chunk_size
;
875 unsigned long long getnum(char *str
, char **err
)
878 unsigned long long rv
= strtoull(str
, &e
, 10);
886 char const Name
[] = "test_restripe";
887 int main(int argc
, char *argv
[])
889 /* save/restore file raid_disks chunk_size level layout start length devices...
896 unsigned long long *offsets
;
897 int raid_disks
, chunk_size
, level
, layout
;
898 unsigned long long start
, length
;
903 fprintf(stderr
, "Usage: test_stripe save/restore file raid_disks chunk_size level layout start length devices...\n");
906 if (strcmp(argv
[1], "save")==0)
908 else if (strcmp(argv
[1], "restore") == 0)
910 else if (strcmp(argv
[1], "test") == 0)
913 fprintf(stderr
, "test_stripe: must give 'save' or 'restore'.\n");
918 raid_disks
= getnum(argv
[3], &err
);
919 chunk_size
= getnum(argv
[4], &err
);
920 level
= getnum(argv
[5], &err
);
921 layout
= getnum(argv
[6], &err
);
922 start
= getnum(argv
[7], &err
);
923 length
= getnum(argv
[8], &err
);
925 fprintf(stderr
, "test_stripe: Bad number: %s\n", err
);
928 if (argc
!= raid_disks
+ 9) {
929 fprintf(stderr
, "test_stripe: wrong number of devices: want %d found %d\n",
933 fds
= xmalloc(raid_disks
* sizeof(*fds
));
934 offsets
= xcalloc(raid_disks
, sizeof(*offsets
));
936 storefd
= open(file
, O_RDWR
);
939 fprintf(stderr
, "test_stripe: could not open %s.\n", file
);
942 for (i
=0; i
<raid_disks
; i
++) {
944 p
= strchr(argv
[9+i
], ':');
948 offsets
[i
] = atoll(p
) * 512;
951 fds
[i
] = open(argv
[9+i
], O_RDWR
);
954 fprintf(stderr
,"test_stripe: cannot open %s.\n", argv
[9+i
]);
959 buf
= xmalloc(raid_disks
* chunk_size
);
962 int rv
= save_stripes(fds
, offsets
,
963 raid_disks
, chunk_size
, level
, layout
,
968 "test_stripe: save_stripes returned %d\n", rv
);
971 } else if (save
== 2) {
972 int rv
= test_stripes(fds
, offsets
,
973 raid_disks
, chunk_size
, level
, layout
,
977 "test_stripe: test_stripes returned %d\n", rv
);
981 int rv
= restore_stripes(fds
, offsets
,
982 raid_disks
, chunk_size
, level
, layout
,
984 start
, length
, NULL
);
987 "test_stripe: restore_stripes returned %d\n",