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 #if !RAID6_USE_EMPTY_ZERO_PAGE
22 /* In .bss so it's zeroed */
23 const char raid6_empty_zero_page
[PAGE_SIZE
] __attribute__((aligned(256)));
24 EXPORT_SYMBOL(raid6_empty_zero_page
);
28 struct raid6_calls raid6_call
;
29 EXPORT_SYMBOL_GPL(raid6_call
);
31 const struct raid6_calls
* const raid6_algos
[] = {
32 #if defined(__i386__) && !defined(__arch_um__)
33 #ifdef CONFIG_AS_AVX512
46 #if defined(__x86_64__) && !defined(__arch_um__)
47 #ifdef CONFIG_AS_AVX512
69 #if defined(CONFIG_S390)
72 #ifdef CONFIG_KERNEL_MODE_NEON
89 void (*raid6_2data_recov
)(int, size_t, int, int, void **);
90 EXPORT_SYMBOL_GPL(raid6_2data_recov
);
92 void (*raid6_datap_recov
)(int, size_t, int, void **);
93 EXPORT_SYMBOL_GPL(raid6_datap_recov
);
95 const struct raid6_recov_calls
*const raid6_recov_algos
[] = {
97 #ifdef CONFIG_AS_AVX512
106 #if defined(CONFIG_KERNEL_MODE_NEON)
114 #define RAID6_TIME_JIFFIES_LG2 4
116 /* Need more time to be stable in userspace */
117 #define RAID6_TIME_JIFFIES_LG2 9
118 #define time_before(x, y) ((x) < (y))
121 #define RAID6_TEST_DISKS 8
122 #define RAID6_TEST_DISKS_ORDER 3
124 static inline const struct raid6_recov_calls
*raid6_choose_recov(void)
126 const struct raid6_recov_calls
*const *algo
;
127 const struct raid6_recov_calls
*best
;
129 for (best
= NULL
, algo
= raid6_recov_algos
; *algo
; algo
++)
130 if (!best
|| (*algo
)->priority
> best
->priority
)
131 if (!(*algo
)->valid
|| (*algo
)->valid())
135 raid6_2data_recov
= best
->data2
;
136 raid6_datap_recov
= best
->datap
;
138 pr_info("raid6: using %s recovery algorithm\n", best
->name
);
140 pr_err("raid6: Yikes! No recovery algorithm found!\n");
145 static inline const struct raid6_calls
*raid6_choose_gen(
146 void *(*const dptrs
)[RAID6_TEST_DISKS
], const int disks
)
148 unsigned long perf
, bestgenperf
, bestxorperf
, j0
, j1
;
149 int start
= (disks
>>1)-1, stop
= disks
-3; /* work on the second half of the disks */
150 const struct raid6_calls
*const *algo
;
151 const struct raid6_calls
*best
;
153 for (bestgenperf
= 0, bestxorperf
= 0, best
= NULL
, algo
= raid6_algos
; *algo
; algo
++) {
154 if (!best
|| (*algo
)->prefer
>= best
->prefer
) {
155 if ((*algo
)->valid
&& !(*algo
)->valid())
158 if (!IS_ENABLED(CONFIG_RAID6_PQ_BENCHMARK
)) {
167 while ((j1
= jiffies
) == j0
)
169 while (time_before(jiffies
,
170 j1
+ (1<<RAID6_TIME_JIFFIES_LG2
))) {
171 (*algo
)->gen_syndrome(disks
, PAGE_SIZE
, *dptrs
);
176 if (perf
> bestgenperf
) {
180 pr_info("raid6: %-8s gen() %5ld MB/s\n", (*algo
)->name
,
181 (perf
* HZ
* (disks
-2)) >>
182 (20 - PAGE_SHIFT
+ RAID6_TIME_JIFFIES_LG2
));
184 if (!(*algo
)->xor_syndrome
)
191 while ((j1
= jiffies
) == j0
)
193 while (time_before(jiffies
,
194 j1
+ (1<<RAID6_TIME_JIFFIES_LG2
))) {
195 (*algo
)->xor_syndrome(disks
, start
, stop
,
204 pr_info("raid6: %-8s xor() %5ld MB/s\n", (*algo
)->name
,
205 (perf
* HZ
* (disks
-2)) >>
206 (20 - PAGE_SHIFT
+ RAID6_TIME_JIFFIES_LG2
+ 1));
211 if (IS_ENABLED(CONFIG_RAID6_PQ_BENCHMARK
)) {
212 pr_info("raid6: using algorithm %s gen() %ld MB/s\n",
214 (bestgenperf
* HZ
* (disks
-2)) >>
215 (20 - PAGE_SHIFT
+RAID6_TIME_JIFFIES_LG2
));
216 if (best
->xor_syndrome
)
217 pr_info("raid6: .... xor() %ld MB/s, rmw enabled\n",
218 (bestxorperf
* HZ
* (disks
-2)) >>
219 (20 - PAGE_SHIFT
+ RAID6_TIME_JIFFIES_LG2
+ 1));
221 pr_info("raid6: skip pq benchmark and using algorithm %s\n",
225 pr_err("raid6: Yikes! No algorithm found!\n");
231 /* Try to pick the best algorithm */
232 /* This code uses the gfmul table as convenient data set to abuse */
234 int __init
raid6_select_algo(void)
236 const int disks
= RAID6_TEST_DISKS
;
238 const struct raid6_calls
*gen_best
;
239 const struct raid6_recov_calls
*rec_best
;
241 void *dptrs
[RAID6_TEST_DISKS
];
244 /* prepare the buffer and fill it circularly with gfmul table */
245 disk_ptr
= (char *)__get_free_pages(GFP_KERNEL
, RAID6_TEST_DISKS_ORDER
);
247 pr_err("raid6: Yikes! No memory available.\n");
252 for (i
= 0; i
< disks
; i
++)
253 dptrs
[i
] = p
+ PAGE_SIZE
* i
;
255 cycle
= ((disks
- 2) * PAGE_SIZE
) / 65536;
256 for (i
= 0; i
< cycle
; i
++) {
257 memcpy(p
, raid6_gfmul
, 65536);
261 if ((disks
- 2) * PAGE_SIZE
% 65536)
262 memcpy(p
, raid6_gfmul
, (disks
- 2) * PAGE_SIZE
% 65536);
264 /* select raid gen_syndrome function */
265 gen_best
= raid6_choose_gen(&dptrs
, disks
);
267 /* select raid recover functions */
268 rec_best
= raid6_choose_recov();
270 free_pages((unsigned long)disk_ptr
, RAID6_TEST_DISKS_ORDER
);
272 return gen_best
&& rec_best
? 0 : -EINVAL
;
275 static void raid6_exit(void)
280 subsys_initcall(raid6_select_algo
);
281 module_exit(raid6_exit
);
282 MODULE_LICENSE("GPL");
283 MODULE_DESCRIPTION("RAID6 Q-syndrome calculations");