Searched refs:be128_xor (Results 1 - 6 of 6) sorted by relevance
| /kernel/linux/linux-5.10/crypto/ |
| H A D | gf128mul.c | 184 be128_xor(r, r, &p[0]); in gf128mul_lle()
186 be128_xor(r, r, &p[1]); in gf128mul_lle()
188 be128_xor(r, r, &p[2]); in gf128mul_lle()
190 be128_xor(r, r, &p[3]); in gf128mul_lle()
192 be128_xor(r, r, &p[4]); in gf128mul_lle()
194 be128_xor(r, r, &p[5]); in gf128mul_lle()
196 be128_xor(r, r, &p[6]); in gf128mul_lle()
198 be128_xor(r, r, &p[7]); in gf128mul_lle()
222 be128_xor(r, r, &p[7]); in gf128mul_bbe()
224 be128_xor( in gf128mul_bbe()
[all...] |
| H A D | lrw.c | 177 be128_xor(wdst++, &t, wsrc++); in lrw_xor_tweak()
181 be128_xor(&t, &t, in lrw_xor_tweak()
|
| /kernel/linux/linux-6.6/lib/crypto/ |
| H A D | gf128mul.c | 187 * most common). This ensures that each be128_xor() call in the loop in gf128mul_lle()
191 * making each be128_xor() a NOP if its associated bit in 'ch' is not in gf128mul_lle()
192 * set, and this is equivalent to calling be128_xor() conditionally. in gf128mul_lle()
211 be128_xor(r, r, &p[ 0 + !(ch & 0x80)]); in gf128mul_lle()
212 be128_xor(r, r, &p[ 2 + !(ch & 0x40)]); in gf128mul_lle()
213 be128_xor(r, r, &p[ 4 + !(ch & 0x20)]); in gf128mul_lle()
214 be128_xor(r, r, &p[ 6 + !(ch & 0x10)]); in gf128mul_lle()
215 be128_xor(r, r, &p[ 8 + !(ch & 0x08)]); in gf128mul_lle()
216 be128_xor(r, r, &p[10 + !(ch & 0x04)]); in gf128mul_lle()
217 be128_xor( in gf128mul_lle()
[all...] |
| /kernel/linux/linux-5.10/include/crypto/ |
| H A D | b128ops.h | 70 static inline void be128_xor(be128 *r, const be128 *p, const be128 *q) in be128_xor() function
|
| /kernel/linux/linux-6.6/include/crypto/ |
| H A D | b128ops.h | 60 static inline void be128_xor(be128 *r, const be128 *p, const be128 *q) in be128_xor() function
|
| /kernel/linux/linux-6.6/crypto/ |
| H A D | lrw.c | 177 be128_xor(wdst++, &t, wsrc++); in lrw_xor_tweak()
181 be128_xor(&t, &t, in lrw_xor_tweak()
|
Completed in 6 milliseconds