Mercurial > audlegacy-plugins
comparison src/flac113/libflac/md5.c @ 715:a9b178bc4ae4 trunk
[svn] Import flac. Please test.
author | js |
---|---|
date | Sat, 24 Feb 2007 10:20:58 -0800 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
714:e758e9d4f861 | 715:a9b178bc4ae4 |
---|---|
1 /* | |
2 * This code implements the MD5 message-digest algorithm. | |
3 * The algorithm is due to Ron Rivest. This code was | |
4 * written by Colin Plumb in 1993, no copyright is claimed. | |
5 * This code is in the public domain; do with it what you wish. | |
6 * | |
7 * Equivalent code is available from RSA Data Security, Inc. | |
8 * This code has been tested against that, and is equivalent, | |
9 * except that you don't need to include two pages of legalese | |
10 * with every copy. | |
11 * | |
12 * To compute the message digest of a chunk of bytes, declare an | |
13 * MD5Context structure, pass it to MD5Init, call MD5Update as | |
14 * needed on buffers full of bytes, and then call MD5Final, which | |
15 * will fill a supplied 16-byte array with the digest. | |
16 * | |
17 * Changed so as no longer to depend on Colin Plumb's `usual.h' header | |
18 * definitions; now uses stuff from dpkg's config.h. | |
19 * - Ian Jackson <ijackson@nyx.cs.du.edu>. | |
20 * Still in the public domain. | |
21 * | |
22 * Josh Coalson: made some changes to integrate with libFLAC. | |
23 * Still in the public domain. | |
24 */ | |
25 | |
26 #if HAVE_CONFIG_H | |
27 # include <config.h> | |
28 #endif | |
29 | |
30 #include <stdlib.h> /* for malloc() */ | |
31 #include <string.h> /* for memcpy() */ | |
32 | |
33 #include "private/md5.h" | |
34 | |
35 #ifndef FLaC__INLINE | |
36 #define FLaC__INLINE | |
37 #endif | |
38 | |
39 static FLAC__bool is_big_endian_host_; | |
40 | |
41 #ifndef ASM_MD5 | |
42 | |
43 /* The four core functions - F1 is optimized somewhat */ | |
44 | |
45 /* #define F1(x, y, z) (x & y | ~x & z) */ | |
46 #define F1(x, y, z) (z ^ (x & (y ^ z))) | |
47 #define F2(x, y, z) F1(z, x, y) | |
48 #define F3(x, y, z) (x ^ y ^ z) | |
49 #define F4(x, y, z) (y ^ (x | ~z)) | |
50 | |
51 /* This is the central step in the MD5 algorithm. */ | |
52 #define MD5STEP(f,w,x,y,z,in,s) \ | |
53 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x) | |
54 | |
55 /* | |
56 * The core of the MD5 algorithm, this alters an existing MD5 hash to | |
57 * reflect the addition of 16 longwords of new data. MD5Update blocks | |
58 * the data and converts bytes into longwords for this routine. | |
59 */ | |
60 void | |
61 FLAC__MD5Transform(FLAC__uint32 buf[4], FLAC__uint32 const in[16]) | |
62 { | |
63 register FLAC__uint32 a, b, c, d; | |
64 | |
65 a = buf[0]; | |
66 b = buf[1]; | |
67 c = buf[2]; | |
68 d = buf[3]; | |
69 | |
70 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); | |
71 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); | |
72 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); | |
73 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); | |
74 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); | |
75 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); | |
76 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); | |
77 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); | |
78 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); | |
79 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); | |
80 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); | |
81 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); | |
82 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); | |
83 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); | |
84 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); | |
85 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); | |
86 | |
87 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); | |
88 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); | |
89 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); | |
90 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); | |
91 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); | |
92 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); | |
93 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); | |
94 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); | |
95 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); | |
96 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); | |
97 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); | |
98 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); | |
99 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); | |
100 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); | |
101 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); | |
102 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); | |
103 | |
104 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); | |
105 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); | |
106 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); | |
107 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); | |
108 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); | |
109 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); | |
110 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); | |
111 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); | |
112 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); | |
113 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); | |
114 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); | |
115 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); | |
116 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); | |
117 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); | |
118 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); | |
119 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); | |
120 | |
121 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); | |
122 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); | |
123 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); | |
124 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); | |
125 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); | |
126 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); | |
127 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); | |
128 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); | |
129 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); | |
130 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); | |
131 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); | |
132 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); | |
133 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); | |
134 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); | |
135 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); | |
136 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); | |
137 | |
138 buf[0] += a; | |
139 buf[1] += b; | |
140 buf[2] += c; | |
141 buf[3] += d; | |
142 } | |
143 | |
144 #endif | |
145 | |
146 FLaC__INLINE | |
147 void | |
148 byteSwap(FLAC__uint32 *buf, unsigned words) | |
149 { | |
150 md5byte *p = (md5byte *)buf; | |
151 | |
152 if(!is_big_endian_host_) | |
153 return; | |
154 do { | |
155 *buf++ = (FLAC__uint32)((unsigned)p[3] << 8 | p[2]) << 16 | ((unsigned)p[1] << 8 | p[0]); | |
156 p += 4; | |
157 } while (--words); | |
158 } | |
159 | |
160 /* | |
161 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious | |
162 * initialization constants. | |
163 */ | |
164 void | |
165 FLAC__MD5Init(struct FLAC__MD5Context *ctx) | |
166 { | |
167 FLAC__uint32 test = 1; | |
168 | |
169 is_big_endian_host_ = (*((FLAC__byte*)(&test)))? false : true; | |
170 | |
171 ctx->buf[0] = 0x67452301; | |
172 ctx->buf[1] = 0xefcdab89; | |
173 ctx->buf[2] = 0x98badcfe; | |
174 ctx->buf[3] = 0x10325476; | |
175 | |
176 ctx->bytes[0] = 0; | |
177 ctx->bytes[1] = 0; | |
178 | |
179 ctx->internal_buf = 0; | |
180 ctx->capacity = 0; | |
181 } | |
182 | |
183 /* | |
184 * Update context to reflect the concatenation of another buffer full | |
185 * of bytes. | |
186 */ | |
187 void | |
188 FLAC__MD5Update(struct FLAC__MD5Context *ctx, md5byte const *buf, unsigned len) | |
189 { | |
190 FLAC__uint32 t; | |
191 | |
192 /* Update byte count */ | |
193 | |
194 t = ctx->bytes[0]; | |
195 if ((ctx->bytes[0] = t + len) < t) | |
196 ctx->bytes[1]++; /* Carry from low to high */ | |
197 | |
198 t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */ | |
199 if (t > len) { | |
200 memcpy((md5byte *)ctx->in + 64 - t, buf, len); | |
201 return; | |
202 } | |
203 /* First chunk is an odd size */ | |
204 memcpy((md5byte *)ctx->in + 64 - t, buf, t); | |
205 byteSwap(ctx->in, 16); | |
206 FLAC__MD5Transform(ctx->buf, ctx->in); | |
207 buf += t; | |
208 len -= t; | |
209 | |
210 /* Process data in 64-byte chunks */ | |
211 while (len >= 64) { | |
212 memcpy(ctx->in, buf, 64); | |
213 byteSwap(ctx->in, 16); | |
214 FLAC__MD5Transform(ctx->buf, ctx->in); | |
215 buf += 64; | |
216 len -= 64; | |
217 } | |
218 | |
219 /* Handle any remaining bytes of data. */ | |
220 memcpy(ctx->in, buf, len); | |
221 } | |
222 | |
223 /* | |
224 * Convert the incoming audio signal to a byte stream and FLAC__MD5Update it. | |
225 */ | |
226 FLAC__bool | |
227 FLAC__MD5Accumulate(struct FLAC__MD5Context *ctx, const FLAC__int32 * const signal[], unsigned channels, unsigned samples, unsigned bytes_per_sample) | |
228 { | |
229 unsigned channel, sample, a_byte; | |
230 FLAC__int32 a_word; | |
231 FLAC__byte *buf_; | |
232 const unsigned bytes_needed = channels * samples * bytes_per_sample; | |
233 | |
234 if(ctx->capacity < bytes_needed) { | |
235 FLAC__byte *tmp = (FLAC__byte*)realloc(ctx->internal_buf, bytes_needed); | |
236 if(0 == tmp) { | |
237 free(ctx->internal_buf); | |
238 if(0 == (ctx->internal_buf = (FLAC__byte*)malloc(bytes_needed))) | |
239 return false; | |
240 } | |
241 ctx->internal_buf = tmp; | |
242 ctx->capacity = bytes_needed; | |
243 } | |
244 | |
245 buf_ = ctx->internal_buf; | |
246 | |
247 #ifdef FLAC__CPU_IA32 | |
248 if(channels == 2 && bytes_per_sample == 2) { | |
249 memcpy(buf_, signal[0], sizeof(FLAC__int32) * samples); | |
250 buf_ += sizeof(FLAC__int16); | |
251 for(sample = 0; sample < samples; sample++) | |
252 ((FLAC__int16 *)buf_)[2 * sample] = (FLAC__int16)signal[1][sample]; | |
253 } | |
254 else if(channels == 1 && bytes_per_sample == 2) { | |
255 for(sample = 0; sample < samples; sample++) | |
256 ((FLAC__int16 *)buf_)[sample] = (FLAC__int16)signal[0][sample]; | |
257 } | |
258 else | |
259 #endif | |
260 for(sample = 0; sample < samples; sample++) { | |
261 for(channel = 0; channel < channels; channel++) { | |
262 a_word = signal[channel][sample]; | |
263 for(a_byte = 0; a_byte < bytes_per_sample; a_byte++) { | |
264 *buf_++ = (FLAC__byte)(a_word & 0xff); | |
265 a_word >>= 8; | |
266 } | |
267 } | |
268 } | |
269 | |
270 FLAC__MD5Update(ctx, ctx->internal_buf, bytes_needed); | |
271 | |
272 return true; | |
273 } | |
274 | |
275 /* | |
276 * Final wrapup - pad to 64-byte boundary with the bit pattern | |
277 * 1 0* (64-bit count of bits processed, MSB-first) | |
278 */ | |
279 void | |
280 FLAC__MD5Final(md5byte digest[16], struct FLAC__MD5Context *ctx) | |
281 { | |
282 int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */ | |
283 md5byte *p = (md5byte *)ctx->in + count; | |
284 | |
285 /* Set the first char of padding to 0x80. There is always room. */ | |
286 *p++ = 0x80; | |
287 | |
288 /* Bytes of padding needed to make 56 bytes (-8..55) */ | |
289 count = 56 - 1 - count; | |
290 | |
291 if (count < 0) { /* Padding forces an extra block */ | |
292 memset(p, 0, count + 8); | |
293 byteSwap(ctx->in, 16); | |
294 FLAC__MD5Transform(ctx->buf, ctx->in); | |
295 p = (md5byte *)ctx->in; | |
296 count = 56; | |
297 } | |
298 memset(p, 0, count); | |
299 byteSwap(ctx->in, 14); | |
300 | |
301 /* Append length in bits and transform */ | |
302 ctx->in[14] = ctx->bytes[0] << 3; | |
303 ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29; | |
304 FLAC__MD5Transform(ctx->buf, ctx->in); | |
305 | |
306 byteSwap(ctx->buf, 4); | |
307 memcpy(digest, ctx->buf, 16); | |
308 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */ | |
309 if(0 != ctx->internal_buf) { | |
310 free(ctx->internal_buf); | |
311 ctx->internal_buf = 0; | |
312 ctx->capacity = 0; | |
313 } | |
314 } |