?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
GUI: Fix Tomato RAF theme for all builds. Compilation typo.
[tomato.git] / release / src-rt-6.x.4708 / linux / linux-2.6.36 / scripts / mod / sumversion.c
blob288ea922928e77f09fdc51b555c948c9630b336a
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 static inline void le32_to_cpu_array(uint32_t *buf, unsigned int words)
72 {
73 while (words--) {
74 *buf = ntohl(*buf);
75 buf++;
76 }
77 }
78
79 static inline void cpu_to_le32_array(uint32_t *buf, unsigned int words)
80 {
81 while (words--) {
82 *buf = htonl(*buf);
83 buf++;
84 }
85 }
86
87 static void md4_transform(uint32_t *hash, uint32_t const *in)
88 {
89 uint32_t a, b, c, d;
90
91 a = hash[0];
92 b = hash[1];
93 c = hash[2];
94 d = hash[3];
95
96 ROUND1(a, b, c, d, in[0], 3);
97 ROUND1(d, a, b, c, in[1], 7);
98 ROUND1(c, d, a, b, in[2], 11);
99 ROUND1(b, c, d, a, in[3], 19);
100 ROUND1(a, b, c, d, in[4], 3);
101 ROUND1(d, a, b, c, in[5], 7);
102 ROUND1(c, d, a, b, in[6], 11);
103 ROUND1(b, c, d, a, in[7], 19);
104 ROUND1(a, b, c, d, in[8], 3);
105 ROUND1(d, a, b, c, in[9], 7);
106 ROUND1(c, d, a, b, in[10], 11);
107 ROUND1(b, c, d, a, in[11], 19);
108 ROUND1(a, b, c, d, in[12], 3);
109 ROUND1(d, a, b, c, in[13], 7);
110 ROUND1(c, d, a, b, in[14], 11);
111 ROUND1(b, c, d, a, in[15], 19);
112
113 ROUND2(a, b, c, d,in[ 0], 3);
114 ROUND2(d, a, b, c, in[4], 5);
115 ROUND2(c, d, a, b, in[8], 9);
116 ROUND2(b, c, d, a, in[12], 13);
117 ROUND2(a, b, c, d, in[1], 3);
118 ROUND2(d, a, b, c, in[5], 5);
119 ROUND2(c, d, a, b, in[9], 9);
120 ROUND2(b, c, d, a, in[13], 13);
121 ROUND2(a, b, c, d, in[2], 3);
122 ROUND2(d, a, b, c, in[6], 5);
123 ROUND2(c, d, a, b, in[10], 9);
124 ROUND2(b, c, d, a, in[14], 13);
125 ROUND2(a, b, c, d, in[3], 3);
126 ROUND2(d, a, b, c, in[7], 5);
127 ROUND2(c, d, a, b, in[11], 9);
128 ROUND2(b, c, d, a, in[15], 13);
129
130 ROUND3(a, b, c, d,in[ 0], 3);
131 ROUND3(d, a, b, c, in[8], 9);
132 ROUND3(c, d, a, b, in[4], 11);
133 ROUND3(b, c, d, a, in[12], 15);
134 ROUND3(a, b, c, d, in[2], 3);
135 ROUND3(d, a, b, c, in[10], 9);
136 ROUND3(c, d, a, b, in[6], 11);
137 ROUND3(b, c, d, a, in[14], 15);
138 ROUND3(a, b, c, d, in[1], 3);
139 ROUND3(d, a, b, c, in[9], 9);
140 ROUND3(c, d, a, b, in[5], 11);
141 ROUND3(b, c, d, a, in[13], 15);
142 ROUND3(a, b, c, d, in[3], 3);
143 ROUND3(d, a, b, c, in[11], 9);
144 ROUND3(c, d, a, b, in[7], 11);
145 ROUND3(b, c, d, a, in[15], 15);
146
147 hash[0] += a;
148 hash[1] += b;
149 hash[2] += c;
150 hash[3] += d;
151 }
152
153 static inline void md4_transform_helper(struct md4_ctx *ctx)
154 {
155 le32_to_cpu_array(ctx->block, sizeof(ctx->block) / sizeof(uint32_t));
156 md4_transform(ctx->hash, ctx->block);
157 }
158
159 static void md4_init(struct md4_ctx *mctx)
160 {
161 mctx->hash[0] = 0x67452301;
162 mctx->hash[1] = 0xefcdab89;
163 mctx->hash[2] = 0x98badcfe;
164 mctx->hash[3] = 0x10325476;
165 mctx->byte_count = 0;
166 }
167
168 static void md4_update(struct md4_ctx *mctx,
169 const unsigned char *data, unsigned int len)
170 {
171 const uint32_t avail = sizeof(mctx->block) - (mctx->byte_count & 0x3f);
172
173 mctx->byte_count += len;
174
175 if (avail > len) {
176 memcpy((char *)mctx->block + (sizeof(mctx->block) - avail),
177 data, len);
178 return;
179 }
180
181 memcpy((char *)mctx->block + (sizeof(mctx->block) - avail),
182 data, avail);
183
184 md4_transform_helper(mctx);
185 data += avail;
186 len -= avail;
187
188 while (len >= sizeof(mctx->block)) {
189 memcpy(mctx->block, data, sizeof(mctx->block));
190 md4_transform_helper(mctx);
191 data += sizeof(mctx->block);
192 len -= sizeof(mctx->block);
193 }
194
195 memcpy(mctx->block, data, len);
196 }
197
198 static void md4_final_ascii(struct md4_ctx *mctx, char *out, unsigned int len)
199 {
200 const unsigned int offset = mctx->byte_count & 0x3f;
201 char *p = (char *)mctx->block + offset;
202 int padding = 56 - (offset + 1);
203
204 *p++ = 0x80;
205 if (padding < 0) {
206 memset(p, 0x00, padding + sizeof (uint64_t));
207 md4_transform_helper(mctx);
208 p = (char *)mctx->block;
209 padding = 56;
210 }
211
212 memset(p, 0, padding);
213 mctx->block[14] = mctx->byte_count << 3;
214 mctx->block[15] = mctx->byte_count >> 29;
215 le32_to_cpu_array(mctx->block, (sizeof(mctx->block) -
216 sizeof(uint64_t)) / sizeof(uint32_t));
217 md4_transform(mctx->hash, mctx->block);
218 cpu_to_le32_array(mctx->hash, sizeof(mctx->hash) / sizeof(uint32_t));
219
220 snprintf(out, len, "%08X%08X%08X%08X",
221 mctx->hash[0], mctx->hash[1], mctx->hash[2], mctx->hash[3]);
222 }
223
224 static inline void add_char(unsigned char c, struct md4_ctx *md)
225 {
226 md4_update(md, &c, 1);
227 }
228
229 static int parse_string(const char *file, unsigned long len,
230 struct md4_ctx *md)
231 {
232 unsigned long i;
233
234 add_char(file[0], md);
235 for (i = 1; i < len; i++) {
236 add_char(file[i], md);
237 if (file[i] == '"' && file[i-1] != '\\')
238 break;
239 }
240 return i;
241 }
242
243 static int parse_comment(const char *file, unsigned long len)
244 {
245 unsigned long i;
246
247 for (i = 2; i < len; i++) {
248 if (file[i-1] == '*' && file[i] == '/')
249 break;
250 }
251 return i;
252 }
253
254 static int parse_file(const char *fname, struct md4_ctx *md)
255 {
256 char *file;
257 unsigned long i, len;
258
259 file = grab_file(fname, &len);
260 if (!file)
261 return 0;
262
263 for (i = 0; i < len; i++) {
264 /* Collapse and ignore \ and CR. */
265 if (file[i] == '\\' && (i+1 < len) && file[i+1] == '\n') {
266 i++;
267 continue;
268 }
269
270 /* Ignore whitespace */
271 if (isspace(file[i]))
272 continue;
273
274 /* Handle strings as whole units */
275 if (file[i] == '"') {
276 i += parse_string(file+i, len - i, md);
277 continue;
278 }
279
280 /* Comments: ignore */
281 if (file[i] == '/' && file[i+1] == '*') {
282 i += parse_comment(file+i, len - i);
283 continue;
284 }
285
286 add_char(file[i], md);
287 }
288 release_file(file, len);
289 return 1;
290 }
291 /* Check whether the file is a static library or not */
292 static int is_static_library(const char *objfile)
293 {
294 int len = strlen(objfile);
295 if (objfile[len - 2] == '.' && objfile[len - 1] == 'a')
296 return 1;
297 else
298 return 0;
299 }
300
301 /* We have dir/file.o. Open dir/.file.o.cmd, look for deps_ line to
302 * figure out source file. */
303 static int parse_source_files(const char *objfile, struct md4_ctx *md)
304 {
305 char *cmd, *file, *line, *dir;
306 const char *base;
307 unsigned long flen, pos = 0;
308 int dirlen, ret = 0, check_files = 0;
309
310 cmd = NOFAIL(malloc(strlen(objfile) + sizeof("..cmd")));
311
312 base = strrchr(objfile, '/');
313 if (base) {
314 base++;
315 dirlen = base - objfile;
316 sprintf(cmd, "%.*s.%s.cmd", dirlen, objfile, base);
317 } else {
318 dirlen = 0;
319 sprintf(cmd, ".%s.cmd", objfile);
320 }
321 dir = NOFAIL(malloc(dirlen + 1));
322 strncpy(dir, objfile, dirlen);
323 dir[dirlen] = '\0';
324
325 file = grab_file(cmd, &flen);
326 if (!file) {
327 warn("could not find %s for %s\n", cmd, objfile);
328 goto out;
329 }
330
331 /* There will be a line like so:
332 deps_drivers/net/dummy.o := \
333 drivers/net/dummy.c \
334 $(wildcard include/config/net/fastroute.h) \
335 include/linux/module.h \
336
337 Sum all files in the same dir or subdirs.
338 */
339 while ((line = get_next_line(&pos, file, flen)) != NULL) {
340 char* p = line;
341 if (strncmp(line, "deps_", sizeof("deps_")-1) == 0) {
342 check_files = 1;
343 continue;
344 }
345 if (!check_files)
346 continue;
347
348 /* Continue until line does not end with '\' */
349 if ( *(p + strlen(p)-1) != '\\')
350 break;
351 /* Terminate line at first space, to get rid of final ' \' */
352 while (*p) {
353 if (isspace(*p)) {
354 *p = '\0';
355 break;
356 }
357 p++;
358 }
359
360 /* Check if this file is in same dir as objfile */
361 if ((strstr(line, dir)+strlen(dir)-1) == strrchr(line, '/')) {
362 if (!parse_file(line, md)) {
363 warn("could not open %s: %s\n",
364 line, strerror(errno));
365 goto out_file;
366 }
367
368 }
369
370 }
371
372 /* Everyone parsed OK */
373 ret = 1;
374 out_file:
375 release_file(file, flen);
376 out:
377 free(dir);
378 free(cmd);
379 return ret;
380 }
381
382 /* Calc and record src checksum. */
383 void get_src_version(const char *modname, char sum[], unsigned sumlen)
384 {
385 void *file;
386 unsigned long len;
387 struct md4_ctx md;
388 char *sources, *end, *fname;
389 const char *basename;
390 char filelist[PATH_MAX + 1];
391 char *modverdir = getenv("MODVERDIR");
392
393 if (!modverdir)
394 modverdir = ".";
395
396 /* Source files for module are in .tmp_versions/modname.mod,
397 after the first line. */
398 if (strrchr(modname, '/'))
399 basename = strrchr(modname, '/') + 1;
400 else
401 basename = modname;
402 sprintf(filelist, "%s/%.*s.mod", modverdir,
403 (int) strlen(basename) - 2, basename);
404
405 file = grab_file(filelist, &len);
406 if (!file)
407 /* not a module or .mod file missing - ignore */
408 return;
409
410 sources = strchr(file, '\n');
411 if (!sources) {
412 warn("malformed versions file for %s\n", modname);
413 goto release;
414 }
415
416 sources++;
417 end = strchr(sources, '\n');
418 if (!end) {
419 warn("bad ending versions file for %s\n", modname);
420 goto release;
421 }
422 *end = '\0';
423
424 md4_init(&md);
425 while ((fname = strsep(&sources, " ")) != NULL) {
426 if (!*fname)
427 continue;
428 if (!(is_static_library(fname)) &&
429 !parse_source_files(fname, &md))
430 goto release;
431 }
432
433 md4_final_ascii(&md, sum, sumlen);
434 release:
435 release_file(file, len);
436 }
437
438 static void write_version(const char *filename, const char *sum,
439 unsigned long offset)
440 {
441 int fd;
442
443 fd = open(filename, O_RDWR);
444 if (fd < 0) {
445 warn("changing sum in %s failed: %s\n",
446 filename, strerror(errno));
447 return;
448 }
449
450 if (lseek(fd, offset, SEEK_SET) == (off_t)-1) {
451 warn("changing sum in %s:%lu failed: %s\n",
452 filename, offset, strerror(errno));
453 goto out;
454 }
455
456 if (write(fd, sum, strlen(sum)+1) != strlen(sum)+1) {
457 warn("writing sum in %s failed: %s\n",
458 filename, strerror(errno));
459 goto out;
460 }
461 out:
462 close(fd);
463 }
464
465 static int strip_rcs_crap(char *version)
466 {
467 unsigned int len, full_len;
468
469 if (strncmp(version, "$Revision", strlen("$Revision")) != 0)
470 return 0;
471
472 /* Space for version string follows. */
473 full_len = strlen(version) + strlen(version + strlen(version) + 1) + 2;
474
475 /* Move string to start with version number: prefix will be
476 * $Revision$ or $Revision: */
477 len = strlen("$Revision");
478 if (version[len] == ':' || version[len] == '$')
479 len++;
480 while (isspace(version[len]))
481 len++;
482 memmove(version, version+len, full_len-len);
483 full_len -= len;
484
485 /* Preserve up to next whitespace. */
486 len = 0;
487 while (version[len] && !isspace(version[len]))
488 len++;
489 memmove(version + len, version + strlen(version),
490 full_len - strlen(version));
491 return 1;
492 }
493
494 /* Clean up RCS-style version numbers. */
495 void maybe_frob_rcs_version(const char *modfilename,
496 char *version,
497 void *modinfo,
498 unsigned long version_offset)
499 {
500 if (strip_rcs_crap(version))
501 write_version(modfilename, version, version_offset);
502 }
Tomato firmware and modifications.