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
:
87 case 600 + ALGORITHM_PARITY_N_6
:
89 return raid_disks
- 1;
91 return raid_disks
- 2; /* parity block */
93 case 600 + ALGORITHM_LEFT_ASYMMETRIC_6
:
95 return raid_disks
- 1;
97 pd
= (raid_disks
-1) - stripe
% raid_disks
;
98 if (block
== -1) return pd
;
103 case 600 + ALGORITHM_RIGHT_ASYMMETRIC_6
:
105 return raid_disks
- 1;
107 pd
= stripe
% raid_disks
;
108 if (block
== -1) return pd
;
113 case 600 + ALGORITHM_LEFT_SYMMETRIC_6
:
115 return raid_disks
- 1;
117 pd
= (raid_disks
- 1) - stripe
% raid_disks
;
118 if (block
== -1) return pd
;
119 return (pd
+ 1 + block
) % raid_disks
;
121 case 600 + ALGORITHM_RIGHT_SYMMETRIC_6
:
123 return raid_disks
- 1;
125 pd
= stripe
% raid_disks
;
126 if (block
== -1) return pd
;
127 return (pd
+ 1 + block
) % raid_disks
;
129 case 600 + ALGORITHM_PARITY_0_6
:
131 return raid_disks
- 1;
135 case 600 + ALGORITHM_PARITY_0
:
142 case 600 + ALGORITHM_LEFT_ASYMMETRIC
:
143 pd
= raid_disks
- 1 - (stripe
% raid_disks
);
144 if (block
== -1) return pd
;
145 if (block
== -2) return (pd
+1) % raid_disks
;
146 if (pd
== raid_disks
- 1)
152 case 600 + ALGORITHM_ROTATING_ZERO_RESTART
:
153 /* Different order for calculating Q, otherwize same as ... */
154 case 600 + ALGORITHM_RIGHT_ASYMMETRIC
:
155 pd
= stripe
% raid_disks
;
156 if (block
== -1) return pd
;
157 if (block
== -2) return (pd
+1) % raid_disks
;
158 if (pd
== raid_disks
- 1)
164 case 600 + ALGORITHM_LEFT_SYMMETRIC
:
165 pd
= raid_disks
- 1 - (stripe
% raid_disks
);
166 if (block
== -1) return pd
;
167 if (block
== -2) return (pd
+1) % raid_disks
;
168 return (pd
+ 2 + block
) % raid_disks
;
170 case 600 + ALGORITHM_RIGHT_SYMMETRIC
:
171 pd
= stripe
% raid_disks
;
172 if (block
== -1) return pd
;
173 if (block
== -2) return (pd
+1) % raid_disks
;
174 return (pd
+ 2 + block
) % raid_disks
;
177 case 600 + ALGORITHM_ROTATING_N_RESTART
:
178 /* Same a left_asymmetric, by first stripe is
179 * D D D P Q rather than
182 pd
= raid_disks
- 1 - ((stripe
+ 1) % raid_disks
);
183 if (block
== -1) return pd
;
184 if (block
== -2) return (pd
+1) % raid_disks
;
185 if (pd
== raid_disks
- 1)
191 case 600 + ALGORITHM_ROTATING_N_CONTINUE
:
192 /* Same as left_symmetric but Q is before P */
193 pd
= raid_disks
- 1 - (stripe
% raid_disks
);
194 if (block
== -1) return pd
;
195 if (block
== -2) return (pd
+raid_disks
-1) % raid_disks
;
196 return (pd
+ 1 + block
) % raid_disks
;
200 static int is_ddf(int layout
)
206 case ALGORITHM_ROTATING_N_CONTINUE
:
207 case ALGORITHM_ROTATING_N_RESTART
:
208 case ALGORITHM_ROTATING_ZERO_RESTART
:
214 void xor_blocks(char *target
, char **sources
, int disks
, int size
)
217 /* Amazingly inefficient... */
218 for (i
=0; i
<size
; i
++) {
220 for (j
=0 ; j
<disks
; j
++)
226 void qsyndrome(uint8_t *p
, uint8_t *q
, uint8_t **sources
, int disks
, int size
)
229 uint8_t wq0
, wp0
, wd0
, w10
, w20
;
230 for ( d
= 0; d
< size
; d
++) {
231 wq0
= wp0
= sources
[disks
-1][d
];
232 for ( z
= disks
-2 ; z
>= 0 ; z
-- ) {
235 w20
= (wq0
&0x80) ? 0xff : 0x00;
236 w10
= (wq0
<< 1) & 0xff;
248 * The following was taken from linux/drivers/md/mktables.c, and modified
249 * to create in-memory tables rather than C code
251 static uint8_t gfmul(uint8_t a
, uint8_t b
)
258 a
= (a
<< 1) ^ (a
& 0x80 ? 0x1d : 0);
265 static uint8_t gfpow(uint8_t a
, int b
)
283 int tables_ready
= 0;
284 uint8_t raid6_gfmul
[256][256];
285 uint8_t raid6_gfexp
[256];
286 uint8_t raid6_gfinv
[256];
287 uint8_t raid6_gfexi
[256];
288 uint8_t raid6_gflog
[256];
289 uint8_t raid6_gfilog
[256];
290 void make_tables(void)
296 /* Compute multiplication table */
297 for (i
= 0; i
< 256; i
++)
298 for (j
= 0; j
< 256; j
++)
299 raid6_gfmul
[i
][j
] = gfmul(i
, j
);
301 /* Compute power-of-2 table (exponent) */
303 for (i
= 0; i
< 256; i
++) {
307 v
= 0; /* For entry 255, not a real entry */
310 /* Compute inverse table x^-1 == x^254 */
311 for (i
= 0; i
< 256; i
++)
312 raid6_gfinv
[i
] = gfpow(i
, 254);
314 /* Compute inv(2^x + 1) (exponent-xor-inverse) table */
315 for (i
= 0; i
< 256; i
++)
316 raid6_gfexi
[i
] = raid6_gfinv
[raid6_gfexp
[i
] ^ 1];
318 /* Compute log and inverse log */
319 /* Modified code from:
320 * http://web.eecs.utk.edu/~plank/plank/papers/CS-96-332.html
324 raid6_gfilog
[255] = 0;
326 for (log
= 0; log
< 255; log
++) {
327 raid6_gflog
[b
] = (uint8_t) log
;
328 raid6_gfilog
[log
] = (uint8_t) b
;
330 if (b
& 256) b
= b
^ 0435;
339 void ensure_zero_has_size(int chunk_size
)
341 if (zero
== NULL
|| chunk_size
> zero_size
) {
344 zero
= xcalloc(1, chunk_size
);
345 zero_size
= chunk_size
;
349 /* Following was taken from linux/drivers/md/raid6recov.c */
351 /* Recover two failed data blocks. */
352 void raid6_2data_recov(int disks
, size_t bytes
, int faila
, int failb
,
355 uint8_t *p
, *q
, *dp
, *dq
;
357 const uint8_t *pbmul
; /* P multiplier table for B data */
358 const uint8_t *qmul
; /* Q multiplier table (for both) */
363 /* Compute syndrome with zero for the missing data pages
364 Use the dead data pages as temporary storage for
365 delta p and delta q */
371 qsyndrome(dp
, dq
, ptrs
, disks
-2, bytes
);
373 /* Restore pointer table */
377 /* Now, pick the proper data tables */
378 pbmul
= raid6_gfmul
[raid6_gfexi
[failb
-faila
]];
379 qmul
= raid6_gfmul
[raid6_gfinv
[raid6_gfexp
[faila
]^raid6_gfexp
[failb
]]];
385 *dq
++ = db
= pbmul
[px
] ^ qx
; /* Reconstructed B */
386 *dp
++ = db
^ px
; /* Reconstructed A */
391 /* Recover failure of one data block plus the P block */
392 void raid6_datap_recov(int disks
, size_t bytes
, int faila
, uint8_t **ptrs
)
395 const uint8_t *qmul
; /* Q multiplier table */
400 /* Compute syndrome with zero for the missing data page
401 Use the dead data page as temporary storage for delta q */
405 qsyndrome(p
, dq
, ptrs
, disks
-2, bytes
);
407 /* Restore pointer table */
410 /* Now, pick the proper data tables */
411 qmul
= raid6_gfmul
[raid6_gfinv
[raid6_gfexp
[faila
]]];
415 *p
++ ^= *dq
= qmul
[*q
^ *dq
];
420 /* Try to find out if a specific disk has a problem */
421 int raid6_check_disks(int data_disks
, int start
, int chunk_size
,
422 int level
, int layout
, int diskP
, int diskQ
,
423 char *p
, char *q
, char **stripes
)
428 int curr_broken_disk
= -1;
429 int prev_broken_disk
= -1;
430 int broken_status
= 0;
432 for(i
= 0; i
< chunk_size
; i
++) {
433 Px
= (uint8_t)stripes
[diskP
][i
] ^ (uint8_t)p
[i
];
434 Qx
= (uint8_t)stripes
[diskQ
][i
] ^ (uint8_t)q
[i
];
436 if((Px
!= 0) && (Qx
== 0))
437 curr_broken_disk
= diskP
;
440 if((Px
== 0) && (Qx
!= 0))
441 curr_broken_disk
= diskQ
;
444 if((Px
!= 0) && (Qx
!= 0)) {
445 data_id
= (raid6_gflog
[Qx
] - raid6_gflog
[Px
]);
446 if(data_id
< 0) data_id
+= 255;
447 diskD
= geo_map(data_id
, start
/chunk_size
,
448 data_disks
+ 2, level
, layout
);
449 curr_broken_disk
= diskD
;
452 if((Px
== 0) && (Qx
== 0))
453 curr_broken_disk
= curr_broken_disk
;
455 if(curr_broken_disk
>= data_disks
+ 2)
458 switch(broken_status
) {
460 if(curr_broken_disk
!= -1) {
461 prev_broken_disk
= curr_broken_disk
;
467 if(curr_broken_disk
!= prev_broken_disk
)
473 curr_broken_disk
= prev_broken_disk
= -2;
478 return curr_broken_disk
;
481 /*******************************************************************************
482 * Function: save_stripes
484 * Function reads data (only data without P and Q) from array and writes
485 * it to buf and opcjonaly to backup files
487 * source : A list of 'fds' of the active disks.
489 * offsets : A list of offsets on disk belonging
490 * to the array [bytes]
491 * raid_disks : geometry: number of disks in the array
492 * chunk_size : geometry: chunk size [bytes]
493 * level : geometry: RAID level
494 * layout : geometry: layout
495 * nwrites : number of backup files
496 * dest : A list of 'fds' for mirrored targets
497 * (e.g. backup files). They are already seeked to right
498 * (write) location. If NULL, data will be wrote
500 * start : start address of data to read (must be stripe-aligned)
502 * length - : length of data to read (must be stripe-aligned)
504 * buf : buffer for data. It is large enough to hold
505 * one stripe. It is stripe aligned
509 ******************************************************************************/
510 int save_stripes(int *source
, unsigned long long *offsets
,
511 int raid_disks
, int chunk_size
, int level
, int layout
,
512 int nwrites
, int *dest
,
513 unsigned long long start
, unsigned long long length
,
517 int data_disks
= raid_disks
- (level
== 0 ? 0 : level
<=5 ? 1 : 2);
520 unsigned long long length_test
;
524 ensure_zero_has_size(chunk_size
);
526 len
= data_disks
* chunk_size
;
527 length_test
= length
/ len
;
530 if (length
!= length_test
) {
531 dprintf("Error: save_stripes(): Data are not alligned. EXIT\n");
532 dprintf("\tArea for saving stripes (length) = %llu\n", length
);
533 dprintf("\tWork step (len) = %i\n", len
);
534 dprintf("\tExpected save area (length_test) = %llu\n",
541 int fdisk
[3], fblock
[3];
542 for (disk
= 0; disk
< raid_disks
; disk
++) {
543 unsigned long long offset
;
546 offset
= (start
/chunk_size
/data_disks
)*chunk_size
;
547 dnum
= geo_map(disk
< data_disks
? disk
: data_disks
- disk
- 1,
548 start
/chunk_size
/data_disks
,
549 raid_disks
, level
, layout
);
550 if (dnum
< 0) abort();
551 if (source
[dnum
] < 0 ||
552 lseek64(source
[dnum
], offsets
[dnum
]+offset
, 0) < 0 ||
553 read(source
[dnum
], buf
+disk
* chunk_size
, chunk_size
)
556 fdisk
[failed
] = dnum
;
557 fblock
[failed
] = disk
;
561 if (failed
== 0 || fblock
[0] >= data_disks
)
562 /* all data disks are good */
564 else if (failed
== 1 || fblock
[1] >= data_disks
+1) {
565 /* one failed data disk and good parity */
566 char *bufs
[data_disks
];
567 for (i
=0; i
< data_disks
; i
++)
569 bufs
[i
] = buf
+ data_disks
*chunk_size
;
571 bufs
[i
] = buf
+ i
*chunk_size
;
573 xor_blocks(buf
+ fblock
[0]*chunk_size
,
574 bufs
, data_disks
, chunk_size
);
575 } else if (failed
> 2 || level
!= 6)
576 /* too much failure */
579 /* RAID6 computations needed. */
580 uint8_t *bufs
[data_disks
+4];
583 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
584 raid_disks
, level
, layout
);
585 qdisk
= geo_map(-2, start
/chunk_size
/data_disks
,
586 raid_disks
, level
, layout
);
587 if (is_ddf(layout
)) {
588 /* q over 'raid_disks' blocks, in device order.
589 * 'p' and 'q' get to be all zero
591 for (i
= 0; i
< raid_disks
; i
++)
593 for (i
= 0; i
< data_disks
; i
++) {
594 int dnum
= geo_map(i
,
595 start
/chunk_size
/data_disks
,
596 raid_disks
, level
, layout
);
598 /* i is the logical block number, so is index to 'buf'.
599 * dnum is physical disk number
600 * and thus the syndrome number.
603 bufs
[snum
] = (uint8_t*)buf
+ chunk_size
* i
;
605 syndrome_disks
= raid_disks
;
607 /* for md, q is over 'data_disks' blocks,
608 * starting immediately after 'q'
609 * Note that for the '_6' variety, the p block
610 * makes a hole that we need to be careful of.
614 for (j
= 0; j
< raid_disks
; j
++) {
615 int dnum
= (qdisk
+ 1 + j
) % raid_disks
;
616 if (dnum
== disk
|| dnum
== qdisk
)
618 for (i
= 0; i
< data_disks
; i
++)
620 start
/chunk_size
/data_disks
,
621 raid_disks
, level
, layout
) == dnum
)
623 /* i is the logical block number, so is index to 'buf'.
624 * dnum is physical disk number
625 * snum is syndrome disk for which 0 is immediately after Q
627 bufs
[snum
] = (uint8_t*)buf
+ chunk_size
* i
;
636 syndrome_disks
= data_disks
;
639 /* Place P and Q blocks at end of bufs */
640 bufs
[syndrome_disks
] = (uint8_t*)buf
+ chunk_size
* data_disks
;
641 bufs
[syndrome_disks
+1] = (uint8_t*)buf
+ chunk_size
* (data_disks
+1);
643 if (fblock
[1] == data_disks
)
644 /* One data failed, and parity failed */
645 raid6_datap_recov(syndrome_disks
+2, chunk_size
,
648 if (fdisk
[0] > fdisk
[1]) {
653 /* Two data blocks failed, P,Q OK */
654 raid6_2data_recov(syndrome_disks
+2, chunk_size
,
655 fdisk
[0], fdisk
[1], bufs
);
659 for (i
= 0; i
< nwrites
; i
++)
660 if (write(dest
[i
], buf
, len
) != len
)
663 /* build next stripe in buffer */
674 * A list of 'fds' of the active disks. Some may be '-1' for not-available.
675 * A geometry: raid_disks, chunk_size, level, layout
676 * An 'fd' to read from. It is already seeked to the right (Read) location.
677 * A start and length.
678 * The length must be a multiple of the stripe size.
680 * We build a full stripe in memory and then write it out.
681 * We assume that there are enough working devices.
683 int restore_stripes(int *dest
, unsigned long long *offsets
,
684 int raid_disks
, int chunk_size
, int level
, int layout
,
685 int source
, unsigned long long read_offset
,
686 unsigned long long start
, unsigned long long length
,
690 char **stripes
= xmalloc(raid_disks
* sizeof(char*));
691 char **blocks
= xmalloc(raid_disks
* sizeof(char*));
695 int data_disks
= raid_disks
- (level
== 0 ? 0 : level
<= 5 ? 1 : 2);
697 if (posix_memalign((void**)&stripe_buf
, 4096, raid_disks
* chunk_size
))
700 if (zero
== NULL
|| chunk_size
> zero_size
) {
703 zero
= xcalloc(1, chunk_size
);
704 zero_size
= chunk_size
;
707 if (stripe_buf
== NULL
|| stripes
== NULL
|| blocks
== NULL
712 for (i
= 0; i
< raid_disks
; i
++)
713 stripes
[i
] = stripe_buf
+ i
* chunk_size
;
715 unsigned int len
= data_disks
* chunk_size
;
716 unsigned long long offset
;
723 for (i
= 0; i
< data_disks
; i
++) {
724 int disk
= geo_map(i
, start
/chunk_size
/data_disks
,
725 raid_disks
, level
, layout
);
726 if (src_buf
== NULL
) {
728 if (lseek64(source
, read_offset
, 0) !=
729 (off64_t
)read_offset
) {
735 chunk_size
) != chunk_size
) {
740 /* read from input buffer */
741 memcpy(stripes
[disk
],
742 src_buf
+ read_offset
,
745 read_offset
+= chunk_size
;
747 /* We have the data, now do the parity */
748 offset
= (start
/chunk_size
/data_disks
) * chunk_size
;
752 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
753 raid_disks
, level
, layout
);
754 for (i
= 0; i
< data_disks
; i
++)
755 blocks
[i
] = stripes
[(disk
+1+i
) % raid_disks
];
756 xor_blocks(stripes
[disk
], blocks
, data_disks
, chunk_size
);
759 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
760 raid_disks
, level
, layout
);
761 qdisk
= geo_map(-2, start
/chunk_size
/data_disks
,
762 raid_disks
, level
, layout
);
763 if (is_ddf(layout
)) {
764 /* q over 'raid_disks' blocks, in device order.
765 * 'p' and 'q' get to be all zero
767 for (i
= 0; i
< raid_disks
; i
++)
768 if (i
== disk
|| i
== qdisk
)
769 blocks
[i
] = (char*)zero
;
771 blocks
[i
] = stripes
[i
];
772 syndrome_disks
= raid_disks
;
774 /* for md, q is over 'data_disks' blocks,
775 * starting immediately after 'q'
777 for (i
= 0; i
< data_disks
; i
++)
778 blocks
[i
] = stripes
[(qdisk
+1+i
) % raid_disks
];
780 syndrome_disks
= data_disks
;
782 qsyndrome((uint8_t*)stripes
[disk
],
783 (uint8_t*)stripes
[qdisk
],
785 syndrome_disks
, chunk_size
);
788 for (i
=0; i
< raid_disks
; i
++)
791 offsets
[i
]+offset
, 0) < 0) {
795 if (write(dest
[i
], stripes
[i
],
796 chunk_size
) != chunk_size
) {
815 int test_stripes(int *source
, unsigned long long *offsets
,
816 int raid_disks
, int chunk_size
, int level
, int layout
,
817 unsigned long long start
, unsigned long long length
)
819 /* ready the data and p (and q) blocks, and check we got them right */
820 char *stripe_buf
= xmalloc(raid_disks
* chunk_size
);
821 char **stripes
= xmalloc(raid_disks
* sizeof(char*));
822 char **blocks
= xmalloc(raid_disks
* sizeof(char*));
823 char *p
= xmalloc(chunk_size
);
824 char *q
= xmalloc(chunk_size
);
828 int data_disks
= raid_disks
- (level
== 5 ? 1: 2);
833 for ( i
= 0 ; i
< raid_disks
; i
++)
834 stripes
[i
] = stripe_buf
+ i
* chunk_size
;
839 for (i
= 0 ; i
< raid_disks
; i
++) {
840 lseek64(source
[i
], offsets
[i
]+start
, 0);
841 read(source
[i
], stripes
[i
], chunk_size
);
843 for (i
= 0 ; i
< data_disks
; i
++) {
844 int disk
= geo_map(i
, start
/chunk_size
, raid_disks
,
846 blocks
[i
] = stripes
[disk
];
847 printf("%d->%d\n", i
, disk
);
851 qsyndrome(p
, q
, (uint8_t**)blocks
, data_disks
, chunk_size
);
852 diskP
= geo_map(-1, start
/chunk_size
, raid_disks
,
854 if (memcmp(p
, stripes
[diskP
], chunk_size
) != 0) {
855 printf("P(%d) wrong at %llu\n", diskP
,
858 diskQ
= geo_map(-2, start
/chunk_size
, raid_disks
,
860 if (memcmp(q
, stripes
[diskQ
], chunk_size
) != 0) {
861 printf("Q(%d) wrong at %llu\n", diskQ
,
864 disk
= raid6_check_disks(data_disks
, start
, chunk_size
,
865 level
, layout
, diskP
, diskQ
,
868 printf("Possible failed disk: %d\n", disk
);
871 printf("Failure detected, but disk unknown\n");
875 length
-= chunk_size
;
881 unsigned long long getnum(char *str
, char **err
)
884 unsigned long long rv
= strtoull(str
, &e
, 10);
892 main(int argc
, char *argv
[])
894 /* save/restore file raid_disks chunk_size level layout start length devices...
901 unsigned long long *offsets
;
902 int raid_disks
, chunk_size
, level
, layout
;
903 unsigned long long start
, length
;
908 fprintf(stderr
, "Usage: test_stripe save/restore file raid_disks"
909 " chunk_size level layout start length devices...\n");
912 if (strcmp(argv
[1], "save")==0)
914 else if (strcmp(argv
[1], "restore") == 0)
916 else if (strcmp(argv
[1], "test") == 0)
919 fprintf(stderr
, "test_stripe: must give 'save' or 'restore'.\n");
924 raid_disks
= getnum(argv
[3], &err
);
925 chunk_size
= getnum(argv
[4], &err
);
926 level
= getnum(argv
[5], &err
);
927 layout
= getnum(argv
[6], &err
);
928 start
= getnum(argv
[7], &err
);
929 length
= getnum(argv
[8], &err
);
931 fprintf(stderr
, "test_stripe: Bad number: %s\n", err
);
934 if (argc
!= raid_disks
+ 9) {
935 fprintf(stderr
, "test_stripe: wrong number of devices: want %d found %d\n",
939 fds
= xmalloc(raid_disks
* sizeof(*fds
));
940 offsets
= xcalloc(raid_disks
, sizeof(*offsets
));
942 storefd
= open(file
, O_RDWR
);
945 fprintf(stderr
, "test_stripe: could not open %s.\n", file
);
948 for (i
=0; i
<raid_disks
; i
++) {
950 p
= strchr(argv
[9+i
], ':');
954 offsets
[i
] = atoll(p
) * 512;
957 fds
[i
] = open(argv
[9+i
], O_RDWR
);
960 fprintf(stderr
,"test_stripe: cannot open %s.\n", argv
[9+i
]);
965 buf
= xmalloc(raid_disks
* chunk_size
);
968 int rv
= save_stripes(fds
, offsets
,
969 raid_disks
, chunk_size
, level
, layout
,
974 "test_stripe: save_stripes returned %d\n", rv
);
977 } else if (save
== 2) {
978 int rv
= test_stripes(fds
, offsets
,
979 raid_disks
, chunk_size
, level
, layout
,
983 "test_stripe: test_stripes returned %d\n", rv
);
987 int rv
= restore_stripes(fds
, offsets
,
988 raid_disks
, chunk_size
, level
, layout
,
990 start
, length
, NULL
);
993 "test_stripe: restore_stripes returned %d\n",