Mercurial > audlegacy
comparison src/libaudutil/md5.c @ 4570:5586782f9dfe
Added libaudutil for functionality that does not fit into plugin API, but
does not belong into the core either.
author | Matti Hamalainen <ccr@tnsp.org> |
---|---|
date | Wed, 21 May 2008 08:54:18 +0300 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
4569:273e15b0d9c1 | 4570:5586782f9dfe |
---|---|
1 /* | |
2 * MD5 implementation, modified for Audacious from | |
3 * Colin Plumb's implementation by Matti 'ccr' Hämäläinen. | |
4 * | |
5 * This code implements the MD5 message-digest algorithm. | |
6 * The algorithm is due to Ron Rivest. This code was | |
7 * written by Colin Plumb in 1993, no copyright is claimed. | |
8 * This code is in the public domain; do with it what you wish. | |
9 */ | |
10 #include "audutil.h" | |
11 #include <string.h> | |
12 | |
13 | |
14 #if G_BYTE_ORDER == G_LITTLE_ENDIAN | |
15 #define aud_md5_bytereverse(buf, len) /* Nothing */ | |
16 #else | |
17 #if G_BYTE_ORDER == G_BIG_ENDIAN | |
18 static void aud_md5_bytereverse(guint8 *buf, guint l) | |
19 { | |
20 guint32 t; | |
21 do { | |
22 t = (guint32) ((guint) buf[3] << 8 | buf[2]) << 16 | ((guint) buf[1] << 8 | buf[0]); | |
23 *(guint32 *) buf = t; | |
24 buf += sizeof(guint32); | |
25 } while (--l); | |
26 } | |
27 #else | |
28 #error Unsupported endianess! | |
29 #endif | |
30 #endif | |
31 | |
32 | |
33 /* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious | |
34 * initialization constants. | |
35 */ | |
36 void aud_md5_init(aud_md5state_t *ctx) | |
37 { | |
38 ctx->buf[0] = 0x67452301; | |
39 ctx->buf[1] = 0xefcdab89; | |
40 ctx->buf[2] = 0x98badcfe; | |
41 ctx->buf[3] = 0x10325476; | |
42 | |
43 ctx->bits[0] = 0; | |
44 ctx->bits[1] = 0; | |
45 } | |
46 | |
47 | |
48 /* The core of the MD5 algorithm, this alters an existing MD5 hash to | |
49 * reflect the addition of 16 longwords of new data. aud_md5_update blocks | |
50 * the data and converts bytes into longwords for this routine. | |
51 */ | |
52 #define F1(x, y, z) (z ^ (x & (y ^ z))) | |
53 #define F2(x, y, z) F1(z, x, y) | |
54 #define F3(x, y, z) (x ^ y ^ z) | |
55 #define F4(x, y, z) (y ^ (x | ~z)) | |
56 #define MD5STEP(f, w, x, y, z, data, s) \ | |
57 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) | |
58 | |
59 static void aud_md5_transform(guint32 buf[4], guint32 const in[16]) | |
60 { | |
61 register guint32 a, b, c, d; | |
62 | |
63 a = buf[0]; | |
64 b = buf[1]; | |
65 c = buf[2]; | |
66 d = buf[3]; | |
67 | |
68 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); | |
69 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); | |
70 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); | |
71 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); | |
72 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); | |
73 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); | |
74 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); | |
75 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); | |
76 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); | |
77 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); | |
78 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); | |
79 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); | |
80 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); | |
81 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); | |
82 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); | |
83 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); | |
84 | |
85 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); | |
86 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); | |
87 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); | |
88 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); | |
89 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); | |
90 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); | |
91 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); | |
92 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); | |
93 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); | |
94 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); | |
95 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); | |
96 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); | |
97 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); | |
98 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); | |
99 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); | |
100 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); | |
101 | |
102 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); | |
103 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); | |
104 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); | |
105 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); | |
106 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); | |
107 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); | |
108 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); | |
109 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); | |
110 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); | |
111 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); | |
112 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); | |
113 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); | |
114 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); | |
115 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); | |
116 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); | |
117 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); | |
118 | |
119 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); | |
120 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); | |
121 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); | |
122 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); | |
123 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); | |
124 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); | |
125 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); | |
126 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); | |
127 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); | |
128 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); | |
129 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); | |
130 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); | |
131 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); | |
132 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); | |
133 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); | |
134 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); | |
135 | |
136 buf[0] += a; | |
137 buf[1] += b; | |
138 buf[2] += c; | |
139 buf[3] += d; | |
140 } | |
141 | |
142 | |
143 /* Update context to reflect the concatenation of another buffer full | |
144 * of bytes. | |
145 */ | |
146 void aud_md5_append(aud_md5state_t *ctx, const guint8 *buf, guint len) | |
147 { | |
148 guint32 t; | |
149 | |
150 /* Update bitcount */ | |
151 t = ctx->bits[0]; | |
152 if ((ctx->bits[0] = t + ((guint32) len << 3)) < t) | |
153 ctx->bits[1]++; /* Carry from low to high */ | |
154 ctx->bits[1] += len >> 29; | |
155 | |
156 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ | |
157 | |
158 /* Handle any leading odd-sized chunks */ | |
159 if (t) { | |
160 guint8 *p = (guint8 *) ctx->in + t; | |
161 | |
162 t = 64 - t; | |
163 if (len < t) { | |
164 memcpy(p, buf, len); | |
165 return; | |
166 } | |
167 memcpy(p, buf, t); | |
168 aud_md5_bytereverse(ctx->in, 16); | |
169 aud_md5_transform(ctx->buf, (guint32 *) ctx->in); | |
170 buf += t; | |
171 len -= t; | |
172 } | |
173 | |
174 /* Process data in 64-byte chunks */ | |
175 while (len >= 64) { | |
176 memcpy(ctx->in, buf, 64); | |
177 aud_md5_bytereverse(ctx->in, 16); | |
178 aud_md5_transform(ctx->buf, (guint32 *) ctx->in); | |
179 buf += 64; | |
180 len -= 64; | |
181 } | |
182 | |
183 /* Handle any remaining bytes of data. */ | |
184 memcpy(ctx->in, buf, len); | |
185 } | |
186 | |
187 /* Final wrapup - pad to 64-byte boundary with the bit pattern | |
188 * 1 0* (64-bit count of bits processed, MSB-first) | |
189 */ | |
190 void aud_md5_finish(aud_md5state_t *ctx, aud_md5hash_t digest) | |
191 { | |
192 guint count; | |
193 guint8 *p; | |
194 | |
195 /* Compute number of bytes mod 64 */ | |
196 count = (ctx->bits[0] >> 3) & 0x3F; | |
197 | |
198 /* Set the first char of padding to 0x80. This is safe since there is | |
199 always at least one byte free */ | |
200 p = ctx->in + count; | |
201 *p++ = 0x80; | |
202 | |
203 /* Bytes of padding needed to make 64 bytes */ | |
204 count = 64 - 1 - count; | |
205 | |
206 /* Pad out to 56 mod 64 */ | |
207 if (count < 8) { | |
208 /* Two lots of padding: Pad the first block to 64 bytes */ | |
209 memset(p, 0, count); | |
210 aud_md5_bytereverse(ctx->in, 16); | |
211 aud_md5_transform(ctx->buf, (guint32 *) ctx->in); | |
212 | |
213 /* Now fill the next block with 56 bytes */ | |
214 memset(ctx->in, 0, 56); | |
215 } else { | |
216 /* Pad block to 56 bytes */ | |
217 memset(p, 0, count - 8); | |
218 } | |
219 aud_md5_bytereverse(ctx->in, 14); | |
220 | |
221 /* Append length in bits and transform */ | |
222 ((guint32 *) ctx->in)[14] = ctx->bits[0]; | |
223 ((guint32 *) ctx->in)[15] = ctx->bits[1]; | |
224 | |
225 aud_md5_transform(ctx->buf, (guint32 *) ctx->in); | |
226 aud_md5_bytereverse((guint8 *) ctx->buf, 4); | |
227 memcpy(digest, ctx->buf, 16); | |
228 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */ | |
229 } |