1 /* crypto/ripemd/rmd_dgst.c */ 2 /* Copyright (C) 1995-1998 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 * $Id: rmd160c.c,v 1.2 1999/02/26 20:06:46 wollman Exp $ 59 */ 60 61 #include <sys/types.h> 62 63 #include <stdio.h> 64 #include <string.h> 65 66 #if 0 67 #include <machine/ansi.h> /* we use the __ variants of bit-sized types */ 68 #endif 69 #include <machine/endian.h> 70 71 #include "rmd_locl.h" 72 73 /* 74 * The assembly-language code is not position-independent, so don't 75 * try to use it in a shared library. 76 */ 77 #ifdef PIC 78 #undef RMD160_ASM 79 #endif 80 81 char *RMD160_version="RIPEMD160 part of SSLeay 0.9.0b 11-Oct-1998"; 82 83 #ifdef RMD160_ASM 84 void ripemd160_block_x86(RIPEMD160_CTX *c, const u_int32_t *p,int num); 85 #define ripemd160_block ripemd160_block_x86 86 #else 87 void ripemd160_block(RIPEMD160_CTX *c, const u_int32_t *p,int num); 88 #endif 89 90 void RIPEMD160_Init(c) 91 RIPEMD160_CTX *c; 92 { 93 c->A=RIPEMD160_A; 94 c->B=RIPEMD160_B; 95 c->C=RIPEMD160_C; 96 c->D=RIPEMD160_D; 97 c->E=RIPEMD160_E; 98 c->Nl=0; 99 c->Nh=0; 100 c->num=0; 101 } 102 103 void RIPEMD160_Update(c, data, len) 104 RIPEMD160_CTX *c; 105 const unsigned char *data; 106 size_t len; 107 { 108 register u_int32_t *p; 109 int sw,sc; 110 u_int32_t l; 111 112 if (len == 0) return; 113 114 l=(c->Nl+(len<<3))&0xffffffffL; 115 if (l < c->Nl) /* overflow */ 116 c->Nh++; 117 c->Nh+=(len>>29); 118 c->Nl=l; 119 120 if (c->num != 0) 121 { 122 p=c->data; 123 sw=c->num>>2; 124 sc=c->num&0x03; 125 126 if ((c->num+len) >= RIPEMD160_CBLOCK) 127 { 128 l= p[sw]; 129 p_c2l(data,l,sc); 130 p[sw++]=l; 131 for (; sw<RIPEMD160_LBLOCK; sw++) 132 { 133 c2l(data,l); 134 p[sw]=l; 135 } 136 len-=(RIPEMD160_CBLOCK-c->num); 137 138 ripemd160_block(c,p,64); 139 c->num=0; 140 /* drop through and do the rest */ 141 } 142 else 143 { 144 int ew,ec; 145 146 c->num+=(int)len; 147 if ((sc+len) < 4) /* ugly, add char's to a word */ 148 { 149 l= p[sw]; 150 p_c2l_p(data,l,sc,len); 151 p[sw]=l; 152 } 153 else 154 { 155 ew=(c->num>>2); 156 ec=(c->num&0x03); 157 l= p[sw]; 158 p_c2l(data,l,sc); 159 p[sw++]=l; 160 for (; sw < ew; sw++) 161 { c2l(data,l); p[sw]=l; } 162 if (ec) 163 { 164 c2l_p(data,l,ec); 165 p[sw]=l; 166 } 167 } 168 return; 169 } 170 } 171 /* we now can process the input data in blocks of RIPEMD160_CBLOCK 172 * chars and save the leftovers to c->data. */ 173 #if BYTE_ORDER == LITTLE_ENDIAN 174 if ((((unsigned long)data)%sizeof(u_int32_t)) == 0) 175 { 176 sw=(int)len/RIPEMD160_CBLOCK; 177 if (sw > 0) 178 { 179 sw*=RIPEMD160_CBLOCK; 180 ripemd160_block(c,(u_int32_t *)data,sw); 181 data+=sw; 182 len-=sw; 183 } 184 } 185 #endif 186 p=c->data; 187 while (len >= RIPEMD160_CBLOCK) 188 { 189 #if BYTE_ORDER == LITTLE_ENDIAN || BYTE_ORDER == BIG_ENDIAN 190 if (p != (u_int32_t *)data) 191 memcpy(p,data,RIPEMD160_CBLOCK); 192 data+=RIPEMD160_CBLOCK; 193 #if BYTE_ORDER == BIG_ENDIAN 194 for (sw=(RIPEMD160_LBLOCK/4); sw; sw--) 195 { 196 Endian_Reverse32(p[0]); 197 Endian_Reverse32(p[1]); 198 Endian_Reverse32(p[2]); 199 Endian_Reverse32(p[3]); 200 p+=4; 201 } 202 #endif 203 #else 204 for (sw=(RIPEMD160_LBLOCK/4); sw; sw--) 205 { 206 c2l(data,l); *(p++)=l; 207 c2l(data,l); *(p++)=l; 208 c2l(data,l); *(p++)=l; 209 c2l(data,l); *(p++)=l; 210 } 211 #endif 212 p=c->data; 213 ripemd160_block(c,p,64); 214 len-=RIPEMD160_CBLOCK; 215 } 216 sc=(int)len; 217 c->num=sc; 218 if (sc) 219 { 220 sw=sc>>2; /* words to copy */ 221 #if BYTE_ORDER == LITTLE_ENDIAN 222 p[sw]=0; 223 memcpy(p,data,sc); 224 #else 225 sc&=0x03; 226 for ( ; sw; sw--) 227 { c2l(data,l); *(p++)=l; } 228 c2l_p(data,l,sc); 229 *p=l; 230 #endif 231 } 232 } 233 234 void RIPEMD160_Transform(c,b) 235 RIPEMD160_CTX *c; 236 unsigned char *b; 237 { 238 u_int32_t p[16]; 239 #if BYTE_ORDER != LITTLE_ENDIAN 240 u_int32_t *q; 241 int i; 242 #endif 243 244 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN 245 memcpy(p,b,64); 246 #if BYTE_ORDER == BIG_ENDIAN 247 q=p; 248 for (i=(RIPEMD160_LBLOCK/4); i; i--) 249 { 250 Endian_Reverse32(q[0]); 251 Endian_Reverse32(q[1]); 252 Endian_Reverse32(q[2]); 253 Endian_Reverse32(q[3]); 254 q+=4; 255 } 256 #endif 257 #else 258 q=p; 259 for (i=(RIPEMD160_LBLOCK/4); i; i--) 260 { 261 u_int32_t l; 262 c2l(b,l); *(q++)=l; 263 c2l(b,l); *(q++)=l; 264 c2l(b,l); *(q++)=l; 265 c2l(b,l); *(q++)=l; 266 } 267 #endif 268 ripemd160_block(c,p,64); 269 } 270 271 #ifndef RMD160_ASM 272 273 void ripemd160_block(ctx, X, num) 274 RIPEMD160_CTX *ctx; 275 const u_int32_t *X; 276 int num; 277 { 278 register u_int32_t A,B,C,D,E; 279 u_int32_t a,b,c,d,e; 280 281 for (;;) 282 { 283 A=ctx->A; B=ctx->B; C=ctx->C; D=ctx->D; E=ctx->E; 284 285 RIP1(A,B,C,D,E,WL00,SL00); 286 RIP1(E,A,B,C,D,WL01,SL01); 287 RIP1(D,E,A,B,C,WL02,SL02); 288 RIP1(C,D,E,A,B,WL03,SL03); 289 RIP1(B,C,D,E,A,WL04,SL04); 290 RIP1(A,B,C,D,E,WL05,SL05); 291 RIP1(E,A,B,C,D,WL06,SL06); 292 RIP1(D,E,A,B,C,WL07,SL07); 293 RIP1(C,D,E,A,B,WL08,SL08); 294 RIP1(B,C,D,E,A,WL09,SL09); 295 RIP1(A,B,C,D,E,WL10,SL10); 296 RIP1(E,A,B,C,D,WL11,SL11); 297 RIP1(D,E,A,B,C,WL12,SL12); 298 RIP1(C,D,E,A,B,WL13,SL13); 299 RIP1(B,C,D,E,A,WL14,SL14); 300 RIP1(A,B,C,D,E,WL15,SL15); 301 302 RIP2(E,A,B,C,D,WL16,SL16,KL1); 303 RIP2(D,E,A,B,C,WL17,SL17,KL1); 304 RIP2(C,D,E,A,B,WL18,SL18,KL1); 305 RIP2(B,C,D,E,A,WL19,SL19,KL1); 306 RIP2(A,B,C,D,E,WL20,SL20,KL1); 307 RIP2(E,A,B,C,D,WL21,SL21,KL1); 308 RIP2(D,E,A,B,C,WL22,SL22,KL1); 309 RIP2(C,D,E,A,B,WL23,SL23,KL1); 310 RIP2(B,C,D,E,A,WL24,SL24,KL1); 311 RIP2(A,B,C,D,E,WL25,SL25,KL1); 312 RIP2(E,A,B,C,D,WL26,SL26,KL1); 313 RIP2(D,E,A,B,C,WL27,SL27,KL1); 314 RIP2(C,D,E,A,B,WL28,SL28,KL1); 315 RIP2(B,C,D,E,A,WL29,SL29,KL1); 316 RIP2(A,B,C,D,E,WL30,SL30,KL1); 317 RIP2(E,A,B,C,D,WL31,SL31,KL1); 318 319 RIP3(D,E,A,B,C,WL32,SL32,KL2); 320 RIP3(C,D,E,A,B,WL33,SL33,KL2); 321 RIP3(B,C,D,E,A,WL34,SL34,KL2); 322 RIP3(A,B,C,D,E,WL35,SL35,KL2); 323 RIP3(E,A,B,C,D,WL36,SL36,KL2); 324 RIP3(D,E,A,B,C,WL37,SL37,KL2); 325 RIP3(C,D,E,A,B,WL38,SL38,KL2); 326 RIP3(B,C,D,E,A,WL39,SL39,KL2); 327 RIP3(A,B,C,D,E,WL40,SL40,KL2); 328 RIP3(E,A,B,C,D,WL41,SL41,KL2); 329 RIP3(D,E,A,B,C,WL42,SL42,KL2); 330 RIP3(C,D,E,A,B,WL43,SL43,KL2); 331 RIP3(B,C,D,E,A,WL44,SL44,KL2); 332 RIP3(A,B,C,D,E,WL45,SL45,KL2); 333 RIP3(E,A,B,C,D,WL46,SL46,KL2); 334 RIP3(D,E,A,B,C,WL47,SL47,KL2); 335 336 RIP4(C,D,E,A,B,WL48,SL48,KL3); 337 RIP4(B,C,D,E,A,WL49,SL49,KL3); 338 RIP4(A,B,C,D,E,WL50,SL50,KL3); 339 RIP4(E,A,B,C,D,WL51,SL51,KL3); 340 RIP4(D,E,A,B,C,WL52,SL52,KL3); 341 RIP4(C,D,E,A,B,WL53,SL53,KL3); 342 RIP4(B,C,D,E,A,WL54,SL54,KL3); 343 RIP4(A,B,C,D,E,WL55,SL55,KL3); 344 RIP4(E,A,B,C,D,WL56,SL56,KL3); 345 RIP4(D,E,A,B,C,WL57,SL57,KL3); 346 RIP4(C,D,E,A,B,WL58,SL58,KL3); 347 RIP4(B,C,D,E,A,WL59,SL59,KL3); 348 RIP4(A,B,C,D,E,WL60,SL60,KL3); 349 RIP4(E,A,B,C,D,WL61,SL61,KL3); 350 RIP4(D,E,A,B,C,WL62,SL62,KL3); 351 RIP4(C,D,E,A,B,WL63,SL63,KL3); 352 353 RIP5(B,C,D,E,A,WL64,SL64,KL4); 354 RIP5(A,B,C,D,E,WL65,SL65,KL4); 355 RIP5(E,A,B,C,D,WL66,SL66,KL4); 356 RIP5(D,E,A,B,C,WL67,SL67,KL4); 357 RIP5(C,D,E,A,B,WL68,SL68,KL4); 358 RIP5(B,C,D,E,A,WL69,SL69,KL4); 359 RIP5(A,B,C,D,E,WL70,SL70,KL4); 360 RIP5(E,A,B,C,D,WL71,SL71,KL4); 361 RIP5(D,E,A,B,C,WL72,SL72,KL4); 362 RIP5(C,D,E,A,B,WL73,SL73,KL4); 363 RIP5(B,C,D,E,A,WL74,SL74,KL4); 364 RIP5(A,B,C,D,E,WL75,SL75,KL4); 365 RIP5(E,A,B,C,D,WL76,SL76,KL4); 366 RIP5(D,E,A,B,C,WL77,SL77,KL4); 367 RIP5(C,D,E,A,B,WL78,SL78,KL4); 368 RIP5(B,C,D,E,A,WL79,SL79,KL4); 369 370 a=A; b=B; c=C; d=D; e=E; 371 /* Do other half */ 372 A=ctx->A; B=ctx->B; C=ctx->C; D=ctx->D; E=ctx->E; 373 374 RIP5(A,B,C,D,E,WR00,SR00,KR0); 375 RIP5(E,A,B,C,D,WR01,SR01,KR0); 376 RIP5(D,E,A,B,C,WR02,SR02,KR0); 377 RIP5(C,D,E,A,B,WR03,SR03,KR0); 378 RIP5(B,C,D,E,A,WR04,SR04,KR0); 379 RIP5(A,B,C,D,E,WR05,SR05,KR0); 380 RIP5(E,A,B,C,D,WR06,SR06,KR0); 381 RIP5(D,E,A,B,C,WR07,SR07,KR0); 382 RIP5(C,D,E,A,B,WR08,SR08,KR0); 383 RIP5(B,C,D,E,A,WR09,SR09,KR0); 384 RIP5(A,B,C,D,E,WR10,SR10,KR0); 385 RIP5(E,A,B,C,D,WR11,SR11,KR0); 386 RIP5(D,E,A,B,C,WR12,SR12,KR0); 387 RIP5(C,D,E,A,B,WR13,SR13,KR0); 388 RIP5(B,C,D,E,A,WR14,SR14,KR0); 389 RIP5(A,B,C,D,E,WR15,SR15,KR0); 390 391 RIP4(E,A,B,C,D,WR16,SR16,KR1); 392 RIP4(D,E,A,B,C,WR17,SR17,KR1); 393 RIP4(C,D,E,A,B,WR18,SR18,KR1); 394 RIP4(B,C,D,E,A,WR19,SR19,KR1); 395 RIP4(A,B,C,D,E,WR20,SR20,KR1); 396 RIP4(E,A,B,C,D,WR21,SR21,KR1); 397 RIP4(D,E,A,B,C,WR22,SR22,KR1); 398 RIP4(C,D,E,A,B,WR23,SR23,KR1); 399 RIP4(B,C,D,E,A,WR24,SR24,KR1); 400 RIP4(A,B,C,D,E,WR25,SR25,KR1); 401 RIP4(E,A,B,C,D,WR26,SR26,KR1); 402 RIP4(D,E,A,B,C,WR27,SR27,KR1); 403 RIP4(C,D,E,A,B,WR28,SR28,KR1); 404 RIP4(B,C,D,E,A,WR29,SR29,KR1); 405 RIP4(A,B,C,D,E,WR30,SR30,KR1); 406 RIP4(E,A,B,C,D,WR31,SR31,KR1); 407 408 RIP3(D,E,A,B,C,WR32,SR32,KR2); 409 RIP3(C,D,E,A,B,WR33,SR33,KR2); 410 RIP3(B,C,D,E,A,WR34,SR34,KR2); 411 RIP3(A,B,C,D,E,WR35,SR35,KR2); 412 RIP3(E,A,B,C,D,WR36,SR36,KR2); 413 RIP3(D,E,A,B,C,WR37,SR37,KR2); 414 RIP3(C,D,E,A,B,WR38,SR38,KR2); 415 RIP3(B,C,D,E,A,WR39,SR39,KR2); 416 RIP3(A,B,C,D,E,WR40,SR40,KR2); 417 RIP3(E,A,B,C,D,WR41,SR41,KR2); 418 RIP3(D,E,A,B,C,WR42,SR42,KR2); 419 RIP3(C,D,E,A,B,WR43,SR43,KR2); 420 RIP3(B,C,D,E,A,WR44,SR44,KR2); 421 RIP3(A,B,C,D,E,WR45,SR45,KR2); 422 RIP3(E,A,B,C,D,WR46,SR46,KR2); 423 RIP3(D,E,A,B,C,WR47,SR47,KR2); 424 425 RIP2(C,D,E,A,B,WR48,SR48,KR3); 426 RIP2(B,C,D,E,A,WR49,SR49,KR3); 427 RIP2(A,B,C,D,E,WR50,SR50,KR3); 428 RIP2(E,A,B,C,D,WR51,SR51,KR3); 429 RIP2(D,E,A,B,C,WR52,SR52,KR3); 430 RIP2(C,D,E,A,B,WR53,SR53,KR3); 431 RIP2(B,C,D,E,A,WR54,SR54,KR3); 432 RIP2(A,B,C,D,E,WR55,SR55,KR3); 433 RIP2(E,A,B,C,D,WR56,SR56,KR3); 434 RIP2(D,E,A,B,C,WR57,SR57,KR3); 435 RIP2(C,D,E,A,B,WR58,SR58,KR3); 436 RIP2(B,C,D,E,A,WR59,SR59,KR3); 437 RIP2(A,B,C,D,E,WR60,SR60,KR3); 438 RIP2(E,A,B,C,D,WR61,SR61,KR3); 439 RIP2(D,E,A,B,C,WR62,SR62,KR3); 440 RIP2(C,D,E,A,B,WR63,SR63,KR3); 441 442 RIP1(B,C,D,E,A,WR64,SR64); 443 RIP1(A,B,C,D,E,WR65,SR65); 444 RIP1(E,A,B,C,D,WR66,SR66); 445 RIP1(D,E,A,B,C,WR67,SR67); 446 RIP1(C,D,E,A,B,WR68,SR68); 447 RIP1(B,C,D,E,A,WR69,SR69); 448 RIP1(A,B,C,D,E,WR70,SR70); 449 RIP1(E,A,B,C,D,WR71,SR71); 450 RIP1(D,E,A,B,C,WR72,SR72); 451 RIP1(C,D,E,A,B,WR73,SR73); 452 RIP1(B,C,D,E,A,WR74,SR74); 453 RIP1(A,B,C,D,E,WR75,SR75); 454 RIP1(E,A,B,C,D,WR76,SR76); 455 RIP1(D,E,A,B,C,WR77,SR77); 456 RIP1(C,D,E,A,B,WR78,SR78); 457 RIP1(B,C,D,E,A,WR79,SR79); 458 459 D =ctx->B+c+D; 460 ctx->B=ctx->C+d+E; 461 ctx->C=ctx->D+e+A; 462 ctx->D=ctx->E+a+B; 463 ctx->E=ctx->A+b+C; 464 ctx->A=D; 465 466 X+=16; 467 num-=64; 468 if (num <= 0) break; 469 } 470 } 471 #endif 472 473 void RIPEMD160_Final(md, c) 474 unsigned char *md; 475 RIPEMD160_CTX *c; 476 { 477 register int i,j; 478 register u_int32_t l; 479 register u_int32_t *p; 480 static unsigned char end[4]={0x80,0x00,0x00,0x00}; 481 unsigned char *cp=end; 482 483 /* c->num should definitly have room for at least one more byte. */ 484 p=c->data; 485 j=c->num; 486 i=j>>2; 487 488 /* purify often complains about the following line as an 489 * Uninitialized Memory Read. While this can be true, the 490 * following p_c2l macro will reset l when that case is true. 491 * This is because j&0x03 contains the number of 'valid' bytes 492 * already in p[i]. If and only if j&0x03 == 0, the UMR will 493 * occur but this is also the only time p_c2l will do 494 * l= *(cp++) instead of l|= *(cp++) 495 * Many thanks to Alex Tang <altitude@cic.net> for pickup this 496 * 'potential bug' */ 497 #ifdef PURIFY 498 if ((j&0x03) == 0) p[i]=0; 499 #endif 500 l=p[i]; 501 p_c2l(cp,l,j&0x03); 502 p[i]=l; 503 i++; 504 /* i is the next 'undefined word' */ 505 if (c->num >= RIPEMD160_LAST_BLOCK) 506 { 507 for (; i<RIPEMD160_LBLOCK; i++) 508 p[i]=0; 509 ripemd160_block(c,p,64); 510 i=0; 511 } 512 for (; i<(RIPEMD160_LBLOCK-2); i++) 513 p[i]=0; 514 p[RIPEMD160_LBLOCK-2]=c->Nl; 515 p[RIPEMD160_LBLOCK-1]=c->Nh; 516 ripemd160_block(c,p,64); 517 cp=md; 518 l=c->A; l2c(l,cp); 519 l=c->B; l2c(l,cp); 520 l=c->C; l2c(l,cp); 521 l=c->D; l2c(l,cp); 522 l=c->E; l2c(l,cp); 523 524 /* clear stuff, ripemd160_block may be leaving some stuff on the stack 525 * but I'm not worried :-) */ 526 c->num=0; 527 /* memset((char *)&c,0,sizeof(c));*/ 528 } 529 530 #ifdef undef 531 int printit(l) 532 unsigned long *l; 533 { 534 int i,ii; 535 536 for (i=0; i<2; i++) 537 { 538 for (ii=0; ii<8; ii++) 539 { 540 fprintf(stderr,"%08lx ",l[i*8+ii]); 541 } 542 fprintf(stderr,"\n"); 543 } 544 } 545 #endif 546