1 /* crypto/ripemd/rmd_locl.h */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
62 #define c2nl(c,l) (l =(((u_int32_t)(*((c)++)))<<24), \
63 l|=(((u_int32_t)(*((c)++)))<<16), \
64 l|=(((u_int32_t)(*((c)++)))<< 8), \
65 l|=(((u_int32_t)(*((c)++))) ))
68 #define p_c2nl(c,l,n) { \
70 case 0: l =((u_int32_t)(*((c)++)))<<24; \
71 case 1: l|=((u_int32_t)(*((c)++)))<<16; \
72 case 2: l|=((u_int32_t)(*((c)++)))<< 8; \
73 case 3: l|=((u_int32_t)(*((c)++))); \
78 /* NOTE the pointer is not incremented at the end of this */
79 #define c2nl_p(c,l,n) { \
83 case 3: l =((u_int32_t)(*(--(c))))<< 8; \
84 case 2: l|=((u_int32_t)(*(--(c))))<<16; \
85 case 1: l|=((u_int32_t)(*(--(c))))<<24; \
90 #define p_c2nl_p(c,l,sc,len) { \
93 case 0: l =((u_int32_t)(*((c)++)))<<24; \
94 if (--len == 0) break; \
95 case 1: l|=((u_int32_t)(*((c)++)))<<16; \
96 if (--len == 0) break; \
97 case 2: l|=((u_int32_t)(*((c)++)))<< 8; \
102 #define nl2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \
103 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
104 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
105 *((c)++)=(unsigned char)(((l) )&0xff))
108 #define c2l(c,l) (l =(((u_int32_t)(*((c)++))) ), \
109 l|=(((u_int32_t)(*((c)++)))<< 8), \
110 l|=(((u_int32_t)(*((c)++)))<<16), \
111 l|=(((u_int32_t)(*((c)++)))<<24))
114 #define p_c2l(c,l,n) { \
116 case 0: l =((u_int32_t)(*((c)++))); \
117 case 1: l|=((u_int32_t)(*((c)++)))<< 8; \
118 case 2: l|=((u_int32_t)(*((c)++)))<<16; \
119 case 3: l|=((u_int32_t)(*((c)++)))<<24; \
124 /* NOTE the pointer is not incremented at the end of this */
125 #define c2l_p(c,l,n) { \
129 case 3: l =((u_int32_t)(*(--(c))))<<16; \
130 case 2: l|=((u_int32_t)(*(--(c))))<< 8; \
131 case 1: l|=((u_int32_t)(*(--(c)))); \
136 #define p_c2l_p(c,l,sc,len) { \
139 case 0: l =((u_int32_t)(*((c)++))); \
140 if (--len == 0) break; \
141 case 1: l|=((u_int32_t)(*((c)++)))<< 8; \
142 if (--len == 0) break; \
143 case 2: l|=((u_int32_t)(*((c)++)))<<16; \
148 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
149 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
150 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
151 *((c)++)=(unsigned char)(((l)>>24)&0xff))
155 #define ROTATE(a,n) _lrotl(a,n)
157 #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
160 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
162 /* 5 instructions with rotate instruction, else 9 */
163 #define Endian_Reverse32(a) \
166 (a)=((ROTATE(l,8)&0x00FF00FF)|(ROTATE(l,24)&0xFF00FF00)); \
169 /* 6 instructions with rotate instruction, else 8 */
170 #define Endian_Reverse32(a) \
173 l=(((l&0xFF00FF00)>>8L)|((l&0x00FF00FF)<<8L)); \
178 #define F1(x,y,z) ((x)^(y)^(z))
179 #define F2(x,y,z) (((x)&(y))|((~x)&z))
180 #define F3(x,y,z) (((x)|(~y))^(z))
181 #define F4(x,y,z) (((x)&(z))|((y)&(~(z))))
182 #define F5(x,y,z) ((x)^((y)|(~(z))))
184 #define RIPEMD160_A 0x67452301L
185 #define RIPEMD160_B 0xEFCDAB89L
186 #define RIPEMD160_C 0x98BADCFEL
187 #define RIPEMD160_D 0x10325476L
188 #define RIPEMD160_E 0xC3D2E1F0L
190 #include "rmdconst.h"
192 #define RIP1(a,b,c,d,e,w,s) { \
197 #define RIP2(a,b,c,d,e,w,s,K) { \
198 a+=F2(b,c,d)+X[w]+K; \
202 #define RIP3(a,b,c,d,e,w,s,K) { \
203 a+=F3(b,c,d)+X[w]+K; \
207 #define RIP4(a,b,c,d,e,w,s,K) { \
208 a+=F4(b,c,d)+X[w]+K; \
212 #define RIP5(a,b,c,d,e,w,s,K) { \
213 a+=F5(b,c,d)+X[w]+K; \