lib/raid6/algos.c

   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 /*
  14  * raid6/algos.c
  15  *
  16  * Algorithm list and algorithm selection for RAID-6
  17  */
  18
  19 #include <linux/raid/pq.h>
  20 #ifndef __KERNEL__
  21 #include <sys/mman.h>
  22 #include <stdio.h>
  23 #else
  24 #include <linux/module.h>
  25 #include <linux/gfp.h>
  26 #if !RAID6_USE_EMPTY_ZERO_PAGE
  27 /* In .bss so it's zeroed */
  28 const char raid6_empty_zero_page[PAGE_SIZE] __attribute__((aligned(256)));
  29 EXPORT_SYMBOL(raid6_empty_zero_page);
  30 #endif
  31 #endif
  32
  33 struct raid6_calls raid6_call;
  34 EXPORT_SYMBOL_GPL(raid6_call);
  35
  36 const struct raid6_calls * const raid6_algos[] = {
  37 #if defined(__ia64__)
  38         &raid6_intx16,
  39         &raid6_intx32,
  40 #endif
  41 #if defined(__i386__) && !defined(__arch_um__)
  42         &raid6_mmxx1,
  43         &raid6_mmxx2,
  44         &raid6_sse1x1,
  45         &raid6_sse1x2,
  46         &raid6_sse2x1,
  47         &raid6_sse2x2,
  48 #ifdef CONFIG_AS_AVX2
  49         &raid6_avx2x1,
  50         &raid6_avx2x2,
  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 #endif
  63 #ifdef CONFIG_ALTIVEC
  64         &raid6_altivec1,
  65         &raid6_altivec2,
  66         &raid6_altivec4,
  67         &raid6_altivec8,
  68 #endif
  69 #if defined(CONFIG_TILEGX)
  70         &raid6_tilegx8,
  71 #endif
  72 #if defined(CONFIG_S390)
  73         &raid6_s390vx8,
  74 #endif
  75         &raid6_intx1,
  76         &raid6_intx2,
  77         &raid6_intx4,
  78         &raid6_intx8,
  79 #ifdef CONFIG_KERNEL_MODE_NEON
  80         &raid6_neonx1,
  81         &raid6_neonx2,
  82         &raid6_neonx4,
  83         &raid6_neonx8,
  84 #endif
  85         NULL
  86 };
  87
  88 void (*raid6_2data_recov)(int, size_t, int, int, void **);
  89 EXPORT_SYMBOL_GPL(raid6_2data_recov);
  90
  91 void (*raid6_datap_recov)(int, size_t, int, void **);
  92 EXPORT_SYMBOL_GPL(raid6_datap_recov);
  93
  94 const struct raid6_recov_calls *const raid6_recov_algos[] = {
  95 #ifdef CONFIG_AS_AVX2
  96         &raid6_recov_avx2,
  97 #endif
  98 #ifdef CONFIG_AS_SSSE3
  99         &raid6_recov_ssse3,
 100 #endif
 101 #ifdef CONFIG_S390
 102         &raid6_recov_s390xc,
 103 #endif
 104         &raid6_recov_intx1,
 105         NULL
 106 };
 107
 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
 113 #define time_before(x, y) ((x) < (y))
 114 #endif
 115
 116 static inline const struct raid6_recov_calls *raid6_choose_recov(void)
 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
 130                 pr_info("raid6: using %s recovery algorithm\n", best->name);
 131         } else
 132                 pr_err("raid6: Yikes! No recovery algorithm found!\n");
 133
 134         return best;
 135 }
 136
 137 static inline const struct raid6_calls *raid6_choose_gen(
 138         void *(*const dptrs)[(65536/PAGE_SIZE)+2], const int disks)
 139 {
 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 */
 142         const struct raid6_calls *const *algo;
 143         const struct raid6_calls *best;
 144
 145         for (bestgenperf = 0, bestxorperf = 0, best = NULL, algo = raid6_algos; *algo; algo++) {
 146                 if (!best || (*algo)->prefer >= best->prefer) {
 147                         if ((*algo)->valid && !(*algo)->valid())
 148                                 continue;
 149
 150                         perf = 0;
 151
 152                         preempt_disable();
 153                         j0 = jiffies;
 154                         while ((j1 = jiffies) == j0)
 155                                 cpu_relax();
 156                         while (time_before(jiffies,
 157                                             j1 + (1<<RAID6_TIME_JIFFIES_LG2))) {
 158                                 (*algo)->gen_syndrome(disks, PAGE_SIZE, *dptrs);
 159                                 perf++;
 160                         }
 161                         preempt_enable();
 162
 163                         if (perf > bestgenperf) {
 164                                 bestgenperf = perf;
 165                                 best = *algo;
 166                         }
 167                         pr_info("raid6: %-8s gen() %5ld MB/s\n", (*algo)->name,
 168                                (perf*HZ) >> (20-16+RAID6_TIME_JIFFIES_LG2));
 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));
 192                 }
 193         }
 194
 195         if (best) {
 196                 pr_info("raid6: using algorithm %s gen() %ld MB/s\n",
 197                        best->name,
 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));
 202                 raid6_call = *best;
 203         } else
 204                 pr_err("raid6: Yikes!  No algorithm found!\n");
 205
 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
 213 int __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) {
 230                 pr_err("raid6: Yikes!  No memory available.\n");
 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);
 239
 240         /* select raid recover functions */
 241         rec_best = raid6_choose_recov();
 242
 243         free_pages((unsigned long)syndromes, 1);
 244
 245         return gen_best && rec_best ? 0 : -EINVAL;
 246 }
 247
 248 static void raid6_exit(void)
 249 {
 250         do { } while (0);
 251 }
 252
 253 subsys_initcall(raid6_select_algo);
 254 module_exit(raid6_exit);
 255 MODULE_LICENSE("GPL");
 256 MODULE_DESCRIPTION("RAID6 Q-syndrome calculations");