Mercurial > libavutil.hg
annotate sha1.c @ 448:41603959875e libavutil
Disentangle nested preprocessor directives.
author | diego |
---|---|
date | Wed, 13 Feb 2008 08:08:03 +0000 |
parents | 81f4d434dc96 |
children | 880c6441f56a |
rev | line source |
---|---|
351 | 1 /* |
2 * Copyright (C) 2007 Michael Niedermayer <michaelni@gmx.at> | |
3 * based on public domain SHA-1 code by Steve Reid <steve@edmweb.com> | |
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 */ | |
288 | 21 |
22 #include "common.h" | |
332 | 23 #include "bswap.h" |
288 | 24 #include "sha1.h" |
25 | |
26 typedef struct AVSHA1 { | |
27 uint64_t count; | |
28 uint8_t buffer[64]; | |
309
0498b2f2851a
put state[5] last so no padding is needed on arch where uint64_t needs 8byte alignment
michael
parents:
308
diff
changeset
|
29 uint32_t state[5]; |
288 | 30 } AVSHA1; |
31 | |
406 | 32 const int av_sha1_size = sizeof(AVSHA1); |
33 | |
288 | 34 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) |
35 | |
36 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ | |
446 | 37 #define blk0(i) (block[i] = be2me_32(((const uint32_t*)buffer)[i])) |
301 | 38 #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1)) |
39 | |
40 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); | |
41 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30); | |
42 #define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); | |
43 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); | |
44 #define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30); | |
288 | 45 |
46 /* Hash a single 512-bit block. This is the core of the algorithm. */ | |
47 | |
446 | 48 static void transform(uint32_t state[5], const 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
|
49 uint32_t block[80]; |
308 | 50 unsigned int i, a, b, c, d, e; |
290
8f02801da0f8
its faster to copy the data to the stack it seems ...
michael
parents:
289
diff
changeset
|
51 |
288 | 52 a = state[0]; |
53 b = state[1]; | |
54 c = state[2]; | |
55 d = state[3]; | |
56 e = state[4]; | |
310 | 57 #ifdef CONFIG_SMALL |
302 | 58 for(i=0; i<80; i++){ |
306 | 59 int t; |
60 if(i<16) t= be2me_32(((uint32_t*)buffer)[i]); | |
61 else t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1); | |
62 block[i]= t; | |
63 t+= e+rol(a,5); | |
302 | 64 if(i<40){ |
65 if(i<20) t+= ((b&(c^d))^d) +0x5A827999; | |
66 else t+= ( b^c ^d) +0x6ED9EBA1; | |
67 }else{ | |
68 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC; | |
69 else t+= ( b^c ^d) +0xCA62C1D6; | |
70 } | |
299 | 71 e= d; |
72 d= c; | |
73 c= rol(b,30); | |
74 b= a; | |
75 a= t; | |
76 } | |
77 #else | |
301 | 78 for(i=0; i<15; i+=5){ |
288 | 79 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); |
80 } | |
301 | 81 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); |
82 for(i=20; i<40; i+=5){ | |
288 | 83 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); |
84 } | |
85 for(; i<60; i+=5){ | |
86 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); | |
87 } | |
88 for(; i<80; i+=5){ | |
89 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); | |
90 } | |
299 | 91 #endif |
288 | 92 state[0] += a; |
93 state[1] += b; | |
94 state[2] += c; | |
95 state[3] += d; | |
96 state[4] += e; | |
97 } | |
98 | |
315 | 99 void av_sha1_init(AVSHA1* ctx){ |
100 ctx->state[0] = 0x67452301; | |
101 ctx->state[1] = 0xEFCDAB89; | |
102 ctx->state[2] = 0x98BADCFE; | |
103 ctx->state[3] = 0x10325476; | |
104 ctx->state[4] = 0xC3D2E1F0; | |
105 ctx->count = 0; | |
288 | 106 } |
107 | |
446 | 108 void av_sha1_update(AVSHA1* ctx, const uint8_t* data, unsigned int len){ |
288 | 109 unsigned int i, j; |
110 | |
315 | 111 j = ctx->count & 63; |
112 ctx->count += len; | |
311 | 113 #ifdef CONFIG_SMALL |
114 for( i = 0; i < len; i++ ){ | |
315 | 115 ctx->buffer[ j++ ] = data[i]; |
311 | 116 if( 64 == j ){ |
315 | 117 transform(ctx->state, ctx->buffer); |
311 | 118 j = 0; |
119 } | |
120 } | |
121 #else | |
288 | 122 if ((j + len) > 63) { |
315 | 123 memcpy(&ctx->buffer[j], data, (i = 64-j)); |
124 transform(ctx->state, ctx->buffer); | |
288 | 125 for ( ; i + 63 < len; i += 64) { |
315 | 126 transform(ctx->state, &data[i]); |
288 | 127 } |
304 | 128 j=0; |
288 | 129 } |
130 else i = 0; | |
315 | 131 memcpy(&ctx->buffer[j], &data[i], len - i); |
311 | 132 #endif |
288 | 133 } |
134 | |
315 | 135 void av_sha1_final(AVSHA1* ctx, uint8_t digest[20]){ |
288 | 136 int i; |
315 | 137 uint64_t finalcount= be2me_64(ctx->count<<3); |
288 | 138 |
315 | 139 av_sha1_update(ctx, "\200", 1); |
140 while ((ctx->count & 63) != 56) { | |
141 av_sha1_update(ctx, "", 1); | |
288 | 142 } |
407
7390e0fc2fd3
kill a warning, av_sha1_update accepts uint8_t * not uint64_t *
lu_zero
parents:
406
diff
changeset
|
143 av_sha1_update(ctx, (uint8_t *)&finalcount, 8); /* Should cause a transform() */ |
295 | 144 for(i=0; i<5; i++) |
315 | 145 ((uint32_t*)digest)[i]= be2me_32(ctx->state[i]); |
288 | 146 } |
147 | |
289 | 148 // use the following to test |
292 | 149 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1 |
288 | 150 #ifdef TEST |
151 #include <stdio.h> | |
152 #undef printf | |
153 | |
404 | 154 int main(void){ |
288 | 155 int i, k; |
315 | 156 AVSHA1 ctx; |
288 | 157 unsigned char digest[20]; |
158 | |
159 for(k=0; k<3; k++){ | |
315 | 160 av_sha1_init(&ctx); |
288 | 161 if(k==0) |
315 | 162 av_sha1_update(&ctx, "abc", 3); |
288 | 163 else if(k==1) |
315 | 164 av_sha1_update(&ctx, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56); |
288 | 165 else |
166 for(i=0; i<1000*1000; i++) | |
315 | 167 av_sha1_update(&ctx, "a", 1); |
168 av_sha1_final(&ctx, digest); | |
288 | 169 for (i = 0; i < 20; i++) |
170 printf("%02X", digest[i]); | |
171 putchar('\n'); | |
172 } | |
173 //Test Vectors (from FIPS PUB 180-1) | |
174 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n" | |
175 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n" | |
176 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n"); | |
177 | |
178 return 0; | |
179 } | |
180 #endif |