Lines Matching +full:39 +full:x

61  * The elements of GF(2^128) := GF(2)[X]/(X^128-X^7-X^2-X^1-1) can
72 * Every bit is a coefficient of some power of X. We can store the bits
75 * The above buffer represents the polynomial 1, and X^7+X^2+X^1+1 looks
82 * represents X^127. X^7+X^2+X^1+1 looks like 00000000 .... 10000111,
91 * endian). The above buffer represents X^7 in this case and the
103 * bbe on a little endian machine u32 x[4]:
105 * MS x[0] LS MS x[1] LS
109 * MS x[2] LS MS x[3] LS
111 * 39...32 47...40 55...48 63...56 07...00 15...08 23...16 31...24
115 * MS x[0] LS MS x[1] LS
117 * 31...24 23...16 15...08 07...00 63...56 55...48 47...40 39...32
119 * MS x[2] LS MS x[3] LS
133 /* Multiply a GF(2^128) field element by x. Field elements are
141 MS x[0] LS MS x[1] LS
143 24...31 16...23 08...15 00...07 56...63 48...55 40...47 32...39
145 MS x[2] LS MS x[3] LS
152 MS x[0] LS MS x[1] LS
154 00...07 08...15 16...23 24...31 32...39 40...47 48...55 56...63
156 MS x[2] LS MS x[3] LS
168 * The following functions multiply a field element by x in
176 static inline u64 gf128mul_mask_from_bit(u64 x, int which) in gf128mul_mask_from_bit() argument
178 /* a constant-time version of 'x & ((u64)1 << which) ? (u64)-1 : 0' */ in gf128mul_mask_from_bit()
179 return ((s64)(x << (63 - which)) >> 63); in gf128mul_mask_from_bit()
182 static inline void gf128mul_x_lle(be128 *r, const be128 *x) in gf128mul_x_lle() argument
184 u64 a = be64_to_cpu(x->a); in gf128mul_x_lle()
185 u64 b = be64_to_cpu(x->b); in gf128mul_x_lle()
195 static inline void gf128mul_x_bbe(be128 *r, const be128 *x) in gf128mul_x_bbe() argument
197 u64 a = be64_to_cpu(x->a); in gf128mul_x_bbe()
198 u64 b = be64_to_cpu(x->b); in gf128mul_x_bbe()
208 static inline void gf128mul_x_ble(le128 *r, const le128 *x) in gf128mul_x_ble() argument
210 u64 a = le64_to_cpu(x->a); in gf128mul_x_ble()
211 u64 b = le64_to_cpu(x->b); in gf128mul_x_ble()
230 void gf128mul_x8_ble(le128 *r, const le128 *x);