xref: /minix/external/bsd/dhcp/dist/dst/md5_locl.h (revision bb9622b5)
1 /*	$NetBSD: md5_locl.h,v 1.1.1.2 2014/07/12 11:57:51 spz Exp $	*/
2 /* crypto/md/md5_locl.h */
3 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
4  * All rights reserved.
5  *
6  * This package is an SSL implementation written
7  * by Eric Young (eay@cryptsoft.com).
8  * The implementation was written so as to conform with Netscapes SSL.
9  *
10  * This library is free for commercial and non-commercial use as long as
11  * the following conditions are aheared to.  The following conditions
12  * apply to all code found in this distribution, be it the RC4, RSA,
13  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
14  * included with this distribution is covered by the same copyright terms
15  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
16  *
17  * Copyright remains Eric Young's, and as such any Copyright notices in
18  * the code are not to be removed.
19  * If this package is used in a product, Eric Young should be given attribution
20  * as the author of the parts of the library used.
21  * This can be in the form of a textual message at program startup or
22  * in documentation (online or textual) provided with the package.
23  *
24  * Redistribution and use in source and binary forms, with or without
25  * modification, are permitted provided that the following conditions
26  * are met:
27  * 1. Redistributions of source code must retain the copyright
28  *    notice, this list of conditions and the following disclaimer.
29  * 2. Redistributions in binary form must reproduce the above copyright
30  *    notice, this list of conditions and the following disclaimer in the
31  *    documentation and/or other materials provided with the distribution.
32  * 3. All advertising materials mentioning features or use of this software
33  *    must display the following acknowledgement:
34  *    "This product includes cryptographic software written by
35  *     Eric Young (eay@cryptsoft.com)"
36  *    The word 'cryptographic' can be left out if the rouines from the library
37  *    being used are not cryptographic related :-).
38  * 4. If you include any Windows specific code (or a derivative thereof) from
39  *    the apps directory (application code) you must include an acknowledgement:
40  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
41  *
42  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
43  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
46  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
48  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
50  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
51  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52  * SUCH DAMAGE.
53  *
54  * The licence and distribution terms for any publically available version or
55  * derivative of this code cannot be changed.  i.e. this code cannot simply be
56  * copied and put under another distribution licence
57  * [including the GNU Public Licence.]
58  */
59 
60 /*
61  * Portions Copyright (c) 2007,2009 by Internet Systems Consortium, Inc. ("ISC")
62  *
63  * Permission to use, copy, modify, and distribute this software for any
64  * purpose with or without fee is hereby granted, provided that the above
65  * copyright notice and this permission notice appear in all copies.
66  *
67  * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
68  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
69  * MERCHANTABILITY AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR
70  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
71  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
72  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
73  * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
74  *
75  *   Internet Systems Consortium, Inc.
76  *   950 Charter Street
77  *   Redwood City, CA 94063
78  *   <info@isc.org>
79  *   https://www.isc.org/
80  */
81 
82 #include <stdlib.h>
83 #include <string.h>
84 #include "md5.h"
85 
86 #define ULONG	unsigned long
87 #define UCHAR	unsigned char
88 #define UINT	unsigned int
89 
90 #if defined(NOCONST)
91 #define const
92 #endif
93 
94 #undef c2l
95 #define c2l(c,l)	(l = ((unsigned long)(*((c)++)))     , \
96 			 l|=(((unsigned long)(*((c)++)))<< 8), \
97 			 l|=(((unsigned long)(*((c)++)))<<16), \
98 			 l|=(((unsigned long)(*((c)++)))<<24))
99 
100 #undef p_c2l
101 #define p_c2l(c,l,n)	{ \
102 			switch (n) { \
103 			case 0: l =((unsigned long)(*((c)++))); \
104 			case 1: l|=((unsigned long)(*((c)++)))<< 8; \
105 			case 2: l|=((unsigned long)(*((c)++)))<<16; \
106 			case 3: l|=((unsigned long)(*((c)++)))<<24; \
107 				} \
108 			}
109 
110 /* NOTE the pointer is not incremented at the end of this */
111 #undef c2l_p
112 #define c2l_p(c,l,n)	{ \
113 			l=0; \
114 			(c)+=n; \
115 			switch (n) { \
116 			case 3: l =((unsigned long)(*(--(c))))<<16; \
117 			case 2: l|=((unsigned long)(*(--(c))))<< 8; \
118 			case 1: l|=((unsigned long)(*(--(c))))    ; \
119 				} \
120 			}
121 
122 #undef p_c2l_p
123 #define p_c2l_p(c,l,sc,len) { \
124 			switch (sc) \
125 				{ \
126 			case 0: l =((unsigned long)(*((c)++))); \
127 				if (--len == 0) break; \
128 			case 1: l|=((unsigned long)(*((c)++)))<< 8; \
129 				if (--len == 0) break; \
130 			case 2: l|=((unsigned long)(*((c)++)))<<16; \
131 				} \
132 			}
133 
134 #undef l2c
135 #define l2c(l,c)	(*((c)++)=(unsigned char)(((l)    )&0xff), \
136 			 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
137 			 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
138 			 *((c)++)=(unsigned char)(((l)>>24)&0xff))
139 
140 /* NOTE - c is not incremented as per l2c */
141 #undef l2cn
142 #define l2cn(l1,l2,c,n)	{ \
143 			c+=n; \
144 			switch (n) { \
145 			case 8: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
146 			case 7: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
147 			case 6: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
148 			case 5: *(--(c))=(unsigned char)(((l2)    )&0xff); \
149 			case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
150 			case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
151 			case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
152 			case 1: *(--(c))=(unsigned char)(((l1)    )&0xff); \
153 				} \
154 			}
155 
156 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
157 #if defined(WIN32)
158 /* 5 instructions with rotate instruction, else 9 */
159 #define Endian_Reverse32(a) \
160 	{ \
161 	unsigned long l=(a); \
162 	(a)=((ROTATE(l,8)&0x00FF00FF)|(ROTATE(l,24)&0xFF00FF00)); \
163 	}
164 #else
165 /* 6 instructions with rotate instruction, else 8 */
166 #define Endian_Reverse32(a) \
167 	{ \
168 	unsigned long l=(a); \
169 	l=(((l&0xFF00FF00)>>8L)|((l&0x00FF00FF)<<8L)); \
170 	(a)=ROTATE(l,16L); \
171 	}
172 #endif
173 /*
174 #define	F(x,y,z)	(((x) & (y))  |  ((~(x)) & (z)))
175 #define	G(x,y,z)	(((x) & (z))  |  ((y) & (~(z))))
176 */
177 
178 /* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
179  * simplified to the code below.  Wei attributes these optimizations
180  * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
181  */
182 #define	F(x,y,z)	((((y) ^ (z)) & (x)) ^ (z))
183 #define	G(x,y,z)	((((x) ^ (y)) & (z)) ^ (y))
184 #define	H(x,y,z)	((x) ^ (y) ^ (z))
185 #define	I(x,y,z)	(((x) | (~(z))) ^ (y))
186 
187 #undef ROTATE
188 #if defined(WIN32)
189 #define ROTATE(a,n)     _lrotl(a,n)
190 #else
191 #define ROTATE(a,n)     (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
192 #endif
193 
194 #define LOCL_R0(a,b,c,d,k,s,t) { \
195 	a+=((k)+(t)+F((b),(c),(d))); \
196 	a=ROTATE(a,s); \
197 	a+=b; };\
198 
199 #define LOCL_R1(a,b,c,d,k,s,t) { \
200 	a+=((k)+(t)+G((b),(c),(d))); \
201 	a=ROTATE(a,s); \
202 	a+=b; };
203 
204 #define LOCL_R2(a,b,c,d,k,s,t) { \
205 	a+=((k)+(t)+H((b),(c),(d))); \
206 	a=ROTATE(a,s); \
207 	a+=b; };
208 
209 #define LOCL_R3(a,b,c,d,k,s,t) { \
210 	a+=((k)+(t)+I((b),(c),(d))); \
211 	a=ROTATE(a,s); \
212 	a+=b; };
213