1 /* -*- linux-c -*- ------------------------------------------------------- *
3 * Copyright 2002 H. Peter Anvin - All Rights Reserved
4 * Copyright 2012 Tilera Corporation - All Rights Reserved
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, Inc., 53 Temple Place Ste 330,
9 * Boston MA 02111-1307, USA; either version 2 of the License, or
10 * (at your option) any later version; incorporated herein by reference.
12 * ----------------------------------------------------------------------- */
17 * $#-way unrolled TILE-Gx SIMD for RAID-6 math.
19 * This file is postprocessed using unroll.awk.
23 #include <linux/raid/pq.h>
25 /* Create 8 byte copies of constant byte */
26 # define NBYTES(x) (__insn_v1addi(0, x))
30 * The SHLBYTE() operation shifts each byte left by 1, *not*
31 * rolling over into the next byte
33 static inline __attribute_const__ u64 SHLBYTE(u64 v)
35 /* Vector One Byte Shift Left Immediate. */
36 return __insn_v1shli(v, 1);
40 * The MASK() operation returns 0xFF in any byte for which the high
41 * bit is 1, 0x00 for any byte for which the high bit is 0.
43 static inline __attribute_const__ u64 MASK(u64 v)
45 /* Vector One Byte Shift Right Signed Immediate. */
46 return __insn_v1shrsi(v, 7);
50 void raid6_tilegx$#_gen_syndrome(int disks, size_t bytes, void **ptrs)
52 u8 **dptr = (u8 **)ptrs;
56 u64 wd$$, wq$$, wp$$, w1$$, w2$$;
57 u64 x1d = NBYTES(0x1d);
60 z0 = disks - 3; /* Highest data disk */
61 p = (u64 *)dptr[z0+1]; /* XOR parity */
62 q = (u64 *)dptr[z0+2]; /* RS syndrome */
64 z0ptr = (u64 *)&dptr[z0][0];
65 for ( d = 0 ; d < bytes ; d += NSIZE*$# ) {
66 wq$$ = wp$$ = *z0ptr++;
67 for ( z = z0-1 ; z >= 0 ; z-- ) {
68 wd$$ = *(u64 *)&dptr[z][d+$$*NSIZE];
81 const struct raid6_calls raid6_tilegx$# = {
82 raid6_tilegx$#_gen_syndrome,
83 NULL, /* XOR not yet implemented */