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 static 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;
338 /* Following was taken from linux/drivers/md/raid6recov.c */
340 /* Recover two failed data blocks. */
341 void raid6_2data_recov(int disks
, size_t bytes
, int faila
, int failb
,
344 uint8_t *p
, *q
, *dp
, *dq
;
346 const uint8_t *pbmul
; /* P multiplier table for B data */
347 const uint8_t *qmul
; /* Q multiplier table (for both) */
352 /* Compute syndrome with zero for the missing data pages
353 Use the dead data pages as temporary storage for
354 delta p and delta q */
360 qsyndrome(dp
, dq
, ptrs
, disks
-2, bytes
);
362 /* Restore pointer table */
366 /* Now, pick the proper data tables */
367 pbmul
= raid6_gfmul
[raid6_gfexi
[failb
-faila
]];
368 qmul
= raid6_gfmul
[raid6_gfinv
[raid6_gfexp
[faila
]^raid6_gfexp
[failb
]]];
374 *dq
++ = db
= pbmul
[px
] ^ qx
; /* Reconstructed B */
375 *dp
++ = db
^ px
; /* Reconstructed A */
380 /* Recover failure of one data block plus the P block */
381 void raid6_datap_recov(int disks
, size_t bytes
, int faila
, uint8_t **ptrs
)
384 const uint8_t *qmul
; /* Q multiplier table */
389 /* Compute syndrome with zero for the missing data page
390 Use the dead data page as temporary storage for delta q */
394 qsyndrome(p
, dq
, ptrs
, disks
-2, bytes
);
396 /* Restore pointer table */
399 /* Now, pick the proper data tables */
400 qmul
= raid6_gfmul
[raid6_gfinv
[raid6_gfexp
[faila
]]];
404 *p
++ ^= *dq
= qmul
[*q
^ *dq
];
409 /* Try to find out if a specific disk has a problem */
410 int raid6_check_disks(int data_disks
, int start
, int chunk_size
,
411 int level
, int layout
, int diskP
, int diskQ
,
412 char *p
, char *q
, char **stripes
)
417 int curr_broken_disk
= -1;
418 int prev_broken_disk
= -1;
419 int broken_status
= 0;
421 for(i
= 0; i
< chunk_size
; i
++) {
422 Px
= (uint8_t)stripes
[diskP
][i
] ^ (uint8_t)p
[i
];
423 Qx
= (uint8_t)stripes
[diskQ
][i
] ^ (uint8_t)q
[i
];
425 if((Px
!= 0) && (Qx
== 0))
426 curr_broken_disk
= diskP
;
429 if((Px
== 0) && (Qx
!= 0))
430 curr_broken_disk
= diskQ
;
433 if((Px
!= 0) && (Qx
!= 0)) {
434 data_id
= (raid6_gflog
[Qx
] - raid6_gflog
[Px
]);
435 if(data_id
< 0) data_id
+= 255;
436 diskD
= geo_map(data_id
, start
/chunk_size
,
437 data_disks
+ 2, level
, layout
);
438 curr_broken_disk
= diskD
;
441 if((Px
== 0) && (Qx
== 0))
442 curr_broken_disk
= curr_broken_disk
;
444 if(curr_broken_disk
>= data_disks
+ 2)
447 switch(broken_status
) {
449 if(curr_broken_disk
!= -1) {
450 prev_broken_disk
= curr_broken_disk
;
456 if(curr_broken_disk
!= prev_broken_disk
)
462 curr_broken_disk
= prev_broken_disk
= -2;
467 return curr_broken_disk
;
470 /*******************************************************************************
471 * Function: save_stripes
473 * Function reads data (only data without P and Q) from array and writes
474 * it to buf and opcjonaly to backup files
476 * source : A list of 'fds' of the active disks.
478 * offsets : A list of offsets on disk belonging
479 * to the array [bytes]
480 * raid_disks : geometry: number of disks in the array
481 * chunk_size : geometry: chunk size [bytes]
482 * level : geometry: RAID level
483 * layout : geometry: layout
484 * nwrites : number of backup files
485 * dest : A list of 'fds' for mirrored targets
486 * (e.g. backup files). They are already seeked to right
487 * (write) location. If NULL, data will be wrote
489 * start : start address of data to read (must be stripe-aligned)
491 * length - : length of data to read (must be stripe-aligned)
493 * buf : buffer for data. It is large enough to hold
494 * one stripe. It is stripe aligned
498 ******************************************************************************/
499 int save_stripes(int *source
, unsigned long long *offsets
,
500 int raid_disks
, int chunk_size
, int level
, int layout
,
501 int nwrites
, int *dest
,
502 unsigned long long start
, unsigned long long length
,
506 int data_disks
= raid_disks
- (level
== 0 ? 0 : level
<=5 ? 1 : 2);
509 unsigned long long length_test
;
514 if (zero
== NULL
|| chunk_size
> zero_size
) {
517 zero
= malloc(chunk_size
);
519 memset(zero
, 0, chunk_size
);
520 zero_size
= chunk_size
;
523 len
= data_disks
* chunk_size
;
524 length_test
= length
/ len
;
527 if (length
!= length_test
) {
528 dprintf("Error: save_stripes(): Data are not alligned. EXIT\n");
529 dprintf("\tArea for saving stripes (length) = %llu\n", length
);
530 dprintf("\tWork step (len) = %i\n", len
);
531 dprintf("\tExpected save area (length_test) = %llu\n",
538 int fdisk
[3], fblock
[3];
539 for (disk
= 0; disk
< raid_disks
; disk
++) {
540 unsigned long long offset
;
543 offset
= (start
/chunk_size
/data_disks
)*chunk_size
;
544 dnum
= geo_map(disk
< data_disks
? disk
: data_disks
- disk
- 1,
545 start
/chunk_size
/data_disks
,
546 raid_disks
, level
, layout
);
547 if (dnum
< 0) abort();
548 if (source
[dnum
] < 0 ||
549 lseek64(source
[dnum
], offsets
[dnum
]+offset
, 0) < 0 ||
550 read(source
[dnum
], buf
+disk
* chunk_size
, chunk_size
)
553 fdisk
[failed
] = dnum
;
554 fblock
[failed
] = disk
;
558 if (failed
== 0 || fblock
[0] >= data_disks
)
559 /* all data disks are good */
561 else if (failed
== 1 || fblock
[1] >= data_disks
+1) {
562 /* one failed data disk and good parity */
563 char *bufs
[data_disks
];
564 for (i
=0; i
< data_disks
; i
++)
566 bufs
[i
] = buf
+ data_disks
*chunk_size
;
568 bufs
[i
] = buf
+ i
*chunk_size
;
570 xor_blocks(buf
+ fblock
[0]*chunk_size
,
571 bufs
, data_disks
, chunk_size
);
572 } else if (failed
> 2 || level
!= 6)
573 /* too much failure */
576 /* RAID6 computations needed. */
577 uint8_t *bufs
[data_disks
+4];
580 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
581 raid_disks
, level
, layout
);
582 qdisk
= geo_map(-2, start
/chunk_size
/data_disks
,
583 raid_disks
, level
, layout
);
584 if (is_ddf(layout
)) {
585 /* q over 'raid_disks' blocks, in device order.
586 * 'p' and 'q' get to be all zero
588 for (i
= 0; i
< raid_disks
; i
++)
590 for (i
= 0; i
< data_disks
; i
++) {
591 int dnum
= geo_map(i
,
592 start
/chunk_size
/data_disks
,
593 raid_disks
, level
, layout
);
595 /* i is the logical block number, so is index to 'buf'.
596 * dnum is physical disk number
597 * and thus the syndrome number.
600 bufs
[snum
] = (uint8_t*)buf
+ chunk_size
* i
;
602 syndrome_disks
= raid_disks
;
604 /* for md, q is over 'data_disks' blocks,
605 * starting immediately after 'q'
606 * Note that for the '_6' variety, the p block
607 * makes a hole that we need to be careful of.
611 for (j
= 0; j
< raid_disks
; j
++) {
612 int dnum
= (qdisk
+ 1 + j
) % raid_disks
;
613 if (dnum
== disk
|| dnum
== qdisk
)
615 for (i
= 0; i
< data_disks
; i
++)
617 start
/chunk_size
/data_disks
,
618 raid_disks
, level
, layout
) == dnum
)
620 /* i is the logical block number, so is index to 'buf'.
621 * dnum is physical disk number
622 * snum is syndrome disk for which 0 is immediately after Q
624 bufs
[snum
] = (uint8_t*)buf
+ chunk_size
* i
;
633 syndrome_disks
= data_disks
;
636 /* Place P and Q blocks at end of bufs */
637 bufs
[syndrome_disks
] = (uint8_t*)buf
+ chunk_size
* data_disks
;
638 bufs
[syndrome_disks
+1] = (uint8_t*)buf
+ chunk_size
* (data_disks
+1);
640 if (fblock
[1] == data_disks
)
641 /* One data failed, and parity failed */
642 raid6_datap_recov(syndrome_disks
+2, chunk_size
,
645 if (fdisk
[0] > fdisk
[1]) {
650 /* Two data blocks failed, P,Q OK */
651 raid6_2data_recov(syndrome_disks
+2, chunk_size
,
652 fdisk
[0], fdisk
[1], bufs
);
656 for (i
= 0; i
< nwrites
; i
++)
657 if (write(dest
[i
], buf
, len
) != len
)
660 /* build next stripe in buffer */
671 * A list of 'fds' of the active disks. Some may be '-1' for not-available.
672 * A geometry: raid_disks, chunk_size, level, layout
673 * An 'fd' to read from. It is already seeked to the right (Read) location.
674 * A start and length.
675 * The length must be a multiple of the stripe size.
677 * We build a full stripe in memory and then write it out.
678 * We assume that there are enough working devices.
680 int restore_stripes(int *dest
, unsigned long long *offsets
,
681 int raid_disks
, int chunk_size
, int level
, int layout
,
682 int source
, unsigned long long read_offset
,
683 unsigned long long start
, unsigned long long length
,
687 char **stripes
= malloc(raid_disks
* sizeof(char*));
688 char **blocks
= malloc(raid_disks
* sizeof(char*));
692 int data_disks
= raid_disks
- (level
== 0 ? 0 : level
<= 5 ? 1 : 2);
694 if (posix_memalign((void**)&stripe_buf
, 4096, raid_disks
* chunk_size
))
697 if (zero
== NULL
|| chunk_size
> zero_size
) {
700 zero
= malloc(chunk_size
);
702 memset(zero
, 0, chunk_size
);
703 zero_size
= chunk_size
;
706 if (stripe_buf
== NULL
|| stripes
== NULL
|| blocks
== NULL
711 for (i
= 0; i
< raid_disks
; i
++)
712 stripes
[i
] = stripe_buf
+ i
* chunk_size
;
714 unsigned int len
= data_disks
* chunk_size
;
715 unsigned long long offset
;
722 for (i
= 0; i
< data_disks
; i
++) {
723 int disk
= geo_map(i
, start
/chunk_size
/data_disks
,
724 raid_disks
, level
, layout
);
725 if (src_buf
== NULL
) {
727 if (lseek64(source
, read_offset
, 0) !=
728 (off64_t
)read_offset
) {
734 chunk_size
) != chunk_size
) {
739 /* read from input buffer */
740 memcpy(stripes
[disk
],
741 src_buf
+ read_offset
,
744 read_offset
+= chunk_size
;
746 /* We have the data, now do the parity */
747 offset
= (start
/chunk_size
/data_disks
) * chunk_size
;
751 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
752 raid_disks
, level
, layout
);
753 for (i
= 0; i
< data_disks
; i
++)
754 blocks
[i
] = stripes
[(disk
+1+i
) % raid_disks
];
755 xor_blocks(stripes
[disk
], blocks
, data_disks
, chunk_size
);
758 disk
= geo_map(-1, start
/chunk_size
/data_disks
,
759 raid_disks
, level
, layout
);
760 qdisk
= geo_map(-2, start
/chunk_size
/data_disks
,
761 raid_disks
, level
, layout
);
762 if (is_ddf(layout
)) {
763 /* q over 'raid_disks' blocks, in device order.
764 * 'p' and 'q' get to be all zero
766 for (i
= 0; i
< raid_disks
; i
++)
767 if (i
== disk
|| i
== qdisk
)
768 blocks
[i
] = (char*)zero
;
770 blocks
[i
] = stripes
[i
];
771 syndrome_disks
= raid_disks
;
773 /* for md, q is over 'data_disks' blocks,
774 * starting immediately after 'q'
776 for (i
= 0; i
< data_disks
; i
++)
777 blocks
[i
] = stripes
[(qdisk
+1+i
) % raid_disks
];
779 syndrome_disks
= data_disks
;
781 qsyndrome((uint8_t*)stripes
[disk
],
782 (uint8_t*)stripes
[qdisk
],
784 syndrome_disks
, chunk_size
);
787 for (i
=0; i
< raid_disks
; i
++)
790 offsets
[i
]+offset
, 0) < 0) {
794 if (write(dest
[i
], stripes
[i
],
795 chunk_size
) != chunk_size
) {
814 int test_stripes(int *source
, unsigned long long *offsets
,
815 int raid_disks
, int chunk_size
, int level
, int layout
,
816 unsigned long long start
, unsigned long long length
)
818 /* ready the data and p (and q) blocks, and check we got them right */
819 char *stripe_buf
= malloc(raid_disks
* chunk_size
);
820 char **stripes
= malloc(raid_disks
* sizeof(char*));
821 char **blocks
= malloc(raid_disks
* sizeof(char*));
822 char *p
= malloc(chunk_size
);
823 char *q
= malloc(chunk_size
);
827 int data_disks
= raid_disks
- (level
== 5 ? 1: 2);
832 for ( i
= 0 ; i
< raid_disks
; i
++)
833 stripes
[i
] = stripe_buf
+ i
* chunk_size
;
838 for (i
= 0 ; i
< raid_disks
; i
++) {
839 lseek64(source
[i
], offsets
[i
]+start
, 0);
840 read(source
[i
], stripes
[i
], chunk_size
);
842 for (i
= 0 ; i
< data_disks
; i
++) {
843 int disk
= geo_map(i
, start
/chunk_size
, raid_disks
,
845 blocks
[i
] = stripes
[disk
];
846 printf("%d->%d\n", i
, disk
);
850 qsyndrome(p
, q
, (uint8_t**)blocks
, data_disks
, chunk_size
);
851 diskP
= geo_map(-1, start
/chunk_size
, raid_disks
,
853 if (memcmp(p
, stripes
[diskP
], chunk_size
) != 0) {
854 printf("P(%d) wrong at %llu\n", diskP
,
857 diskQ
= geo_map(-2, start
/chunk_size
, raid_disks
,
859 if (memcmp(q
, stripes
[diskQ
], chunk_size
) != 0) {
860 printf("Q(%d) wrong at %llu\n", diskQ
,
863 disk
= raid6_check_disks(data_disks
, start
, chunk_size
,
864 level
, layout
, diskP
, diskQ
,
867 printf("Possible failed disk: %d\n", disk
);
870 printf("Failure detected, but disk unknown\n");
874 length
-= chunk_size
;
880 unsigned long long getnum(char *str
, char **err
)
883 unsigned long long rv
= strtoull(str
, &e
, 10);
891 main(int argc
, char *argv
[])
893 /* save/restore file raid_disks chunk_size level layout start length devices...
900 unsigned long long *offsets
;
901 int raid_disks
, chunk_size
, level
, layout
;
902 unsigned long long start
, length
;
907 fprintf(stderr
, "Usage: test_stripe save/restore file raid_disks"
908 " chunk_size level layout start length devices...\n");
911 if (strcmp(argv
[1], "save")==0)
913 else if (strcmp(argv
[1], "restore") == 0)
915 else if (strcmp(argv
[1], "test") == 0)
918 fprintf(stderr
, "test_stripe: must give 'save' or 'restore'.\n");
923 raid_disks
= getnum(argv
[3], &err
);
924 chunk_size
= getnum(argv
[4], &err
);
925 level
= getnum(argv
[5], &err
);
926 layout
= getnum(argv
[6], &err
);
927 start
= getnum(argv
[7], &err
);
928 length
= getnum(argv
[8], &err
);
930 fprintf(stderr
, "test_stripe: Bad number: %s\n", err
);
933 if (argc
!= raid_disks
+ 9) {
934 fprintf(stderr
, "test_stripe: wrong number of devices: want %d found %d\n",
938 fds
= malloc(raid_disks
* sizeof(*fds
));
939 offsets
= malloc(raid_disks
* sizeof(*offsets
));
940 memset(offsets
, 0, 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
= malloc(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",