Mercurial > libdvdread4.hg
annotate md5.c @ 32:6698620c1477 src
Because of ARM memory alignment issues the struct app_info has to be
packed.
Patch by Erik Hovland /erik ^ hovland * org \
author | rathann |
---|---|
date | Sat, 13 Dec 2008 14:27:51 +0000 |
parents | 98951f8ec89c |
children | 9f1804080f76 |
rev | line source |
---|---|
3 | 1 /* md5.c - Functions to compute MD5 message digest of files or memory blocks |
2 according to the definition of MD5 in RFC 1321 from April 1992. | |
3 Copyright (C) 1995, 1996, 2001 Free Software Foundation, Inc. | |
4 NOTE: The canonical source of this file is maintained with the GNU C | |
5 Library. Bugs can be reported to bug-glibc@prep.ai.mit.edu. | |
6 | |
7 This program is free software; you can redistribute it and/or modify it | |
8 under the terms of the GNU General Public License as published by the | |
9 Free Software Foundation; either version 2, or (at your option) any | |
10 later version. | |
11 | |
12 This program is distributed in the hope that it will be useful, | |
13 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 GNU General Public License for more details. | |
16 | |
17 You should have received a copy of the GNU General Public License | |
18 along with this program; if not, write to the Free Software Foundation, | |
21
4aa618ae094f
Use consistent license headers everywhere: Fix FSF address and boilerplate.
diego
parents:
3
diff
changeset
|
19 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ |
3 | 20 |
21 /* Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995. */ | |
22 | |
23 #ifdef HAVE_CONFIG_H | |
24 # include <config.h> | |
25 #endif | |
26 | |
27 #include <sys/types.h> | |
28 | |
29 #include <stdlib.h> | |
30 #include <string.h> | |
31 | |
32 #include "md5.h" | |
33 /* #include "unlocked-io.h" */ | |
34 | |
35 #ifdef _LIBC | |
36 # include <endian.h> | |
37 # if __BYTE_ORDER == __BIG_ENDIAN | |
38 # define WORDS_BIGENDIAN 1 | |
39 # endif | |
40 #endif | |
41 | |
42 #ifdef WORDS_BIGENDIAN | |
26 | 43 # define SWAP(n) \ |
27
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
44 (((n) << 24) | (((n) & 0xff00) << 8) | (((n) >> 8) & 0xff00) | ((n) >> 24)) |
3 | 45 #else |
46 # define SWAP(n) (n) | |
47 #endif | |
48 | |
49 | |
50 /* This array contains the bytes used to pad the buffer to the next | |
51 64-byte boundary. (RFC 1321, 3.1: Step 1) */ | |
52 static const unsigned char fillbuf[64] = { 0x80, 0 /* , 0, 0, ... */ }; | |
53 | |
54 | |
55 /* Initialize structure containing state of computation. | |
56 (RFC 1321, 3.3: Step 3) */ | |
57 void | |
58 md5_init_ctx (ctx) | |
59 struct md5_ctx *ctx; | |
60 { | |
61 ctx->A = 0x67452301; | |
62 ctx->B = 0xefcdab89; | |
63 ctx->C = 0x98badcfe; | |
64 ctx->D = 0x10325476; | |
65 | |
66 ctx->total[0] = ctx->total[1] = 0; | |
67 ctx->buflen = 0; | |
68 } | |
69 | |
70 /* Put result from CTX in first 16 bytes following RESBUF. The result | |
71 must be in little endian byte order. | |
72 | |
73 IMPORTANT: On some systems it is required that RESBUF is correctly | |
74 aligned for a 32 bits value. */ | |
75 void * | |
76 md5_read_ctx (ctx, resbuf) | |
77 const struct md5_ctx *ctx; | |
78 void *resbuf; | |
79 { | |
80 ((md5_uint32 *) resbuf)[0] = SWAP (ctx->A); | |
81 ((md5_uint32 *) resbuf)[1] = SWAP (ctx->B); | |
82 ((md5_uint32 *) resbuf)[2] = SWAP (ctx->C); | |
83 ((md5_uint32 *) resbuf)[3] = SWAP (ctx->D); | |
84 | |
85 return resbuf; | |
86 } | |
87 | |
88 /* Process the remaining bytes in the internal buffer and the usual | |
89 prolog according to the standard and write the result to RESBUF. | |
90 | |
91 IMPORTANT: On some systems it is required that RESBUF is correctly | |
92 aligned for a 32 bits value. */ | |
93 void * | |
94 md5_finish_ctx (ctx, resbuf) | |
95 struct md5_ctx *ctx; | |
96 void *resbuf; | |
97 { | |
98 /* Take yet unprocessed bytes into account. */ | |
99 md5_uint32 bytes = ctx->buflen; | |
100 size_t pad; | |
101 | |
102 /* Now count remaining bytes. */ | |
103 ctx->total[0] += bytes; | |
104 if (ctx->total[0] < bytes) | |
105 ++ctx->total[1]; | |
106 | |
107 pad = bytes >= 56 ? 64 + 56 - bytes : 56 - bytes; | |
108 memcpy (&ctx->buffer[bytes], fillbuf, pad); | |
109 | |
110 /* Put the 64-bit file length in *bits* at the end of the buffer. */ | |
111 *(md5_uint32 *) &ctx->buffer[bytes + pad] = SWAP (ctx->total[0] << 3); | |
112 *(md5_uint32 *) &ctx->buffer[bytes + pad + 4] = SWAP ((ctx->total[1] << 3) | | |
26 | 113 (ctx->total[0] >> 29)); |
3 | 114 |
115 /* Process last bytes. */ | |
116 md5_process_block (ctx->buffer, bytes + pad + 8, ctx); | |
117 | |
118 return md5_read_ctx (ctx, resbuf); | |
119 } | |
120 | |
121 /* Compute MD5 message digest for bytes read from STREAM. The | |
122 resulting message digest number will be written into the 16 bytes | |
123 beginning at RESBLOCK. */ | |
124 int | |
125 md5_stream (stream, resblock) | |
126 FILE *stream; | |
127 void *resblock; | |
128 { | |
129 /* Important: BLOCKSIZE must be a multiple of 64. */ | |
130 #define BLOCKSIZE 4096 | |
131 struct md5_ctx ctx; | |
132 char buffer[BLOCKSIZE + 72]; | |
133 size_t sum; | |
134 | |
135 /* Initialize the computation context. */ | |
136 md5_init_ctx (&ctx); | |
137 | |
138 /* Iterate over full file contents. */ | |
139 while (1) | |
140 { | |
141 /* We read the file in blocks of BLOCKSIZE bytes. One call of the | |
26 | 142 computation function processes the whole buffer so that with the |
143 next round of the loop another block can be read. */ | |
3 | 144 size_t n; |
145 sum = 0; | |
146 | |
147 /* Read block. Take care for partial reads. */ | |
148 do | |
26 | 149 { |
150 n = fread (buffer + sum, 1, BLOCKSIZE - sum, stream); | |
3 | 151 |
26 | 152 sum += n; |
153 } | |
3 | 154 while (sum < BLOCKSIZE && n != 0); |
155 if (n == 0 && ferror (stream)) | |
156 return 1; | |
157 | |
158 /* If end of file is reached, end the loop. */ | |
159 if (n == 0) | |
26 | 160 break; |
3 | 161 |
162 /* Process buffer with BLOCKSIZE bytes. Note that | |
27
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
163 BLOCKSIZE % 64 == 0 |
3 | 164 */ |
165 md5_process_block (buffer, BLOCKSIZE, &ctx); | |
166 } | |
167 | |
168 /* Add the last bytes if necessary. */ | |
169 if (sum > 0) | |
170 md5_process_bytes (buffer, sum, &ctx); | |
171 | |
172 /* Construct result in desired memory. */ | |
173 md5_finish_ctx (&ctx, resblock); | |
174 return 0; | |
175 } | |
176 | |
177 /* Compute MD5 message digest for LEN bytes beginning at BUFFER. The | |
178 result is always in little endian byte order, so that a byte-wise | |
179 output yields to the wanted ASCII representation of the message | |
180 digest. */ | |
181 void * | |
182 md5_buffer (buffer, len, resblock) | |
183 const char *buffer; | |
184 size_t len; | |
185 void *resblock; | |
186 { | |
187 struct md5_ctx ctx; | |
188 | |
189 /* Initialize the computation context. */ | |
190 md5_init_ctx (&ctx); | |
191 | |
192 /* Process whole buffer but last len % 64 bytes. */ | |
193 md5_process_bytes (buffer, len, &ctx); | |
194 | |
195 /* Put result in desired memory area. */ | |
196 return md5_finish_ctx (&ctx, resblock); | |
197 } | |
198 | |
199 | |
200 void | |
201 md5_process_bytes (buffer, len, ctx) | |
202 const void *buffer; | |
203 size_t len; | |
204 struct md5_ctx *ctx; | |
205 { | |
206 /* When we already have some bits in our internal buffer concatenate | |
207 both inputs first. */ | |
208 if (ctx->buflen != 0) | |
209 { | |
210 size_t left_over = ctx->buflen; | |
211 size_t add = 128 - left_over > len ? len : 128 - left_over; | |
212 | |
213 memcpy (&ctx->buffer[left_over], buffer, add); | |
214 ctx->buflen += add; | |
215 | |
216 if (left_over + add > 64) | |
26 | 217 { |
218 md5_process_block (ctx->buffer, (left_over + add) & ~63, ctx); | |
219 /* The regions in the following copy operation cannot overlap. */ | |
220 memcpy (ctx->buffer, &ctx->buffer[(left_over + add) & ~63], | |
221 (left_over + add) & 63); | |
222 ctx->buflen = (left_over + add) & 63; | |
223 } | |
3 | 224 |
225 buffer = (const char *) buffer + add; | |
226 len -= add; | |
227 } | |
228 | |
229 /* Process available complete blocks. */ | |
230 if (len > 64) | |
231 { | |
232 md5_process_block (buffer, len & ~63, ctx); | |
233 buffer = (const char *) buffer + (len & ~63); | |
234 len &= 63; | |
235 } | |
236 | |
237 /* Move remaining bytes in internal buffer. */ | |
238 if (len > 0) | |
239 { | |
240 memcpy (ctx->buffer, buffer, len); | |
241 ctx->buflen = len; | |
242 } | |
243 } | |
244 | |
245 | |
246 /* These are the four functions used in the four steps of the MD5 algorithm | |
247 and defined in the RFC 1321. The first function is a little bit optimized | |
248 (as found in Colin Plumbs public domain implementation). */ | |
249 /* #define FF(b, c, d) ((b & c) | (~b & d)) */ | |
250 #define FF(b, c, d) (d ^ (b & (c ^ d))) | |
251 #define FG(b, c, d) FF (d, b, c) | |
252 #define FH(b, c, d) (b ^ c ^ d) | |
253 #define FI(b, c, d) (c ^ (b | ~d)) | |
254 | |
255 /* Process LEN bytes of BUFFER, accumulating context into CTX. | |
256 It is assumed that LEN % 64 == 0. */ | |
257 | |
258 void | |
259 md5_process_block (buffer, len, ctx) | |
260 const void *buffer; | |
261 size_t len; | |
262 struct md5_ctx *ctx; | |
263 { | |
264 md5_uint32 correct_words[16]; | |
265 const md5_uint32 *words = buffer; | |
266 size_t nwords = len / sizeof (md5_uint32); | |
267 const md5_uint32 *endp = words + nwords; | |
268 md5_uint32 A = ctx->A; | |
269 md5_uint32 B = ctx->B; | |
270 md5_uint32 C = ctx->C; | |
271 md5_uint32 D = ctx->D; | |
272 | |
273 /* First increment the byte count. RFC 1321 specifies the possible | |
274 length of the file up to 2^64 bits. Here we only compute the | |
275 number of bytes. Do a double word increment. */ | |
276 ctx->total[0] += len; | |
277 if (ctx->total[0] < len) | |
278 ++ctx->total[1]; | |
279 | |
280 /* Process all bytes in the buffer with 64 bytes in each round of | |
281 the loop. */ | |
282 while (words < endp) | |
283 { | |
284 md5_uint32 *cwp = correct_words; | |
285 md5_uint32 A_save = A; | |
286 md5_uint32 B_save = B; | |
287 md5_uint32 C_save = C; | |
288 md5_uint32 D_save = D; | |
289 | |
290 /* First round: using the given function, the context and a constant | |
26 | 291 the next context is computed. Because the algorithms processing |
292 unit is a 32-bit word and it is determined to work on words in | |
293 little endian byte order we perhaps have to change the byte order | |
294 before the computation. To reduce the work for the next steps | |
295 we store the swapped words in the array CORRECT_WORDS. */ | |
3 | 296 |
27
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
297 #define OP(a, b, c, d, s, T) \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
298 do \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
299 { \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
300 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
301 ++words; \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
302 a = rol (a, s); \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
303 a += b; \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
304 } \ |
3 | 305 while (0) |
306 | |
307 /* Before we start, one word to the strange constants. | |
26 | 308 They are defined in RFC 1321 as |
3 | 309 |
26 | 310 T[i] = (int) (4294967296.0 * fabs (sin (i))), i=1..64, or |
311 perl -e 'foreach(1..64){printf "0x%08x\n", int (4294967296 * abs (sin $_))}' | |
3 | 312 */ |
313 | |
314 /* Round 1. */ | |
315 OP (A, B, C, D, 7, 0xd76aa478); | |
316 OP (D, A, B, C, 12, 0xe8c7b756); | |
317 OP (C, D, A, B, 17, 0x242070db); | |
318 OP (B, C, D, A, 22, 0xc1bdceee); | |
319 OP (A, B, C, D, 7, 0xf57c0faf); | |
320 OP (D, A, B, C, 12, 0x4787c62a); | |
321 OP (C, D, A, B, 17, 0xa8304613); | |
322 OP (B, C, D, A, 22, 0xfd469501); | |
323 OP (A, B, C, D, 7, 0x698098d8); | |
324 OP (D, A, B, C, 12, 0x8b44f7af); | |
325 OP (C, D, A, B, 17, 0xffff5bb1); | |
326 OP (B, C, D, A, 22, 0x895cd7be); | |
327 OP (A, B, C, D, 7, 0x6b901122); | |
328 OP (D, A, B, C, 12, 0xfd987193); | |
329 OP (C, D, A, B, 17, 0xa679438e); | |
330 OP (B, C, D, A, 22, 0x49b40821); | |
331 | |
332 /* For the second to fourth round we have the possibly swapped words | |
26 | 333 in CORRECT_WORDS. Redefine the macro to take an additional first |
334 argument specifying the function to use. */ | |
3 | 335 #undef OP |
27
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
336 #define OP(f, a, b, c, d, k, s, T) \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
337 do \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
338 { \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
339 a += f (b, c, d) + correct_words[k] + T; \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
340 a = rol (a, s); \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
341 a += b; \ |
98951f8ec89c
cosmetics: Sync indentation and similar changes from libdvdread 0.9.5.
diego
parents:
26
diff
changeset
|
342 } \ |
3 | 343 while (0) |
344 | |
345 /* Round 2. */ | |
346 OP (FG, A, B, C, D, 1, 5, 0xf61e2562); | |
347 OP (FG, D, A, B, C, 6, 9, 0xc040b340); | |
348 OP (FG, C, D, A, B, 11, 14, 0x265e5a51); | |
349 OP (FG, B, C, D, A, 0, 20, 0xe9b6c7aa); | |
350 OP (FG, A, B, C, D, 5, 5, 0xd62f105d); | |
351 OP (FG, D, A, B, C, 10, 9, 0x02441453); | |
352 OP (FG, C, D, A, B, 15, 14, 0xd8a1e681); | |
353 OP (FG, B, C, D, A, 4, 20, 0xe7d3fbc8); | |
354 OP (FG, A, B, C, D, 9, 5, 0x21e1cde6); | |
355 OP (FG, D, A, B, C, 14, 9, 0xc33707d6); | |
356 OP (FG, C, D, A, B, 3, 14, 0xf4d50d87); | |
357 OP (FG, B, C, D, A, 8, 20, 0x455a14ed); | |
358 OP (FG, A, B, C, D, 13, 5, 0xa9e3e905); | |
359 OP (FG, D, A, B, C, 2, 9, 0xfcefa3f8); | |
360 OP (FG, C, D, A, B, 7, 14, 0x676f02d9); | |
361 OP (FG, B, C, D, A, 12, 20, 0x8d2a4c8a); | |
362 | |
363 /* Round 3. */ | |
364 OP (FH, A, B, C, D, 5, 4, 0xfffa3942); | |
365 OP (FH, D, A, B, C, 8, 11, 0x8771f681); | |
366 OP (FH, C, D, A, B, 11, 16, 0x6d9d6122); | |
367 OP (FH, B, C, D, A, 14, 23, 0xfde5380c); | |
368 OP (FH, A, B, C, D, 1, 4, 0xa4beea44); | |
369 OP (FH, D, A, B, C, 4, 11, 0x4bdecfa9); | |
370 OP (FH, C, D, A, B, 7, 16, 0xf6bb4b60); | |
371 OP (FH, B, C, D, A, 10, 23, 0xbebfbc70); | |
372 OP (FH, A, B, C, D, 13, 4, 0x289b7ec6); | |
373 OP (FH, D, A, B, C, 0, 11, 0xeaa127fa); | |
374 OP (FH, C, D, A, B, 3, 16, 0xd4ef3085); | |
375 OP (FH, B, C, D, A, 6, 23, 0x04881d05); | |
376 OP (FH, A, B, C, D, 9, 4, 0xd9d4d039); | |
377 OP (FH, D, A, B, C, 12, 11, 0xe6db99e5); | |
378 OP (FH, C, D, A, B, 15, 16, 0x1fa27cf8); | |
379 OP (FH, B, C, D, A, 2, 23, 0xc4ac5665); | |
380 | |
381 /* Round 4. */ | |
382 OP (FI, A, B, C, D, 0, 6, 0xf4292244); | |
383 OP (FI, D, A, B, C, 7, 10, 0x432aff97); | |
384 OP (FI, C, D, A, B, 14, 15, 0xab9423a7); | |
385 OP (FI, B, C, D, A, 5, 21, 0xfc93a039); | |
386 OP (FI, A, B, C, D, 12, 6, 0x655b59c3); | |
387 OP (FI, D, A, B, C, 3, 10, 0x8f0ccc92); | |
388 OP (FI, C, D, A, B, 10, 15, 0xffeff47d); | |
389 OP (FI, B, C, D, A, 1, 21, 0x85845dd1); | |
390 OP (FI, A, B, C, D, 8, 6, 0x6fa87e4f); | |
391 OP (FI, D, A, B, C, 15, 10, 0xfe2ce6e0); | |
392 OP (FI, C, D, A, B, 6, 15, 0xa3014314); | |
393 OP (FI, B, C, D, A, 13, 21, 0x4e0811a1); | |
394 OP (FI, A, B, C, D, 4, 6, 0xf7537e82); | |
395 OP (FI, D, A, B, C, 11, 10, 0xbd3af235); | |
396 OP (FI, C, D, A, B, 2, 15, 0x2ad7d2bb); | |
397 OP (FI, B, C, D, A, 9, 21, 0xeb86d391); | |
398 | |
399 /* Add the starting values of the context. */ | |
400 A += A_save; | |
401 B += B_save; | |
402 C += C_save; | |
403 D += D_save; | |
404 } | |
405 | |
406 /* Put checksum in context given as argument. */ | |
407 ctx->A = A; | |
408 ctx->B = B; | |
409 ctx->C = C; | |
410 ctx->D = D; | |
411 } |