Annotation of embedaddon/rsync/lib/md5.c, revision 1.1.1.2
1.1 misho 1: /*
2: * RFC 1321 compliant MD5 implementation
3: *
4: * Copyright (C) 2001-2003 Christophe Devine
1.1.1.2 ! misho 5: * Copyright (C) 2007-2020 Wayne Davison
1.1 misho 6: *
7: * This program is free software; you can redistribute it and/or modify
8: * it under the terms of the GNU General Public License as published by
9: * the Free Software Foundation; either version 3 of the License, or
10: * (at your option) any 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 along
18: * with this program; if not, visit the http://fsf.org website.
19: */
20:
21: #include "rsync.h"
22:
1.1.1.2 ! misho 23: #ifndef USE_OPENSSL
1.1 misho 24: void md5_begin(md_context *ctx)
25: {
26: ctx->A = 0x67452301;
27: ctx->B = 0xEFCDAB89;
28: ctx->C = 0x98BADCFE;
29: ctx->D = 0x10325476;
30:
31: ctx->totalN = ctx->totalN2 = 0;
32: }
33:
34: static void md5_process(md_context *ctx, const uchar data[CSUM_CHUNK])
35: {
36: uint32 X[16], A, B, C, D;
37:
38: A = ctx->A;
39: B = ctx->B;
40: C = ctx->C;
41: D = ctx->D;
42:
43: X[0] = IVALu(data, 0);
44: X[1] = IVALu(data, 4);
45: X[2] = IVALu(data, 8);
46: X[3] = IVALu(data, 12);
47: X[4] = IVALu(data, 16);
48: X[5] = IVALu(data, 20);
49: X[6] = IVALu(data, 24);
50: X[7] = IVALu(data, 28);
51: X[8] = IVALu(data, 32);
52: X[9] = IVALu(data, 36);
53: X[10] = IVALu(data, 40);
54: X[11] = IVALu(data, 44);
55: X[12] = IVALu(data, 48);
56: X[13] = IVALu(data, 52);
57: X[14] = IVALu(data, 56);
58: X[15] = IVALu(data, 60);
59:
60: #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
61:
62: #define P(a,b,c,d,k,s,t) a += F(b,c,d) + X[k] + t, a = S(a,s) + b
63:
64: #define F(x,y,z) (z ^ (x & (y ^ z)))
65:
66: P(A, B, C, D, 0, 7, 0xD76AA478);
67: P(D, A, B, C, 1, 12, 0xE8C7B756);
68: P(C, D, A, B, 2, 17, 0x242070DB);
69: P(B, C, D, A, 3, 22, 0xC1BDCEEE);
70: P(A, B, C, D, 4, 7, 0xF57C0FAF);
71: P(D, A, B, C, 5, 12, 0x4787C62A);
72: P(C, D, A, B, 6, 17, 0xA8304613);
73: P(B, C, D, A, 7, 22, 0xFD469501);
74: P(A, B, C, D, 8, 7, 0x698098D8);
75: P(D, A, B, C, 9, 12, 0x8B44F7AF);
76: P(C, D, A, B, 10, 17, 0xFFFF5BB1);
77: P(B, C, D, A, 11, 22, 0x895CD7BE);
78: P(A, B, C, D, 12, 7, 0x6B901122);
79: P(D, A, B, C, 13, 12, 0xFD987193);
80: P(C, D, A, B, 14, 17, 0xA679438E);
81: P(B, C, D, A, 15, 22, 0x49B40821);
82:
83: #undef F
84: #define F(x,y,z) (y ^ (z & (x ^ y)))
85:
86: P(A, B, C, D, 1, 5, 0xF61E2562);
87: P(D, A, B, C, 6, 9, 0xC040B340);
88: P(C, D, A, B, 11, 14, 0x265E5A51);
89: P(B, C, D, A, 0, 20, 0xE9B6C7AA);
90: P(A, B, C, D, 5, 5, 0xD62F105D);
91: P(D, A, B, C, 10, 9, 0x02441453);
92: P(C, D, A, B, 15, 14, 0xD8A1E681);
93: P(B, C, D, A, 4, 20, 0xE7D3FBC8);
94: P(A, B, C, D, 9, 5, 0x21E1CDE6);
95: P(D, A, B, C, 14, 9, 0xC33707D6);
96: P(C, D, A, B, 3, 14, 0xF4D50D87);
97: P(B, C, D, A, 8, 20, 0x455A14ED);
98: P(A, B, C, D, 13, 5, 0xA9E3E905);
99: P(D, A, B, C, 2, 9, 0xFCEFA3F8);
100: P(C, D, A, B, 7, 14, 0x676F02D9);
101: P(B, C, D, A, 12, 20, 0x8D2A4C8A);
102:
103: #undef F
104: #define F(x,y,z) (x ^ y ^ z)
105:
106: P(A, B, C, D, 5, 4, 0xFFFA3942);
107: P(D, A, B, C, 8, 11, 0x8771F681);
108: P(C, D, A, B, 11, 16, 0x6D9D6122);
109: P(B, C, D, A, 14, 23, 0xFDE5380C);
110: P(A, B, C, D, 1, 4, 0xA4BEEA44);
111: P(D, A, B, C, 4, 11, 0x4BDECFA9);
112: P(C, D, A, B, 7, 16, 0xF6BB4B60);
113: P(B, C, D, A, 10, 23, 0xBEBFBC70);
114: P(A, B, C, D, 13, 4, 0x289B7EC6);
115: P(D, A, B, C, 0, 11, 0xEAA127FA);
116: P(C, D, A, B, 3, 16, 0xD4EF3085);
117: P(B, C, D, A, 6, 23, 0x04881D05);
118: P(A, B, C, D, 9, 4, 0xD9D4D039);
119: P(D, A, B, C, 12, 11, 0xE6DB99E5);
120: P(C, D, A, B, 15, 16, 0x1FA27CF8);
121: P(B, C, D, A, 2, 23, 0xC4AC5665);
122:
123: #undef F
124: #define F(x,y,z) (y ^ (x | ~z))
125:
126: P(A, B, C, D, 0, 6, 0xF4292244);
127: P(D, A, B, C, 7, 10, 0x432AFF97);
128: P(C, D, A, B, 14, 15, 0xAB9423A7);
129: P(B, C, D, A, 5, 21, 0xFC93A039);
130: P(A, B, C, D, 12, 6, 0x655B59C3);
131: P(D, A, B, C, 3, 10, 0x8F0CCC92);
132: P(C, D, A, B, 10, 15, 0xFFEFF47D);
133: P(B, C, D, A, 1, 21, 0x85845DD1);
134: P(A, B, C, D, 8, 6, 0x6FA87E4F);
135: P(D, A, B, C, 15, 10, 0xFE2CE6E0);
136: P(C, D, A, B, 6, 15, 0xA3014314);
137: P(B, C, D, A, 13, 21, 0x4E0811A1);
138: P(A, B, C, D, 4, 6, 0xF7537E82);
139: P(D, A, B, C, 11, 10, 0xBD3AF235);
140: P(C, D, A, B, 2, 15, 0x2AD7D2BB);
141: P(B, C, D, A, 9, 21, 0xEB86D391);
142:
143: #undef F
144:
145: ctx->A += A;
146: ctx->B += B;
147: ctx->C += C;
148: ctx->D += D;
149: }
150:
1.1.1.2 ! misho 151: #if defined HAVE_ASM && CSUM_CHUNK == 64
! 152: extern void md5_process_asm(md_context *ctx, const void *data, size_t num);
! 153: #endif
! 154:
1.1 misho 155: void md5_update(md_context *ctx, const uchar *input, uint32 length)
156: {
157: uint32 left, fill;
158:
159: if (!length)
160: return;
161:
162: left = ctx->totalN & 0x3F;
163: fill = CSUM_CHUNK - left;
164:
165: ctx->totalN += length;
166: ctx->totalN &= 0xFFFFFFFF;
167:
168: if (ctx->totalN < length)
169: ctx->totalN2++;
170:
171: if (left && length >= fill) {
172: memcpy(ctx->buffer + left, input, fill);
173: md5_process(ctx, ctx->buffer);
174: length -= fill;
175: input += fill;
176: left = 0;
177: }
178:
1.1.1.2 ! misho 179: #if defined HAVE_ASM && CSUM_CHUNK == 64
! 180: if (length >= CSUM_CHUNK) {
! 181: uint32 chunks = length / CSUM_CHUNK;
! 182: md5_process_asm(ctx, input, chunks);
! 183: length -= chunks * CSUM_CHUNK;
! 184: input += chunks * CSUM_CHUNK;
! 185: }
! 186: #else
1.1 misho 187: while (length >= CSUM_CHUNK) {
188: md5_process(ctx, input);
189: length -= CSUM_CHUNK;
190: input += CSUM_CHUNK;
191: }
1.1.1.2 ! misho 192: #endif
1.1 misho 193:
194: if (length)
195: memcpy(ctx->buffer + left, input, length);
196: }
197:
198: static uchar md5_padding[CSUM_CHUNK] = { 0x80 };
199:
200: void md5_result(md_context *ctx, uchar digest[MD5_DIGEST_LEN])
201: {
202: uint32 last, padn;
203: uint32 high, low;
204: uchar msglen[8];
205:
206: high = (ctx->totalN >> 29)
207: | (ctx->totalN2 << 3);
208: low = (ctx->totalN << 3);
209:
210: SIVALu(msglen, 0, low);
211: SIVALu(msglen, 4, high);
212:
213: last = ctx->totalN & 0x3F;
214: padn = last < 56 ? 56 - last : 120 - last;
215:
216: md5_update(ctx, md5_padding, padn);
217: md5_update(ctx, msglen, 8);
218:
219: SIVALu(digest, 0, ctx->A);
220: SIVALu(digest, 4, ctx->B);
221: SIVALu(digest, 8, ctx->C);
222: SIVALu(digest, 12, ctx->D);
223: }
1.1.1.2 ! misho 224: #endif
! 225:
! 226: #ifdef TEST_MD5
1.1 misho 227:
228: void get_md5(uchar *out, const uchar *input, int n)
229: {
230: md_context ctx;
231: md5_begin(&ctx);
232: md5_update(&ctx, input, n);
233: md5_result(&ctx, out);
234: }
235:
236: #include <stdlib.h>
237: #include <stdio.h>
238:
239: /*
240: * those are the standard RFC 1321 test vectors
241: */
242:
243: static struct {
244: char *str, *md5;
245: } tests[] = {
246: { "",
247: "d41d8cd98f00b204e9800998ecf8427e" },
248: { "a",
249: "0cc175b9c0f1b6a831c399e269772661" },
250: { "abc",
251: "900150983cd24fb0d6963f7d28e17f72" },
252: { "message digest",
253: "f96b697d7cb7938d525a2f31aaf161d0" },
254: { "abcdefghijklmnopqrstuvwxyz",
255: "c3fcd3d76192e4007dfb496cca67e13b" },
256: { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
257: "d174ab98d277d9f5a5611c2c9f419d9f" },
258: { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
259: "57edf4a22be3c955ac49da2e2107b67a" },
260: { NULL, NULL }
261: };
262:
263: int main(int argc, char *argv[])
264: {
265: FILE *f;
266: int i, j;
267: char output[33];
268: md_context ctx;
269: uchar buf[1000];
270: uchar md5sum[MD5_DIGEST_LEN];
271:
272: if (argc < 2) {
273: printf("\nMD5 Validation Tests:\n\n");
274:
275: for (i = 0; tests[i].str; i++) {
276: char *str = tests[i].str;
277: char *chk = tests[i].md5;
278:
279: printf(" Test %d ", i + 1);
280:
281: get_md5(md5sum, str, strlen(str));
282:
283: for (j = 0; j < MD5_DIGEST_LEN; j++)
284: sprintf(output + j * 2, "%02x", md5sum[j]);
285:
286: if (memcmp(output, chk, 32)) {
287: printf("failed!\n");
288: return 1;
289: }
290:
291: printf("passed.\n");
292: }
293:
294: printf("\n");
295: return 0;
296: }
297:
298: while (--argc) {
299: if (!(f = fopen(*++argv, "rb"))) {
300: perror("fopen");
301: return 1;
302: }
303:
304: md5_begin(&ctx);
305:
306: while ((i = fread(buf, 1, sizeof buf, f)) > 0)
307: md5_update(&ctx, buf, i);
308:
309: md5_result(&ctx, md5sum);
310:
311: for (j = 0; j < MD5_DIGEST_LEN; j++)
312: printf("%02x", md5sum[j]);
313:
314: printf(" %s\n", *argv);
315: }
316:
317: return 0;
318: }
319:
320: #endif
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to md5.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / rsync / lib