big endian fix
[libav.git] / libavutil / md5.c
1 /*
2 * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
3 * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
4 * #inlcude LGPL license
5 *
6 * References:
7 * IETF RFC 1321: The MD5 Message-Digest Algorithm
8 * Ron Rivest. IETF, April, 1992
9 *
10 * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
11 * from Christopher R. Hertel (crh@ubiqx.mn.org)
12 * simplified, cleaned and IMO redundant comments removed by michael
13 *
14 * if you use gcc, then version 4.1 or later and -fomit-frame-pointer is
15 * strongly recommanded
16 */
17
18 #include "common.h"
19 #include <string.h>
20 #include "md5.h"
21
22 typedef struct AVMD5{
23 uint8_t block[64];
24 uint32_t ABCD[4];
25 uint64_t len;
26 int b_used;
27 } AVMD5;
28
29 const int av_md5_size= sizeof(AVMD5);
30
31 static const uint8_t S[4][4] = {
32 { 7, 12, 17, 22 }, /* Round 1 */
33 { 5, 9, 14, 20 }, /* Round 2 */
34 { 4, 11, 16, 23 }, /* Round 3 */
35 { 6, 10, 15, 21 } /* Round 4 */
36 };
37
38 static const uint32_t T[64] = {
39 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* Round 1 */
40 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
41 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
42 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
43
44 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* Round 2 */
45 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
46 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
47 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
48
49 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* Round 3 */
50 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
51 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
52 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
53
54 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* Round 4 */
55 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
56 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
57 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
58 };
59
60 #define CORE(i, a, b, c, d) \
61 t = S[i>>4][i&3];\
62 a += T[i];\
63 \
64 switch(i>>4){\
65 case 0: a += (d ^ (b&(c^d))) + X[ i &15 ]; break;\
66 case 1: a += (c ^ (d&(c^b))) + X[ (1+5*i)&15 ]; break;\
67 case 2: a += (b^c^d) + X[ (5+3*i)&15 ]; break;\
68 case 3: a += (c^(b|~d)) + X[ ( 7*i)&15 ]; break;\
69 }\
70 a = b + (( a << t ) | ( a >> (32 - t) ));
71
72 #ifdef WORDS_BIGENDIAN
73 static void body(uint32_t ABCD[4], uint32_t X[16]){
74 #else
75 static void body(uint32_t ABCD[4], const uint32_t X[16]){
76 #endif
77 int t;
78 int i attribute_unused;
79 unsigned int a= ABCD[3];
80 unsigned int b= ABCD[2];
81 unsigned int c= ABCD[1];
82 unsigned int d= ABCD[0];
83
84 #ifdef WORDS_BIGENDIAN
85 for(i=0; i<16; i++)
86 X[i]= bswap_32(X[i]);
87 #endif
88
89 #ifdef CONFIG_SMALL
90 for( i = 0; i < 64; i++ ){
91 CORE(i,a,b,c,d)
92 t=d; d=c; c=b; b=a; a=t;
93 }
94 #else
95 #define CORE2(i) CORE(i,a,b,c,d) CORE((i+1),d,a,b,c) CORE((i+2),c,d,a,b) CORE((i+3),b,c,d,a)
96 #define CORE4(i) CORE2(i) CORE2((i+4)) CORE2((i+8)) CORE2((i+12))
97 CORE4(0) CORE4(16) CORE4(32) CORE4(48)
98 #endif
99
100 ABCD[0] += d;
101 ABCD[1] += c;
102 ABCD[2] += b;
103 ABCD[3] += a;
104 }
105
106 void av_md5_init(AVMD5 *ctx){
107 ctx->len = 0;
108 ctx->b_used = 0;
109
110 ctx->ABCD[0] = 0x10325476;
111 ctx->ABCD[1] = 0x98badcfe;
112 ctx->ABCD[2] = 0xefcdab89;
113 ctx->ABCD[3] = 0x67452301;
114 }
115
116 void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len){
117 int i;
118
119 ctx->len += len;
120
121 for( i = 0; i < len; i++ ){
122 ctx->block[ ctx->b_used++ ] = src[i];
123 if( 64 == ctx->b_used ){
124 body(ctx->ABCD, (const uint32_t*) ctx->block);
125 ctx->b_used = 0;
126 }
127 }
128 }
129
130 void av_md5_final(AVMD5 *ctx, uint8_t *dst){
131 int i;
132
133 ctx->block[ctx->b_used++] = 0x80;
134
135 memset(&ctx->block[ctx->b_used], 0, 64 - ctx->b_used);
136
137 if( 56 < ctx->b_used ){
138 body( ctx->ABCD, (const uint32_t*) ctx->block );
139 memset(ctx->block, 0, 64);
140 }
141
142 for(i=0; i<8; i++)
143 ctx->block[56+i] = (ctx->len << 3) >> (i<<3);
144
145 body(ctx->ABCD, (const uint32_t*) ctx->block);
146
147 for(i=0; i<4; i++)
148 ((uint32_t*)dst)[i]= le2me_32(ctx->ABCD[3-i]);
149 }
150
151 void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len){
152 AVMD5 ctx[1];
153
154 av_md5_init(ctx);
155 av_md5_update(ctx, src, len);
156 av_md5_final(ctx, dst);
157 }
158
159 #ifdef TEST
160 #include <stdio.h>
161 main(){
162 uint64_t md5val;
163 int i;
164 uint8_t in[1000];
165
166 for(i=0; i<1000; i++) in[i]= i*i;
167 av_md5_sum( (uint8_t*)&md5val, in, 1000); printf("%lld\n", md5val);
168 av_md5_sum( (uint8_t*)&md5val, in, 63); printf("%lld\n", md5val);
169 av_md5_sum( (uint8_t*)&md5val, in, 64); printf("%lld\n", md5val);
170 av_md5_sum( (uint8_t*)&md5val, in, 65); printf("%lld\n", md5val);
171 for(i=0; i<1000; i++) in[i]= i % 127;
172 av_md5_sum( (uint8_t*)&md5val, in, 999); printf("%lld\n", md5val);
173 }
174 #endif