Mercurial > libavutil.hg
annotate md5.c @ 116:d76a36742464 libavutil
Change license headers to say 'FFmpeg' instead of 'this program/this library'
and fix GPL/LGPL version mismatches.
author | diego |
---|---|
date | Sat, 07 Oct 2006 15:30:46 +0000 |
parents | f40e091f7716 |
children | d94fb7e6cb53 |
rev | line source |
---|---|
45 | 1 /* |
2 * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at) | |
3 * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org) | |
59 | 4 * |
116
d76a36742464
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
59
diff
changeset
|
5 * This file is part of FFmpeg. |
d76a36742464
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
59
diff
changeset
|
6 * |
d76a36742464
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
59
diff
changeset
|
7 * FFmpeg is free software; you can redistribute it and/or |
59 | 8 * modify it under the terms of the GNU Lesser General Public |
9 * License as published by the Free Software Foundation; either | |
116
d76a36742464
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
59
diff
changeset
|
10 * version 2.1 of the License, or (at your option) any later version. |
59 | 11 * |
116
d76a36742464
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
59
diff
changeset
|
12 * FFmpeg is distributed in the hope that it will be useful, |
59 | 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
15 * Lesser General Public License for more details. | |
16 * | |
17 * You should have received a copy of the GNU Lesser General Public | |
116
d76a36742464
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
59
diff
changeset
|
18 * License along with FFmpeg; if not, write to the Free Software |
59 | 19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
45 | 20 * |
21 * References: | |
22 * IETF RFC 1321: The MD5 Message-Digest Algorithm | |
23 * Ron Rivest. IETF, April, 1992 | |
24 * | |
25 * based on http://ubiqx.org/libcifs/source/Auth/MD5.c | |
26 * from Christopher R. Hertel (crh@ubiqx.mn.org) | |
27 * simplified, cleaned and IMO redundant comments removed by michael | |
28 * | |
29 * if you use gcc, then version 4.1 or later and -fomit-frame-pointer is | |
58 | 30 * strongly recommended |
45 | 31 */ |
32 | |
33 #include "common.h" | |
34 #include <string.h> | |
35 #include "md5.h" | |
36 | |
37 typedef struct AVMD5{ | |
38 uint8_t block[64]; | |
39 uint32_t ABCD[4]; | |
40 uint64_t len; | |
41 int b_used; | |
42 } AVMD5; | |
43 | |
44 const int av_md5_size= sizeof(AVMD5); | |
45 | |
46 static const uint8_t S[4][4] = { | |
47 { 7, 12, 17, 22 }, /* Round 1 */ | |
48 { 5, 9, 14, 20 }, /* Round 2 */ | |
49 { 4, 11, 16, 23 }, /* Round 3 */ | |
50 { 6, 10, 15, 21 } /* Round 4 */ | |
51 }; | |
52 | |
53 static const uint32_t T[64] = { | |
54 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* Round 1 */ | |
55 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501, | |
56 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, | |
57 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821, | |
58 | |
59 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* Round 2 */ | |
60 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8, | |
61 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, | |
62 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, | |
63 | |
64 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* Round 3 */ | |
65 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, | |
66 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, | |
67 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665, | |
68 | |
69 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* Round 4 */ | |
70 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1, | |
71 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, | |
72 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391, | |
73 }; | |
74 | |
75 #define CORE(i, a, b, c, d) \ | |
76 t = S[i>>4][i&3];\ | |
77 a += T[i];\ | |
78 \ | |
79 switch(i>>4){\ | |
49 | 80 case 0: a += (d ^ (b&(c^d))) + X[ i &15 ]; break;\ |
81 case 1: a += (c ^ (d&(c^b))) + X[ (1+5*i)&15 ]; break;\ | |
82 case 2: a += (b^c^d) + X[ (5+3*i)&15 ]; break;\ | |
83 case 3: a += (c^(b|~d)) + X[ ( 7*i)&15 ]; break;\ | |
45 | 84 }\ |
85 a = b + (( a << t ) | ( a >> (32 - t) )); | |
86 | |
51 | 87 static void body(uint32_t ABCD[4], uint32_t X[16]){ |
53 | 88 |
49 | 89 int t; |
50 | 90 int i attribute_unused; |
45 | 91 unsigned int a= ABCD[3]; |
92 unsigned int b= ABCD[2]; | |
93 unsigned int c= ABCD[1]; | |
94 unsigned int d= ABCD[0]; | |
95 | |
96 #ifdef WORDS_BIGENDIAN | |
97 for(i=0; i<16; i++) | |
98 X[i]= bswap_32(X[i]); | |
99 #endif | |
100 | |
101 #ifdef CONFIG_SMALL | |
102 for( i = 0; i < 64; i++ ){ | |
103 CORE(i,a,b,c,d) | |
104 t=d; d=c; c=b; b=a; a=t; | |
105 } | |
106 #else | |
107 #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) | |
108 #define CORE4(i) CORE2(i) CORE2((i+4)) CORE2((i+8)) CORE2((i+12)) | |
109 CORE4(0) CORE4(16) CORE4(32) CORE4(48) | |
110 #endif | |
111 | |
112 ABCD[0] += d; | |
113 ABCD[1] += c; | |
114 ABCD[2] += b; | |
115 ABCD[3] += a; | |
116 } | |
117 | |
118 void av_md5_init(AVMD5 *ctx){ | |
119 ctx->len = 0; | |
120 ctx->b_used = 0; | |
121 | |
122 ctx->ABCD[0] = 0x10325476; | |
123 ctx->ABCD[1] = 0x98badcfe; | |
124 ctx->ABCD[2] = 0xefcdab89; | |
125 ctx->ABCD[3] = 0x67452301; | |
126 } | |
127 | |
128 void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len){ | |
129 int i; | |
130 | |
131 ctx->len += len; | |
132 | |
133 for( i = 0; i < len; i++ ){ | |
134 ctx->block[ ctx->b_used++ ] = src[i]; | |
135 if( 64 == ctx->b_used ){ | |
53 | 136 body(ctx->ABCD, (uint32_t*) ctx->block); |
45 | 137 ctx->b_used = 0; |
138 } | |
139 } | |
140 } | |
141 | |
142 void av_md5_final(AVMD5 *ctx, uint8_t *dst){ | |
143 int i; | |
144 | |
145 ctx->block[ctx->b_used++] = 0x80; | |
146 | |
147 memset(&ctx->block[ctx->b_used], 0, 64 - ctx->b_used); | |
148 | |
149 if( 56 < ctx->b_used ){ | |
53 | 150 body( ctx->ABCD, (uint32_t*) ctx->block ); |
45 | 151 memset(ctx->block, 0, 64); |
152 } | |
153 | |
154 for(i=0; i<8; i++) | |
155 ctx->block[56+i] = (ctx->len << 3) >> (i<<3); | |
156 | |
53 | 157 body(ctx->ABCD, (uint32_t*) ctx->block); |
45 | 158 |
159 for(i=0; i<4; i++) | |
160 ((uint32_t*)dst)[i]= le2me_32(ctx->ABCD[3-i]); | |
161 } | |
162 | |
163 void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len){ | |
164 AVMD5 ctx[1]; | |
165 | |
166 av_md5_init(ctx); | |
167 av_md5_update(ctx, src, len); | |
168 av_md5_final(ctx, dst); | |
169 } | |
170 | |
171 #ifdef TEST | |
172 #include <stdio.h> | |
173 main(){ | |
174 uint64_t md5val; | |
175 int i; | |
176 uint8_t in[1000]; | |
177 | |
178 for(i=0; i<1000; i++) in[i]= i*i; | |
179 av_md5_sum( (uint8_t*)&md5val, in, 1000); printf("%lld\n", md5val); | |
180 av_md5_sum( (uint8_t*)&md5val, in, 63); printf("%lld\n", md5val); | |
181 av_md5_sum( (uint8_t*)&md5val, in, 64); printf("%lld\n", md5val); | |
182 av_md5_sum( (uint8_t*)&md5val, in, 65); printf("%lld\n", md5val); | |
183 for(i=0; i<1000; i++) in[i]= i % 127; | |
184 av_md5_sum( (uint8_t*)&md5val, in, 999); printf("%lld\n", md5val); | |
185 } | |
186 #endif |