Lines Matching +full:8 +full:a
3 * Keyed 32-bit hash function using TEA in a Davis-Meyer function
23 /* a, b, c, d - data; h0, h1 - accumulated hash */
36 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
49 u32 a, b, c, d; in keyed_hash() local
55 pad = (u32) len | ((u32) len << 8); in keyed_hash()
59 a = (u32) msg[0] | in keyed_hash()
60 (u32) msg[1] << 8 | (u32) msg[2] << 16 | (u32) msg[3] << 24; in keyed_hash()
62 (u32) msg[5] << 8 | (u32) msg[6] << 16 | (u32) msg[7] << 24; in keyed_hash()
63 c = (u32) msg[8] | in keyed_hash()
64 (u32) msg[9] << 8 | in keyed_hash()
67 (u32) msg[13] << 8 | in keyed_hash()
77 a = (u32) msg[0] | in keyed_hash()
78 (u32) msg[1] << 8 | (u32) msg[2] << 16 | (u32) msg[3] << 24; in keyed_hash()
80 (u32) msg[5] << 8 | (u32) msg[6] << 16 | (u32) msg[7] << 24; in keyed_hash()
81 c = (u32) msg[8] | in keyed_hash()
82 (u32) msg[9] << 8 | in keyed_hash()
87 d <<= 8; in keyed_hash()
90 } else if (len >= 8) { in keyed_hash()
91 a = (u32) msg[0] | in keyed_hash()
92 (u32) msg[1] << 8 | (u32) msg[2] << 16 | (u32) msg[3] << 24; in keyed_hash()
94 (u32) msg[5] << 8 | (u32) msg[6] << 16 | (u32) msg[7] << 24; in keyed_hash()
97 for (i = 8; i < len; i++) { in keyed_hash()
98 c <<= 8; in keyed_hash()
102 a = (u32) msg[0] | in keyed_hash()
103 (u32) msg[1] << 8 | (u32) msg[2] << 16 | (u32) msg[3] << 24; in keyed_hash()
107 b <<= 8; in keyed_hash()
111 a = b = c = d = pad; in keyed_hash()
113 a <<= 8; in keyed_hash()
114 a |= msg[i]; in keyed_hash()
131 u32 a, c; in yura_hash() local
138 a = msg[0] - 48; in yura_hash()
140 a = (msg[0] - 48) * pow; in yura_hash()
146 a = a + c * pow; in yura_hash()
153 a = a + c * pow; in yura_hash()
160 a = a + c * pow; in yura_hash()
163 a = a << 7; in yura_hash()
164 return a; in yura_hash()
169 u32 a = 0; in r5_hash() local
171 a += *msg << 4; in r5_hash()
172 a += *msg >> 4; in r5_hash()
173 a *= 11; in r5_hash()
176 return a; in r5_hash()