Statistics
| Branch: | Revision:

ffmpeg / libavutil / md5.c @ f1505ce3

History | View | Annotate | Download (5.19 KB)

1
/*
2
 * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
3
 * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
4
 *
5
 * This file is part of FFmpeg.
6
 *
7
 * FFmpeg is free software; you can redistribute it and/or
8
 * modify it under the terms of the GNU Lesser General Public
9
 * License as published by the Free Software Foundation; either
10
 * version 2.1 of the License, or (at your option) any later version.
11
 *
12
 * FFmpeg 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 GNU
15
 * Lesser General Public License for more details.
16
 *
17
 * You should have received a copy of the GNU Lesser General Public
18
 * License along with FFmpeg; if not, write to the Free Software
19
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
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
30
 * strongly recommended
31
 */
32

    
33
#include "common.h"
34
#include <string.h>
35
#include "md5.h"
36

    
37
typedef struct AVMD5{
38
    uint64_t len;
39
    uint8_t  block[64];
40
    uint32_t ABCD[4];
41
} AVMD5;
42

    
43
const int av_md5_size= sizeof(AVMD5);
44

    
45
static const uint8_t S[4][4] = {
46
    { 7, 12, 17, 22 },  /* Round 1 */
47
    { 5,  9, 14, 20 },  /* Round 2 */
48
    { 4, 11, 16, 23 },  /* Round 3 */
49
    { 6, 10, 15, 21 }   /* Round 4 */
50
};
51

    
52
static const uint32_t T[64] = { // T[i]= fabs(sin(i+1)<<32)
53
    0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,   /* Round 1 */
54
    0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
55
    0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
56
    0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
57

    
58
    0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,   /* Round 2 */
59
    0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
60
    0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
61
    0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
62

    
63
    0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,   /* Round 3 */
64
    0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
65
    0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
66
    0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
67

    
68
    0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,   /* Round 4 */
69
    0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
70
    0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
71
    0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
72
};
73

    
74
#define CORE(i, a, b, c, d) \
75
        t = S[i>>4][i&3];\
76
        a += T[i];\
77
\
78
        switch(i>>4){\
79
        case 0: a += (d ^ (b&(c^d))) + X[      i &15 ]; break;\
80
        case 1: a += (c ^ (d&(c^b))) + X[ (1+5*i)&15 ]; break;\
81
        case 2: a += (b^c^d)         + X[ (5+3*i)&15 ]; break;\
82
        case 3: a += (c^(b|~d))      + X[ (  7*i)&15 ]; break;\
83
        }\
84
        a = b + (( a << t ) | ( a >> (32 - t) ));
85

    
86
static void body(uint32_t ABCD[4], uint32_t X[16]){
87

    
88
    int t;
89
    int i attribute_unused;
90
    unsigned int a= ABCD[3];
91
    unsigned int b= ABCD[2];
92
    unsigned int c= ABCD[1];
93
    unsigned int d= ABCD[0];
94

    
95
#ifdef WORDS_BIGENDIAN
96
    for(i=0; i<16; i++)
97
        X[i]= bswap_32(X[i]);
98
#endif
99

    
100
#ifdef CONFIG_SMALL
101
    for( i = 0; i < 64; i++ ){
102
        CORE(i,a,b,c,d)
103
        t=d; d=c; c=b; b=a; a=t;
104
    }
105
#else
106
#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)
107
#define CORE4(i) CORE2(i) CORE2((i+4)) CORE2((i+8)) CORE2((i+12))
108
CORE4(0) CORE4(16) CORE4(32) CORE4(48)
109
#endif
110

    
111
    ABCD[0] += d;
112
    ABCD[1] += c;
113
    ABCD[2] += b;
114
    ABCD[3] += a;
115
}
116

    
117
void av_md5_init(AVMD5 *ctx){
118
    ctx->len    = 0;
119

    
120
    ctx->ABCD[0] = 0x10325476;
121
    ctx->ABCD[1] = 0x98badcfe;
122
    ctx->ABCD[2] = 0xefcdab89;
123
    ctx->ABCD[3] = 0x67452301;
124
}
125

    
126
void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len){
127
    int i, j;
128

    
129
    j= ctx->len & 63;
130
    ctx->len += len;
131

    
132
    for( i = 0; i < len; i++ ){
133
        ctx->block[j++] = src[i];
134
        if( 64 == j ){
135
            body(ctx->ABCD, (uint32_t*) ctx->block);
136
            j = 0;
137
        }
138
    }
139
}
140

    
141
void av_md5_final(AVMD5 *ctx, uint8_t *dst){
142
    int i;
143
    uint64_t finalcount= le2me_64(ctx->len<<3);
144

    
145
    av_md5_update(ctx, "\200", 1);
146
    while((ctx->len & 63)<56)
147
        av_md5_update(ctx, "", 1);
148

    
149
    av_md5_update(ctx, &finalcount, 8);
150

    
151
    for(i=0; i<4; i++)
152
        ((uint32_t*)dst)[i]= le2me_32(ctx->ABCD[3-i]);
153
}
154

    
155
void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len){
156
    AVMD5 ctx[1];
157

    
158
    av_md5_init(ctx);
159
    av_md5_update(ctx, src, len);
160
    av_md5_final(ctx, dst);
161
}
162

    
163
#ifdef TEST
164
#include <stdio.h>
165
#undef printf
166
main(){
167
    uint64_t md5val;
168
    int i;
169
    uint8_t in[1000];
170

    
171
    for(i=0; i<1000; i++) in[i]= i*i;
172
    av_md5_sum( (uint8_t*)&md5val, in,  1000); printf("%"PRId64"\n", md5val);
173
    av_md5_sum( (uint8_t*)&md5val, in,  63); printf("%"PRId64"\n", md5val);
174
    av_md5_sum( (uint8_t*)&md5val, in,  64); printf("%"PRId64"\n", md5val);
175
    av_md5_sum( (uint8_t*)&md5val, in,  65); printf("%"PRId64"\n", md5val);
176
    for(i=0; i<1000; i++) in[i]= i % 127;
177
    av_md5_sum( (uint8_t*)&md5val, in,  999); printf("%"PRId64"\n", md5val);
178
}
179
#endif