File:  [DragonFly] / src / lib / libmd / rmd160c.c
Revision 1.3: download - view: text, annotated - select for diffs
Sun Nov 9 02:34:03 2003 UTC (10 years, 8 months ago) by dillon
Branches: MAIN
CVS tags: HEAD, DragonFly_Snap29Sep2004, DragonFly_Snap13Sep2004, DragonFly_1_0_REL, DragonFly_1_0_RC1, DragonFly_1_0A_REL
Core integer types header file reorganization stage 2/2:

Adjust main source files to reflect stdint.h and other changes.  Primarily
this means getting rid of the _BSD_XXX type useage but in some cases,
such as for tar, it means getting rid of #define overrides for intmax_t
and uintmax_t.

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