/usr/include/gf2x/gf2x_mul1.h is in libgf2x-dev 1.2-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 | /* This file is part of the gf2x library.
Copyright 2007, 2008, 2009, 2010, 2012, 2013, 2015
Richard Brent, Pierrick Gaudry, Emmanuel Thome', Paul Zimmermann
This program is free software; you can redistribute it and/or modify it
under the terms of either:
- If the archive contains a file named toom-gpl.c (not a trivial
placeholder), the GNU General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at your
option) any later version.
- If the archive contains a file named toom-gpl.c which is a trivial
placeholder, the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the license text for more details.
You should have received a copy of the GNU General Public License as
well as the GNU Lesser General Public License along with this program;
see the files COPYING and COPYING.LIB. If not, write to the Free
Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#ifndef GF2X_MUL1_H_
#define GF2X_MUL1_H_
/* This file was generated automatically with
./gen_bb_mul_code 64 3. Don't edit it! */
#include "gf2x.h"
/* All gf2x source files for lowlevel functions must include gf2x-small.h
* This is mandatory for the tuning mechanism. */
#include "gf2x/gf2x-small.h"
GF2X_STORAGE_CLASS_mul1 void
gf2x_mul1 (unsigned long *c, unsigned long a, unsigned long b)
{
unsigned long hi, lo, tmp, A[8];
A[0] = 0; A[1] = a;
A[2] = A[1] << 1; A[3] = A[2] ^ a;
A[4] = A[2] << 1; A[5] = A[4] ^ a;
A[6] = A[3] << 1; A[7] = A[6] ^ a;
lo = (A[b >> 63] << 3) ^ A[(b >> 60) & 7];
hi = lo >> 58;
lo = (lo << 6) ^ (A[(b >> 57) & 7] << 3) ^ A[(b >> 54) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 51) & 7] << 3) ^ A[(b >> 48) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 45) & 7] << 3) ^ A[(b >> 42) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 39) & 7] << 3) ^ A[(b >> 36) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 33) & 7] << 3) ^ A[(b >> 30) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 27) & 7] << 3) ^ A[(b >> 24) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 21) & 7] << 3) ^ A[(b >> 18) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 15) & 7] << 3) ^ A[(b >> 12) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 9) & 7] << 3) ^ A[(b >> 6) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 3) & 7] << 3) ^ A[b & 7];
tmp = -((a >> 63) & 1);
tmp &= ((b & 0xefbefbefbefbefbe) >> 1);
hi = hi ^ tmp;
tmp = -((a >> 62) & 1);
tmp &= ((b & 0xcf3cf3cf3cf3cf3c) >> 2);
hi = hi ^ tmp;
tmp = -((a >> 61) & 1);
tmp &= ((b & 0x8e38e38e38e38e38) >> 3);
hi = hi ^ tmp;
tmp = -((a >> 60) & 1);
tmp &= ((b & 0xc30c30c30c30c30) >> 4);
hi = hi ^ tmp;
tmp = -((a >> 59) & 1);
tmp &= ((b & 0x820820820820820) >> 5);
hi = hi ^ tmp;
c[0] = lo;
c[1] = hi;
}
GF2X_STORAGE_CLASS_mul_1_n unsigned long
gf2x_mul_1_n (unsigned long *cp, const unsigned long *bp, long sb, unsigned long a)
{
long i;
unsigned long carry = 0, b;
unsigned long hi, lo, tmp, A[8];
A[0] = 0; A[1] = a;
A[2] = A[1] << 1; A[3] = A[2] ^ a;
A[4] = A[2] << 1; A[5] = A[4] ^ a;
A[6] = A[3] << 1; A[7] = A[6] ^ a;
for (i = 0; i < sb; i++)
{
b = bp[i];
lo = (A[b >> 63] << 3) ^ A[(b >> 60) & 7];
hi = lo >> 58;
lo = (lo << 6) ^ (A[(b >> 57) & 7] << 3) ^ A[(b >> 54) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 51) & 7] << 3) ^ A[(b >> 48) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 45) & 7] << 3) ^ A[(b >> 42) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 39) & 7] << 3) ^ A[(b >> 36) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 33) & 7] << 3) ^ A[(b >> 30) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 27) & 7] << 3) ^ A[(b >> 24) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 21) & 7] << 3) ^ A[(b >> 18) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 15) & 7] << 3) ^ A[(b >> 12) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 9) & 7] << 3) ^ A[(b >> 6) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 3) & 7] << 3) ^ A[b & 7];
tmp = -((a >> 63) & 1);
tmp &= ((b & 0xefbefbefbefbefbe) >> 1);
hi = hi ^ tmp;
tmp = -((a >> 62) & 1);
tmp &= ((b & 0xcf3cf3cf3cf3cf3c) >> 2);
hi = hi ^ tmp;
tmp = -((a >> 61) & 1);
tmp &= ((b & 0x8e38e38e38e38e38) >> 3);
hi = hi ^ tmp;
tmp = -((a >> 60) & 1);
tmp &= ((b & 0xc30c30c30c30c30) >> 4);
hi = hi ^ tmp;
tmp = -((a >> 59) & 1);
tmp &= ((b & 0x820820820820820) >> 5);
hi = hi ^ tmp;
cp[i] = carry ^ lo;
carry = hi;
}
return carry;
}
GF2X_STORAGE_CLASS_addmul_1_n unsigned long
gf2x_addmul_1_n (unsigned long *dp, const unsigned long *cp, const unsigned long* bp, long sb,
unsigned long a)
{
long i;
unsigned long carry = 0, b;
unsigned long hi, lo, tmp, A[8];
A[0] = 0; A[1] = a;
A[2] = A[1] << 1; A[3] = A[2] ^ a;
A[4] = A[2] << 1; A[5] = A[4] ^ a;
A[6] = A[3] << 1; A[7] = A[6] ^ a;
for (i = 0; i < sb; i++)
{
b = bp[i];
lo = (A[b >> 63] << 3) ^ A[(b >> 60) & 7];
hi = lo >> 58;
lo = (lo << 6) ^ (A[(b >> 57) & 7] << 3) ^ A[(b >> 54) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 51) & 7] << 3) ^ A[(b >> 48) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 45) & 7] << 3) ^ A[(b >> 42) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 39) & 7] << 3) ^ A[(b >> 36) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 33) & 7] << 3) ^ A[(b >> 30) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 27) & 7] << 3) ^ A[(b >> 24) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 21) & 7] << 3) ^ A[(b >> 18) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 15) & 7] << 3) ^ A[(b >> 12) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 9) & 7] << 3) ^ A[(b >> 6) & 7];
hi = (hi << 6) | (lo >> 58);
lo = (lo << 6) ^ (A[(b >> 3) & 7] << 3) ^ A[b & 7];
tmp = -((a >> 63) & 1);
tmp &= ((b & 0xefbefbefbefbefbe) >> 1);
hi = hi ^ tmp;
tmp = -((a >> 62) & 1);
tmp &= ((b & 0xcf3cf3cf3cf3cf3c) >> 2);
hi = hi ^ tmp;
tmp = -((a >> 61) & 1);
tmp &= ((b & 0x8e38e38e38e38e38) >> 3);
hi = hi ^ tmp;
tmp = -((a >> 60) & 1);
tmp &= ((b & 0xc30c30c30c30c30) >> 4);
hi = hi ^ tmp;
tmp = -((a >> 59) & 1);
tmp &= ((b & 0x820820820820820) >> 5);
hi = hi ^ tmp;
dp[i] = cp[i] ^ (carry ^ lo);
carry = hi;
}
return carry;
}
#endif /* GF2X_MUL1_H_ */
|