?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
modprobe,depmod: deprecate "include", sort config files, warn if they miss .conf
[mit.git] / depmod.c
blobb64bfcccc63c921638c8d2364b58b4db8012b94e
1 /* New simplified depmod without backwards compat stuff and not
2 requiring ksyms.
3
4 (C) 2002 Rusty Russell IBM Corporation
5 */
6 #define _GNU_SOURCE /* asprintf */
7
8 #include <stdio.h>
9 #include <stdlib.h>
10 #include <getopt.h>
11 #include <string.h>
12 #include <errno.h>
13 #include <unistd.h>
14 #include <elf.h>
15 #include <sys/types.h>
16 #include <sys/stat.h>
17 #include <fcntl.h>
18 #include <dirent.h>
19 #include <sys/utsname.h>
20 #include <sys/mman.h>
21
22 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
23
24 #include "zlibsupport.h"
25 #include "depmod.h"
26 #include "logging.h"
27 #include "index.h"
28 #include "moduleops.h"
29 #include "tables.h"
30 #include "config_filter.h"
31
32 #include "testing.h"
33
34 #ifndef MODULE_DIR
35 #define MODULE_DIR "/lib/modules/"
36 #endif
37
38 #ifndef MODULE_BUILTIN_KEY
39 #define MODULE_BUILTIN_KEY "built-in"
40 #endif
41
42 struct module_overrides
43 {
44 /* Next override */
45 struct module_overrides *next;
46
47 /* overridden module */
48 char *modfile;
49 };
50
51 struct module_search
52 {
53 /* Next search */
54 struct module_search *next;
55
56 /* search path */
57 char *search_path;
58 size_t len;
59 };
60
61 static int verbose;
62 static unsigned int skipchars;
63 static unsigned int make_map_files = 1; /* default to on */
64 static unsigned int force_map_files = 0; /* default to on */
65
66 #define SYMBOL_HASH_SIZE 1024
67 struct symbol
68 {
69 struct symbol *next;
70 struct module *owner;
71 char name[0];
72 };
73
74 static struct symbol *symbolhash[SYMBOL_HASH_SIZE];
75
76 /* This is based on the hash agorithm from gdbm, via tdb */
77 static inline unsigned int tdb_hash(const char *name)
78 {
79 unsigned value; /* Used to compute the hash value. */
80 unsigned i; /* Used to cycle through random values. */
81
82 /* Set the initial value from the key size. */
83 for (value = 0x238F13AF * strlen(name), i=0; name[i]; i++)
84 value = (value + (((unsigned char *)name)[i] << (i*5 % 24)));
85
86 return (1103515243 * value + 12345);
87 }
88
89 void add_symbol(const char *name, struct module *owner)
90 {
91 unsigned int hash;
92 struct symbol *new = NOFAIL(malloc(sizeof *new + strlen(name) + 1));
93
94 new->owner = owner;
95 strcpy(new->name, name);
96
97 hash = tdb_hash(name) % SYMBOL_HASH_SIZE;
98 new->next = symbolhash[hash];
99 symbolhash[hash] = new;
100 }
101
102 static int print_unknown;
103
104 struct module *find_symbol(const char *name, const char *modname, int weak)
105 {
106 struct symbol *s;
107
108 /* For our purposes, .foo matches foo. PPC64 needs this. */
109 if (name[0] == '.')
110 name++;
111
112 for (s = symbolhash[tdb_hash(name) % SYMBOL_HASH_SIZE]; s; s=s->next) {
113 if (streq(s->name, name))
114 return s->owner;
115 }
116
117 if (print_unknown && !weak)
118 warn("%s needs unknown symbol %s\n", modname, name);
119
120 return NULL;
121 }
122
123 void add_dep(struct module *mod, struct module *depends_on)
124 {
125 unsigned int i;
126
127 for (i = 0; i < mod->num_deps; i++)
128 if (mod->deps[i] == depends_on)
129 return;
130
131 mod->deps = NOFAIL(realloc(mod->deps, sizeof(mod->deps[0])*(mod->num_deps+1)));
132 mod->deps[mod->num_deps++] = depends_on;
133 }
134
135 static void load_system_map(const char *filename)
136 {
137 FILE *system_map;
138 char line[10240];
139 const char ksymstr[] = "__ksymtab_";
140 const int ksymstr_len = strlen(ksymstr);
141
142 system_map = fopen(filename, "r");
143 if (!system_map)
144 fatal("Could not open '%s': %s\n", filename, strerror(errno));
145
146 /* eg. c0294200 R __ksymtab_devfs_alloc_devnum */
147 while (fgets(line, sizeof(line)-1, system_map)) {
148 char *ptr;
149
150 /* Snip \n */
151 ptr = strchr(line, '\n');
152 if (ptr)
153 *ptr = '\0';
154
155 ptr = strchr(line, ' ');
156 if (!ptr || !(ptr = strchr(ptr + 1, ' ')))
157 continue;
158
159 /* Covers gpl-only and normal symbols. */
160 if (strncmp(ptr+1, ksymstr, ksymstr_len) == 0)
161 add_symbol(ptr+1+ksymstr_len, NULL);
162 }
163
164 fclose(system_map);
165
166 /* __this_module is magic inserted by kernel loader. */
167 add_symbol("__this_module", NULL);
168 /* On S390, this is faked up too */
169 add_symbol("_GLOBAL_OFFSET_TABLE_", NULL);
170 }
171
172 static struct option options[] = { { "all", 0, NULL, 'a' },
173 { "quick", 0, NULL, 'A' },
174 { "basedir", 1, NULL, 'b' },
175 { "errsyms", 0, NULL, 'e' },
176 { "filesyms", 1, NULL, 'F' },
177 { "help", 0, NULL, 'h' },
178 { "show", 0, NULL, 'n' },
179 { "dry-run", 0, NULL, 'n' },
180 { "quiet", 0, NULL, 'q' },
181 { "root", 0, NULL, 'r' },
182 { "unresolved-error", 0, NULL, 'u' },
183 { "verbose", 0, NULL, 'v' },
184 { "version", 0, NULL, 'V' },
185 { "config", 1, NULL, 'C' },
186 { "warn", 1, NULL, 'w' },
187 { "map", 0, NULL, 'm' },
188 { NULL, 0, NULL, 0 } };
189
190 /* Version number or module name? Don't assume extension. */
191 static int is_version_number(const char *version)
192 {
193 unsigned int dummy;
194
195 return (sscanf(version, "%u.%u.%u", &dummy, &dummy, &dummy) == 3);
196 }
197
198 static int old_module_version(const char *version)
199 {
200 /* Expect three part version. */
201 unsigned int major, sub, minor;
202
203 sscanf(version, "%u.%u.%u", &major, &sub, &minor);
204
205 if (major > 2) return 0;
206 if (major < 2) return 1;
207
208 /* 2.x */
209 if (sub > 5) return 0;
210 if (sub < 5) return 1;
211
212 /* 2.5.x */
213 if (minor >= 48) return 0;
214 return 1;
215 }
216
217 static void exec_old_depmod(char *argv[])
218 {
219 char *sep;
220 char pathname[strlen(argv[0])+1];
221 char oldname[strlen("depmod") + strlen(argv[0]) + sizeof(".old")];
222
223 memset(pathname, 0, strlen(argv[0])+1);
224 sep = strrchr(argv[0], '/');
225 if (sep)
226 memcpy(pathname, argv[0], sep - argv[0]+1);
227 sprintf(oldname, "%s%s.old", pathname, "depmod");
228
229 /* Recursion detection: we need an env var since we can't
230 change argv[0] (as older modutils uses it to determine
231 behavior). */
232 if (getenv("MODULE_RECURSE"))
233 return;
234 setenv("MODULE_RECURSE", "y", 0);
235
236 execvp(oldname, argv);
237 fprintf(stderr,
238 "Version requires old depmod, but couldn't run %s: %s\n",
239 oldname, strerror(errno));
240 exit(2);
241 }
242
243 static void grammar(const char *cmd, const char *filename, unsigned int line)
244 {
245 warn("%s line %u: ignoring bad line starting with '%s'\n",
246 filename, line, cmd);
247 }
248
249
250 static void print_usage(const char *name)
251 {
252 fprintf(stderr,
253 "%s " VERSION " -- part of " PACKAGE "\n"
254 "%s -[aA] [-n -e -v -q -V -r -u -w -m]\n"
255 " [-b basedirectory] [forced_version]\n"
256 "depmod [-n -e -v -q -r -u -w] [-F kernelsyms] module1.ko module2.ko ...\n"
257 "If no arguments (except options) are given, \"depmod -a\" is assumed\n"
258 "\n"
259 "depmod will output a dependancy list suitable for the modprobe utility.\n"
260 "\n"
261 "\n"
262 "Options:\n"
263 "\t-a, --all Probe all modules\n"
264 "\t-A, --quick Only does the work if there's a new module\n"
265 "\t-e, --errsyms Report not supplied symbols\n"
266 "\t-m, --map Create the legacy map files\n"
267 "\t-n, --show Write the dependency file on stdout only\n"
268 "\t-V, --version Print the release version\n"
269 "\t-v, --verbose Enable verbose mode\n"
270 "\t-w, --warn Warn on duplicates\n"
271 "\t-h, --help Print this usage message\n"
272 "\n"
273 "The following options are useful for people managing distributions:\n"
274 "\t-b basedirectory\n"
275 "\t --basedir basedirectory Use an image of a module tree.\n"
276 "\t-F kernelsyms\n"
277 "\t --filesyms kernelsyms Use the file instead of the\n"
278 "\t current kernel symbols.\n",
279 "depmod", "depmod");
280 }
281
282 static int ends_in(const char *name, const char *ext)
283 {
284 unsigned int namelen, extlen;
285
286 /* Grab lengths */
287 namelen = strlen(name);
288 extlen = strlen(ext);
289
290 if (namelen < extlen) return 0;
291
292 if (streq(name + namelen - extlen, ext))
293 return 1;
294 return 0;
295 }
296
297 /* "\177ELF" <byte> where byte = 001 for 32-bit, 002 for 64 */
298 int needconv(const char *elfhdr)
299 {
300 union { short s; char c[2]; } endian_test;
301
302 endian_test.s = 1;
303 if (endian_test.c[1] == 1) return elfhdr[EI_DATA] != ELFDATA2MSB;
304 if (endian_test.c[0] == 1) return elfhdr[EI_DATA] != ELFDATA2LSB;
305 else
306 abort();
307 }
308
309 static char *my_basename(const char *name)
310 {
311 const char *base = strrchr(name, '/');
312 if (base) return (char *)base + 1;
313 return (char *)name;
314 }
315
316 static struct module *grab_module(const char *dirname, const char *filename)
317 {
318 struct module *new;
319
320 new = NOFAIL(malloc(sizeof(*new)
321 + strlen(dirname?:"") + 1 + strlen(filename) + 1));
322 if (dirname)
323 sprintf(new->pathname, "%s/%s", dirname, filename);
324 else
325 strcpy(new->pathname, filename);
326 new->basename = my_basename(new->pathname);
327
328 INIT_LIST_HEAD(&new->dep_list);
329 new->order = INDEX_PRIORITY_MIN;
330
331 new->data = grab_file(new->pathname, &new->len);
332 if (!new->data) {
333 warn("Can't read module %s: %s\n",
334 new->pathname, strerror(errno));
335 goto fail_data;
336 }
337
338 /* "\177ELF" <byte> where byte = 001 for 32-bit, 002 for 64 */
339 if (memcmp(new->data, ELFMAG, SELFMAG) != 0) {
340 warn("Module %s is not an elf object\n", new->pathname);
341 goto fail;
342 }
343
344 switch (((char *)new->data)[EI_CLASS]) {
345 case ELFCLASS32:
346 new->ops = &mod_ops32;
347 break;
348 case ELFCLASS64:
349 new->ops = &mod_ops64;
350 break;
351 default:
352 warn("Module %s has elf unknown identifier %i\n",
353 new->pathname, ((char *)new->data)[EI_CLASS]);
354 goto fail;
355 }
356 new->conv = needconv(new->data);
357 return new;
358
359 fail:
360 release_file(new->data, new->len);
361 fail_data:
362 free(new);
363 return NULL;
364 }
365
366 struct module_traverse
367 {
368 struct module_traverse *prev;
369 struct module *mod;
370 };
371
372 static int in_loop(struct module *mod, const struct module_traverse *traverse)
373 {
374 const struct module_traverse *i;
375
376 for (i = traverse; i; i = i->prev) {
377 if (i->mod == mod)
378 return 1;
379 }
380 return 0;
381 }
382
383 /* Assume we are doing all the modules, so only report each loop once. */
384 static void report_loop(const struct module *mod,
385 const struct module_traverse *traverse)
386 {
387 const struct module_traverse *i;
388
389 /* Check that start is least alphabetically. eg. a depends
390 on b depends on a will get reported for a, not b. */
391 for (i = traverse->prev; i->prev; i = i->prev) {
392 if (strcmp(mod->pathname, i->mod->pathname) > 0)
393 return;
394 }
395
396 /* Is start in the loop? If not, don't report now. eg. a
397 depends on b which depends on c which depends on b. Don't
398 report when generating depends for a. */
399 if (mod != i->mod)
400 return;
401
402 warn("Loop detected: %s ", mod->pathname);
403 for (i = traverse->prev; i->prev; i = i->prev)
404 fprintf(stderr, "needs %s ", i->mod->basename);
405 fprintf(stderr, "which needs %s again!\n", i->mod->basename);
406 }
407
408 /* This is damn slow, but loops actually happen, and we don't want to
409 just exit() and leave the user without any modules. */
410 static int has_dep_loop(struct module *module, struct module_traverse *prev)
411 {
412 unsigned int i;
413 struct module_traverse traverse = { .prev = prev, .mod = module };
414
415 if (in_loop(module, prev)) {
416 report_loop(module, &traverse);
417 return 1;
418 }
419
420 for (i = 0; i < module->num_deps; i++)
421 if (has_dep_loop(module->deps[i], &traverse))
422 return 1;
423 return 0;
424 }
425
426 /* Uniquifies and orders a dependency list. */
427 static void order_dep_list(struct module *start, struct module *mod)
428 {
429 unsigned int i;
430
431 for (i = 0; i < mod->num_deps; i++) {
432 /* If it was previously depended on, move it to the
433 tail. ie. if a needs b and c, and c needs b, we
434 must order b after c. */
435 list_del(&mod->deps[i]->dep_list);
436 list_add_tail(&mod->deps[i]->dep_list, &start->dep_list);
437 order_dep_list(start, mod->deps[i]);
438 }
439 }
440
441 static struct module *deleted = NULL;
442
443 static void del_module(struct module **modules, struct module *delme)
444 {
445 struct module **i;
446
447 /* Find pointer to it. */
448 if (modules) {
449 for (i = modules; *i != delme; i = &(*i)->next);
450
451 *i = delme->next;
452 }
453
454 /* Save on a list to quiet valgrind.
455 Can't free - other modules may depend on them */
456 delme->next = deleted;
457 deleted = delme;
458 }
459
460 /* Convert filename to the module name. Works if filename == modname, too. */
461 static void filename2modname(char *modname, const char *filename)
462 {
463 const char *afterslash;
464 unsigned int i;
465
466 afterslash = strrchr(filename, '/');
467 if (!afterslash)
468 afterslash = filename;
469 else
470 afterslash++;
471
472 /* Convert to underscores, stop at first . */
473 for (i = 0; afterslash[i] && afterslash[i] != '.'; i++) {
474 if (afterslash[i] == '-')
475 modname[i] = '_';
476 else
477 modname[i] = afterslash[i];
478 }
479 modname[i] = '\0';
480 }
481
482 /* convert to relative path if possible */
483 static const char *compress_path(const char *path, const char *basedir)
484 {
485 int len = strlen(basedir);
486
487 if (strncmp(path, basedir, len) == 0)
488 path += len + 1;
489 return path;
490 }
491
492 static void output_deps(struct module *modules,
493 FILE *out, char *dirname)
494 {
495 struct module *i;
496
497 for (i = modules; i; i = i->next) {
498 struct list_head *j, *tmp;
499 order_dep_list(i, i);
500
501 fprintf(out, "%s:", compress_path(i->pathname, dirname));
502 list_for_each_safe(j, tmp, &i->dep_list) {
503 struct module *dep
504 = list_entry(j, struct module, dep_list);
505 fprintf(out, " %s",
506 compress_path(dep->pathname, dirname));
507 list_del_init(j);
508 }
509 fprintf(out, "\n");
510 }
511 }
512
513 /* warn whenever duplicate module aliases, deps, or symbols are found. */
514 int warn_dups = 0;
515
516 static void output_deps_bin(struct module *modules,
517 FILE *out, char *dirname)
518 {
519 struct module *i;
520 struct index_node *index;
521 char *line;
522 char *p;
523
524 index = index_create();
525
526 for (i = modules; i; i = i->next) {
527 struct list_head *j, *tmp;
528 char modname[strlen(i->pathname)+1];
529
530 order_dep_list(i, i);
531
532 filename2modname(modname, i->pathname);
533 nofail_asprintf(&line, "%s:",
534 compress_path(i->pathname, dirname));
535 p = line;
536 list_for_each_safe(j, tmp, &i->dep_list) {
537 struct module *dep
538 = list_entry(j, struct module, dep_list);
539 nofail_asprintf(&line, "%s %s",
540 p,
541 compress_path(dep->pathname, dirname));
542 free(p);
543 p = line;
544 list_del_init(j);
545 }
546 if (index_insert(index, modname, line, i->order) && warn_dups)
547 warn("duplicate module deps:\n%s\n",line);
548 free(line);
549 }
550
551 index_write(index, out);
552 index_destroy(index);
553 }
554
555
556 static int smells_like_module(const char *name)
557 {
558 return ends_in(name,".ko") || ends_in(name, ".ko.gz");
559 }
560
561 typedef struct module *(*do_module_t)(const char *dirname,
562 const char *filename,
563 struct module *next,
564 struct module_search *search,
565 struct module_overrides *overrides);
566
567 static int is_higher_priority(const char *newpath, const char *oldpath,
568 struct module_search *search,
569 struct module_overrides *overrides)
570 {
571 struct module_search *tmp;
572 struct module_overrides *ovtmp;
573 int i = 0;
574 int prio_builtin = -1;
575 int prio_new = -1;
576 int prio_old = -1;
577
578 /* The names already match, now we check for overrides and directory search
579 * order
580 */
581 for (ovtmp = overrides; ovtmp != NULL; ovtmp = ovtmp->next) {
582 if (strcmp(ovtmp->modfile, newpath) == 0)
583 return 1;
584 if (strcmp(ovtmp->modfile, oldpath) == 0)
585 return 0;
586 }
587 for (i = 0, tmp = search; tmp != NULL; tmp = tmp->next, i++) {
588 if (strcmp(tmp->search_path, MODULE_BUILTIN_KEY) == 0)
589 prio_builtin = i;
590 else if (strncmp(tmp->search_path, newpath, tmp->len) == 0)
591 prio_new = i;
592 else if (strncmp(tmp->search_path, oldpath, tmp->len) == 0)
593 prio_old = i;
594 }
595 if (prio_builtin < 0)
596 prio_builtin = i;
597 if (prio_new < 0)
598 prio_new = prio_builtin;
599 if (prio_old < 0)
600 prio_old = prio_builtin;
601
602 return prio_new > prio_old;
603 }
604
605
606 static struct module *do_module(const char *dirname,
607 const char *filename,
608 struct module *list,
609 struct module_search *search,
610 struct module_overrides *overrides)
611 {
612 struct module *new, **i;
613
614 new = grab_module(dirname, filename);
615 if (!new)
616 return list;
617
618 /* Check if module is already in the list. */
619 for (i = &list; *i; i = &(*i)->next) {
620
621 if (streq((*i)->basename, filename)) {
622 char newpath[strlen(dirname) + strlen("/")
623 + strlen(filename) + 1];
624
625 sprintf(newpath, "%s/%s", dirname, filename);
626
627 if (is_higher_priority(newpath, (*i)->pathname,search,
628 overrides)) {
629 del_module(i, *i);
630
631 new->next = *i;
632 *i = new;
633 } else
634 del_module(NULL, new);
635
636 return list;
637 }
638 }
639
640 /* Not in the list already. Just prepend. */
641 new->next = list;
642 return new;
643 }
644
645 static struct module *grab_dir(const char *dirname,
646 DIR *dir,
647 struct module *next,
648 do_module_t do_mod,
649 struct module_search *search,
650 struct module_overrides *overrides)
651 {
652 struct dirent *dirent;
653
654 while ((dirent = readdir(dir)) != NULL) {
655 if (smells_like_module(dirent->d_name))
656 next = do_mod(dirname, dirent->d_name, next,
657 search, overrides);
658 else if (!streq(dirent->d_name, ".")
659 && !streq(dirent->d_name, "..")
660 && !streq(dirent->d_name, "source")
661 && !streq(dirent->d_name, "build")) {
662
663 DIR *sub;
664 char subdir[strlen(dirname) + 1
665 + strlen(dirent->d_name) + 1];
666 sprintf(subdir, "%s/%s", dirname, dirent->d_name);
667 sub = opendir(subdir);
668 if (sub) {
669 next = grab_dir(subdir, sub, next, do_mod,
670 search, overrides);
671 closedir(sub);
672 }
673 }
674 }
675 return next;
676 }
677
678 static struct module *grab_basedir(const char *dirname,
679 struct module_search *search,
680 struct module_overrides *overrides)
681 {
682 DIR *dir;
683 struct module *list;
684
685 dir = opendir(dirname);
686 if (!dir) {
687 warn("Couldn't open directory %s: %s\n",
688 dirname, strerror(errno));
689 return NULL;
690 }
691 list = grab_dir(dirname, dir, NULL, do_module, search, overrides);
692 closedir(dir);
693
694 return list;
695 }
696
697 static struct module *sort_modules(const char *dirname, struct module *list)
698 {
699 struct module *tlist = NULL, **tpos = &tlist;
700 FILE *modorder;
701 int dir_len = strlen(dirname) + 1;
702 char file_name[dir_len + strlen("modules.order") + 1];
703 char line[10240];
704 unsigned int linenum = 0;
705
706 sprintf(file_name, "%s/%s", dirname, "modules.order");
707
708 modorder = fopen(file_name, "r");
709 if (!modorder) {
710 /* Older kernels don't generate modules.order. Just
711 return if the file doesn't exist. */
712 if (errno == ENOENT)
713 return list;
714 fatal("Could not open '%s': %s\n", file_name, strerror(errno));
715 }
716
717 sprintf(line, "%s/", dirname);
718
719 /* move modules listed in modorder file to tlist in order */
720 while (fgets(line, sizeof(line), modorder)) {
721 struct module **pos, *mod;
722 int len = strlen(line);
723
724 linenum++;
725 if (line[len - 1] == '\n')
726 line[len - 1] = '\0';
727
728 for (pos = &list; (mod = *pos); pos = &(*pos)->next) {
729 if (strcmp(line, mod->pathname + dir_len) == 0) {
730 mod->order = linenum;
731 *pos = mod->next;
732 mod->next = NULL;
733 *tpos = mod;
734 tpos = &mod->next;
735 break;
736 }
737 }
738 }
739
740 /* append the rest */
741 *tpos = list;
742
743 fclose(modorder);
744
745 return tlist;
746 }
747
748 static struct module *parse_modules(struct module *list)
749 {
750 struct module *i;
751
752 for (i = list; i; i = i->next) {
753 i->ops->load_symbols(i);
754 i->ops->fetch_tables(i);
755 }
756
757 for (i = list; i; i = i->next)
758 i->ops->calculate_deps(i, verbose);
759
760 /* Strip out modules with dependency loops. */
761 again:
762 for (i = list; i; i = i->next) {
763 if (has_dep_loop(i, NULL)) {
764 warn("Module %s ignored, due to loop\n",
765 i->pathname + skipchars);
766 del_module(&list, i);
767 goto again;
768 }
769 }
770
771 return list;
772 }
773
774 /* Simply dump hash table. */
775 static void output_symbols(struct module *unused, FILE *out, char *dirname)
776 {
777 unsigned int i;
778
779 fprintf(out, "# Aliases for symbols, used by symbol_request().\n");
780 for (i = 0; i < SYMBOL_HASH_SIZE; i++) {
781 struct symbol *s;
782
783 for (s = symbolhash[i]; s; s = s->next) {
784 if (s->owner) {
785 char modname[strlen(s->owner->pathname)+1];
786 filename2modname(modname, s->owner->pathname);
787 fprintf(out, "alias symbol:%s %s\n",
788 s->name, modname);
789 }
790 }
791 }
792 }
793
794 static void output_symbols_bin(struct module *unused, FILE *out, char *dirname)
795 {
796 struct index_node *index;
797 unsigned int i;
798 char *alias;
799 int duplicate;
800
801 index = index_create();
802
803 for (i = 0; i < SYMBOL_HASH_SIZE; i++) {
804 struct symbol *s;
805
806 for (s = symbolhash[i]; s; s = s->next) {
807 if (s->owner) {
808 char modname[strlen(s->owner->pathname)+1];
809 filename2modname(modname, s->owner->pathname);
810 nofail_asprintf(&alias, "symbol:%s", s->name);
811 duplicate = index_insert(index, alias, modname,
812 s->owner->order);
813 if (duplicate && warn_dups)
814 warn("duplicate module syms:\n%s %s\n",
815 alias, modname);
816 free(alias);
817 }
818 }
819 }
820
821 index_write(index, out);
822 index_destroy(index);
823 }
824
825 static const char *next_string(const char *string, unsigned long *secsize)
826 {
827 /* Skip non-zero chars */
828 while (string[0]) {
829 string++;
830 if ((*secsize)-- <= 1)
831 return NULL;
832 }
833
834 /* Skip any zero padding. */
835 while (!string[0]) {
836 string++;
837 if ((*secsize)-- <= 1)
838 return NULL;
839 }
840 return string;
841 }
842
843 /* Careful! Don't munge - in [ ] as per Debian Bug#350915 */
844 static char *underscores(char *string)
845 {
846 unsigned int i;
847
848 if (!string)
849 return NULL;
850
851 for (i = 0; string[i]; i++) {
852 switch (string[i]) {
853 case '-':
854 string[i] = '_';
855 break;
856
857 case ']':
858 warn("Unmatched bracket in %s\n", string);
859 break;
860
861 case '[':
862 i += strcspn(&string[i], "]");
863 if (!string[i])
864 warn("Unmatched bracket in %s\n", string);
865 }
866 }
867 return string;
868 }
869
870 static void output_aliases(struct module *modules, FILE *out, char *dirname)
871 {
872 struct module *i;
873 const char *p;
874 unsigned long size;
875
876 fprintf(out, "# Aliases extracted from modules themselves.\n");
877 for (i = modules; i; i = i->next) {
878 char modname[strlen(i->pathname)+1];
879
880 filename2modname(modname, i->pathname);
881
882 /* Grab from old-style .modalias section. */
883 for (p = i->ops->get_aliases(i, &size);
884 p;
885 p = next_string(p, &size))
886 fprintf(out, "alias %s %s\n", p, modname);
887
888 /* Grab form new-style .modinfo section. */
889 for (p = i->ops->get_modinfo(i, &size);
890 p;
891 p = next_string(p, &size)) {
892 if (strncmp(p, "alias=", strlen("alias=")) == 0)
893 fprintf(out, "alias %s %s\n",
894 p + strlen("alias="), modname);
895 }
896 }
897 }
898
899 static void output_aliases_bin(struct module *modules, FILE *out, char *dirname)
900 {
901 struct module *i;
902 const char *p;
903 char *alias;
904 unsigned long size;
905 struct index_node *index;
906 int duplicate;
907
908 index = index_create();
909
910 for (i = modules; i; i = i->next) {
911 char modname[strlen(i->pathname)+1];
912
913 filename2modname(modname, i->pathname);
914
915 /* Grab from old-style .modalias section. */
916 for (p = i->ops->get_aliases(i, &size);
917 p;
918 p = next_string(p, &size)) {
919 alias = NOFAIL(strdup(p));
920 underscores(alias);
921 duplicate = index_insert(index, alias, modname, i->order);
922 if (duplicate && warn_dups)
923 warn("duplicate module alias:\n%s %s\n",
924 alias, modname);
925 free(alias);
926 }
927
928 /* Grab from new-style .modinfo section. */
929 for (p = i->ops->get_modinfo(i, &size);
930 p;
931 p = next_string(p, &size)) {
932 if (strncmp(p, "alias=", strlen("alias=")) == 0) {
933 alias = NOFAIL(strdup(p + strlen("alias=")));
934 underscores(alias);
935 duplicate = index_insert(index, alias, modname, i->order);
936 if (duplicate && warn_dups)
937 warn("duplicate module alias:\n%s %s\n",
938 alias, modname);
939 free(alias);
940 }
941 }
942 }
943
944 index_write(index, out);
945 index_destroy(index);
946 }
947
948 struct depfile {
949 char *name;
950 void (*func)(struct module *, FILE *, char *dirname);
951 int map_file;
952 };
953
954 static struct depfile depfiles[] = {
955 { "modules.dep", output_deps, 0 }, /* This is what we check for '-A'. */
956 { "modules.dep.bin", output_deps_bin, 0 },
957 { "modules.pcimap", output_pci_table, 1 },
958 { "modules.usbmap", output_usb_table, 1 },
959 { "modules.ccwmap", output_ccw_table, 1 },
960 { "modules.ieee1394map", output_ieee1394_table, 1 },
961 { "modules.isapnpmap", output_isapnp_table, 1 },
962 { "modules.inputmap", output_input_table, 1 },
963 { "modules.ofmap", output_of_table, 1 },
964 { "modules.seriomap", output_serio_table, 1 },
965 { "modules.alias", output_aliases, 0 },
966 { "modules.alias.bin", output_aliases_bin, 0 },
967 { "modules.symbols", output_symbols, 0 },
968 { "modules.symbols.bin", output_symbols_bin, 0 }
969 };
970
971 /* If we can't figure it out, it's safe to say "true". */
972 static int any_modules_newer(const char *dirname, time_t mtime)
973 {
974 DIR *dir;
975 struct dirent *dirent;
976
977 dir = opendir(dirname);
978 if (!dir)
979 return 1;
980
981 while ((dirent = readdir(dir)) != NULL) {
982 struct stat st;
983 char file[strlen(dirname) + 1 + strlen(dirent->d_name) + 1];
984
985 if (streq(dirent->d_name, ".") || streq(dirent->d_name, ".."))
986 continue;
987
988 sprintf(file, "%s/%s", dirname, dirent->d_name);
989 if (lstat(file, &st) != 0)
990 goto ret_true;
991
992 if (smells_like_module(dirent->d_name)) {
993 if (st.st_mtime > mtime)
994 goto ret_true;
995 } else if (S_ISDIR(st.st_mode)) {
996 if (any_modules_newer(file, mtime))
997 goto ret_true;
998 }
999 }
1000 closedir(dir);
1001 return 0;
1002
1003 ret_true:
1004 closedir(dir);
1005 return 1;
1006 }
1007
1008 static int depfile_out_of_date(const char *dirname)
1009 {
1010 struct stat st;
1011 char depfile[strlen(dirname) + 1 + strlen(depfiles[0].name) + 1];
1012
1013 sprintf(depfile, "%s/%s", dirname, depfiles[0].name);
1014
1015 if (stat(depfile, &st) != 0)
1016 return 1;
1017
1018 return any_modules_newer(dirname, st.st_mtime);
1019 }
1020
1021 static char *getline_wrapped(FILE *file, unsigned int *linenum)
1022 {
1023 int size = 256;
1024 int i = 0;
1025 char *buf = NOFAIL(malloc(size));
1026 for(;;) {
1027 int ch = getc_unlocked(file);
1028
1029 switch(ch) {
1030 case EOF:
1031 if (i == 0) {
1032 free(buf);
1033 return NULL;
1034 }
1035 /* else fall through */
1036
1037 case '\n':
1038 if (linenum)
1039 (*linenum)++;
1040 if (i == size)
1041 buf = NOFAIL(realloc(buf, size + 1));
1042 buf[i] = '\0';
1043 return buf;
1044
1045 case '\\':
1046 ch = getc_unlocked(file);
1047
1048 if (ch == '\n') {
1049 if (linenum)
1050 (*linenum)++;
1051 continue;
1052 }
1053 /* else fall through */
1054
1055 default:
1056 buf[i++] = ch;
1057
1058 if (i == size) {
1059 size *= 2;
1060 buf = NOFAIL(realloc(buf, size));
1061 }
1062 }
1063 }
1064 }
1065
1066
1067 static char *strsep_skipspace(char **string, char *delim)
1068 {
1069 if (!*string)
1070 return NULL;
1071 *string += strspn(*string, delim);
1072 return strsep(string, delim);
1073 }
1074
1075 static struct module_search *add_search(const char *search_path,
1076 size_t len,
1077 struct module_search *search)
1078 {
1079
1080 struct module_search *new;
1081
1082 new = NOFAIL(malloc(sizeof(*new)));
1083 new->search_path = NOFAIL(strdup(search_path));
1084 new->len = len;
1085 new->next = search;
1086
1087 return new;
1088
1089 }
1090
1091 static struct module_overrides *add_override(const char *modfile,
1092 struct module_overrides *overrides)
1093 {
1094
1095 struct module_overrides *new;
1096
1097 new = NOFAIL(malloc(sizeof(*new)));
1098 new->modfile = NOFAIL(strdup(modfile));
1099 new->next = overrides;
1100
1101 return new;
1102
1103 }
1104
1105 static int parse_config_scan(const char *filename,
1106 const char *basedir,
1107 const char *kernelversion,
1108 struct module_search **search,
1109 struct module_overrides **overrides);
1110
1111 static int parse_config_file(const char *filename,
1112 const char *basedir,
1113 const char *kernelversion,
1114 struct module_search **search,
1115 struct module_overrides **overrides)
1116 {
1117 char *line;
1118 unsigned int linenum = 0;
1119 FILE *cfile;
1120
1121 cfile = fopen(filename, "r");
1122 if (!cfile) {
1123 if (errno != ENOENT)
1124 fatal("could not open '%s', reason: %s\n", filename,
1125 strerror(errno));
1126 return 0;
1127 }
1128
1129 while ((line = getline_wrapped(cfile, &linenum)) != NULL) {
1130 char *ptr = line;
1131 char *cmd, *modname;
1132
1133 cmd = strsep_skipspace(&ptr, "\t ");
1134
1135 if (cmd == NULL || cmd[0] == '#' || cmd[0] == '\0') {
1136 free(line);
1137 continue;
1138 }
1139
1140 if (strcmp(cmd, "search") == 0) {
1141 char *search_path;
1142
1143 while ((search_path = strsep_skipspace(&ptr, "\t "))) {
1144 char *dirname;
1145 size_t len;
1146
1147 if (strcmp(search_path,
1148 MODULE_BUILTIN_KEY) == 0) {
1149 *search = add_search(MODULE_BUILTIN_KEY,
1150 0, *search);
1151 continue;
1152 }
1153 len = strlen(basedir)
1154 + strlen(MODULE_DIR)
1155 + strlen(kernelversion)
1156 + 1
1157 + strlen(search_path);
1158 dirname = NOFAIL(malloc(len + 1));
1159 sprintf(dirname, "%s%s%s/%s", basedir,
1160 MODULE_DIR, kernelversion, search_path);
1161 *search = add_search(dirname, len, *search);
1162 free(dirname);
1163 }
1164 } else if (strcmp(cmd, "override") == 0) {
1165 char *pathname = NULL, *version, *subdir;
1166 modname = strsep_skipspace(&ptr, "\t ");
1167 version = strsep_skipspace(&ptr, "\t ");
1168 subdir = strsep_skipspace(&ptr, "\t ");
1169
1170 if (strcmp(version, kernelversion) != 0 &&
1171 strcmp(version, "*") != 0)
1172 continue;
1173
1174 pathname = NOFAIL(malloc(strlen(basedir)
1175 + strlen(MODULE_DIR)
1176 + strlen(kernelversion)
1177 + strlen(subdir)
1178 + strlen(modname)
1179 + strlen(".ko")
1180 + 3));
1181 sprintf(pathname, "%s%s%s/%s/%s.ko", basedir,
1182 MODULE_DIR, kernelversion, subdir, modname);
1183
1184 *overrides = add_override(pathname, *overrides);
1185 free(pathname);
1186 } else if (strcmp(cmd, "include") == 0) {
1187 char *newfilename;
1188
1189 newfilename = strsep_skipspace(&ptr, "\t ");
1190 if (!newfilename) {
1191 grammar(cmd, filename, linenum);
1192 } else {
1193 warn("\"include %s\" is deprecated, "
1194 "please use /etc/depmod.d\n", newfilename);
1195 if (strncmp(newfilename, "/etc/depmod.d",
1196 strlen("/etc/depmod.d")) == 0) {
1197 warn("\"include /etc/depmod.d\" is "
1198 "the default, ignored\n");
1199 } else {
1200 if (!parse_config_scan(newfilename, basedir,
1201 kernelversion,
1202 search, overrides))
1203 warn("Failed to open included"
1204 " config file %s: %s\n",
1205 newfilename, strerror(errno));
1206 }
1207 }
1208 } else if (strcmp(cmd, "make_map_files") == 0) {
1209 char *option;
1210
1211 option = strsep_skipspace(&ptr, "\t ");
1212 if (!option)
1213 grammar(cmd, filename, linenum);
1214 else {
1215 if (0 == strncmp(option, "yes", 3))
1216 make_map_files = 1;
1217 else if (0 == strncmp(option, "no", 2))
1218 make_map_files = 0;
1219 else
1220 grammar(cmd, filename, linenum);
1221 }
1222 } else
1223 grammar(cmd, filename, linenum);
1224
1225 free(line);
1226 }
1227 fclose(cfile);
1228 return 1;
1229 }
1230
1231 static int parse_config_scan(const char *filename,
1232 const char *basedir,
1233 const char *kernelversion,
1234 struct module_search **search,
1235 struct module_overrides **overrides)
1236 {
1237 DIR *dir;
1238 int ret = 0;
1239
1240 dir = opendir(filename);
1241 if (dir) {
1242 struct file_entry {
1243 struct list_head node;
1244 char name[];
1245 };
1246 LIST_HEAD(files_list);
1247 struct file_entry *fe, *fe_tmp;
1248 struct dirent *i;
1249
1250 /* sort files from directory into list */
1251 while ((i = readdir(dir)) != NULL) {
1252 size_t len;
1253
1254 if (i->d_name[0] == '.')
1255 continue;
1256 if (!config_filter(i->d_name))
1257 continue;
1258
1259 len = strlen(i->d_name);
1260 if (len < 6 || strcmp(&i->d_name[len-5], ".conf") != 0)
1261 warn("All config files need .conf: %s/%s, "
1262 "it will be ignored in a future release.\n",
1263 filename, i->d_name);
1264 fe = malloc(sizeof(struct file_entry) + len + 1);
1265 if (fe == NULL)
1266 continue;
1267 strcpy(fe->name, i->d_name);
1268 list_for_each_entry(fe_tmp, &files_list, node)
1269 if (strcmp(fe_tmp->name, fe->name) >= 0)
1270 break;
1271 list_add_tail(&fe->node, &fe_tmp->node);
1272 }
1273 closedir(dir);
1274
1275 /* parse list of files */
1276 list_for_each_entry_safe(fe, fe_tmp, &files_list, node) {
1277 char *cfgfile;
1278
1279 nofail_asprintf(&cfgfile, "%s/%s", filename, fe->name);
1280 if (!parse_config_file(cfgfile, basedir, kernelversion,
1281 search, overrides))
1282 warn("Failed to open config file "
1283 "%s: %s\n", fe->name, strerror(errno));
1284 free(cfgfile);
1285 list_del(&fe->node);
1286 free(fe);
1287 }
1288
1289 ret = 1;
1290 } else {
1291 if (parse_config_file(filename, basedir, kernelversion, search,
1292 overrides))
1293 ret = 1;
1294 }
1295
1296 return ret;
1297 }
1298
1299 static void parse_toplevel_config(const char *filename,
1300 const char *basedir,
1301 const char *kernelversion,
1302 struct module_search **search,
1303 struct module_overrides **overrides)
1304 {
1305 if (filename) {
1306 if (!parse_config_scan(filename, basedir, kernelversion, search,
1307 overrides))
1308 fatal("Failed to open config file %s: %s\n",
1309 filename, strerror(errno));
1310 return;
1311 }
1312
1313 /* deprecated config file */
1314 if (parse_config_file("/etc/depmod.conf", basedir, kernelversion,
1315 search, overrides) > 0)
1316 warn("Deprecated config file /etc/depmod.conf, "
1317 "all config files belong into /etc/depmod.d/.\n");
1318
1319 /* default config */
1320 parse_config_scan("/etc/depmod.d", basedir, kernelversion,
1321 search, overrides);
1322 }
1323
1324 /* Local to main, but not freed on exit. Keep valgrind quiet. */
1325 struct module *list = NULL;
1326 struct module_search *search = NULL;
1327 struct module_overrides *overrides = NULL;
1328
1329 int main(int argc, char *argv[])
1330 {
1331 int opt, all = 0, maybe_all = 0, doing_stdout = 0;
1332 char *basedir = "", *dirname, *version, *badopt = NULL,
1333 *system_map = NULL;
1334 int i;
1335 const char *config = NULL;
1336
1337 /* Don't print out any errors just yet, we might want to exec
1338 backwards compat version. */
1339 opterr = 0;
1340 while ((opt = getopt_long(argc, argv, "ab:ArehnqruvVF:C:wm", options, NULL))
1341 != -1) {
1342 switch (opt) {
1343 case 'a':
1344 all = 1;
1345 break;
1346 case 'b':
1347 basedir = optarg;
1348 skipchars = strlen(basedir);
1349 break;
1350 case 'A':
1351 maybe_all = 1;
1352 break;
1353 case 'F':
1354 system_map = optarg;
1355 break;
1356 case 'e':
1357 print_unknown = 1;
1358 break;
1359 case 'v':
1360 verbose = 1;
1361 break;
1362 case 'u':
1363 case 'q':
1364 case 'r':
1365 break;
1366 case 'C':
1367 config = optarg;
1368 break;
1369 case 'h':
1370 print_usage(argv[0]);
1371 exit(0);
1372 break;
1373 case 'n':
1374 doing_stdout = 1;
1375 break;
1376 case 'V':
1377 printf("%s %s\n", PACKAGE, VERSION);
1378 exit(0);
1379 case 'w':
1380 warn_dups = 1;
1381 break;
1382 case 'm':
1383 force_map_files = 1;
1384 break;
1385 default:
1386 badopt = argv[optind-1];
1387 }
1388 }
1389
1390 /* We can't print unknowns without a System.map */
1391 if (!system_map)
1392 print_unknown = 0;
1393 else
1394 load_system_map(system_map);
1395
1396 /* They can specify the version naked on the command line */
1397 if (optind < argc && is_version_number(argv[optind])) {
1398 version = NOFAIL(strdup(argv[optind]));
1399 optind++;
1400 } else {
1401 struct utsname buf;
1402 uname(&buf);
1403 version = NOFAIL(strdup(buf.release));
1404 }
1405
1406 /* Run old version if required. */
1407 if (old_module_version(version))
1408 exec_old_depmod(argv);
1409
1410 if (badopt) {
1411 fprintf(stderr, "%s: malformed/unrecognized option '%s'\n",
1412 argv[0], badopt);
1413 print_usage(argv[0]);
1414 exit(1);
1415 }
1416
1417 /* Depmod -a by default if no names. */
1418 if (optind == argc)
1419 all = 1;
1420
1421 dirname = NOFAIL(malloc(strlen(basedir)
1422 + strlen(MODULE_DIR)
1423 + strlen(version) + 1));
1424 sprintf(dirname, "%s%s%s", basedir, MODULE_DIR, version);
1425
1426 if (maybe_all) {
1427 if (!doing_stdout && !depfile_out_of_date(dirname))
1428 exit(0);
1429 all = 1;
1430 }
1431
1432 parse_toplevel_config(config, basedir, version, &search, &overrides);
1433
1434 /* For backward compatibility add "updates" to the head of the search
1435 * list here. But only if there was no "search" option specified.
1436 */
1437
1438 if (!search)
1439 search = add_search("updates", strlen("updates"), search);
1440
1441 if (!all) {
1442 /* Do command line args. */
1443 for (opt = optind; opt < argc; opt++) {
1444 struct module *new;
1445
1446 if (argv[opt][0] != '/')
1447 fatal("modules must be specified using absolute paths.\n"
1448 "\"%s\" is a relative path\n", argv[opt]);
1449
1450 new = grab_module(NULL, argv[opt]);
1451 if (!new) {
1452 /* cmd-line specified modules must exist */
1453 fatal("grab_module() failed for module %s\n", argv[opt]);
1454 }
1455 new->next = list;
1456 list = new;
1457 }
1458 } else {
1459 list = grab_basedir(dirname,search,overrides);
1460 }
1461 list = sort_modules(dirname,list);
1462 list = parse_modules(list);
1463
1464 for (i = 0; i < sizeof(depfiles)/sizeof(depfiles[0]); i++) {
1465 FILE *out;
1466 struct depfile *d = &depfiles[i];
1467 char depname[strlen(dirname) + 1 + strlen(d->name) + 1];
1468 char tmpname[strlen(dirname) + 1 + strlen(d->name) +
1469 strlen(".temp") + 1];
1470
1471 if (d->map_file && !make_map_files && !force_map_files)
1472 continue;
1473
1474 sprintf(depname, "%s/%s", dirname, d->name);
1475 sprintf(tmpname, "%s/%s.temp", dirname, d->name);
1476 if (!doing_stdout) {
1477 out = fopen(tmpname, "w");
1478 if (!out)
1479 fatal("Could not open %s for writing: %s\n",
1480 tmpname, strerror(errno));
1481 } else {
1482 out = stdout;
1483 if (ends_in(depname, ".bin"))
1484 continue;
1485 }
1486 d->func(list, out, dirname);
1487 if (!doing_stdout) {
1488 fclose(out);
1489 if (rename(tmpname, depname) < 0)
1490 fatal("Could not rename %s into %s: %s\n",
1491 tmpname, depname, strerror(errno));
1492 }
1493 }
1494
1495 free(dirname);
1496 free(version);
1497
1498 return 0;
1499 }
module-init-tools