| 1 |
/* crypto/sha/sha1dgst.c */ |
| 2 |
/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) |
| 3 |
* All rights reserved. |
| 4 |
* |
| 5 |
* This package is an SSL implementation written |
| 6 |
* by Eric Young (eay@cryptsoft.com). |
| 7 |
* The implementation was written so as to conform with Netscapes SSL. |
| 8 |
* |
| 9 |
* This library is free for commercial and non-commercial use as long as |
| 10 |
* the following conditions are aheared to. The following conditions |
| 11 |
* apply to all code found in this distribution, be it the RC4, RSA, |
| 12 |
* lhash, DES, etc., code; not just the SSL code. The SSL documentation |
| 13 |
* included with this distribution is covered by the same copyright terms |
| 14 |
* except that the holder is Tim Hudson (tjh@cryptsoft.com). |
| 15 |
* |
| 16 |
* Copyright remains Eric Young's, and as such any Copyright notices in |
| 17 |
* the code are not to be removed. |
| 18 |
* If this package is used in a product, Eric Young should be given attribution |
| 19 |
* as the author of the parts of the library used. |
| 20 |
* This can be in the form of a textual message at program startup or |
| 21 |
* in documentation (online or textual) provided with the package. |
| 22 |
* |
| 23 |
* Redistribution and use in source and binary forms, with or without |
| 24 |
* modification, are permitted provided that the following conditions |
| 25 |
* are met: |
| 26 |
* 1. Redistributions of source code must retain the copyright |
| 27 |
* notice, this list of conditions and the following disclaimer. |
| 28 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 29 |
* notice, this list of conditions and the following disclaimer in the |
| 30 |
* documentation and/or other materials provided with the distribution. |
| 31 |
* 3. All advertising materials mentioning features or use of this software |
| 32 |
* must display the following acknowledgement: |
| 33 |
* "This product includes cryptographic software written by |
| 34 |
* Eric Young (eay@cryptsoft.com)" |
| 35 |
* The word 'cryptographic' can be left out if the rouines from the library |
| 36 |
* being used are not cryptographic related :-). |
| 37 |
* 4. If you include any Windows specific code (or a derivative thereof) from |
| 38 |
* the apps directory (application code) you must include an acknowledgement: |
| 39 |
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" |
| 40 |
* |
| 41 |
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
| 42 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 43 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 44 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 45 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 46 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 47 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 48 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 49 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 50 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 51 |
* SUCH DAMAGE. |
| 52 |
* |
| 53 |
* The licence and distribution terms for any publically available version or |
| 54 |
* derivative of this code cannot be changed. i.e. this code cannot simply be |
| 55 |
* copied and put under another distribution licence |
| 56 |
* [including the GNU Public Licence.] |
| 57 |
*/ |
| 58 |
|
| 59 |
#include <stdio.h> |
| 60 |
#include <string.h> |
| 61 |
#undef SHA_0 |
| 62 |
#define SHA_1 |
| 63 |
#include "sha.h" |
| 64 |
#include "sha_locl.h" |
| 65 |
|
| 66 |
/* char *SHA1_version="SHA1 part of SSLeay 0.8.2b 08-Jan-1998"; */ |
| 67 |
|
| 68 |
/* Implemented from SHA-1 document - The Secure Hash Algorithm |
| 69 |
*/ |
| 70 |
|
| 71 |
#define INIT_DATA_h0 (unsigned long)0x67452301L |
| 72 |
#define INIT_DATA_h1 (unsigned long)0xefcdab89L |
| 73 |
#define INIT_DATA_h2 (unsigned long)0x98badcfeL |
| 74 |
#define INIT_DATA_h3 (unsigned long)0x10325476L |
| 75 |
#define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L |
| 76 |
|
| 77 |
#define K_00_19 0x5a827999L |
| 78 |
#define K_20_39 0x6ed9eba1L |
| 79 |
#define K_40_59 0x8f1bbcdcL |
| 80 |
#define K_60_79 0xca62c1d6L |
| 81 |
|
| 82 |
#ifndef NOPROTO |
| 83 |
# ifdef SHA1_ASM |
| 84 |
void sha1_block_x86(SHA_CTX *c, register unsigned long *p, int num); |
| 85 |
# define sha1_block sha1_block_x86 |
| 86 |
# else |
| 87 |
void sha1_block(SHA_CTX *c, register unsigned long *p, int num); |
| 88 |
# endif |
| 89 |
#else |
| 90 |
# ifdef SHA1_ASM |
| 91 |
void sha1_block_x86(); |
| 92 |
# define sha1_block sha1_block_x86 |
| 93 |
# else |
| 94 |
void sha1_block(); |
| 95 |
# endif |
| 96 |
#endif |
| 97 |
|
| 98 |
#if defined(L_ENDIAN) && defined(SHA1_ASM) |
| 99 |
# define M_c2nl c2l |
| 100 |
# define M_p_c2nl p_c2l |
| 101 |
# define M_c2nl_p c2l_p |
| 102 |
# define M_p_c2nl_p p_c2l_p |
| 103 |
# define M_nl2c l2c |
| 104 |
#else |
| 105 |
# define M_c2nl c2nl |
| 106 |
# define M_p_c2nl p_c2nl |
| 107 |
# define M_c2nl_p c2nl_p |
| 108 |
# define M_p_c2nl_p p_c2nl_p |
| 109 |
# define M_nl2c nl2c |
| 110 |
#endif |
| 111 |
|
| 112 |
void SHA1_Init(c) |
| 113 |
SHA_CTX *c; |
| 114 |
{ |
| 115 |
c->h0=INIT_DATA_h0; |
| 116 |
c->h1=INIT_DATA_h1; |
| 117 |
c->h2=INIT_DATA_h2; |
| 118 |
c->h3=INIT_DATA_h3; |
| 119 |
c->h4=INIT_DATA_h4; |
| 120 |
c->Nl=0; |
| 121 |
c->Nh=0; |
| 122 |
c->num=0; |
| 123 |
} |
| 124 |
|
| 125 |
void SHA1_Update(c, data, len) |
| 126 |
SHA_CTX *c; |
| 127 |
register unsigned char *data; |
| 128 |
unsigned long len; |
| 129 |
{ |
| 130 |
register ULONG *p; |
| 131 |
int ew,ec,sw,sc; |
| 132 |
ULONG l; |
| 133 |
|
| 134 |
if (len == 0) return; |
| 135 |
|
| 136 |
l=(c->Nl+(len<<3))&0xffffffffL; |
| 137 |
if (l < c->Nl) /* overflow */ |
| 138 |
c->Nh++; |
| 139 |
c->Nh+=(len>>29); |
| 140 |
c->Nl=l; |
| 141 |
|
| 142 |
if (c->num != 0) |
| 143 |
{ |
| 144 |
p=c->data; |
| 145 |
sw=c->num>>2; |
| 146 |
sc=c->num&0x03; |
| 147 |
|
| 148 |
if ((c->num+len) >= SHA_CBLOCK) |
| 149 |
{ |
| 150 |
l= p[sw]; |
| 151 |
M_p_c2nl(data,l,sc); |
| 152 |
p[sw++]=l; |
| 153 |
for (; sw<SHA_LBLOCK; sw++) |
| 154 |
{ |
| 155 |
M_c2nl(data,l); |
| 156 |
p[sw]=l; |
| 157 |
} |
| 158 |
len-=(SHA_CBLOCK-c->num); |
| 159 |
|
| 160 |
sha1_block(c,p,64); |
| 161 |
c->num=0; |
| 162 |
/* drop through and do the rest */ |
| 163 |
} |
| 164 |
else |
| 165 |
{ |
| 166 |
c->num+=(int)len; |
| 167 |
if ((sc+len) < 4) /* ugly, add char's to a word */ |
| 168 |
{ |
| 169 |
l= p[sw]; |
| 170 |
M_p_c2nl_p(data,l,sc,len); |
| 171 |
p[sw]=l; |
| 172 |
} |
| 173 |
else |
| 174 |
{ |
| 175 |
ew=(c->num>>2); |
| 176 |
ec=(c->num&0x03); |
| 177 |
l= p[sw]; |
| 178 |
M_p_c2nl(data,l,sc); |
| 179 |
p[sw++]=l; |
| 180 |
for (; sw < ew; sw++) |
| 181 |
{ M_c2nl(data,l); p[sw]=l; } |
| 182 |
if (ec) |
| 183 |
{ |
| 184 |
M_c2nl_p(data,l,ec); |
| 185 |
p[sw]=l; |
| 186 |
} |
| 187 |
} |
| 188 |
return; |
| 189 |
} |
| 190 |
} |
| 191 |
/* We can only do the following code for assember, the reason |
| 192 |
* being that the sha1_block 'C' version changes the values |
| 193 |
* in the 'data' array. The assember code avoids this and |
| 194 |
* copies it to a local array. I should be able to do this for |
| 195 |
* the C version as well.... |
| 196 |
*/ |
| 197 |
#if 1 |
| 198 |
#if defined(B_ENDIAN) || defined(SHA1_ASM) |
| 199 |
if ((((unsigned int)data)%sizeof(ULONG)) == 0) |
| 200 |
{ |
| 201 |
sw=len/SHA_CBLOCK; |
| 202 |
if (sw) |
| 203 |
{ |
| 204 |
sw*=SHA_CBLOCK; |
| 205 |
sha1_block(c,(ULONG *)data,sw); |
| 206 |
data+=sw; |
| 207 |
len-=sw; |
| 208 |
} |
| 209 |
} |
| 210 |
#endif |
| 211 |
#endif |
| 212 |
/* we now can process the input data in blocks of SHA_CBLOCK |
| 213 |
* chars and save the leftovers to c->data. */ |
| 214 |
p=c->data; |
| 215 |
while (len >= SHA_CBLOCK) |
| 216 |
{ |
| 217 |
#if defined(B_ENDIAN) || defined(L_ENDIAN) |
| 218 |
if (p != (unsigned long *)data) |
| 219 |
memcpy(p,data,SHA_CBLOCK); |
| 220 |
data+=SHA_CBLOCK; |
| 221 |
# ifdef L_ENDIAN |
| 222 |
# ifndef SHA1_ASM /* Will not happen */ |
| 223 |
for (sw=(SHA_LBLOCK/4); sw; sw--) |
| 224 |
{ |
| 225 |
Endian_Reverse32(p[0]); |
| 226 |
Endian_Reverse32(p[1]); |
| 227 |
Endian_Reverse32(p[2]); |
| 228 |
Endian_Reverse32(p[3]); |
| 229 |
p+=4; |
| 230 |
} |
| 231 |
p=c->data; |
| 232 |
# endif |
| 233 |
# endif |
| 234 |
#else |
| 235 |
for (sw=(SHA_BLOCK/4); sw; sw--) |
| 236 |
{ |
| 237 |
M_c2nl(data,l); *(p++)=l; |
| 238 |
M_c2nl(data,l); *(p++)=l; |
| 239 |
M_c2nl(data,l); *(p++)=l; |
| 240 |
M_c2nl(data,l); *(p++)=l; |
| 241 |
} |
| 242 |
p=c->data; |
| 243 |
#endif |
| 244 |
sha1_block(c,p,64); |
| 245 |
len-=SHA_CBLOCK; |
| 246 |
} |
| 247 |
ec=(int)len; |
| 248 |
c->num=ec; |
| 249 |
ew=(ec>>2); |
| 250 |
ec&=0x03; |
| 251 |
|
| 252 |
for (sw=0; sw < ew; sw++) |
| 253 |
{ M_c2nl(data,l); p[sw]=l; } |
| 254 |
M_c2nl_p(data,l,ec); |
| 255 |
p[sw]=l; |
| 256 |
} |
| 257 |
|
| 258 |
void SHA1_Transform(c,b) |
| 259 |
SHA_CTX *c; |
| 260 |
unsigned char *b; |
| 261 |
{ |
| 262 |
ULONG p[16]; |
| 263 |
#ifndef B_ENDIAN |
| 264 |
ULONG *q; |
| 265 |
int i; |
| 266 |
#endif |
| 267 |
|
| 268 |
#if defined(B_ENDIAN) || defined(L_ENDIAN) |
| 269 |
memcpy(p,b,64); |
| 270 |
#ifdef L_ENDIAN |
| 271 |
q=p; |
| 272 |
for (i=(SHA_LBLOCK/4); i; i--) |
| 273 |
{ |
| 274 |
Endian_Reverse32(q[0]); |
| 275 |
Endian_Reverse32(q[1]); |
| 276 |
Endian_Reverse32(q[2]); |
| 277 |
Endian_Reverse32(q[3]); |
| 278 |
q+=4; |
| 279 |
} |
| 280 |
#endif |
| 281 |
#else |
| 282 |
q=p; |
| 283 |
for (i=(SHA_LBLOCK/4); i; i--) |
| 284 |
{ |
| 285 |
ULONG l; |
| 286 |
c2nl(b,l); *(q++)=l; |
| 287 |
c2nl(b,l); *(q++)=l; |
| 288 |
c2nl(b,l); *(q++)=l; |
| 289 |
c2nl(b,l); *(q++)=l; |
| 290 |
} |
| 291 |
#endif |
| 292 |
sha1_block(c,p,64); |
| 293 |
} |
| 294 |
|
| 295 |
#ifndef SHA1_ASM |
| 296 |
|
| 297 |
void sha1_block(c, W, num) |
| 298 |
SHA_CTX *c; |
| 299 |
register unsigned long *W; |
| 300 |
int num; |
| 301 |
{ |
| 302 |
register ULONG A,B,C,D,E,T; |
| 303 |
ULONG X[16]; |
| 304 |
|
| 305 |
A=c->h0; |
| 306 |
B=c->h1; |
| 307 |
C=c->h2; |
| 308 |
D=c->h3; |
| 309 |
E=c->h4; |
| 310 |
|
| 311 |
for (;;) |
| 312 |
{ |
| 313 |
BODY_00_15( 0,A,B,C,D,E,T,W); |
| 314 |
BODY_00_15( 1,T,A,B,C,D,E,W); |
| 315 |
BODY_00_15( 2,E,T,A,B,C,D,W); |
| 316 |
BODY_00_15( 3,D,E,T,A,B,C,W); |
| 317 |
BODY_00_15( 4,C,D,E,T,A,B,W); |
| 318 |
BODY_00_15( 5,B,C,D,E,T,A,W); |
| 319 |
BODY_00_15( 6,A,B,C,D,E,T,W); |
| 320 |
BODY_00_15( 7,T,A,B,C,D,E,W); |
| 321 |
BODY_00_15( 8,E,T,A,B,C,D,W); |
| 322 |
BODY_00_15( 9,D,E,T,A,B,C,W); |
| 323 |
BODY_00_15(10,C,D,E,T,A,B,W); |
| 324 |
BODY_00_15(11,B,C,D,E,T,A,W); |
| 325 |
BODY_00_15(12,A,B,C,D,E,T,W); |
| 326 |
BODY_00_15(13,T,A,B,C,D,E,W); |
| 327 |
BODY_00_15(14,E,T,A,B,C,D,W); |
| 328 |
BODY_00_15(15,D,E,T,A,B,C,W); |
| 329 |
BODY_16_19(16,C,D,E,T,A,B,W,W,W,W); |
| 330 |
BODY_16_19(17,B,C,D,E,T,A,W,W,W,W); |
| 331 |
BODY_16_19(18,A,B,C,D,E,T,W,W,W,W); |
| 332 |
BODY_16_19(19,T,A,B,C,D,E,W,W,W,X); |
| 333 |
|
| 334 |
BODY_20_31(20,E,T,A,B,C,D,W,W,W,X); |
| 335 |
BODY_20_31(21,D,E,T,A,B,C,W,W,W,X); |
| 336 |
BODY_20_31(22,C,D,E,T,A,B,W,W,W,X); |
| 337 |
BODY_20_31(23,B,C,D,E,T,A,W,W,W,X); |
| 338 |
BODY_20_31(24,A,B,C,D,E,T,W,W,X,X); |
| 339 |
BODY_20_31(25,T,A,B,C,D,E,W,W,X,X); |
| 340 |
BODY_20_31(26,E,T,A,B,C,D,W,W,X,X); |
| 341 |
BODY_20_31(27,D,E,T,A,B,C,W,W,X,X); |
| 342 |
BODY_20_31(28,C,D,E,T,A,B,W,W,X,X); |
| 343 |
BODY_20_31(29,B,C,D,E,T,A,W,W,X,X); |
| 344 |
BODY_20_31(30,A,B,C,D,E,T,W,X,X,X); |
| 345 |
BODY_20_31(31,T,A,B,C,D,E,W,X,X,X); |
| 346 |
BODY_32_39(32,E,T,A,B,C,D,X); |
| 347 |
BODY_32_39(33,D,E,T,A,B,C,X); |
| 348 |
BODY_32_39(34,C,D,E,T,A,B,X); |
| 349 |
BODY_32_39(35,B,C,D,E,T,A,X); |
| 350 |
BODY_32_39(36,A,B,C,D,E,T,X); |
| 351 |
BODY_32_39(37,T,A,B,C,D,E,X); |
| 352 |
BODY_32_39(38,E,T,A,B,C,D,X); |
| 353 |
BODY_32_39(39,D,E,T,A,B,C,X); |
| 354 |
|
| 355 |
BODY_40_59(40,C,D,E,T,A,B,X); |
| 356 |
BODY_40_59(41,B,C,D,E,T,A,X); |
| 357 |
BODY_40_59(42,A,B,C,D,E,T,X); |
| 358 |
BODY_40_59(43,T,A,B,C,D,E,X); |
| 359 |
BODY_40_59(44,E,T,A,B,C,D,X); |
| 360 |
BODY_40_59(45,D,E,T,A,B,C,X); |
| 361 |
BODY_40_59(46,C,D,E,T,A,B,X); |
| 362 |
BODY_40_59(47,B,C,D,E,T,A,X); |
| 363 |
BODY_40_59(48,A,B,C,D,E,T,X); |
| 364 |
BODY_40_59(49,T,A,B,C,D,E,X); |
| 365 |
BODY_40_59(50,E,T,A,B,C,D,X); |
| 366 |
BODY_40_59(51,D,E,T,A,B,C,X); |
| 367 |
BODY_40_59(52,C,D,E,T,A,B,X); |
| 368 |
BODY_40_59(53,B,C,D,E,T,A,X); |
| 369 |
BODY_40_59(54,A,B,C,D,E,T,X); |
| 370 |
BODY_40_59(55,T,A,B,C,D,E,X); |
| 371 |
BODY_40_59(56,E,T,A,B,C,D,X); |
| 372 |
BODY_40_59(57,D,E,T,A,B,C,X); |
| 373 |
BODY_40_59(58,C,D,E,T,A,B,X); |
| 374 |
BODY_40_59(59,B,C,D,E,T,A,X); |
| 375 |
|
| 376 |
BODY_60_79(60,A,B,C,D,E,T,X); |
| 377 |
BODY_60_79(61,T,A,B,C,D,E,X); |
| 378 |
BODY_60_79(62,E,T,A,B,C,D,X); |
| 379 |
BODY_60_79(63,D,E,T,A,B,C,X); |
| 380 |
BODY_60_79(64,C,D,E,T,A,B,X); |
| 381 |
BODY_60_79(65,B,C,D,E,T,A,X); |
| 382 |
BODY_60_79(66,A,B,C,D,E,T,X); |
| 383 |
BODY_60_79(67,T,A,B,C,D,E,X); |
| 384 |
BODY_60_79(68,E,T,A,B,C,D,X); |
| 385 |
BODY_60_79(69,D,E,T,A,B,C,X); |
| 386 |
BODY_60_79(70,C,D,E,T,A,B,X); |
| 387 |
BODY_60_79(71,B,C,D,E,T,A,X); |
| 388 |
BODY_60_79(72,A,B,C,D,E,T,X); |
| 389 |
BODY_60_79(73,T,A,B,C,D,E,X); |
| 390 |
BODY_60_79(74,E,T,A,B,C,D,X); |
| 391 |
BODY_60_79(75,D,E,T,A,B,C,X); |
| 392 |
BODY_60_79(76,C,D,E,T,A,B,X); |
| 393 |
BODY_60_79(77,B,C,D,E,T,A,X); |
| 394 |
BODY_60_79(78,A,B,C,D,E,T,X); |
| 395 |
BODY_60_79(79,T,A,B,C,D,E,X); |
| 396 |
|
| 397 |
c->h0=(c->h0+E)&0xffffffffL; |
| 398 |
c->h1=(c->h1+T)&0xffffffffL; |
| 399 |
c->h2=(c->h2+A)&0xffffffffL; |
| 400 |
c->h3=(c->h3+B)&0xffffffffL; |
| 401 |
c->h4=(c->h4+C)&0xffffffffL; |
| 402 |
|
| 403 |
num-=64; |
| 404 |
if (num <= 0) break; |
| 405 |
|
| 406 |
A=c->h0; |
| 407 |
B=c->h1; |
| 408 |
C=c->h2; |
| 409 |
D=c->h3; |
| 410 |
E=c->h4; |
| 411 |
|
| 412 |
W+=16; |
| 413 |
} |
| 414 |
} |
| 415 |
#endif |
| 416 |
|
| 417 |
void SHA1_Final(md, c) |
| 418 |
unsigned char *md; |
| 419 |
SHA_CTX *c; |
| 420 |
{ |
| 421 |
register int i,j; |
| 422 |
register ULONG l; |
| 423 |
register ULONG *p; |
| 424 |
static unsigned char end[4]={0x80,0x00,0x00,0x00}; |
| 425 |
unsigned char *cp=end; |
| 426 |
|
| 427 |
/* c->num should definitly have room for at least one more byte. */ |
| 428 |
p=c->data; |
| 429 |
j=c->num; |
| 430 |
i=j>>2; |
| 431 |
#ifdef PURIFY |
| 432 |
if ((j&0x03) == 0) p[i]=0; |
| 433 |
#endif |
| 434 |
l=p[i]; |
| 435 |
M_p_c2nl(cp,l,j&0x03); |
| 436 |
p[i]=l; |
| 437 |
i++; |
| 438 |
/* i is the next 'undefined word' */ |
| 439 |
if (c->num >= SHA_LAST_BLOCK) |
| 440 |
{ |
| 441 |
for (; i<SHA_LBLOCK; i++) |
| 442 |
p[i]=0; |
| 443 |
sha1_block(c,p,64); |
| 444 |
i=0; |
| 445 |
} |
| 446 |
for (; i<(SHA_LBLOCK-2); i++) |
| 447 |
p[i]=0; |
| 448 |
p[SHA_LBLOCK-2]=c->Nh; |
| 449 |
p[SHA_LBLOCK-1]=c->Nl; |
| 450 |
#if defined(L_ENDIAN) && defined(SHA1_ASM) |
| 451 |
Endian_Reverse32(p[SHA_LBLOCK-2]); |
| 452 |
Endian_Reverse32(p[SHA_LBLOCK-1]); |
| 453 |
#endif |
| 454 |
sha1_block(c,p,64); |
| 455 |
cp=md; |
| 456 |
l=c->h0; nl2c(l,cp); |
| 457 |
l=c->h1; nl2c(l,cp); |
| 458 |
l=c->h2; nl2c(l,cp); |
| 459 |
l=c->h3; nl2c(l,cp); |
| 460 |
l=c->h4; nl2c(l,cp); |
| 461 |
|
| 462 |
/* clear stuff, sha1_block may be leaving some stuff on the stack |
| 463 |
* but I'm not worried :-) */ |
| 464 |
c->num=0; |
| 465 |
/* memset((char *)&c,0,sizeof(c));*/ |
| 466 |
} |
| 467 |
|
Parent Directory
| 
Revision Log