5 #include <stdlib.h> /* for malloc() */
6 #include <string.h> /* for memcpy() */
8 #include "private/md5.h"
15 * This code implements the MD5 message-digest algorithm.
16 * The algorithm is due to Ron Rivest. This code was
17 * written by Colin Plumb in 1993, no copyright is claimed.
18 * This code is in the public domain; do with it what you wish.
20 * Equivalent code is available from RSA Data Security, Inc.
21 * This code has been tested against that, and is equivalent,
22 * except that you don't need to include two pages of legalese
25 * To compute the message digest of a chunk of bytes, declare an
26 * MD5Context structure, pass it to MD5Init, call MD5Update as
27 * needed on buffers full of bytes, and then call MD5Final, which
28 * will fill a supplied 16-byte array with the digest.
30 * Changed so as no longer to depend on Colin Plumb's `usual.h' header
31 * definitions; now uses stuff from dpkg's config.h.
32 * - Ian Jackson <ijackson@nyx.cs.du.edu>.
33 * Still in the public domain.
35 * Josh Coalson: made some changes to integrate with libFLAC.
36 * Still in the public domain.
39 /* The four core functions - F1 is optimized somewhat */
41 /* #define F1(x, y, z) (x & y | ~x & z) */
42 #define F1(x, y, z) (z ^ (x & (y ^ z)))
43 #define F2(x, y, z) F1(z, x, y)
44 #define F3(x, y, z) (x ^ y ^ z)
45 #define F4(x, y, z) (y ^ (x | ~z))
47 /* This is the central step in the MD5 algorithm. */
48 #define MD5STEP(f,w,x,y,z,in,s) \
49 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x)
52 * The core of the MD5 algorithm, this alters an existing MD5 hash to
53 * reflect the addition of 16 longwords of new data. MD5Update blocks
54 * the data and converts bytes into longwords for this routine.
56 static void FLAC__MD5Transform(FLAC__uint32 buf[4], FLAC__uint32 const in[16])
58 register FLAC__uint32 a, b, c, d;
65 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
66 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
67 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
68 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
69 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
70 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
71 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
72 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
73 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
74 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
75 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
76 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
77 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
78 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
79 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
80 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
82 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
83 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
84 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
85 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
86 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
87 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
88 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
89 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
90 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
91 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
92 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
93 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
94 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
95 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
96 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
97 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
99 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
100 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
101 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
102 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
103 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
104 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
105 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
106 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
107 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
108 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
109 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
110 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
111 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
112 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
113 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
114 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
116 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
117 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
118 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
119 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
120 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
121 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
122 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
123 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
124 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
125 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
126 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
127 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
128 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
129 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
130 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
131 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
140 //@@@@@@ OPT: use bswap/intrinsics
141 FLaC__INLINE static void byteSwap(FLAC__uint32 *buf, unsigned words)
144 FLAC__byte *p = (FLAC__byte *)buf;
145 *buf++ = (FLAC__uint32)((unsigned)p[3] << 8 | p[2]) << 16 | ((unsigned)p[1] << 8 | p[0]);
150 #define byteSwap(buf, words)
154 * Update context to reflect the concatenation of another buffer full
157 static void FLAC__MD5Update(FLAC__MD5Context *ctx, FLAC__byte const *buf, unsigned len)
161 /* Update byte count */
164 if ((ctx->bytes[0] = t + len) < t)
165 ctx->bytes[1]++; /* Carry from low to high */
167 t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */
169 memcpy((FLAC__byte *)ctx->in + 64 - t, buf, len);
172 /* First chunk is an odd size */
173 memcpy((FLAC__byte *)ctx->in + 64 - t, buf, t);
174 byteSwap(ctx->in, 16);
175 FLAC__MD5Transform(ctx->buf, ctx->in);
179 /* Process data in 64-byte chunks */
181 memcpy(ctx->in, buf, 64);
182 byteSwap(ctx->in, 16);
183 FLAC__MD5Transform(ctx->buf, ctx->in);
188 /* Handle any remaining bytes of data. */
189 memcpy(ctx->in, buf, len);
193 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
194 * initialization constants.
196 void FLAC__MD5Init(FLAC__MD5Context *ctx)
198 ctx->buf[0] = 0x67452301;
199 ctx->buf[1] = 0xefcdab89;
200 ctx->buf[2] = 0x98badcfe;
201 ctx->buf[3] = 0x10325476;
206 ctx->internal_buf = 0;
211 * Final wrapup - pad to 64-byte boundary with the bit pattern
212 * 1 0* (64-bit count of bits processed, MSB-first)
214 void FLAC__MD5Final(FLAC__byte digest[16], FLAC__MD5Context *ctx)
216 int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */
217 FLAC__byte *p = (FLAC__byte *)ctx->in + count;
219 /* Set the first char of padding to 0x80. There is always room. */
222 /* Bytes of padding needed to make 56 bytes (-8..55) */
223 count = 56 - 1 - count;
225 if (count < 0) { /* Padding forces an extra block */
226 memset(p, 0, count + 8);
227 byteSwap(ctx->in, 16);
228 FLAC__MD5Transform(ctx->buf, ctx->in);
229 p = (FLAC__byte *)ctx->in;
233 byteSwap(ctx->in, 14);
235 /* Append length in bits and transform */
236 ctx->in[14] = ctx->bytes[0] << 3;
237 ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
238 FLAC__MD5Transform(ctx->buf, ctx->in);
240 byteSwap(ctx->buf, 4);
241 memcpy(digest, ctx->buf, 16);
242 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
243 if(0 != ctx->internal_buf) {
244 free(ctx->internal_buf);
245 ctx->internal_buf = 0;
251 * Convert the incoming audio signal to a byte stream
253 static void format_input_(FLAC__byte *buf, const FLAC__int32 * const signal[], unsigned channels, unsigned samples, unsigned bytes_per_sample)
255 unsigned channel, sample;
256 register FLAC__int32 a_word;
257 register FLAC__byte *buf_ = buf;
261 if(channels == 2 && bytes_per_sample == 2) {
262 FLAC__int16 *buf1_ = ((FLAC__int16*)buf_) + 1;
263 memcpy(buf_, signal[0], sizeof(FLAC__int32) * samples);
264 for(sample = 0; sample < samples; sample++, buf1_+=2)
265 *buf1_ = (FLAC__int16)signal[1][sample];
267 else if(channels == 1 && bytes_per_sample == 2) {
268 FLAC__int16 *buf1_ = (FLAC__int16*)buf_;
269 for(sample = 0; sample < samples; sample++)
270 *buf1_++ = (FLAC__int16)signal[0][sample];
274 if(bytes_per_sample == 2) {
276 for(sample = 0; sample < samples; sample++) {
277 a_word = signal[0][sample];
278 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
279 *buf_++ = (FLAC__byte)a_word;
280 a_word = signal[1][sample];
281 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
282 *buf_++ = (FLAC__byte)a_word;
285 else if(channels == 1) {
286 for(sample = 0; sample < samples; sample++) {
287 a_word = signal[0][sample];
288 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
289 *buf_++ = (FLAC__byte)a_word;
293 for(sample = 0; sample < samples; sample++) {
294 for(channel = 0; channel < channels; channel++) {
295 a_word = signal[channel][sample];
296 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
297 *buf_++ = (FLAC__byte)a_word;
302 else if(bytes_per_sample == 3) {
304 for(sample = 0; sample < samples; sample++) {
305 a_word = signal[0][sample];
306 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
307 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
308 *buf_++ = (FLAC__byte)a_word;
309 a_word = signal[1][sample];
310 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
311 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
312 *buf_++ = (FLAC__byte)a_word;
315 else if(channels == 1) {
316 for(sample = 0; sample < samples; sample++) {
317 a_word = signal[0][sample];
318 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
319 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
320 *buf_++ = (FLAC__byte)a_word;
324 for(sample = 0; sample < samples; sample++) {
325 for(channel = 0; channel < channels; channel++) {
326 a_word = signal[channel][sample];
327 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
328 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
329 *buf_++ = (FLAC__byte)a_word;
334 else if(bytes_per_sample == 1) {
336 for(sample = 0; sample < samples; sample++) {
337 a_word = signal[0][sample];
338 *buf_++ = (FLAC__byte)a_word;
339 a_word = signal[1][sample];
340 *buf_++ = (FLAC__byte)a_word;
343 else if(channels == 1) {
344 for(sample = 0; sample < samples; sample++) {
345 a_word = signal[0][sample];
346 *buf_++ = (FLAC__byte)a_word;
350 for(sample = 0; sample < samples; sample++) {
351 for(channel = 0; channel < channels; channel++) {
352 a_word = signal[channel][sample];
353 *buf_++ = (FLAC__byte)a_word;
358 else { /* bytes_per_sample == 4, maybe optimize more later */
359 for(sample = 0; sample < samples; sample++) {
360 for(channel = 0; channel < channels; channel++) {
361 a_word = signal[channel][sample];
362 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
363 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
364 *buf_++ = (FLAC__byte)a_word; a_word >>= 8;
365 *buf_++ = (FLAC__byte)a_word;
372 * Convert the incoming audio signal to a byte stream and FLAC__MD5Update it.
374 FLAC__bool FLAC__MD5Accumulate(FLAC__MD5Context *ctx, const FLAC__int32 * const signal[], unsigned channels, unsigned samples, unsigned bytes_per_sample)
376 const unsigned bytes_needed = channels * samples * bytes_per_sample;
378 if(ctx->capacity < bytes_needed) {
379 FLAC__byte *tmp = (FLAC__byte*)realloc(ctx->internal_buf, bytes_needed);
381 free(ctx->internal_buf);
382 if(0 == (ctx->internal_buf = (FLAC__byte*)malloc(bytes_needed)))
385 ctx->internal_buf = tmp;
386 ctx->capacity = bytes_needed;
389 format_input_(ctx->internal_buf, signal, channels, samples, bytes_per_sample);
391 FLAC__MD5Update(ctx, ctx->internal_buf, bytes_needed);