Merge remote-tracking branch 'regmap/for-next'
[deliverable/linux.git] / lib / raid6 / algos.c
CommitLineData
1da177e4
LT
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,
93ed05e2 8 * Boston MA 02111-1307, USA; either version 2 of the License, or
1da177e4
LT
9 * (at your option) any later version; incorporated herein by reference.
10 *
11 * ----------------------------------------------------------------------- */
12
13/*
a8e026c7 14 * raid6/algos.c
1da177e4
LT
15 *
16 * Algorithm list and algorithm selection for RAID-6
17 */
18
f701d589 19#include <linux/raid/pq.h>
1da177e4
LT
20#ifndef __KERNEL__
21#include <sys/mman.h>
d7e70ba4 22#include <stdio.h>
f701d589 23#else
f674ef7b 24#include <linux/module.h>
d5302fe4 25#include <linux/gfp.h>
f701d589
DW
26#if !RAID6_USE_EMPTY_ZERO_PAGE
27/* In .bss so it's zeroed */
28const char raid6_empty_zero_page[PAGE_SIZE] __attribute__((aligned(256)));
29EXPORT_SYMBOL(raid6_empty_zero_page);
30#endif
1da177e4
LT
31#endif
32
33struct raid6_calls raid6_call;
f701d589 34EXPORT_SYMBOL_GPL(raid6_call);
1da177e4 35
1da177e4 36const struct raid6_calls * const raid6_algos[] = {
1da177e4
LT
37#if defined(__ia64__)
38 &raid6_intx16,
39 &raid6_intx32,
40#endif
ca5cd877 41#if defined(__i386__) && !defined(__arch_um__)
1da177e4
LT
42 &raid6_mmxx1,
43 &raid6_mmxx2,
44 &raid6_sse1x1,
45 &raid6_sse1x2,
46 &raid6_sse2x1,
47 &raid6_sse2x2,
2c935842
YL
48#ifdef CONFIG_AS_AVX2
49 &raid6_avx2x1,
50 &raid6_avx2x2,
51#endif
1da177e4 52#endif
ca5cd877 53#if defined(__x86_64__) && !defined(__arch_um__)
1da177e4
LT
54 &raid6_sse2x1,
55 &raid6_sse2x2,
56 &raid6_sse2x4,
2c935842
YL
57#ifdef CONFIG_AS_AVX2
58 &raid6_avx2x1,
59 &raid6_avx2x2,
60 &raid6_avx2x4,
61#endif
1da177e4
LT
62#endif
63#ifdef CONFIG_ALTIVEC
64 &raid6_altivec1,
65 &raid6_altivec2,
66 &raid6_altivec4,
67 &raid6_altivec8,
ae77cbc1
KS
68#endif
69#if defined(CONFIG_TILEGX)
70 &raid6_tilegx8,
474fd6e8
MS
71#endif
72#if defined(CONFIG_S390)
73 &raid6_s390vx8,
1da177e4 74#endif
96e67703
JK
75 &raid6_intx1,
76 &raid6_intx2,
77 &raid6_intx4,
78 &raid6_intx8,
7d11965d
AB
79#ifdef CONFIG_KERNEL_MODE_NEON
80 &raid6_neonx1,
81 &raid6_neonx2,
82 &raid6_neonx4,
83 &raid6_neonx8,
84#endif
1da177e4
LT
85 NULL
86};
87
048a8b8c
JK
88void (*raid6_2data_recov)(int, size_t, int, int, void **);
89EXPORT_SYMBOL_GPL(raid6_2data_recov);
90
91void (*raid6_datap_recov)(int, size_t, int, void **);
92EXPORT_SYMBOL_GPL(raid6_datap_recov);
93
94const struct raid6_recov_calls *const raid6_recov_algos[] = {
7056741f
JK
95#ifdef CONFIG_AS_AVX2
96 &raid6_recov_avx2,
97#endif
75aaf4c3 98#ifdef CONFIG_AS_SSSE3
048a8b8c 99 &raid6_recov_ssse3,
f5b55fa1
MS
100#endif
101#ifdef CONFIG_S390
102 &raid6_recov_s390xc,
048a8b8c
JK
103#endif
104 &raid6_recov_intx1,
105 NULL
106};
107
1da177e4
LT
108#ifdef __KERNEL__
109#define RAID6_TIME_JIFFIES_LG2 4
110#else
111/* Need more time to be stable in userspace */
112#define RAID6_TIME_JIFFIES_LG2 9
f701d589 113#define time_before(x, y) ((x) < (y))
1da177e4
LT
114#endif
115
96e67703 116static inline const struct raid6_recov_calls *raid6_choose_recov(void)
048a8b8c
JK
117{
118 const struct raid6_recov_calls *const *algo;
119 const struct raid6_recov_calls *best;
120
121 for (best = NULL, algo = raid6_recov_algos; *algo; algo++)
122 if (!best || (*algo)->priority > best->priority)
123 if (!(*algo)->valid || (*algo)->valid())
124 best = *algo;
125
126 if (best) {
127 raid6_2data_recov = best->data2;
128 raid6_datap_recov = best->datap;
129
b395f75e 130 pr_info("raid6: using %s recovery algorithm\n", best->name);
048a8b8c 131 } else
b395f75e 132 pr_err("raid6: Yikes! No recovery algorithm found!\n");
048a8b8c 133
96e67703
JK
134 return best;
135}
1da177e4 136
96e67703
JK
137static inline const struct raid6_calls *raid6_choose_gen(
138 void *(*const dptrs)[(65536/PAGE_SIZE)+2], const int disks)
1da177e4 139{
fe5cbc6e
MS
140 unsigned long perf, bestgenperf, bestxorperf, j0, j1;
141 int start = (disks>>1)-1, stop = disks-3; /* work on the second half of the disks */
96e67703
JK
142 const struct raid6_calls *const *algo;
143 const struct raid6_calls *best;
1da177e4 144
fe5cbc6e 145 for (bestgenperf = 0, bestxorperf = 0, best = NULL, algo = raid6_algos; *algo; algo++) {
96e67703
JK
146 if (!best || (*algo)->prefer >= best->prefer) {
147 if ((*algo)->valid && !(*algo)->valid())
148 continue;
1da177e4 149
1da177e4
LT
150 perf = 0;
151
152 preempt_disable();
153 j0 = jiffies;
96e67703 154 while ((j1 = jiffies) == j0)
1da177e4 155 cpu_relax();
62b0559a
JL
156 while (time_before(jiffies,
157 j1 + (1<<RAID6_TIME_JIFFIES_LG2))) {
96e67703 158 (*algo)->gen_syndrome(disks, PAGE_SIZE, *dptrs);
1da177e4
LT
159 perf++;
160 }
161 preempt_enable();
162
fe5cbc6e
MS
163 if (perf > bestgenperf) {
164 bestgenperf = perf;
96e67703 165 best = *algo;
1da177e4 166 }
fe5cbc6e 167 pr_info("raid6: %-8s gen() %5ld MB/s\n", (*algo)->name,
1da177e4 168 (perf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2));
fe5cbc6e
MS
169
170 if (!(*algo)->xor_syndrome)
171 continue;
172
173 perf = 0;
174
175 preempt_disable();
176 j0 = jiffies;
177 while ((j1 = jiffies) == j0)
178 cpu_relax();
179 while (time_before(jiffies,
180 j1 + (1<<RAID6_TIME_JIFFIES_LG2))) {
181 (*algo)->xor_syndrome(disks, start, stop,
182 PAGE_SIZE, *dptrs);
183 perf++;
184 }
185 preempt_enable();
186
187 if (best == *algo)
188 bestxorperf = perf;
189
190 pr_info("raid6: %-8s xor() %5ld MB/s\n", (*algo)->name,
191 (perf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2+1));
1da177e4
LT
192 }
193 }
194
a5d6839b 195 if (best) {
fe5cbc6e 196 pr_info("raid6: using algorithm %s gen() %ld MB/s\n",
1da177e4 197 best->name,
fe5cbc6e
MS
198 (bestgenperf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2));
199 if (best->xor_syndrome)
200 pr_info("raid6: .... xor() %ld MB/s, rmw enabled\n",
201 (bestxorperf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2+1));
a5d6839b
AB
202 raid6_call = *best;
203 } else
b395f75e 204 pr_err("raid6: Yikes! No algorithm found!\n");
1da177e4 205
96e67703
JK
206 return best;
207}
208
209
210/* Try to pick the best algorithm */
211/* This code uses the gfmul table as convenient data set to abuse */
212
213int __init raid6_select_algo(void)
214{
215 const int disks = (65536/PAGE_SIZE)+2;
216
217 const struct raid6_calls *gen_best;
218 const struct raid6_recov_calls *rec_best;
219 char *syndromes;
220 void *dptrs[(65536/PAGE_SIZE)+2];
221 int i;
222
223 for (i = 0; i < disks-2; i++)
224 dptrs[i] = ((char *)raid6_gfmul) + PAGE_SIZE*i;
225
226 /* Normal code - use a 2-page allocation to avoid D$ conflict */
227 syndromes = (void *) __get_free_pages(GFP_KERNEL, 1);
228
229 if (!syndromes) {
b395f75e 230 pr_err("raid6: Yikes! No memory available.\n");
96e67703
JK
231 return -ENOMEM;
232 }
233
234 dptrs[disks-2] = syndromes;
235 dptrs[disks-1] = syndromes + PAGE_SIZE;
236
237 /* select raid gen_syndrome function */
238 gen_best = raid6_choose_gen(&dptrs, disks);
1da177e4 239
048a8b8c 240 /* select raid recover functions */
96e67703
JK
241 rec_best = raid6_choose_recov();
242
243 free_pages((unsigned long)syndromes, 1);
048a8b8c 244
96e67703 245 return gen_best && rec_best ? 0 : -EINVAL;
1da177e4 246}
f701d589
DW
247
248static void raid6_exit(void)
249{
250 do { } while (0);
251}
252
253subsys_initcall(raid6_select_algo);
254module_exit(raid6_exit);
255MODULE_LICENSE("GPL");
0efb9e61 256MODULE_DESCRIPTION("RAID6 Q-syndrome calculations");
This page took 1.18558 seconds and 5 git commands to generate.