Lines Matching +full:- +full:e
32 slower code, even if they're little-endian.
42 but assumes little-endianness.
61 register uint32_t A, B, C, D, E; in SHA1_Transform() local
64 A = ctx->state[0]; in SHA1_Transform()
65 B = ctx->state[1]; in SHA1_Transform()
66 C = ctx->state[2]; in SHA1_Transform()
67 D = ctx->state[3]; in SHA1_Transform()
68 E = ctx->state[4]; in SHA1_Transform()
70 #define SHA_F1(A, B, C, D, E, t) \ in SHA1_Transform() argument
71 E += ror27(A) + (W[t] = bswap_32(ctx->buf.w[t])) + (D ^ (B & (C ^ D))) + \ in SHA1_Transform()
76 SHA_F1(A, B, C, D, E, t + 0); in SHA1_Transform()
77 SHA_F1(E, A, B, C, D, t + 1); in SHA1_Transform()
78 SHA_F1(D, E, A, B, C, t + 2); in SHA1_Transform()
79 SHA_F1(C, D, E, A, B, t + 3); in SHA1_Transform()
80 SHA_F1(B, C, D, E, A, t + 4); in SHA1_Transform()
82 SHA_F1(A, B, C, D, E, t + 0); /* 16th one, t == 15 */ in SHA1_Transform()
86 #define SHA_F1(A, B, C, D, E, t) \ in SHA1_Transform() argument
87 E += \ in SHA1_Transform()
88 ror27(A) + (W[t] = ror31(W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16])) + \ in SHA1_Transform()
92 SHA_F1(E, A, B, C, D, t + 1); in SHA1_Transform()
93 SHA_F1(D, E, A, B, C, t + 2); in SHA1_Transform()
94 SHA_F1(C, D, E, A, B, t + 3); in SHA1_Transform()
95 SHA_F1(B, C, D, E, A, t + 4); in SHA1_Transform()
99 #define SHA_F2(A, B, C, D, E, t) \ in SHA1_Transform() argument
100 E += \ in SHA1_Transform()
101 ror27(A) + (W[t] = ror31(W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16])) + \ in SHA1_Transform()
106 SHA_F2(A, B, C, D, E, t + 0); in SHA1_Transform()
107 SHA_F2(E, A, B, C, D, t + 1); in SHA1_Transform()
108 SHA_F2(D, E, A, B, C, t + 2); in SHA1_Transform()
109 SHA_F2(C, D, E, A, B, t + 3); in SHA1_Transform()
110 SHA_F2(B, C, D, E, A, t + 4); in SHA1_Transform()
115 #define SHA_F3(A, B, C, D, E, t) \ in SHA1_Transform() argument
116 E += \ in SHA1_Transform()
117 ror27(A) + (W[t] = ror31(W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16])) + \ in SHA1_Transform()
122 SHA_F3(A, B, C, D, E, t + 0); in SHA1_Transform()
123 SHA_F3(E, A, B, C, D, t + 1); in SHA1_Transform()
124 SHA_F3(D, E, A, B, C, t + 2); in SHA1_Transform()
125 SHA_F3(C, D, E, A, B, t + 3); in SHA1_Transform()
126 SHA_F3(B, C, D, E, A, t + 4); in SHA1_Transform()
131 #define SHA_F4(A, B, C, D, E, t) \ in SHA1_Transform() argument
132 E += \ in SHA1_Transform()
133 ror27(A) + (W[t] = ror31(W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16])) + \ in SHA1_Transform()
138 SHA_F4(A, B, C, D, E, t + 0); in SHA1_Transform()
139 SHA_F4(E, A, B, C, D, t + 1); in SHA1_Transform()
140 SHA_F4(D, E, A, B, C, t + 2); in SHA1_Transform()
141 SHA_F4(C, D, E, A, B, t + 3); in SHA1_Transform()
142 SHA_F4(B, C, D, E, A, t + 4); in SHA1_Transform()
147 ctx->state[0] += A; in SHA1_Transform()
148 ctx->state[1] += B; in SHA1_Transform()
149 ctx->state[2] += C; in SHA1_Transform()
150 ctx->state[3] += D; in SHA1_Transform()
151 ctx->state[4] += E; in SHA1_Transform()
156 int i = ctx->count % sizeof(ctx->buf); in SHA_update()
159 ctx->count += len; in SHA_update()
161 while (len > sizeof(ctx->buf) - i) { in SHA_update()
162 memcpy(&ctx->buf.b[i], p, sizeof(ctx->buf) - i); in SHA_update()
163 len -= sizeof(ctx->buf) - i; in SHA_update()
164 p += sizeof(ctx->buf) - i; in SHA_update()
169 while (len--) { in SHA_update()
170 ctx->buf.b[i++] = *p++; in SHA_update()
171 if (i == sizeof(ctx->buf)) { in SHA_update()
180 uint64_t cnt = ctx->count * 8; in SHA_final()
184 while ((ctx->count % sizeof(ctx->buf)) != (sizeof(ctx->buf) - 8)) { in SHA_final()
188 uint8_t tmp = cnt >> ((7 - i) * 8); in SHA_final()
193 ctx->buf.w[i] = bswap_32(ctx->state[i]); in SHA_final()
196 return ctx->buf.b; in SHA_final()
201 #define rol(bits, value) (((value) << (bits)) | ((value) >> (32 - (bits))))
206 uint32_t A, B, C, D, E; in SHA1_transform() local
207 uint8_t *p = ctx->buf; in SHA1_transform()
219 W[t] = rol(1, W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16]); in SHA1_transform()
222 A = ctx->state[0]; in SHA1_transform()
223 B = ctx->state[1]; in SHA1_transform()
224 C = ctx->state[2]; in SHA1_transform()
225 D = ctx->state[3]; in SHA1_transform()
226 E = ctx->state[4]; in SHA1_transform()
229 uint32_t tmp = rol(5, A) + E + W[t]; in SHA1_transform()
240 E = D; in SHA1_transform()
247 ctx->state[0] += A; in SHA1_transform()
248 ctx->state[1] += B; in SHA1_transform()
249 ctx->state[2] += C; in SHA1_transform()
250 ctx->state[3] += D; in SHA1_transform()
251 ctx->state[4] += E; in SHA1_transform()
256 int i = ctx->count % sizeof(ctx->buf); in SHA_update()
259 ctx->count += len; in SHA_update()
261 while (len--) { in SHA_update()
262 ctx->buf[i++] = *p++; in SHA_update()
263 if (i == sizeof(ctx->buf)) { in SHA_update()
271 uint8_t *p = ctx->buf; in SHA_final()
272 uint64_t cnt = ctx->count * 8; in SHA_final()
276 while ((ctx->count % sizeof(ctx->buf)) != (sizeof(ctx->buf) - 8)) { in SHA_final()
280 uint8_t tmp = cnt >> ((7 - i) * 8); in SHA_final()
285 uint32_t tmp = ctx->state[i]; in SHA_final()
292 return ctx->buf; in SHA_final()
299 ctx->state[0] = 0x67452301; in SHA_init()
300 ctx->state[1] = 0xEFCDAB89; in SHA_init()
301 ctx->state[2] = 0x98BADCFE; in SHA_init()
302 ctx->state[3] = 0x10325476; in SHA_init()
303 ctx->state[4] = 0xC3D2E1F0; in SHA_init()
304 ctx->count = 0; in SHA_init()