1 | #include <netinet/in.h> |
2 | #ifdef __sun__ |
3 | #include <inttypes.h> |
4 | #else |
5 | #include <stdint.h> |
6 | #endif |
7 | #include <ctype.h> |
8 | #include <errno.h> |
9 | #include <string.h> |
10 | #include <limits.h> |
11 | #include "modpost.h" |
12 | |
13 | /* |
14 | * Stolen form Cryptographic API. |
15 | * |
16 | * MD4 Message Digest Algorithm (RFC1320). |
17 | * |
18 | * Implementation derived from Andrew Tridgell and Steve French's |
19 | * CIFS MD4 implementation, and the cryptoapi implementation |
20 | * originally based on the public domain implementation written |
21 | * by Colin Plumb in 1993. |
22 | * |
23 | * Copyright (c) Andrew Tridgell 1997-1998. |
24 | * Modified by Steve French (sfrench@us.ibm.com) 2002 |
25 | * Copyright (c) Cryptoapi developers. |
26 | * Copyright (c) 2002 David S. Miller (davem@redhat.com) |
27 | * Copyright (c) 2002 James Morris <jmorris@intercode.com.au> |
28 | * |
29 | * This program is free software; you can redistribute it and/or modify |
30 | * it under the terms of the GNU General Public License as published by |
31 | * the Free Software Foundation; either version 2 of the License, or |
32 | * (at your option) any later version. |
33 | * |
34 | */ |
35 | #define MD4_DIGEST_SIZE 16 |
36 | #define MD4_HMAC_BLOCK_SIZE 64 |
37 | #define MD4_BLOCK_WORDS 16 |
38 | #define MD4_HASH_WORDS 4 |
39 | |
40 | struct md4_ctx { |
41 | uint32_t hash[MD4_HASH_WORDS]; |
42 | uint32_t block[MD4_BLOCK_WORDS]; |
43 | uint64_t byte_count; |
44 | }; |
45 | |
46 | static inline uint32_t lshift(uint32_t x, unsigned int s) |
47 | { |
48 | x &= 0xFFFFFFFF; |
49 | return ((x << s) & 0xFFFFFFFF) | (x >> (32 - s)); |
50 | } |
51 | |
52 | static inline uint32_t F(uint32_t x, uint32_t y, uint32_t z) |
53 | { |
54 | return (x & y) | ((~x) & z); |
55 | } |
56 | |
57 | static inline uint32_t G(uint32_t x, uint32_t y, uint32_t z) |
58 | { |
59 | return (x & y) | (x & z) | (y & z); |
60 | } |
61 | |
62 | static inline uint32_t H(uint32_t x, uint32_t y, uint32_t z) |
63 | { |
64 | return x ^ y ^ z; |
65 | } |
66 | |
67 | #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) |
68 | #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (uint32_t)0x5A827999,s)) |
69 | #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (uint32_t)0x6ED9EBA1,s)) |
70 | |
71 | /* XXX: this stuff can be optimized */ |
72 | static inline void le32_to_cpu_array(uint32_t *buf, unsigned int words) |
73 | { |
74 | while (words--) { |
75 | *buf = ntohl(*buf); |
76 | buf++; |
77 | } |
78 | } |
79 | |
80 | static inline void cpu_to_le32_array(uint32_t *buf, unsigned int words) |
81 | { |
82 | while (words--) { |
83 | *buf = htonl(*buf); |
84 | buf++; |
85 | } |
86 | } |
87 | |
88 | static void md4_transform(uint32_t *hash, uint32_t const *in) |
89 | { |
90 | uint32_t a, b, c, d; |
91 | |
92 | a = hash[0]; |
93 | b = hash[1]; |
94 | c = hash[2]; |
95 | d = hash[3]; |
96 | |
97 | ROUND1(a, b, c, d, in[0], 3); |
98 | ROUND1(d, a, b, c, in[1], 7); |
99 | ROUND1(c, d, a, b, in[2], 11); |
100 | ROUND1(b, c, d, a, in[3], 19); |
101 | ROUND1(a, b, c, d, in[4], 3); |
102 | ROUND1(d, a, b, c, in[5], 7); |
103 | ROUND1(c, d, a, b, in[6], 11); |
104 | ROUND1(b, c, d, a, in[7], 19); |
105 | ROUND1(a, b, c, d, in[8], 3); |
106 | ROUND1(d, a, b, c, in[9], 7); |
107 | ROUND1(c, d, a, b, in[10], 11); |
108 | ROUND1(b, c, d, a, in[11], 19); |
109 | ROUND1(a, b, c, d, in[12], 3); |
110 | ROUND1(d, a, b, c, in[13], 7); |
111 | ROUND1(c, d, a, b, in[14], 11); |
112 | ROUND1(b, c, d, a, in[15], 19); |
113 | |
114 | ROUND2(a, b, c, d,in[ 0], 3); |
115 | ROUND2(d, a, b, c, in[4], 5); |
116 | ROUND2(c, d, a, b, in[8], 9); |
117 | ROUND2(b, c, d, a, in[12], 13); |
118 | ROUND2(a, b, c, d, in[1], 3); |
119 | ROUND2(d, a, b, c, in[5], 5); |
120 | ROUND2(c, d, a, b, in[9], 9); |
121 | ROUND2(b, c, d, a, in[13], 13); |
122 | ROUND2(a, b, c, d, in[2], 3); |
123 | ROUND2(d, a, b, c, in[6], 5); |
124 | ROUND2(c, d, a, b, in[10], 9); |
125 | ROUND2(b, c, d, a, in[14], 13); |
126 | ROUND2(a, b, c, d, in[3], 3); |
127 | ROUND2(d, a, b, c, in[7], 5); |
128 | ROUND2(c, d, a, b, in[11], 9); |
129 | ROUND2(b, c, d, a, in[15], 13); |
130 | |
131 | ROUND3(a, b, c, d,in[ 0], 3); |
132 | ROUND3(d, a, b, c, in[8], 9); |
133 | ROUND3(c, d, a, b, in[4], 11); |
134 | ROUND3(b, c, d, a, in[12], 15); |
135 | ROUND3(a, b, c, d, in[2], 3); |
136 | ROUND3(d, a, b, c, in[10], 9); |
137 | ROUND3(c, d, a, b, in[6], 11); |
138 | ROUND3(b, c, d, a, in[14], 15); |
139 | ROUND3(a, b, c, d, in[1], 3); |
140 | ROUND3(d, a, b, c, in[9], 9); |
141 | ROUND3(c, d, a, b, in[5], 11); |
142 | ROUND3(b, c, d, a, in[13], 15); |
143 | ROUND3(a, b, c, d, in[3], 3); |
144 | ROUND3(d, a, b, c, in[11], 9); |
145 | ROUND3(c, d, a, b, in[7], 11); |
146 | ROUND3(b, c, d, a, in[15], 15); |
147 | |
148 | hash[0] += a; |
149 | hash[1] += b; |
150 | hash[2] += c; |
151 | hash[3] += d; |
152 | } |
153 | |
154 | static inline void md4_transform_helper(struct md4_ctx *ctx) |
155 | { |
156 | le32_to_cpu_array(buf: ctx->block, ARRAY_SIZE(ctx->block)); |
157 | md4_transform(hash: ctx->hash, in: ctx->block); |
158 | } |
159 | |
160 | static void md4_init(struct md4_ctx *mctx) |
161 | { |
162 | mctx->hash[0] = 0x67452301; |
163 | mctx->hash[1] = 0xefcdab89; |
164 | mctx->hash[2] = 0x98badcfe; |
165 | mctx->hash[3] = 0x10325476; |
166 | mctx->byte_count = 0; |
167 | } |
168 | |
169 | static void md4_update(struct md4_ctx *mctx, |
170 | const unsigned char *data, unsigned int len) |
171 | { |
172 | const uint32_t avail = sizeof(mctx->block) - (mctx->byte_count & 0x3f); |
173 | |
174 | mctx->byte_count += len; |
175 | |
176 | if (avail > len) { |
177 | memcpy(dest: (char *)mctx->block + (sizeof(mctx->block) - avail), |
178 | src: data, n: len); |
179 | return; |
180 | } |
181 | |
182 | memcpy(dest: (char *)mctx->block + (sizeof(mctx->block) - avail), |
183 | src: data, n: avail); |
184 | |
185 | md4_transform_helper(ctx: mctx); |
186 | data += avail; |
187 | len -= avail; |
188 | |
189 | while (len >= sizeof(mctx->block)) { |
190 | memcpy(dest: mctx->block, src: data, n: sizeof(mctx->block)); |
191 | md4_transform_helper(ctx: mctx); |
192 | data += sizeof(mctx->block); |
193 | len -= sizeof(mctx->block); |
194 | } |
195 | |
196 | memcpy(dest: mctx->block, src: data, n: len); |
197 | } |
198 | |
199 | static void md4_final_ascii(struct md4_ctx *mctx, char *out, unsigned int len) |
200 | { |
201 | const unsigned int offset = mctx->byte_count & 0x3f; |
202 | char *p = (char *)mctx->block + offset; |
203 | int padding = 56 - (offset + 1); |
204 | |
205 | *p++ = 0x80; |
206 | if (padding < 0) { |
207 | memset(s: p, c: 0x00, n: padding + sizeof (uint64_t)); |
208 | md4_transform_helper(ctx: mctx); |
209 | p = (char *)mctx->block; |
210 | padding = 56; |
211 | } |
212 | |
213 | memset(s: p, c: 0, n: padding); |
214 | mctx->block[14] = mctx->byte_count << 3; |
215 | mctx->block[15] = mctx->byte_count >> 29; |
216 | le32_to_cpu_array(buf: mctx->block, words: (sizeof(mctx->block) - |
217 | sizeof(uint64_t)) / sizeof(uint32_t)); |
218 | md4_transform(hash: mctx->hash, in: mctx->block); |
219 | cpu_to_le32_array(buf: mctx->hash, ARRAY_SIZE(mctx->hash)); |
220 | |
221 | snprintf(s: out, maxlen: len, format: "%08X%08X%08X%08X" , |
222 | mctx->hash[0], mctx->hash[1], mctx->hash[2], mctx->hash[3]); |
223 | } |
224 | |
225 | static inline void add_char(unsigned char c, struct md4_ctx *md) |
226 | { |
227 | md4_update(mctx: md, data: &c, len: 1); |
228 | } |
229 | |
230 | static int parse_string(const char *file, unsigned long len, |
231 | struct md4_ctx *md) |
232 | { |
233 | unsigned long i; |
234 | |
235 | add_char(c: file[0], md); |
236 | for (i = 1; i < len; i++) { |
237 | add_char(c: file[i], md); |
238 | if (file[i] == '"' && file[i-1] != '\\') |
239 | break; |
240 | } |
241 | return i; |
242 | } |
243 | |
244 | static int (const char *file, unsigned long len) |
245 | { |
246 | unsigned long i; |
247 | |
248 | for (i = 2; i < len; i++) { |
249 | if (file[i-1] == '*' && file[i] == '/') |
250 | break; |
251 | } |
252 | return i; |
253 | } |
254 | |
255 | /* FIXME: Handle .s files differently (eg. # starts comments) --RR */ |
256 | static int parse_file(const char *fname, struct md4_ctx *md) |
257 | { |
258 | char *file; |
259 | unsigned long i, len; |
260 | |
261 | file = read_text_file(filename: fname); |
262 | len = strlen(s: file); |
263 | |
264 | for (i = 0; i < len; i++) { |
265 | /* Collapse and ignore \ and CR. */ |
266 | if (file[i] == '\\' && (i+1 < len) && file[i+1] == '\n') { |
267 | i++; |
268 | continue; |
269 | } |
270 | |
271 | /* Ignore whitespace */ |
272 | if (isspace(file[i])) |
273 | continue; |
274 | |
275 | /* Handle strings as whole units */ |
276 | if (file[i] == '"') { |
277 | i += parse_string(file: file+i, len: len - i, md); |
278 | continue; |
279 | } |
280 | |
281 | /* Comments: ignore */ |
282 | if (file[i] == '/' && file[i+1] == '*') { |
283 | i += parse_comment(file: file+i, len: len - i); |
284 | continue; |
285 | } |
286 | |
287 | add_char(c: file[i], md); |
288 | } |
289 | free(ptr: file); |
290 | return 1; |
291 | } |
292 | /* Check whether the file is a static library or not */ |
293 | static bool is_static_library(const char *objfile) |
294 | { |
295 | int len = strlen(s: objfile); |
296 | |
297 | return objfile[len - 2] == '.' && objfile[len - 1] == 'a'; |
298 | } |
299 | |
300 | /* We have dir/file.o. Open dir/.file.o.cmd, look for source_ and deps_ line |
301 | * to figure out source files. */ |
302 | static int parse_source_files(const char *objfile, struct md4_ctx *md) |
303 | { |
304 | char *cmd, *file, *line, *dir, *pos; |
305 | const char *base; |
306 | int dirlen, ret = 0, check_files = 0; |
307 | |
308 | cmd = NOFAIL(malloc(strlen(objfile) + sizeof("..cmd" ))); |
309 | |
310 | base = strrchr(s: objfile, c: '/'); |
311 | if (base) { |
312 | base++; |
313 | dirlen = base - objfile; |
314 | sprintf(s: cmd, format: "%.*s.%s.cmd" , dirlen, objfile, base); |
315 | } else { |
316 | dirlen = 0; |
317 | sprintf(s: cmd, format: ".%s.cmd" , objfile); |
318 | } |
319 | dir = NOFAIL(malloc(dirlen + 1)); |
320 | strncpy(dest: dir, src: objfile, n: dirlen); |
321 | dir[dirlen] = '\0'; |
322 | |
323 | file = read_text_file(filename: cmd); |
324 | |
325 | pos = file; |
326 | |
327 | /* Sum all files in the same dir or subdirs. */ |
328 | while ((line = get_line(stringp: &pos))) { |
329 | char* p = line; |
330 | |
331 | if (strncmp(s1: line, s2: "source_" , n: sizeof("source_" )-1) == 0) { |
332 | p = strrchr(s: line, c: ' '); |
333 | if (!p) { |
334 | warn("malformed line: %s\n" , line); |
335 | goto out_file; |
336 | } |
337 | p++; |
338 | if (!parse_file(fname: p, md)) { |
339 | warn("could not open %s: %s\n" , |
340 | p, strerror(errno)); |
341 | goto out_file; |
342 | } |
343 | continue; |
344 | } |
345 | if (strncmp(s1: line, s2: "deps_" , n: sizeof("deps_" )-1) == 0) { |
346 | check_files = 1; |
347 | continue; |
348 | } |
349 | if (!check_files) |
350 | continue; |
351 | |
352 | /* Continue until line does not end with '\' */ |
353 | if ( *(p + strlen(s: p)-1) != '\\') |
354 | break; |
355 | /* Terminate line at first space, to get rid of final ' \' */ |
356 | while (*p) { |
357 | if (isspace(*p)) { |
358 | *p = '\0'; |
359 | break; |
360 | } |
361 | p++; |
362 | } |
363 | |
364 | /* Check if this file is in same dir as objfile */ |
365 | if ((strstr(haystack: line, needle: dir)+strlen(s: dir)-1) == strrchr(s: line, c: '/')) { |
366 | if (!parse_file(fname: line, md)) { |
367 | warn("could not open %s: %s\n" , |
368 | line, strerror(errno)); |
369 | goto out_file; |
370 | } |
371 | |
372 | } |
373 | |
374 | } |
375 | |
376 | /* Everyone parsed OK */ |
377 | ret = 1; |
378 | out_file: |
379 | free(ptr: file); |
380 | free(ptr: dir); |
381 | free(ptr: cmd); |
382 | return ret; |
383 | } |
384 | |
385 | /* Calc and record src checksum. */ |
386 | void get_src_version(const char *modname, char sum[], unsigned sumlen) |
387 | { |
388 | char *buf; |
389 | struct md4_ctx md; |
390 | char *fname; |
391 | char filelist[PATH_MAX + 1]; |
392 | |
393 | /* objects for a module are listed in the first line of *.mod file. */ |
394 | snprintf(s: filelist, maxlen: sizeof(filelist), format: "%s.mod" , modname); |
395 | |
396 | buf = read_text_file(filename: filelist); |
397 | |
398 | md4_init(mctx: &md); |
399 | while ((fname = strsep(stringp: &buf, delim: "\n" ))) { |
400 | if (!*fname) |
401 | continue; |
402 | if (!(is_static_library(objfile: fname)) && |
403 | !parse_source_files(objfile: fname, md: &md)) |
404 | goto free; |
405 | } |
406 | |
407 | md4_final_ascii(mctx: &md, out: sum, len: sumlen); |
408 | free: |
409 | free(ptr: buf); |
410 | } |
411 | |