Revision 94d85eaf

View differences:

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
static void body(uint32_t ABCD[4], const uint32_t X[16]){
73
    int i, t;
74
    unsigned int a= ABCD[3];
75
    unsigned int b= ABCD[2];
76
    unsigned int c= ABCD[1];
77
    unsigned int d= ABCD[0];
78

  
79
#ifdef WORDS_BIGENDIAN
80
    for(i=0; i<16; i++)
81
        X[i]= bswap_32(X[i]);
82
#endif
83

  
84
#ifdef CONFIG_SMALL
85
    for( i = 0; i < 64; i++ ){
86
        CORE(i,a,b,c,d)
87
        t=d; d=c; c=b; b=a; a=t;
88
    }
89
#else
90
#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)
91
#define CORE4(i) CORE2(i) CORE2((i+4)) CORE2((i+8)) CORE2((i+12))
92
CORE4(0) CORE4(16) CORE4(32) CORE4(48)
93
#endif
94

  
95
    ABCD[0] += d;
96
    ABCD[1] += c;
97
    ABCD[2] += b;
98
    ABCD[3] += a;
99
}
100

  
101
void av_md5_init(AVMD5 *ctx){
102
    ctx->len    = 0;
103
    ctx->b_used = 0;
104

  
105
    ctx->ABCD[0] = 0x10325476;
106
    ctx->ABCD[1] = 0x98badcfe;
107
    ctx->ABCD[2] = 0xefcdab89;
108
    ctx->ABCD[3] = 0x67452301;
109
}
110

  
111
void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len){
112
    int i;
113

  
114
    ctx->len += len;
115

  
116
    for( i = 0; i < len; i++ ){
117
        ctx->block[ ctx->b_used++ ] = src[i];
118
        if( 64 == ctx->b_used ){
119
            body(ctx->ABCD, ctx->block);
120
            ctx->b_used = 0;
121
        }
122
    }
123
}
124

  
125
void av_md5_final(AVMD5 *ctx, uint8_t *dst){
126
    int i;
127

  
128
    ctx->block[ctx->b_used++] = 0x80;
129

  
130
    memset(&ctx->block[ctx->b_used], 0, 64 - ctx->b_used);
131

  
132
    if( 56 < ctx->b_used ){
133
        body( ctx->ABCD, ctx->block );
134
        memset(ctx->block, 0, 64);
135
    }
136

  
137
    for(i=0; i<8; i++)
138
        ctx->block[56+i] = (ctx->len << 3) >> (i<<3);
139

  
140
    body(ctx->ABCD, ctx->block);
141

  
142
#define le2me_32(a) a
143
    for(i=0; i<4; i++)
144
        ((uint32_t*)dst)[i]= le2me_32(ctx->ABCD[3-i]);
145
}
146

  
147
void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len){
148
    AVMD5 ctx[1];
149

  
150
    av_md5_init(ctx);
151
    av_md5_update(ctx, src, len);
152
    av_md5_final(ctx, dst);
153
}
154

  
155
#ifdef TEST
156
#include <stdio.h>
157
main(){
158
    uint64_t md5val;
159
    int i;
160
    uint8_t in[1000];
161

  
162
    for(i=0; i<1000; i++) in[i]= i*i;
163
    av_md5_sum( (uint8_t*)&md5val, in,  1000); printf("%lld\n", md5val);
164
    av_md5_sum( (uint8_t*)&md5val, in,  63); printf("%lld\n", md5val);
165
    av_md5_sum( (uint8_t*)&md5val, in,  64); printf("%lld\n", md5val);
166
    av_md5_sum( (uint8_t*)&md5val, in,  65); printf("%lld\n", md5val);
167
    for(i=0; i<1000; i++) in[i]= i % 127;
168
    av_md5_sum( (uint8_t*)&md5val, in,  999); printf("%lld\n", md5val);
169
}
170
#endif
libavutil/md5.h
1
#ifndef MD5_H
2
#define MD5_H
3

  
4
extern const av_md5_size;
5

  
6
struct AVMD5;
7

  
8
void av_md5_init(struct AVMD5 *ctx);
9
void av_md5_update(struct AVMD5 *ctx, const uint8_t *src, const int len);
10
void av_md5_final(struct AVMD5 *ctx, uint8_t *dst);
11

  
12
#endif /* MD5_H */
13

  

Also available in: Unified diff