1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* -*- linux-c -*- ------------------------------------------------------- *
4 * Copyright 2002 H. Peter Anvin - All Rights Reserved
6 * ----------------------------------------------------------------------- */
11 * Algorithm list and algorithm selection for RAID-6
14 #include <linux/raid/pq.h>
19 #include <linux/module.h>
20 #include <linux/gfp.h>
21 /* In .bss so it's zeroed */
22 const char raid6_empty_zero_page[PAGE_SIZE] __attribute__((aligned(256)));
23 EXPORT_SYMBOL(raid6_empty_zero_page);
26 struct raid6_calls raid6_call;
27 EXPORT_SYMBOL_GPL(raid6_call);
29 const struct raid6_calls * const raid6_algos[] = {
30 #if defined(__i386__) && !defined(__arch_um__)
31 #ifdef CONFIG_AS_AVX512
44 #if defined(__x86_64__) && !defined(__arch_um__)
45 #ifdef CONFIG_AS_AVX512
67 #if defined(CONFIG_S390)
70 #ifdef CONFIG_KERNEL_MODE_NEON
76 #ifdef CONFIG_LOONGARCH
77 #ifdef CONFIG_CPU_HAS_LASX
80 #ifdef CONFIG_CPU_HAS_LSX
95 void (*raid6_2data_recov)(int, size_t, int, int, void **);
96 EXPORT_SYMBOL_GPL(raid6_2data_recov);
98 void (*raid6_datap_recov)(int, size_t, int, void **);
99 EXPORT_SYMBOL_GPL(raid6_datap_recov);
101 const struct raid6_recov_calls *const raid6_recov_algos[] = {
103 #ifdef CONFIG_AS_AVX512
112 #if defined(CONFIG_KERNEL_MODE_NEON)
120 #define RAID6_TIME_JIFFIES_LG2 4
122 /* Need more time to be stable in userspace */
123 #define RAID6_TIME_JIFFIES_LG2 9
124 #define time_before(x, y) ((x) < (y))
127 #define RAID6_TEST_DISKS 8
128 #define RAID6_TEST_DISKS_ORDER 3
130 static inline const struct raid6_recov_calls *raid6_choose_recov(void)
132 const struct raid6_recov_calls *const *algo;
133 const struct raid6_recov_calls *best;
135 for (best = NULL, algo = raid6_recov_algos; *algo; algo++)
136 if (!best || (*algo)->priority > best->priority)
137 if (!(*algo)->valid || (*algo)->valid())
141 raid6_2data_recov = best->data2;
142 raid6_datap_recov = best->datap;
144 pr_info("raid6: using %s recovery algorithm\n", best->name);
146 pr_err("raid6: Yikes! No recovery algorithm found!\n");
151 static inline const struct raid6_calls *raid6_choose_gen(
152 void *(*const dptrs)[RAID6_TEST_DISKS], const int disks)
154 unsigned long perf, bestgenperf, j0, j1;
155 int start = (disks>>1)-1, stop = disks-3; /* work on the second half of the disks */
156 const struct raid6_calls *const *algo;
157 const struct raid6_calls *best;
159 for (bestgenperf = 0, best = NULL, algo = raid6_algos; *algo; algo++) {
160 if (!best || (*algo)->priority >= best->priority) {
161 if ((*algo)->valid && !(*algo)->valid())
164 if (!IS_ENABLED(CONFIG_RAID6_PQ_BENCHMARK)) {
173 while ((j1 = jiffies) == j0)
175 while (time_before(jiffies,
176 j1 + (1<<RAID6_TIME_JIFFIES_LG2))) {
177 (*algo)->gen_syndrome(disks, PAGE_SIZE, *dptrs);
182 if (perf > bestgenperf) {
186 pr_info("raid6: %-8s gen() %5ld MB/s\n", (*algo)->name,
187 (perf * HZ * (disks-2)) >>
188 (20 - PAGE_SHIFT + RAID6_TIME_JIFFIES_LG2));
193 pr_err("raid6: Yikes! No algorithm found!\n");
199 if (!IS_ENABLED(CONFIG_RAID6_PQ_BENCHMARK)) {
200 pr_info("raid6: skipped pq benchmark and selected %s\n",
205 pr_info("raid6: using algorithm %s gen() %ld MB/s\n",
207 (bestgenperf * HZ * (disks - 2)) >>
208 (20 - PAGE_SHIFT + RAID6_TIME_JIFFIES_LG2));
210 if (best->xor_syndrome) {
215 while ((j1 = jiffies) == j0)
217 while (time_before(jiffies,
218 j1 + (1 << RAID6_TIME_JIFFIES_LG2))) {
219 best->xor_syndrome(disks, start, stop,
225 pr_info("raid6: .... xor() %ld MB/s, rmw enabled\n",
226 (perf * HZ * (disks - 2)) >>
227 (20 - PAGE_SHIFT + RAID6_TIME_JIFFIES_LG2 + 1));
235 /* Try to pick the best algorithm */
236 /* This code uses the gfmul table as convenient data set to abuse */
238 int __init raid6_select_algo(void)
240 const int disks = RAID6_TEST_DISKS;
242 const struct raid6_calls *gen_best;
243 const struct raid6_recov_calls *rec_best;
245 void *dptrs[RAID6_TEST_DISKS];
248 /* prepare the buffer and fill it circularly with gfmul table */
249 disk_ptr = (char *)__get_free_pages(GFP_KERNEL, RAID6_TEST_DISKS_ORDER);
251 pr_err("raid6: Yikes! No memory available.\n");
256 for (i = 0; i < disks; i++)
257 dptrs[i] = p + PAGE_SIZE * i;
259 cycle = ((disks - 2) * PAGE_SIZE) / 65536;
260 for (i = 0; i < cycle; i++) {
261 memcpy(p, raid6_gfmul, 65536);
265 if ((disks - 2) * PAGE_SIZE % 65536)
266 memcpy(p, raid6_gfmul, (disks - 2) * PAGE_SIZE % 65536);
268 /* select raid gen_syndrome function */
269 gen_best = raid6_choose_gen(&dptrs, disks);
271 /* select raid recover functions */
272 rec_best = raid6_choose_recov();
274 free_pages((unsigned long)disk_ptr, RAID6_TEST_DISKS_ORDER);
276 return gen_best && rec_best ? 0 : -EINVAL;
279 static void raid6_exit(void)
284 subsys_initcall(raid6_select_algo);
285 module_exit(raid6_exit);
286 MODULE_LICENSE("GPL");
287 MODULE_DESCRIPTION("RAID6 Q-syndrome calculations");