Mercurial > repos > lsong10 > psiclass

comparison PsiCLASS-1.0.2/samtools-0.1.19/misc/md5.c @ 0:903fc43d6227 draft default tip

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Uploaded
author lsong10
date Fri, 26 Mar 2021 16:52:45 +0000
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:903fc43d6227
1 /*
2 * This code implements the MD5 message-digest algorithm.
3 * The algorithm is due to Ron Rivest. This code was
4 * written by Colin Plumb in 1993, no copyright is claimed.
5 * This code is in the public domain; do with it what you wish.
6 *
7 * Equivalent code is available from RSA Data Security, Inc.
8 * This code has been tested against that, and is equivalent,
9 * except that you don't need to include two pages of legalese
10 * with every copy.
11 *
12 * To compute the message digest of a chunk of bytes, declare an
13 * MD5Context structure, pass it to MD5Init, call MD5Update as
14 * needed on buffers full of bytes, and then call MD5Final, which
15 * will fill a supplied 16-byte array with the digest.
16 */
17
18 /* Brutally hacked by John Walker back from ANSI C to K&R (no
19 prototypes) to maintain the tradition that Netfone will compile
20 with Sun's original "cc". */
21
22 #include <string.h>
23 #include "md5.h"
24
25 #ifndef HIGHFIRST
26 #define byteReverse(buf, len) /* Nothing */
27 #else
28 /*
29 * Note: this code is harmless on little-endian machines.
30 */
31 void byteReverse(buf, longs)
32 unsigned char *buf; unsigned longs;
33 {
34 uint32_t t;
35 do {
36 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
37 ((unsigned) buf[1] << 8 | buf[0]);
38 *(uint32_t *) buf = t;
39 buf += 4;
40 } while (--longs);
41 }
42 #endif
43
44 void MD5Transform(uint32_t buf[4], uint32_t in[16]);
45
46
47 /*
48 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
49 * initialization constants.
50 */
51 void MD5Init(ctx)
52 struct MD5Context *ctx;
53 {
54 ctx->buf[0] = 0x67452301;
55 ctx->buf[1] = 0xefcdab89;
56 ctx->buf[2] = 0x98badcfe;
57 ctx->buf[3] = 0x10325476;
58
59 ctx->bits[0] = 0;
60 ctx->bits[1] = 0;
61 }
62
63 /*
64 * Update context to reflect the concatenation of another buffer full
65 * of bytes.
66 */
67 void MD5Update(ctx, buf, len)
68 struct MD5Context *ctx; unsigned char *buf; unsigned len;
69 {
70 uint32_t t;
71
72 /* Update bitcount */
73
74 t = ctx->bits[0];
75 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
76 ctx->bits[1]++; /* Carry from low to high */
77 ctx->bits[1] += len >> 29;
78
79 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
80
81 /* Handle any leading odd-sized chunks */
82
83 if (t) {
84 unsigned char *p = (unsigned char *) ctx->in + t;
85
86 t = 64 - t;
87 if (len < t) {
88 memcpy(p, buf, len);
89 return;
90 }
91 memcpy(p, buf, t);
92 byteReverse(ctx->in, 16);
93 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
94 buf += t;
95 len -= t;
96 }
97 /* Process data in 64-byte chunks */
98
99 while (len >= 64) {
100 memcpy(ctx->in, buf, 64);
101 byteReverse(ctx->in, 16);
102 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
103 buf += 64;
104 len -= 64;
105 }
106
107 /* Handle any remaining bytes of data. */
108
109 memcpy(ctx->in, buf, len);
110 }
111
112 /*
113 * Final wrapup - pad to 64-byte boundary with the bit pattern
114 * 1 0* (64-bit count of bits processed, MSB-first)
115 */
116 void MD5Final(digest, ctx)
117 unsigned char digest[16]; struct MD5Context *ctx;
118 {
119 unsigned count;
120 unsigned char *p;
121
122 /* Compute number of bytes mod 64 */
123 count = (ctx->bits[0] >> 3) & 0x3F;
124
125 /* Set the first char of padding to 0x80. This is safe since there is
126 always at least one byte free */
127 p = ctx->in + count;
128 *p++ = 0x80;
129
130 /* Bytes of padding needed to make 64 bytes */
131 count = 64 - 1 - count;
132
133 /* Pad out to 56 mod 64 */
134 if (count < 8) {
135 /* Two lots of padding: Pad the first block to 64 bytes */
136 memset(p, 0, count);
137 byteReverse(ctx->in, 16);
138 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
139
140 /* Now fill the next block with 56 bytes */
141 memset(ctx->in, 0, 56);
142 } else {
143 /* Pad block to 56 bytes */
144 memset(p, 0, count - 8);
145 }
146 byteReverse(ctx->in, 14);
147
148 /* Append length in bits and transform */
149 ((uint32_t *) ctx->in)[14] = ctx->bits[0];
150 ((uint32_t *) ctx->in)[15] = ctx->bits[1];
151
152 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
153 byteReverse((unsigned char *) ctx->buf, 4);
154 memcpy(digest, ctx->buf, 16);
155 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
156 }
157
158
159 /* The four core functions - F1 is optimized somewhat */
160
161 /* #define F1(x, y, z) (x & y | ~x & z) */
162 #define F1(x, y, z) (z ^ (x & (y ^ z)))
163 #define F2(x, y, z) F1(z, x, y)
164 #define F3(x, y, z) (x ^ y ^ z)
165 #define F4(x, y, z) (y ^ (x | ~z))
166
167 /* This is the central step in the MD5 algorithm. */
168 #define MD5STEP(f, w, x, y, z, data, s) \
169 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
170
171 /*
172 * The core of the MD5 algorithm, this alters an existing MD5 hash to
173 * reflect the addition of 16 longwords of new data. MD5Update blocks
174 * the data and converts bytes into longwords for this routine.
175 */
176 void MD5Transform(buf, in)
177 uint32_t buf[4]; uint32_t in[16];
178 {
179 register uint32_t a, b, c, d;
180
181 a = buf[0];
182 b = buf[1];
183 c = buf[2];
184 d = buf[3];
185
186 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
187 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
188 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
189 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
190 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
191 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
192 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
193 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
194 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
195 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
196 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
197 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
198 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
199 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
200 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
201 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
202
203 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
204 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
205 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
206 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
207 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
208 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
209 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
210 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
211 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
212 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
213 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
214 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
215 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
216 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
217 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
218 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
219
220 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
221 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
222 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
223 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
224 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
225 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
226 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
227 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
228 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
229 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
230 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
231 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
232 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
233 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
234 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
235 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
236
237 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
238 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
239 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
240 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
241 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
242 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
243 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
244 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
245 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
246 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
247 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
248 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
249 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
250 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
251 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
252 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
253
254 buf[0] += a;
255 buf[1] += b;
256 buf[2] += c;
257 buf[3] += d;
258 }
259
260 /* lh3: the following code is added by me */
261
262 #ifdef MD5SUM_MAIN
263 #include <stdio.h>
264 #include <stdlib.h>
265 #include <string.h>
266 #define HEX_STR "0123456789abcdef"
267
268 static void md5_one(const char *fn)
269 {
270 unsigned char buf[4096], digest[16];
271 MD5_CTX md5;
272 int l;
273 FILE *fp;
274
275 fp = strcmp(fn, "-")? fopen(fn, "r") : stdin;
276 if (fp == 0) {
277 fprintf(stderr, "md5sum: %s: No such file or directory\n", fn);
278 exit(1);
279 }
280 MD5Init(&md5);
281 while ((l = fread(buf, 1, 4096, fp)) > 0)
282 MD5Update(&md5, buf, l);
283 MD5Final(digest, &md5);
284 if (fp != stdin) fclose(fp);
285 for (l = 0; l < 16; ++l)
286 printf("%c%c", HEX_STR[digest[l]>>4&0xf], HEX_STR[digest[l]&0xf]);
287 printf(" %s\n", fn);
288 }
289 int main(int argc, char *argv[])
290 {
291 int i;
292 if (argc == 1) md5_one("-");
293 else for (i = 1; i < argc; ++i) md5_one(argv[i]);
294 return 0;
295 }
296 #endif