raid6.c

   1 /* -*- linux-c -*- ------------------------------------------------------- *
   2  *
   3  *   Copyright 2002-2004 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  * raid6int1.c
  15  *
  16  * 1-way unrolled portable integer math RAID-6 instruction set
  17  *
  18  * This file was postprocessed using unroll.pl and then ported to userspace
  19  */
  20 #include <stdint.h>
  21 #include <unistd.h>
  22 #include "kerncompat.h"
  23 #include "ctree.h"
  24 #include "disk-io.h"
  25
  26 /*
  27  * This is the C data type to use
  28  */
  29
  30 /* Change this from BITS_PER_LONG if there is something better... */
  31 #if BITS_PER_LONG == 64
  32 # define NBYTES(x) ((x) * 0x0101010101010101UL)
  33 # define NSIZE  8
  34 # define NSHIFT 3
  35 typedef uint64_t unative_t;
  36 #else
  37 # define NBYTES(x) ((x) * 0x01010101U)
  38 # define NSIZE  4
  39 # define NSHIFT 2
  40 typedef uint32_t unative_t;
  41 #endif
  42
  43 /*
  44  * These sub-operations are separate inlines since they can sometimes be
  45  * specially optimized using architecture-specific hacks.
  46  */
  47
  48 /*
  49  * The SHLBYTE() operation shifts each byte left by 1, *not*
  50  * rolling over into the next byte
  51  */
  52 static inline __attribute_const__ unative_t SHLBYTE(unative_t v)
  53 {
  54         unative_t vv;
  55
  56         vv = (v << 1) & NBYTES(0xfe);
  57         return vv;
  58 }
  59
  60 /*
  61  * The MASK() operation returns 0xFF in any byte for which the high
  62  * bit is 1, 0x00 for any byte for which the high bit is 0.
  63  */
  64 static inline __attribute_const__ unative_t MASK(unative_t v)
  65 {
  66         unative_t vv;
  67
  68         vv = v & NBYTES(0x80);
  69         vv = (vv << 1) - (vv >> 7); /* Overflow on the top bit is OK */
  70         return vv;
  71 }
  72
  73
  74 void raid6_gen_syndrome(int disks, size_t bytes, void **ptrs)
  75 {
  76         uint8_t **dptr = (uint8_t **)ptrs;
  77         uint8_t *p, *q;
  78         int d, z, z0;
  79
  80         unative_t wd0, wq0, wp0, w10, w20;
  81
  82         z0 = disks - 3;         /* Highest data disk */
  83         p = dptr[z0+1];         /* XOR parity */
  84         q = dptr[z0+2];         /* RS syndrome */
  85
  86         for ( d = 0 ; d < bytes ; d += NSIZE*1 ) {
  87                 wq0 = wp0 = *(unative_t *)&dptr[z0][d+0*NSIZE];
  88                 for ( z = z0-1 ; z >= 0 ; z-- ) {
  89                         wd0 = *(unative_t *)&dptr[z][d+0*NSIZE];
  90                         wp0 ^= wd0;
  91                         w20 = MASK(wq0);
  92                         w10 = SHLBYTE(wq0);
  93                         w20 &= NBYTES(0x1d);
  94                         w10 ^= w20;
  95                         wq0 = w10 ^ wd0;
  96                 }
  97                 *(unative_t *)&p[d+NSIZE*0] = wp0;
  98                 *(unative_t *)&q[d+NSIZE*0] = wq0;
  99         }
 100 }
 101