/src/fontconfig/src/fcmd5.h
Line | Count | Source (jump to first uncovered line) |
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 | | #include "fcint.h" |
18 | | |
19 | | struct MD5Context { |
20 | | FcChar32 buf[4]; |
21 | | FcChar32 bits[2]; |
22 | | unsigned char in[64]; |
23 | | }; |
24 | | |
25 | | static void MD5Init (struct MD5Context *ctx); |
26 | | static void MD5Update (struct MD5Context *ctx, const unsigned char *buf, unsigned len); |
27 | | static void MD5Final (unsigned char digest[16], struct MD5Context *ctx); |
28 | | static void MD5Transform (FcChar32 buf[4], FcChar32 in[16]); |
29 | | |
30 | | #if !defined(WORDS_BIGENDIAN) || !WORDS_BIGENDIAN |
31 | | # define byteReverse(buf, len) /* Nothing */ |
32 | | #else |
33 | | /* |
34 | | * Note: this code is harmless on little-endian machines. |
35 | | */ |
36 | | void |
37 | | byteReverse (unsigned char *buf, unsigned longs) |
38 | | { |
39 | | FcChar32 t; |
40 | | do { |
41 | | t = (FcChar32)((unsigned)buf[3] << 8 | buf[2]) << 16 | |
42 | | ((unsigned)buf[1] << 8 | buf[0]); |
43 | | *(FcChar32 *)buf = t; |
44 | | buf += 4; |
45 | | } while (--longs); |
46 | | } |
47 | | #endif |
48 | | |
49 | | /* |
50 | | * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious |
51 | | * initialization constants. |
52 | | */ |
53 | | static void |
54 | | MD5Init (struct MD5Context *ctx) |
55 | 66 | { |
56 | 66 | ctx->buf[0] = 0x67452301; |
57 | 66 | ctx->buf[1] = 0xefcdab89; |
58 | 66 | ctx->buf[2] = 0x98badcfe; |
59 | 66 | ctx->buf[3] = 0x10325476; |
60 | | |
61 | 66 | ctx->bits[0] = 0; |
62 | 66 | ctx->bits[1] = 0; |
63 | 66 | } |
64 | | |
65 | | /* |
66 | | * Update context to reflect the concatenation of another buffer full |
67 | | * of bytes. |
68 | | */ |
69 | | static void |
70 | | MD5Update (struct MD5Context *ctx, const unsigned char *buf, unsigned len) |
71 | 66 | { |
72 | 66 | FcChar32 t; |
73 | | |
74 | | /* Update bitcount */ |
75 | | |
76 | 66 | t = ctx->bits[0]; |
77 | 66 | if ((ctx->bits[0] = t + ((FcChar32)len << 3)) < t) |
78 | 0 | ctx->bits[1]++; /* Carry from low to high */ |
79 | 66 | ctx->bits[1] += len >> 29; |
80 | | |
81 | 66 | t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ |
82 | | |
83 | | /* Handle any leading odd-sized chunks */ |
84 | | |
85 | 66 | if (t) { |
86 | 0 | unsigned char *p = (unsigned char *)ctx->in + t; |
87 | |
|
88 | 0 | t = 64 - t; |
89 | 0 | if (len < t) { |
90 | 0 | memcpy (p, buf, len); |
91 | 0 | return; |
92 | 0 | } |
93 | 0 | memcpy (p, buf, t); |
94 | 0 | byteReverse (ctx->in, 16); |
95 | 0 | MD5Transform (ctx->buf, (FcChar32 *)ctx->in); |
96 | 0 | buf += t; |
97 | 0 | len -= t; |
98 | 0 | } |
99 | | /* Process data in 64-byte chunks */ |
100 | | |
101 | 66 | while (len >= 64) { |
102 | 0 | memcpy (ctx->in, buf, 64); |
103 | 0 | byteReverse (ctx->in, 16); |
104 | 0 | MD5Transform (ctx->buf, (FcChar32 *)ctx->in); |
105 | 0 | buf += 64; |
106 | 0 | len -= 64; |
107 | 0 | } |
108 | | |
109 | | /* Handle any remaining bytes of data. */ |
110 | | |
111 | 66 | memcpy (ctx->in, buf, len); |
112 | 66 | } |
113 | | |
114 | | /* |
115 | | * Final wrapup - pad to 64-byte boundary with the bit pattern |
116 | | * 1 0* (64-bit count of bits processed, MSB-first) |
117 | | */ |
118 | | static void |
119 | | MD5Final (unsigned char digest[16], struct MD5Context *ctx) |
120 | 66 | { |
121 | 66 | unsigned count; |
122 | 66 | unsigned char *p; |
123 | | |
124 | | /* Compute number of bytes mod 64 */ |
125 | 66 | count = (ctx->bits[0] >> 3) & 0x3F; |
126 | | |
127 | | /* Set the first char of padding to 0x80. This is safe since there is |
128 | | always at least one byte free */ |
129 | 66 | p = ctx->in + count; |
130 | 66 | *p++ = 0x80; |
131 | | |
132 | | /* Bytes of padding needed to make 64 bytes */ |
133 | 66 | count = 64 - 1 - count; |
134 | | |
135 | | /* Pad out to 56 mod 64 */ |
136 | 66 | if (count < 8) { |
137 | | /* Two lots of padding: Pad the first block to 64 bytes */ |
138 | 0 | memset (p, 0, count); |
139 | 0 | byteReverse (ctx->in, 16); |
140 | 0 | MD5Transform (ctx->buf, (FcChar32 *)ctx->in); |
141 | | |
142 | | /* Now fill the next block with 56 bytes */ |
143 | 0 | memset (ctx->in, 0, 56); |
144 | 66 | } else { |
145 | | /* Pad block to 56 bytes */ |
146 | 66 | memset (p, 0, count - 8); |
147 | 66 | } |
148 | 66 | byteReverse (ctx->in, 14); |
149 | | |
150 | | /* Append length in bits and transform */ |
151 | 66 | ((FcChar32 *)ctx->in)[14] = ctx->bits[0]; |
152 | 66 | ((FcChar32 *)ctx->in)[15] = ctx->bits[1]; |
153 | | |
154 | 66 | MD5Transform (ctx->buf, (FcChar32 *)ctx->in); |
155 | 66 | byteReverse ((unsigned char *)ctx->buf, 4); |
156 | 66 | memcpy (digest, ctx->buf, 16); |
157 | 66 | memset (ctx, 0, sizeof (*ctx)); /* In case it's sensitive */ |
158 | 66 | } |
159 | | |
160 | | /* The four core functions - F1 is optimized somewhat */ |
161 | | |
162 | | /* #define F1(x, y, z) (x & y | ~x & z) */ |
163 | 2.11k | #define F1(x, y, z) (z ^ (x & (y ^ z))) |
164 | 1.05k | #define F2(x, y, z) F1 (z, x, y) |
165 | 1.05k | #define F3(x, y, z) (x ^ y ^ z) |
166 | 1.05k | #define F4(x, y, z) (y ^ (x | ~z)) |
167 | | |
168 | | /* This is the central step in the MD5 algorithm. */ |
169 | | #define MD5STEP(f, w, x, y, z, data, s) \ |
170 | 4.22k | (w += f (x, y, z) + data, w = w << s | w >> (32 - s), w += x) |
171 | | |
172 | | /* |
173 | | * The core of the MD5 algorithm, this alters an existing MD5 hash to |
174 | | * reflect the addition of 16 longwords of new data. MD5Update blocks |
175 | | * the data and converts bytes into longwords for this routine. |
176 | | */ |
177 | | static void |
178 | | MD5Transform (FcChar32 buf[4], FcChar32 in[16]) |
179 | 66 | { |
180 | 66 | register FcChar32 a, b, c, d; |
181 | | |
182 | 66 | a = buf[0]; |
183 | 66 | b = buf[1]; |
184 | 66 | c = buf[2]; |
185 | 66 | d = buf[3]; |
186 | | |
187 | 66 | MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7); |
188 | 66 | MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12); |
189 | 66 | MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17); |
190 | 66 | MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22); |
191 | 66 | MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7); |
192 | 66 | MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12); |
193 | 66 | MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17); |
194 | 66 | MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22); |
195 | 66 | MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7); |
196 | 66 | MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12); |
197 | 66 | MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17); |
198 | 66 | MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22); |
199 | 66 | MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7); |
200 | 66 | MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12); |
201 | 66 | MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17); |
202 | 66 | MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22); |
203 | | |
204 | 66 | MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5); |
205 | 66 | MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9); |
206 | 66 | MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14); |
207 | 66 | MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); |
208 | 66 | MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5); |
209 | 66 | MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9); |
210 | 66 | MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14); |
211 | 66 | MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); |
212 | 66 | MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5); |
213 | 66 | MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9); |
214 | 66 | MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14); |
215 | 66 | MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20); |
216 | 66 | MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5); |
217 | 66 | MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); |
218 | 66 | MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14); |
219 | 66 | MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); |
220 | | |
221 | 66 | MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4); |
222 | 66 | MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11); |
223 | 66 | MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16); |
224 | 66 | MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23); |
225 | 66 | MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4); |
226 | 66 | MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); |
227 | 66 | MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); |
228 | 66 | MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23); |
229 | 66 | MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4); |
230 | 66 | MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11); |
231 | 66 | MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16); |
232 | 66 | MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23); |
233 | 66 | MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4); |
234 | 66 | MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11); |
235 | 66 | MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); |
236 | 66 | MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23); |
237 | | |
238 | 66 | MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6); |
239 | 66 | MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10); |
240 | 66 | MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15); |
241 | 66 | MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21); |
242 | 66 | MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6); |
243 | 66 | MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); |
244 | 66 | MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15); |
245 | 66 | MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21); |
246 | 66 | MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); |
247 | 66 | MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); |
248 | 66 | MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15); |
249 | 66 | MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21); |
250 | 66 | MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6); |
251 | 66 | MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10); |
252 | 66 | MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); |
253 | 66 | MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21); |
254 | | |
255 | 66 | buf[0] += a; |
256 | 66 | buf[1] += b; |
257 | 66 | buf[2] += c; |
258 | 66 | buf[3] += d; |
259 | 66 | } |