1
- /* $KAME : md5.c,v 1.3 2000/02/22 14: 01:17 itojun Exp $ */
1
+ /* $Id : md5.c,v 1.2 2000/12/04 01:20:38 tgl Exp $ */
2
2
3
3
/*
4
4
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
91
91
#define MD5_D0 0x10325476
92
92
93
93
/* Integer part of 4294967296 times abs(sin(i)), where i is in radians. */
94
- static const u_int32_t T [65 ] = {
94
+ static const uint32_t T [65 ] = {
95
95
0 ,
96
96
0xd76aa478 , 0xe8c7b756 , 0x242070db , 0xc1bdceee ,
97
97
0xf57c0faf , 0x4787c62a , 0xa8304613 , 0xfd469501 ,
@@ -114,7 +114,7 @@ static const u_int32_t T[65] = {
114
114
0xf7537e82 , 0xbd3af235 , 0x2ad7d2bb , 0xeb86d391 ,
115
115
};
116
116
117
- static const u_int8_t md5_paddat [MD5_BUFLEN ] = {
117
+ static const uint8_t md5_paddat [MD5_BUFLEN ] = {
118
118
0x80 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ,
119
119
0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ,
120
120
0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ,
@@ -125,7 +125,7 @@ static const u_int8_t md5_paddat[MD5_BUFLEN] = {
125
125
0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ,
126
126
};
127
127
128
- static void md5_calc __P (( u_int8_t * , md5_ctxt * ) );
128
+ static void md5_calc ( uint8_t * , md5_ctxt * );
129
129
130
130
void md5_init (ctxt )
131
131
md5_ctxt * ctxt ;
@@ -141,10 +141,10 @@ void md5_init(ctxt)
141
141
142
142
void md5_loop (ctxt , input , len )
143
143
md5_ctxt * ctxt ;
144
- u_int8_t * input ;
145
- u_int len ; /* number of bytes */
144
+ uint8_t * input ;
145
+ unsigned int len ; /* number of bytes */
146
146
{
147
- u_int gap , i ;
147
+ unsigned int gap , i ;
148
148
149
149
ctxt -> md5_n += len * 8 ; /* byte to bit */
150
150
gap = MD5_BUFLEN - ctxt -> md5_i ;
@@ -155,7 +155,7 @@ void md5_loop(ctxt, input, len)
155
155
md5_calc (ctxt -> md5_buf , ctxt );
156
156
157
157
for (i = gap ; i + MD5_BUFLEN <= len ; i += MD5_BUFLEN ) {
158
- md5_calc ((u_int8_t * )(input + i ), ctxt );
158
+ md5_calc ((uint8_t * )(input + i ), ctxt );
159
159
}
160
160
161
161
ctxt -> md5_i = len - i ;
@@ -170,7 +170,7 @@ void md5_loop(ctxt, input, len)
170
170
void md5_pad (ctxt )
171
171
md5_ctxt * ctxt ;
172
172
{
173
- u_int gap ;
173
+ unsigned int gap ;
174
174
175
175
/* Don't count up padding. Keep md5_n. */
176
176
gap = MD5_BUFLEN - ctxt -> md5_i ;
@@ -207,7 +207,7 @@ void md5_pad(ctxt)
207
207
}
208
208
209
209
void md5_result (digest , ctxt )
210
- u_int8_t * digest ;
210
+ uint8_t * digest ;
211
211
md5_ctxt * ctxt ;
212
212
{
213
213
/* 4 byte words */
@@ -227,24 +227,24 @@ void md5_result(digest, ctxt)
227
227
}
228
228
229
229
#if BYTE_ORDER == BIG_ENDIAN
230
- u_int32_t X [16 ];
230
+ uint32_t X [16 ];
231
231
#endif
232
232
233
233
static void md5_calc (b64 , ctxt )
234
- u_int8_t * b64 ;
234
+ uint8_t * b64 ;
235
235
md5_ctxt * ctxt ;
236
236
{
237
- u_int32_t A = ctxt -> md5_sta ;
238
- u_int32_t B = ctxt -> md5_stb ;
239
- u_int32_t C = ctxt -> md5_stc ;
240
- u_int32_t D = ctxt -> md5_std ;
237
+ uint32_t A = ctxt -> md5_sta ;
238
+ uint32_t B = ctxt -> md5_stb ;
239
+ uint32_t C = ctxt -> md5_stc ;
240
+ uint32_t D = ctxt -> md5_std ;
241
241
#if BYTE_ORDER == LITTLE_ENDIAN
242
- u_int32_t * X = (u_int32_t * )b64 ;
242
+ uint32_t * X = (uint32_t * )b64 ;
243
243
#endif
244
244
#if BYTE_ORDER == BIG_ENDIAN
245
245
/* 4 byte words */
246
246
/* what a brute force but fast! */
247
- u_int8_t * y = (u_int8_t * )X ;
247
+ uint8_t * y = (uint8_t * )X ;
248
248
y [ 0 ] = b64 [ 3 ]; y [ 1 ] = b64 [ 2 ]; y [ 2 ] = b64 [ 1 ]; y [ 3 ] = b64 [ 0 ];
249
249
y [ 4 ] = b64 [ 7 ]; y [ 5 ] = b64 [ 6 ]; y [ 6 ] = b64 [ 5 ]; y [ 7 ] = b64 [ 4 ];
250
250
y [ 8 ] = b64 [11 ]; y [ 9 ] = b64 [10 ]; y [10 ] = b64 [ 9 ]; y [11 ] = b64 [ 8 ];
0 commit comments