xref: /openbmc/linux/lib/raid6/mktables.c (revision b5266ea6)
1 /* -*- linux-c -*- ------------------------------------------------------- *
2  *
3  *   Copyright 2002-2007 H. Peter Anvin - All Rights Reserved
4  *
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.
8  *
9  * ----------------------------------------------------------------------- */
10 
11 /*
12  * mktables.c
13  *
14  * Make RAID-6 tables.  This is a host user space program to be run at
15  * compile time.
16  */
17 
18 #include <stdio.h>
19 #include <string.h>
20 #include <inttypes.h>
21 #include <stdlib.h>
22 #include <time.h>
23 
24 static uint8_t gfmul(uint8_t a, uint8_t b)
25 {
26 	uint8_t v = 0;
27 
28 	while (b) {
29 		if (b & 1)
30 			v ^= a;
31 		a = (a << 1) ^ (a & 0x80 ? 0x1d : 0);
32 		b >>= 1;
33 	}
34 
35 	return v;
36 }
37 
38 static uint8_t gfpow(uint8_t a, int b)
39 {
40 	uint8_t v = 1;
41 
42 	b %= 255;
43 	if (b < 0)
44 		b += 255;
45 
46 	while (b) {
47 		if (b & 1)
48 			v = gfmul(v, a);
49 		a = gfmul(a, a);
50 		b >>= 1;
51 	}
52 
53 	return v;
54 }
55 
56 int main(int argc, char *argv[])
57 {
58 	int i, j, k;
59 	uint8_t v;
60 	uint8_t exptbl[256], invtbl[256];
61 
62 	printf("#include <linux/raid/pq.h>\n");
63 	printf("#include <linux/export.h>\n");
64 
65 	/* Compute multiplication table */
66 	printf("\nconst u8  __attribute__((aligned(256)))\n"
67 		"raid6_gfmul[256][256] =\n"
68 		"{\n");
69 	for (i = 0; i < 256; i++) {
70 		printf("\t{\n");
71 		for (j = 0; j < 256; j += 8) {
72 			printf("\t\t");
73 			for (k = 0; k < 8; k++)
74 				printf("0x%02x,%c", gfmul(i, j + k),
75 				       (k == 7) ? '\n' : ' ');
76 		}
77 		printf("\t},\n");
78 	}
79 	printf("};\n");
80 	printf("#ifdef __KERNEL__\n");
81 	printf("EXPORT_SYMBOL(raid6_gfmul);\n");
82 	printf("#endif\n");
83 
84 	/* Compute power-of-2 table (exponent) */
85 	v = 1;
86 	printf("\nconst u8 __attribute__((aligned(256)))\n"
87 	       "raid6_gfexp[256] =\n" "{\n");
88 	for (i = 0; i < 256; i += 8) {
89 		printf("\t");
90 		for (j = 0; j < 8; j++) {
91 			exptbl[i + j] = v;
92 			printf("0x%02x,%c", v, (j == 7) ? '\n' : ' ');
93 			v = gfmul(v, 2);
94 			if (v == 1)
95 				v = 0;	/* For entry 255, not a real entry */
96 		}
97 	}
98 	printf("};\n");
99 	printf("#ifdef __KERNEL__\n");
100 	printf("EXPORT_SYMBOL(raid6_gfexp);\n");
101 	printf("#endif\n");
102 
103 	/* Compute inverse table x^-1 == x^254 */
104 	printf("\nconst u8 __attribute__((aligned(256)))\n"
105 	       "raid6_gfinv[256] =\n" "{\n");
106 	for (i = 0; i < 256; i += 8) {
107 		printf("\t");
108 		for (j = 0; j < 8; j++) {
109 			invtbl[i + j] = v = gfpow(i + j, 254);
110 			printf("0x%02x,%c", v, (j == 7) ? '\n' : ' ');
111 		}
112 	}
113 	printf("};\n");
114 	printf("#ifdef __KERNEL__\n");
115 	printf("EXPORT_SYMBOL(raid6_gfinv);\n");
116 	printf("#endif\n");
117 
118 	/* Compute inv(2^x + 1) (exponent-xor-inverse) table */
119 	printf("\nconst u8 __attribute__((aligned(256)))\n"
120 	       "raid6_gfexi[256] =\n" "{\n");
121 	for (i = 0; i < 256; i += 8) {
122 		printf("\t");
123 		for (j = 0; j < 8; j++)
124 			printf("0x%02x,%c", invtbl[exptbl[i + j] ^ 1],
125 			       (j == 7) ? '\n' : ' ');
126 	}
127 	printf("};\n");
128 	printf("#ifdef __KERNEL__\n");
129 	printf("EXPORT_SYMBOL(raid6_gfexi);\n");
130 	printf("#endif\n");
131 
132 	return 0;
133 }
134