Mercurial > hg > nginx

comparison src/core/ngx_sha1.c @ 6586:1064ea81ed3a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
An internal SHA1 implementation.
author Maxim Dounin <mdounin@mdounin.ru>
date Thu, 09 Jun 2016 16:55:38 +0300
parents
children 9eefb38f0005
comparison
equal deleted inserted replaced
6585:e511e3d581bb 6586:1064ea81ed3a
1
2 /*
3 * Copyright (C) Maxim Dounin
4 * Copyright (C) Nginx, Inc.
5 *
6 * An internal SHA1 implementation.
7 * It is not expected to be optimal and is used only
8 * if no SHA1 implementation was found in system.
9 */
10
11
12 #include <ngx_config.h>
13 #include <ngx_core.h>
14 #include <ngx_sha1.h>
15
16
17 #if !(NGX_HAVE_SHA1)
18
19 static const u_char *ngx_sha1_body(ngx_sha1_t *ctx, const u_char *data,
20 size_t size);
21
22
23 void
24 ngx_sha1_init(ngx_sha1_t *ctx)
25 {
26 ctx->a = 0x67452301;
27 ctx->b = 0xefcdab89;
28 ctx->c = 0x98badcfe;
29 ctx->d = 0x10325476;
30 ctx->e = 0xc3d2e1f0;
31
32 ctx->bytes = 0;
33 }
34
35
36 void
37 ngx_sha1_update(ngx_sha1_t *ctx, const void *data, size_t size)
38 {
39 size_t used, free;
40
41 used = (size_t) (ctx->bytes & 0x3f);
42 ctx->bytes += size;
43
44 if (used) {
45 free = 64 - used;
46
47 if (size < free) {
48 ngx_memcpy(&ctx->buffer[used], data, size);
49 return;
50 }
51
52 ngx_memcpy(&ctx->buffer[used], data, free);
53 data = (u_char *) data + free;
54 size -= free;
55 (void) ngx_sha1_body(ctx, ctx->buffer, 64);
56 }
57
58 if (size >= 64) {
59 data = ngx_sha1_body(ctx, data, size & ~(size_t) 0x3f);
60 size &= 0x3f;
61 }
62
63 ngx_memcpy(ctx->buffer, data, size);
64 }
65
66
67 void
68 ngx_sha1_final(u_char result[20], ngx_sha1_t *ctx)
69 {
70 size_t used, free;
71
72 used = (size_t) (ctx->bytes & 0x3f);
73
74 ctx->buffer[used++] = 0x80;
75
76 free = 64 - used;
77
78 if (free < 8) {
79 ngx_memzero(&ctx->buffer[used], free);
80 (void) ngx_sha1_body(ctx, ctx->buffer, 64);
81 used = 0;
82 free = 64;
83 }
84
85 ngx_memzero(&ctx->buffer[used], free - 8);
86
87 ctx->bytes <<= 3;
88 ctx->buffer[56] = (u_char) (ctx->bytes >> 56);
89 ctx->buffer[57] = (u_char) (ctx->bytes >> 48);
90 ctx->buffer[58] = (u_char) (ctx->bytes >> 40);
91 ctx->buffer[59] = (u_char) (ctx->bytes >> 32);
92 ctx->buffer[60] = (u_char) (ctx->bytes >> 24);
93 ctx->buffer[61] = (u_char) (ctx->bytes >> 16);
94 ctx->buffer[62] = (u_char) (ctx->bytes >> 8);
95 ctx->buffer[63] = (u_char) ctx->bytes;
96
97 (void) ngx_sha1_body(ctx, ctx->buffer, 64);
98
99 result[0] = (u_char) (ctx->a >> 24);
100 result[1] = (u_char) (ctx->a >> 16);
101 result[2] = (u_char) (ctx->a >> 8);
102 result[3] = (u_char) ctx->a;
103 result[4] = (u_char) (ctx->b >> 24);
104 result[5] = (u_char) (ctx->b >> 16);
105 result[6] = (u_char) (ctx->b >> 8);
106 result[7] = (u_char) ctx->b;
107 result[8] = (u_char) (ctx->c >> 24);
108 result[9] = (u_char) (ctx->c >> 16);
109 result[10] = (u_char) (ctx->c >> 8);
110 result[11] = (u_char) ctx->c;
111 result[12] = (u_char) (ctx->d >> 24);
112 result[13] = (u_char) (ctx->d >> 16);
113 result[14] = (u_char) (ctx->d >> 8);
114 result[15] = (u_char) ctx->d;
115 result[16] = (u_char) (ctx->e >> 24);
116 result[17] = (u_char) (ctx->e >> 16);
117 result[18] = (u_char) (ctx->e >> 8);
118 result[19] = (u_char) ctx->e;
119
120 ngx_memzero(ctx, sizeof(*ctx));
121 }
122
123
124 /*
125 * Helper functions.
126 */
127
128 #define ROTATE(bits, word) (((word) << (bits)) | ((word) >> (32 - (bits))))
129
130 #define F1(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
131 #define F2(b, c, d) ((b) ^ (c) ^ (d))
132 #define F3(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
133
134 #define STEP(f, a, b, c, d, e, w, t) \
135 temp = ROTATE(5, (a)) + f((b), (c), (d)) + (e) + (w) + (t); \
136 (e) = (d); \
137 (d) = (c); \
138 (c) = ROTATE(30, (b)); \
139 (b) = (a); \
140 (a) = temp;
141
142
143 /*
144 * GET() reads 4 input bytes in big-endian byte order and returns
145 * them as uint32_t.
146 */
147
148 #define GET(n) \
149 ((uint32_t) p[n * 4 + 3] | \
150 ((uint32_t) p[n * 4 + 2] << 8) | \
151 ((uint32_t) p[n * 4 + 1] << 16) | \
152 ((uint32_t) p[n * 4] << 24))
153
154
155 /*
156 * This processes one or more 64-byte data blocks, but does not update
157 * the bit counters. There are no alignment requirements.
158 */
159
160 static const u_char *
161 ngx_sha1_body(ngx_sha1_t *ctx, const u_char *data, size_t size)
162 {
163 uint32_t a, b, c, d, e, temp;
164 uint32_t saved_a, saved_b, saved_c, saved_d, saved_e;
165 uint32_t words[80];
166 ngx_uint_t i;
167 const u_char *p;
168
169 p = data;
170
171 a = ctx->a;
172 b = ctx->b;
173 c = ctx->c;
174 d = ctx->d;
175 e = ctx->e;
176
177 do {
178 saved_a = a;
179 saved_b = b;
180 saved_c = c;
181 saved_d = d;
182 saved_e = e;
183
184 /* Load data block into the words array */
185
186 for (i = 0; i < 16; i++) {
187 words[i] = GET(i);
188 }
189
190 for (i = 16; i < 80; i++) {
191 words[i] = ROTATE(1, words[i - 3] ^ words[i - 8] ^ words[i - 14]
192 ^ words[i - 16]);
193 }
194
195 /* Transformations */
196
197 STEP(F1, a, b, c, d, e, words[0], 0x5a827999);
198 STEP(F1, a, b, c, d, e, words[1], 0x5a827999);
199 STEP(F1, a, b, c, d, e, words[2], 0x5a827999);
200 STEP(F1, a, b, c, d, e, words[3], 0x5a827999);
201 STEP(F1, a, b, c, d, e, words[4], 0x5a827999);
202 STEP(F1, a, b, c, d, e, words[5], 0x5a827999);
203 STEP(F1, a, b, c, d, e, words[6], 0x5a827999);
204 STEP(F1, a, b, c, d, e, words[7], 0x5a827999);
205 STEP(F1, a, b, c, d, e, words[8], 0x5a827999);
206 STEP(F1, a, b, c, d, e, words[9], 0x5a827999);
207 STEP(F1, a, b, c, d, e, words[10], 0x5a827999);
208 STEP(F1, a, b, c, d, e, words[11], 0x5a827999);
209 STEP(F1, a, b, c, d, e, words[12], 0x5a827999);
210 STEP(F1, a, b, c, d, e, words[13], 0x5a827999);
211 STEP(F1, a, b, c, d, e, words[14], 0x5a827999);
212 STEP(F1, a, b, c, d, e, words[15], 0x5a827999);
213 STEP(F1, a, b, c, d, e, words[16], 0x5a827999);
214 STEP(F1, a, b, c, d, e, words[17], 0x5a827999);
215 STEP(F1, a, b, c, d, e, words[18], 0x5a827999);
216 STEP(F1, a, b, c, d, e, words[19], 0x5a827999);
217
218 STEP(F2, a, b, c, d, e, words[20], 0x6ed9eba1);
219 STEP(F2, a, b, c, d, e, words[21], 0x6ed9eba1);
220 STEP(F2, a, b, c, d, e, words[22], 0x6ed9eba1);
221 STEP(F2, a, b, c, d, e, words[23], 0x6ed9eba1);
222 STEP(F2, a, b, c, d, e, words[24], 0x6ed9eba1);
223 STEP(F2, a, b, c, d, e, words[25], 0x6ed9eba1);
224 STEP(F2, a, b, c, d, e, words[26], 0x6ed9eba1);
225 STEP(F2, a, b, c, d, e, words[27], 0x6ed9eba1);
226 STEP(F2, a, b, c, d, e, words[28], 0x6ed9eba1);
227 STEP(F2, a, b, c, d, e, words[29], 0x6ed9eba1);
228 STEP(F2, a, b, c, d, e, words[30], 0x6ed9eba1);
229 STEP(F2, a, b, c, d, e, words[31], 0x6ed9eba1);
230 STEP(F2, a, b, c, d, e, words[32], 0x6ed9eba1);
231 STEP(F2, a, b, c, d, e, words[33], 0x6ed9eba1);
232 STEP(F2, a, b, c, d, e, words[34], 0x6ed9eba1);
233 STEP(F2, a, b, c, d, e, words[35], 0x6ed9eba1);
234 STEP(F2, a, b, c, d, e, words[36], 0x6ed9eba1);
235 STEP(F2, a, b, c, d, e, words[37], 0x6ed9eba1);
236 STEP(F2, a, b, c, d, e, words[38], 0x6ed9eba1);
237 STEP(F2, a, b, c, d, e, words[39], 0x6ed9eba1);
238
239 STEP(F3, a, b, c, d, e, words[40], 0x8f1bbcdc);
240 STEP(F3, a, b, c, d, e, words[41], 0x8f1bbcdc);
241 STEP(F3, a, b, c, d, e, words[42], 0x8f1bbcdc);
242 STEP(F3, a, b, c, d, e, words[43], 0x8f1bbcdc);
243 STEP(F3, a, b, c, d, e, words[44], 0x8f1bbcdc);
244 STEP(F3, a, b, c, d, e, words[45], 0x8f1bbcdc);
245 STEP(F3, a, b, c, d, e, words[46], 0x8f1bbcdc);
246 STEP(F3, a, b, c, d, e, words[47], 0x8f1bbcdc);
247 STEP(F3, a, b, c, d, e, words[48], 0x8f1bbcdc);
248 STEP(F3, a, b, c, d, e, words[49], 0x8f1bbcdc);
249 STEP(F3, a, b, c, d, e, words[50], 0x8f1bbcdc);
250 STEP(F3, a, b, c, d, e, words[51], 0x8f1bbcdc);
251 STEP(F3, a, b, c, d, e, words[52], 0x8f1bbcdc);
252 STEP(F3, a, b, c, d, e, words[53], 0x8f1bbcdc);
253 STEP(F3, a, b, c, d, e, words[54], 0x8f1bbcdc);
254 STEP(F3, a, b, c, d, e, words[55], 0x8f1bbcdc);
255 STEP(F3, a, b, c, d, e, words[56], 0x8f1bbcdc);
256 STEP(F3, a, b, c, d, e, words[57], 0x8f1bbcdc);
257 STEP(F3, a, b, c, d, e, words[58], 0x8f1bbcdc);
258 STEP(F3, a, b, c, d, e, words[59], 0x8f1bbcdc);
259
260 STEP(F2, a, b, c, d, e, words[60], 0xca62c1d6);
261 STEP(F2, a, b, c, d, e, words[61], 0xca62c1d6);
262 STEP(F2, a, b, c, d, e, words[62], 0xca62c1d6);
263 STEP(F2, a, b, c, d, e, words[63], 0xca62c1d6);
264 STEP(F2, a, b, c, d, e, words[64], 0xca62c1d6);
265 STEP(F2, a, b, c, d, e, words[65], 0xca62c1d6);
266 STEP(F2, a, b, c, d, e, words[66], 0xca62c1d6);
267 STEP(F2, a, b, c, d, e, words[67], 0xca62c1d6);
268 STEP(F2, a, b, c, d, e, words[68], 0xca62c1d6);
269 STEP(F2, a, b, c, d, e, words[69], 0xca62c1d6);
270 STEP(F2, a, b, c, d, e, words[70], 0xca62c1d6);
271 STEP(F2, a, b, c, d, e, words[71], 0xca62c1d6);
272 STEP(F2, a, b, c, d, e, words[72], 0xca62c1d6);
273 STEP(F2, a, b, c, d, e, words[73], 0xca62c1d6);
274 STEP(F2, a, b, c, d, e, words[74], 0xca62c1d6);
275 STEP(F2, a, b, c, d, e, words[75], 0xca62c1d6);
276 STEP(F2, a, b, c, d, e, words[76], 0xca62c1d6);
277 STEP(F2, a, b, c, d, e, words[77], 0xca62c1d6);
278 STEP(F2, a, b, c, d, e, words[78], 0xca62c1d6);
279 STEP(F2, a, b, c, d, e, words[79], 0xca62c1d6);
280
281 a += saved_a;
282 b += saved_b;
283 c += saved_c;
284 d += saved_d;
285 e += saved_e;
286
287 p += 64;
288
289 } while (size -= 64);
290
291 ctx->a = a;
292 ctx->b = b;
293 ctx->c = c;
294 ctx->d = d;
295 ctx->e = e;
296
297 return p;
298 }
299
300 #endif