1 /* -*- linux-c -*- ------------------------------------------------------- *
3 * Copyright 2002-2007 H. Peter Anvin - All Rights Reserved
5 * This file is part of the Linux kernel, and is made available under
6 * the terms of the GNU General Public License version 2 or (at your
7 * option) any later version; incorporated herein by reference.
9 * ----------------------------------------------------------------------- */
14 * Make RAID-6 tables. This is a host user space program to be run at
24 static uint8_t gfmul(uint8_t a
, uint8_t b
)
31 a
= (a
<< 1) ^ (a
& 0x80 ? 0x1d : 0);
38 static uint8_t gfpow(uint8_t a
, int b
)
56 int main(int argc
, char *argv
[])
60 uint8_t exptbl
[256], invtbl
[256];
62 printf("#include <linux/raid/pq.h>\n");
63 printf("#include <linux/export.h>\n");
65 /* Compute multiplication table */
66 printf("\nconst u8 __attribute__((aligned(256)))\n"
67 "raid6_gfmul[256][256] =\n"
69 for (i
= 0; i
< 256; i
++) {
71 for (j
= 0; j
< 256; j
+= 8) {
73 for (k
= 0; k
< 8; k
++)
74 printf("0x%02x,%c", gfmul(i
, j
+ k
),
75 (k
== 7) ? '\n' : ' ');
80 printf("#ifdef __KERNEL__\n");
81 printf("EXPORT_SYMBOL(raid6_gfmul);\n");
84 /* Compute vector multiplication table */
85 printf("\nconst u8 __attribute__((aligned(256)))\n"
86 "raid6_vgfmul[256][32] =\n"
88 for (i
= 0; i
< 256; i
++) {
90 for (j
= 0; j
< 16; j
+= 8) {
92 for (k
= 0; k
< 8; k
++)
93 printf("0x%02x,%c", gfmul(i
, j
+ k
),
94 (k
== 7) ? '\n' : ' ');
96 for (j
= 0; j
< 16; j
+= 8) {
98 for (k
= 0; k
< 8; k
++)
99 printf("0x%02x,%c", gfmul(i
, (j
+ k
) << 4),
100 (k
== 7) ? '\n' : ' ');
105 printf("#ifdef __KERNEL__\n");
106 printf("EXPORT_SYMBOL(raid6_vgfmul);\n");
109 /* Compute power-of-2 table (exponent) */
111 printf("\nconst u8 __attribute__((aligned(256)))\n"
112 "raid6_gfexp[256] =\n" "{\n");
113 for (i
= 0; i
< 256; i
+= 8) {
115 for (j
= 0; j
< 8; j
++) {
117 printf("0x%02x,%c", v
, (j
== 7) ? '\n' : ' ');
120 v
= 0; /* For entry 255, not a real entry */
124 printf("#ifdef __KERNEL__\n");
125 printf("EXPORT_SYMBOL(raid6_gfexp);\n");
128 /* Compute log-of-2 table */
129 printf("\nconst u8 __attribute__((aligned(256)))\n"
130 "raid6_gflog[256] =\n" "{\n");
131 for (i
= 0; i
< 256; i
+= 8) {
133 for (j
= 0; j
< 8; j
++) {
135 for (k
= 0; k
< 256; k
++)
136 if (exptbl
[k
] == (i
+ j
)) {
140 printf("0x%02x,%c", v
, (j
== 7) ? '\n' : ' ');
144 printf("#ifdef __KERNEL__\n");
145 printf("EXPORT_SYMBOL(raid6_gflog);\n");
148 /* Compute inverse table x^-1 == x^254 */
149 printf("\nconst u8 __attribute__((aligned(256)))\n"
150 "raid6_gfinv[256] =\n" "{\n");
151 for (i
= 0; i
< 256; i
+= 8) {
153 for (j
= 0; j
< 8; j
++) {
154 invtbl
[i
+ j
] = v
= gfpow(i
+ j
, 254);
155 printf("0x%02x,%c", v
, (j
== 7) ? '\n' : ' ');
159 printf("#ifdef __KERNEL__\n");
160 printf("EXPORT_SYMBOL(raid6_gfinv);\n");
163 /* Compute inv(2^x + 1) (exponent-xor-inverse) table */
164 printf("\nconst u8 __attribute__((aligned(256)))\n"
165 "raid6_gfexi[256] =\n" "{\n");
166 for (i
= 0; i
< 256; i
+= 8) {
168 for (j
= 0; j
< 8; j
++)
169 printf("0x%02x,%c", invtbl
[exptbl
[i
+ j
] ^ 1],
170 (j
== 7) ? '\n' : ' ');
173 printf("#ifdef __KERNEL__\n");
174 printf("EXPORT_SYMBOL(raid6_gfexi);\n");