mktables.c 3.9 KB

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