File:  [ELWIX - Embedded LightWeight unIX -] / embedaddon / rsync / lib / md5.c
Revision 1.1.1.1 (vendor branch): download - view: text, annotated - select for diffs - revision graph
Fri Feb 17 15:09:30 2012 UTC (12 years, 4 months ago) by misho
Branches: rsync, MAIN
CVS tags: v3_1_2p5, rsync3_0_9p0, RSYNC3_1_0, RSYNC3_0_9, HEAD
rsync

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

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>