annotate sha1.c @ 305:18d523d5c838 libavutil

remove middle variant (keep fastest and smallest)
author michael
date Tue, 13 Mar 2007 10:36:49 +0000
parents a9cd369e2c4b
children d66e1c3838d7
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
1 // SHA-1 code Copyright 2007 Michael Nidermayer <michaelni@gmx.at>
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
2 // license LGPL
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
3 // based on public domain SHA-1 code by Steve Reid <steve@edmweb.com>
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
4
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
5 #include "common.h"
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
6 #include "sha1.h"
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
7
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
8 typedef struct AVSHA1 {
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
9 uint32_t state[5];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
10 uint64_t count;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
11 uint8_t buffer[64];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
12 } AVSHA1;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
13
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
14 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
15
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
16 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
301
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
17 #define blk0(i) (block[i] = be2me_32(block[i]))
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
18 #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
19
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
20 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
21 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30);
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
22 #define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
23 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
24 #define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
25
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
26 /* Hash a single 512-bit block. This is the core of the algorithm. */
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
27
299
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
28 //#define VARIANT2
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
29
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
30 static void transform(uint32_t state[5], uint8_t buffer[64]){
291
78b11473f66a avoid silly ring buffer logic (faster with -O2, -O3 is always slower then -O2)
michael
parents: 290
diff changeset
31 uint32_t block[80];
299
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
32 unsigned int i;
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
33 unsigned int a, b, c, d, e;
290
8f02801da0f8 its faster to copy the data to the stack it seems ...
michael
parents: 289
diff changeset
34
305
18d523d5c838 remove middle variant (keep fastest and smallest)
michael
parents: 304
diff changeset
35 #if defined (VARIANT2)
296
5a85142df236 10% smaller object file, 2% slower
michael
parents: 295
diff changeset
36 for(i=0; i<16; i++)
5a85142df236 10% smaller object file, 2% slower
michael
parents: 295
diff changeset
37 block[i]= be2me_32(((uint32_t*)buffer)[i]);
5a85142df236 10% smaller object file, 2% slower
michael
parents: 295
diff changeset
38 for(;i<80; i++)
5a85142df236 10% smaller object file, 2% slower
michael
parents: 295
diff changeset
39 block[i]= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
301
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
40 #else
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
41 memcpy(block, buffer, 64);
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
42 #endif
290
8f02801da0f8 its faster to copy the data to the stack it seems ...
michael
parents: 289
diff changeset
43
299
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
44
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
45 a = state[0];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
46 b = state[1];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
47 c = state[2];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
48 d = state[3];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
49 e = state[4];
299
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
50 #ifdef VARIANT2
302
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
51 for(i=0; i<80; i++){
303
5b46b6b71fe2 double ;;
michael
parents: 302
diff changeset
52 int t= e+block[i]+rol(a,5);
302
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
53 if(i<40){
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
54 if(i<20) t+= ((b&(c^d))^d) +0x5A827999;
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
55 else t+= ( b^c ^d) +0x6ED9EBA1;
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
56 }else{
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
57 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC;
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
58 else t+= ( b^c ^d) +0xCA62C1D6;
901256787a89 factorize VARIANT2 (smaller and slower)
michael
parents: 301
diff changeset
59 }
299
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
60 e= d;
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
61 d= c;
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
62 c= rol(b,30);
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
63 b= a;
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
64 a= t;
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
65 }
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
66 #else
301
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
67 for(i=0; i<15; i+=5){
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
68 R0(a,b,c,d,e,0+i); R0(e,a,b,c,d,1+i); R0(d,e,a,b,c,2+i); R0(c,d,e,a,b,3+i); R0(b,c,d,e,a,4+i);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
69 }
301
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
70 R0(a,b,c,d,e,15); R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
b1c6f2421786 revert 2% speed loss change (r8360)
michael
parents: 300
diff changeset
71 for(i=20; i<40; i+=5){
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
72 R2(a,b,c,d,e,0+i); R2(e,a,b,c,d,1+i); R2(d,e,a,b,c,2+i); R2(c,d,e,a,b,3+i); R2(b,c,d,e,a,4+i);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
73 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
74 for(; i<60; i+=5){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
75 R3(a,b,c,d,e,0+i); R3(e,a,b,c,d,1+i); R3(d,e,a,b,c,2+i); R3(c,d,e,a,b,3+i); R3(b,c,d,e,a,4+i);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
76 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
77 for(; i<80; i+=5){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
78 R4(a,b,c,d,e,0+i); R4(e,a,b,c,d,1+i); R4(d,e,a,b,c,2+i); R4(c,d,e,a,b,3+i); R4(b,c,d,e,a,4+i);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
79 }
299
5c84cfeb69a9 2 other variants of how to implement the core part
michael
parents: 298
diff changeset
80 #endif
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
81 state[0] += a;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
82 state[1] += b;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
83 state[2] += c;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
84 state[3] += d;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
85 state[4] += e;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
86 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
87
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
88 void av_sha1_init(AVSHA1* context){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
89 context->state[0] = 0x67452301;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
90 context->state[1] = 0xEFCDAB89;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
91 context->state[2] = 0x98BADCFE;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
92 context->state[3] = 0x10325476;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
93 context->state[4] = 0xC3D2E1F0;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
94 context->count = 0;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
95 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
96
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
97 void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
98 unsigned int i, j;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
99
294
97f5321b12ad make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents: 293
diff changeset
100 j = context->count & 63;
97f5321b12ad make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents: 293
diff changeset
101 context->count += len;
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
102 if ((j + len) > 63) {
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
103 memcpy(&context->buffer[j], data, (i = 64-j));
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
104 transform(context->state, context->buffer);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
105 for ( ; i + 63 < len; i += 64) {
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
106 transform(context->state, &data[i]);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
107 }
304
michael
parents: 303
diff changeset
108 j=0;
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
109 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
110 else i = 0;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
111 memcpy(&context->buffer[j], &data[i], len - i);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
112 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
113
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
114 void av_sha1_final(AVSHA1* context, uint8_t digest[20]){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
115 int i;
294
97f5321b12ad make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents: 293
diff changeset
116 uint64_t finalcount= be2me_64(context->count<<3);
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
117
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
118 av_sha1_update(context, "\200", 1);
294
97f5321b12ad make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents: 293
diff changeset
119 while ((context->count & 63) != 56) {
300
0ac5f1000ed1 zero byte idea by rich
michael
parents: 299
diff changeset
120 av_sha1_update(context, "", 1);
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
121 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
122 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */
295
e96e6ae1c3fa very slightly smaller object file
michael
parents: 294
diff changeset
123 for(i=0; i<5; i++)
e96e6ae1c3fa very slightly smaller object file
michael
parents: 294
diff changeset
124 ((uint32_t*)digest)[i]= be2me_32(context->state[i]);
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
125 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
126
289
18a98b19af3f explain how to test it
michael
parents: 288
diff changeset
127 // use the following to test
292
d1f03d9014cb dont recommand testing with -O3
michael
parents: 291
diff changeset
128 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1
288
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
129 #ifdef TEST
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
130 #include <stdio.h>
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
131 #undef printf
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
132
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
133 int main(){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
134 int i, k;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
135 AVSHA1 context;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
136 unsigned char digest[20];
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
137
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
138 for(k=0; k<3; k++){
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
139 av_sha1_init(&context);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
140 if(k==0)
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
141 av_sha1_update(&context, "abc", 3);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
142 else if(k==1)
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
143 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
144 else
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
145 for(i=0; i<1000*1000; i++)
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
146 av_sha1_update(&context, "a", 1);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
147 av_sha1_final(&context, digest);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
148 for (i = 0; i < 20; i++)
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
149 printf("%02X", digest[i]);
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
150 putchar('\n');
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
151 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
152 //Test Vectors (from FIPS PUB 180-1)
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
153 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
154 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
155 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
156
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
157 return 0;
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
158 }
c82b7b95e69d simple SHA-1 implementation
michael
parents:
diff changeset
159 #endif