algos.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  1. /* -*- linux-c -*- ------------------------------------------------------- *
  2. *
  3. * Copyright 2002 H. Peter Anvin - All Rights Reserved
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, Inc., 53 Temple Place Ste 330,
  8. * Boston MA 02111-1307, USA; either version 2 of the License, or
  9. * (at your option) any later version; incorporated herein by reference.
  10. *
  11. * ----------------------------------------------------------------------- */
  12. /*
  13. * raid6/algos.c
  14. *
  15. * Algorithm list and algorithm selection for RAID-6
  16. */
  17. #include <linux/raid/pq.h>
  18. #ifndef __KERNEL__
  19. #include <sys/mman.h>
  20. #include <stdio.h>
  21. #else
  22. #include <linux/module.h>
  23. #include <linux/gfp.h>
  24. #if !RAID6_USE_EMPTY_ZERO_PAGE
  25. /* In .bss so it's zeroed */
  26. const char raid6_empty_zero_page[PAGE_SIZE] __attribute__((aligned(256)));
  27. EXPORT_SYMBOL(raid6_empty_zero_page);
  28. #endif
  29. #endif
  30. struct raid6_calls raid6_call;
  31. EXPORT_SYMBOL_GPL(raid6_call);
  32. const struct raid6_calls * const raid6_algos[] = {
  33. #if defined(__ia64__)
  34. &raid6_intx16,
  35. &raid6_intx32,
  36. #endif
  37. #if defined(__i386__) && !defined(__arch_um__)
  38. &raid6_mmxx1,
  39. &raid6_mmxx2,
  40. &raid6_sse1x1,
  41. &raid6_sse1x2,
  42. &raid6_sse2x1,
  43. &raid6_sse2x2,
  44. #ifdef CONFIG_AS_AVX2
  45. &raid6_avx2x1,
  46. &raid6_avx2x2,
  47. #endif
  48. #ifdef CONFIG_AS_AVX512
  49. &raid6_avx512x1,
  50. &raid6_avx512x2,
  51. #endif
  52. #endif
  53. #if defined(__x86_64__) && !defined(__arch_um__)
  54. &raid6_sse2x1,
  55. &raid6_sse2x2,
  56. &raid6_sse2x4,
  57. #ifdef CONFIG_AS_AVX2
  58. &raid6_avx2x1,
  59. &raid6_avx2x2,
  60. &raid6_avx2x4,
  61. #endif
  62. #ifdef CONFIG_AS_AVX512
  63. &raid6_avx512x1,
  64. &raid6_avx512x2,
  65. &raid6_avx512x4,
  66. #endif
  67. #endif
  68. #ifdef CONFIG_ALTIVEC
  69. &raid6_altivec1,
  70. &raid6_altivec2,
  71. &raid6_altivec4,
  72. &raid6_altivec8,
  73. #endif
  74. #if defined(CONFIG_TILEGX)
  75. &raid6_tilegx8,
  76. #endif
  77. &raid6_intx1,
  78. &raid6_intx2,
  79. &raid6_intx4,
  80. &raid6_intx8,
  81. #ifdef CONFIG_KERNEL_MODE_NEON
  82. &raid6_neonx1,
  83. &raid6_neonx2,
  84. &raid6_neonx4,
  85. &raid6_neonx8,
  86. #endif
  87. NULL
  88. };
  89. void (*raid6_2data_recov)(int, size_t, int, int, void **);
  90. EXPORT_SYMBOL_GPL(raid6_2data_recov);
  91. void (*raid6_datap_recov)(int, size_t, int, void **);
  92. EXPORT_SYMBOL_GPL(raid6_datap_recov);
  93. const struct raid6_recov_calls *const raid6_recov_algos[] = {
  94. #ifdef CONFIG_AS_AVX2
  95. &raid6_recov_avx2,
  96. #endif
  97. #ifdef CONFIG_AS_SSSE3
  98. &raid6_recov_ssse3,
  99. #endif
  100. &raid6_recov_intx1,
  101. NULL
  102. };
  103. #ifdef __KERNEL__
  104. #define RAID6_TIME_JIFFIES_LG2 4
  105. #else
  106. /* Need more time to be stable in userspace */
  107. #define RAID6_TIME_JIFFIES_LG2 9
  108. #define time_before(x, y) ((x) < (y))
  109. #endif
  110. static inline const struct raid6_recov_calls *raid6_choose_recov(void)
  111. {
  112. const struct raid6_recov_calls *const *algo;
  113. const struct raid6_recov_calls *best;
  114. for (best = NULL, algo = raid6_recov_algos; *algo; algo++)
  115. if (!best || (*algo)->priority > best->priority)
  116. if (!(*algo)->valid || (*algo)->valid())
  117. best = *algo;
  118. if (best) {
  119. raid6_2data_recov = best->data2;
  120. raid6_datap_recov = best->datap;
  121. pr_info("raid6: using %s recovery algorithm\n", best->name);
  122. } else
  123. pr_err("raid6: Yikes! No recovery algorithm found!\n");
  124. return best;
  125. }
  126. static inline const struct raid6_calls *raid6_choose_gen(
  127. void *(*const dptrs)[(65536/PAGE_SIZE)+2], const int disks)
  128. {
  129. unsigned long perf, bestgenperf, bestxorperf, j0, j1;
  130. int start = (disks>>1)-1, stop = disks-3; /* work on the second half of the disks */
  131. const struct raid6_calls *const *algo;
  132. const struct raid6_calls *best;
  133. for (bestgenperf = 0, bestxorperf = 0, best = NULL, algo = raid6_algos; *algo; algo++) {
  134. if (!best || (*algo)->prefer >= best->prefer) {
  135. if ((*algo)->valid && !(*algo)->valid())
  136. continue;
  137. perf = 0;
  138. preempt_disable();
  139. j0 = jiffies;
  140. while ((j1 = jiffies) == j0)
  141. cpu_relax();
  142. while (time_before(jiffies,
  143. j1 + (1<<RAID6_TIME_JIFFIES_LG2))) {
  144. (*algo)->gen_syndrome(disks, PAGE_SIZE, *dptrs);
  145. perf++;
  146. }
  147. preempt_enable();
  148. if (perf > bestgenperf) {
  149. bestgenperf = perf;
  150. best = *algo;
  151. }
  152. pr_info("raid6: %-8s gen() %5ld MB/s\n", (*algo)->name,
  153. (perf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2));
  154. if (!(*algo)->xor_syndrome)
  155. continue;
  156. perf = 0;
  157. preempt_disable();
  158. j0 = jiffies;
  159. while ((j1 = jiffies) == j0)
  160. cpu_relax();
  161. while (time_before(jiffies,
  162. j1 + (1<<RAID6_TIME_JIFFIES_LG2))) {
  163. (*algo)->xor_syndrome(disks, start, stop,
  164. PAGE_SIZE, *dptrs);
  165. perf++;
  166. }
  167. preempt_enable();
  168. if (best == *algo)
  169. bestxorperf = perf;
  170. pr_info("raid6: %-8s xor() %5ld MB/s\n", (*algo)->name,
  171. (perf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2+1));
  172. }
  173. }
  174. if (best) {
  175. pr_info("raid6: using algorithm %s gen() %ld MB/s\n",
  176. best->name,
  177. (bestgenperf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2));
  178. if (best->xor_syndrome)
  179. pr_info("raid6: .... xor() %ld MB/s, rmw enabled\n",
  180. (bestxorperf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2+1));
  181. raid6_call = *best;
  182. } else
  183. pr_err("raid6: Yikes! No algorithm found!\n");
  184. return best;
  185. }
  186. /* Try to pick the best algorithm */
  187. /* This code uses the gfmul table as convenient data set to abuse */
  188. int __init raid6_select_algo(void)
  189. {
  190. const int disks = (65536/PAGE_SIZE)+2;
  191. const struct raid6_calls *gen_best;
  192. const struct raid6_recov_calls *rec_best;
  193. char *syndromes;
  194. void *dptrs[(65536/PAGE_SIZE)+2];
  195. int i;
  196. for (i = 0; i < disks-2; i++)
  197. dptrs[i] = ((char *)raid6_gfmul) + PAGE_SIZE*i;
  198. /* Normal code - use a 2-page allocation to avoid D$ conflict */
  199. syndromes = (void *) __get_free_pages(GFP_KERNEL, 1);
  200. if (!syndromes) {
  201. pr_err("raid6: Yikes! No memory available.\n");
  202. return -ENOMEM;
  203. }
  204. dptrs[disks-2] = syndromes;
  205. dptrs[disks-1] = syndromes + PAGE_SIZE;
  206. /* select raid gen_syndrome function */
  207. gen_best = raid6_choose_gen(&dptrs, disks);
  208. /* select raid recover functions */
  209. rec_best = raid6_choose_recov();
  210. free_pages((unsigned long)syndromes, 1);
  211. return gen_best && rec_best ? 0 : -EINVAL;
  212. }
  213. static void raid6_exit(void)
  214. {
  215. do { } while (0);
  216. }
  217. subsys_initcall(raid6_select_algo);
  218. module_exit(raid6_exit);
  219. MODULE_LICENSE("GPL");
  220. MODULE_DESCRIPTION("RAID6 Q-syndrome calculations");