Mercurial > dovecot > original-hg > dovecot-1.2
annotate src/lib/sha1.c @ 8572:9ec2882243a6 HEAD
Try to use (Apple) gcc's __BIG_ENDIAN__ and __LITTLE_ENDIAN__ macros if possible.
Based on a patch by Apple.
author | Timo Sirainen <tss@iki.fi> |
---|---|
date | Fri, 19 Dec 2008 08:50:14 +0200 |
parents | a8b515e1a26f |
children |
rev | line source |
---|---|
2370 | 1 /* $KAME: sha1.c,v 1.5 2000/11/08 06:13:08 itojun Exp $ */ |
2 /* | |
3 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. | |
4 * All rights reserved. | |
5 * | |
6 * Redistribution and use in source and binary forms, with or without | |
7 * modification, are permitted provided that the following conditions | |
8 * are met: | |
9 * 1. Redistributions of source code must retain the above copyright | |
10 * notice, this list of conditions and the following disclaimer. | |
11 * 2. Redistributions in binary form must reproduce the above copyright | |
12 * notice, this list of conditions and the following disclaimer in the | |
13 * documentation and/or other materials provided with the distribution. | |
14 * 3. Neither the name of the project nor the names of its contributors | |
15 * may be used to endorse or promote products derived from this software | |
16 * without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND | |
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE | |
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
28 * SUCH DAMAGE. | |
29 */ | |
30 | |
31 /* | |
32 * FIPS pub 180-1: Secure Hash Algorithm (SHA-1) | |
33 * based on: http://csrc.nist.gov/fips/fip180-1.txt | |
34 * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org> | |
35 */ | |
36 | |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
37 #include "lib.h" |
2370 | 38 #include "sha1.h" |
39 #include "safe-memset.h" | |
40 | |
41 /* constant table */ | |
6420
a8b515e1a26f
Removed _ prefixes from function names.
Timo Sirainen <tss@iki.fi>
parents:
3452
diff
changeset
|
42 static uint32_t SHA1_K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 }; |
a8b515e1a26f
Removed _ prefixes from function names.
Timo Sirainen <tss@iki.fi>
parents:
3452
diff
changeset
|
43 #define K(t) SHA1_K[(t) / 20] |
2370 | 44 |
45 #define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d))) | |
46 #define F1(b, c, d) (((b) ^ (c)) ^ (d)) | |
47 #define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d))) | |
48 #define F3(b, c, d) (((b) ^ (c)) ^ (d)) | |
49 | |
50 #define S(n, x) (((x) << (n)) | ((x) >> (32 - n))) | |
51 | |
52 #define H(n) (ctxt->h.b32[(n)]) | |
53 #define COUNT (ctxt->count) | |
54 #define BCOUNT (ctxt->c.b64[0] / 8) | |
55 #define W(n) (ctxt->m.b32[(n)]) | |
56 | |
57 #define PUTBYTE(x) { \ | |
58 ctxt->m.b8[(COUNT % 64)] = (x); \ | |
59 COUNT++; \ | |
60 COUNT %= 64; \ | |
61 ctxt->c.b64[0] += 8; \ | |
62 if (COUNT % 64 == 0) \ | |
63 sha1_step(ctxt); \ | |
64 } | |
65 | |
66 #define PUTPAD(x) { \ | |
67 ctxt->m.b8[(COUNT % 64)] = (x); \ | |
68 COUNT++; \ | |
69 COUNT %= 64; \ | |
70 if (COUNT % 64 == 0) \ | |
71 sha1_step(ctxt); \ | |
72 } | |
73 | |
74 static void sha1_step(struct sha1_ctxt *); | |
75 | |
76 static void | |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
77 sha1_step(struct sha1_ctxt *ctxt) |
2370 | 78 { |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
79 uint32_t a, b, c, d, e; |
2370 | 80 size_t t, s; |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
81 uint32_t tmp; |
2370 | 82 |
8572
9ec2882243a6
Try to use (Apple) gcc's __BIG_ENDIAN__ and __LITTLE_ENDIAN__ macros if possible.
Timo Sirainen <tss@iki.fi>
parents:
6420
diff
changeset
|
83 #if !WORDS_BIGENDIAN |
2370 | 84 struct sha1_ctxt tctxt; |
85 memmove(&tctxt.m.b8[0], &ctxt->m.b8[0], 64); | |
86 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2]; | |
87 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0]; | |
88 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6]; | |
89 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4]; | |
90 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10]; | |
91 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8]; | |
92 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14]; | |
93 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12]; | |
94 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18]; | |
95 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16]; | |
96 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22]; | |
97 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20]; | |
98 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26]; | |
99 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24]; | |
100 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30]; | |
101 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28]; | |
102 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34]; | |
103 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32]; | |
104 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38]; | |
105 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36]; | |
106 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42]; | |
107 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40]; | |
108 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46]; | |
109 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44]; | |
110 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50]; | |
111 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48]; | |
112 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54]; | |
113 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52]; | |
114 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58]; | |
115 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56]; | |
116 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62]; | |
117 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60]; | |
118 #endif | |
119 | |
120 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4); | |
121 | |
122 for (t = 0; t < 20; t++) { | |
123 s = t & 0x0f; | |
124 if (t >= 16) { | |
125 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
126 } | |
127 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t); | |
128 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
129 } | |
130 for (t = 20; t < 40; t++) { | |
131 s = t & 0x0f; | |
132 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
133 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t); | |
134 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
135 } | |
136 for (t = 40; t < 60; t++) { | |
137 s = t & 0x0f; | |
138 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
139 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t); | |
140 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
141 } | |
142 for (t = 60; t < 80; t++) { | |
143 s = t & 0x0f; | |
144 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); | |
145 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t); | |
146 e = d; d = c; c = S(30, b); b = a; a = tmp; | |
147 } | |
148 | |
149 H(0) = H(0) + a; | |
150 H(1) = H(1) + b; | |
151 H(2) = H(2) + c; | |
152 H(3) = H(3) + d; | |
153 H(4) = H(4) + e; | |
154 | |
155 memset(&ctxt->m.b8[0], 0, 64); | |
156 } | |
157 | |
158 /*------------------------------------------------------------*/ | |
159 | |
160 void | |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
161 sha1_init(struct sha1_ctxt *ctxt) |
2370 | 162 { |
163 memset(ctxt, 0, sizeof(struct sha1_ctxt)); | |
164 H(0) = 0x67452301; | |
165 H(1) = 0xefcdab89; | |
166 H(2) = 0x98badcfe; | |
167 H(3) = 0x10325476; | |
168 H(4) = 0xc3d2e1f0; | |
169 } | |
170 | |
171 void | |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
172 sha1_pad(struct sha1_ctxt *ctxt) |
2370 | 173 { |
174 size_t padlen; /*pad length in bytes*/ | |
175 size_t padstart; | |
176 | |
177 PUTPAD(0x80); | |
178 | |
179 padstart = COUNT % 64; | |
180 padlen = 64 - padstart; | |
181 if (padlen < 8) { | |
182 memset(&ctxt->m.b8[padstart], 0, padlen); | |
183 COUNT += padlen; | |
184 COUNT %= 64; | |
185 sha1_step(ctxt); | |
186 padstart = COUNT % 64; /* should be 0 */ | |
187 padlen = 64 - padstart; /* should be 64 */ | |
188 } | |
189 memset(&ctxt->m.b8[padstart], 0, padlen - 8); | |
190 COUNT += (padlen - 8); | |
191 COUNT %= 64; | |
8572
9ec2882243a6
Try to use (Apple) gcc's __BIG_ENDIAN__ and __LITTLE_ENDIAN__ macros if possible.
Timo Sirainen <tss@iki.fi>
parents:
6420
diff
changeset
|
192 #if WORDS_BIGENDIAN |
2370 | 193 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]); |
194 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]); | |
195 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]); | |
196 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]); | |
197 #else | |
198 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]); | |
199 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]); | |
200 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]); | |
201 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]); | |
202 #endif | |
203 } | |
204 | |
205 void | |
2628
59059ea978b2
Change src from unsigned char* toi void* so callers don't have to do
Timo Sirainen <tss@iki.fi>
parents:
2385
diff
changeset
|
206 sha1_loop(struct sha1_ctxt *ctxt, const void *input, size_t len) |
2370 | 207 { |
2628
59059ea978b2
Change src from unsigned char* toi void* so callers don't have to do
Timo Sirainen <tss@iki.fi>
parents:
2385
diff
changeset
|
208 const unsigned char *input_c = input; |
2370 | 209 size_t gaplen; |
210 size_t gapstart; | |
211 size_t off; | |
212 size_t copysiz; | |
213 | |
214 off = 0; | |
215 | |
216 while (off < len) { | |
217 gapstart = COUNT % 64; | |
218 gaplen = 64 - gapstart; | |
219 | |
220 copysiz = (gaplen < len - off) ? gaplen : len - off; | |
2628
59059ea978b2
Change src from unsigned char* toi void* so callers don't have to do
Timo Sirainen <tss@iki.fi>
parents:
2385
diff
changeset
|
221 memmove(&ctxt->m.b8[gapstart], &input_c[off], copysiz); |
2370 | 222 COUNT += copysiz; |
223 COUNT %= 64; | |
224 ctxt->c.b64[0] += copysiz * 8; | |
225 if (COUNT % 64 == 0) | |
226 sha1_step(ctxt); | |
227 off += copysiz; | |
228 } | |
229 } | |
230 | |
231 void | |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
232 sha1_result(struct sha1_ctxt *ctxt, void *digest0) |
2370 | 233 { |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
234 uint8_t *digest; |
2370 | 235 |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
236 digest = (uint8_t *)digest0; |
2370 | 237 sha1_pad(ctxt); |
8572
9ec2882243a6
Try to use (Apple) gcc's __BIG_ENDIAN__ and __LITTLE_ENDIAN__ macros if possible.
Timo Sirainen <tss@iki.fi>
parents:
6420
diff
changeset
|
238 #if WORDS_BIGENDIAN |
2370 | 239 memmove(digest, &ctxt->h.b8[0], 20); |
240 #else | |
241 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2]; | |
242 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0]; | |
243 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6]; | |
244 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4]; | |
245 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10]; | |
246 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8]; | |
247 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14]; | |
248 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12]; | |
249 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18]; | |
250 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16]; | |
251 #endif | |
252 safe_memset(ctxt, 0, sizeof(struct sha1_ctxt)); | |
253 } | |
254 | |
2385
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
255 void sha1_get_digest(const void *data, size_t size, |
161a9e818ad6
Changed to use standard uint* types rather than u_int*. Also removed
Timo Sirainen <tss@iki.fi>
parents:
2370
diff
changeset
|
256 unsigned char result[SHA1_RESULTLEN]) |
2370 | 257 { |
258 struct sha1_ctxt ctx; | |
259 | |
260 sha1_init(&ctx); | |
261 sha1_loop(&ctx, data, size); | |
262 sha1_result(&ctx, result); | |
263 } |