1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/* vi: set sw=4 ts=4: */
/*
* depmod - generate modules.dep
* Copyright (c) 2008 Bernhard Fischer
*
* Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
*/
#undef _GNU_SOURCE
#define _GNU_SOURCE
#include <libbb.h>
#include <sys/utsname.h> /* uname() */
/*
* Theory of operation:
* - iterate over all modules and record their full path
* - iterate over all modules looking for "depends=" entries
* for each depends, look through our list of full paths and emit if found
*/
typedef struct dep_lst_t {
char *name;
llist_t *dependencies;
llist_t *aliases;
struct dep_lst_t *next;
} dep_lst_t;
struct globals {
dep_lst_t *lst; /* modules without their corresponding extension */
};
#define G (*(struct globals*)&bb_common_bufsiz1)
/* We have to zero it out because of NOEXEC */
#define INIT_G() memset(&G, 0, sizeof(G))
static char* find_keyword(void *the_module, size_t len, const char * const word)
{
char *ptr = the_module;
do {
/* search for the first char in word */
ptr = memchr(ptr, *word, len - (ptr - (char*)the_module));
if (ptr == NULL) /* no occurance left, done */
return NULL;
if (!strncmp(ptr, word, strlen(word))) {
ptr += strlen(word);
break;
}
++ptr;
} while (1);
return ptr;
}
static int FAST_FUNC fileAction(const char *fname, struct stat *sb,
void UNUSED_PARAM *data, int UNUSED_PARAM depth)
{
size_t len = sb->st_size;
void *the_module;
char *ptr;
int fd;
char *depends, *deps;
dep_lst_t *this;
if (strrstr(fname, ".ko") == NULL) /* not a module */
goto skip;
/*XXX: FIXME: does not handle compressed modules!
* There should be a function that looks at the extension and sets up
* open_transformer for us.
*/
fd = xopen(fname, O_RDONLY);
the_module = mmap(NULL, len, PROT_READ, MAP_SHARED
#if defined MAP_POPULATE
|MAP_POPULATE
#endif
, fd, 0);
close(fd);
if (the_module == MAP_FAILED)
bb_perror_msg_and_die("mmap");
this = xzalloc(sizeof(dep_lst_t));
this->name = xstrdup(fname);
this->next = G.lst;
G.lst = this;
//bb_info_msg("fname='%s'", fname);
ptr = find_keyword(the_module, len, "depends=");
if (!*ptr)
goto d_none;
deps = depends = xstrdup(ptr);
//bb_info_msg(" depends='%s'", depends);
while (deps) {
ptr = strsep(&deps, ",");
//bb_info_msg("[%s] -> '%s'", fname, (char*)ptr);
llist_add_to_end(&this->dependencies, xstrdup(ptr));
}
free(depends);
d_none:
if (ENABLE_FEATURE_DEPMOD_ALIAS)
{
size_t pos = 0;
do {
ptr = find_keyword(the_module + pos, len - pos, "alias=");
if (ptr) {
//bb_info_msg("[%s] alias '%s'", fname, (char*)ptr);
llist_add_to_end(&this->aliases, xstrdup(ptr));
} else
break;
pos = (ptr - (char*)the_module);
} while (1);
}
munmap(the_module, sb->st_size);
skip:
return TRUE;
}
int depmod_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
int depmod_main(int argc UNUSED_PARAM, char **argv)
{
int ret;
size_t moddir_base_len = 0; /* length of the "-b basedir" */
char *moddir_base = NULL, *moddir, *system_map, *chp;
FILE *filedes = stdout;
enum {
ARG_a = (1<<0), /* All modules, ignore mods in argv */
ARG_A = (1<<1), /* Only emit .ko that are newer than modules.dep file */
ARG_b = (1<<2), /* not /lib/modules/$(uname -r)/ but this base-dir */
ARG_e = (1<<3), /* with -F, print unresolved symbols */
ARG_F = (1<<4), /* System.map that contains the symbols */
ARG_n = (1<<5) /* dry-run, print to stdout only */
};
INIT_G();
getopt32(argv, "aAb:eF:n", &moddir_base, &system_map);
argv += optind;
/* If a version is provided, then that kernel version’s module directory
* is used, rather than the current kernel version (as returned by
* "uname -r"). */
if (*argv && (sscanf(*argv, "%d.%d.%d", &ret, &ret, &ret) == 3)) {
moddir = concat_path_file(CONFIG_DEFAULT_MODULES_DIR, *argv++);
} else {
struct utsname uts;
if (uname(&uts) < 0)
bb_simple_perror_msg_and_die("uname");
moddir = concat_path_file(CONFIG_DEFAULT_MODULES_DIR, uts.release);
}
/* If no modules are given on the command-line, -a is on per default. */
option_mask32 |= *argv == NULL;
if (option_mask32 & ARG_b) {
moddir_base_len = strlen(moddir_base) + 1;
xchdir(moddir_base);
}
if (!(option_mask32 & ARG_n)) { /* --dry-run */
chp = concat_path_file(moddir, CONFIG_DEFAULT_DEPMOD_FILE);
filedes = xfopen_for_write(chp);
if (ENABLE_FEATURE_CLEAN_UP)
free(chp);
}
ret = EXIT_SUCCESS;
do {
chp = option_mask32 & ARG_a ? moddir : (*argv + moddir_base_len);
if (!recursive_action(chp,
ACTION_RECURSE, /* flags */
fileAction, /* file action */
NULL, /* dir action */
NULL, /* user data */
0)) { /* depth */
ret = EXIT_FAILURE;
}
} while (!(option_mask32 & ARG_a) && *++argv);
{
dep_lst_t *mods = G.lst;
/* Fixup the module names in the depends list */
while (mods) {
llist_t *deps = NULL, *old_deps = mods->dependencies;
while (old_deps) {
dep_lst_t *all = G.lst;
char *longname = NULL;
char *shortname = llist_pop(&old_deps);
while (all) {
char *nam =
xstrdup(bb_get_last_path_component_nostrip(all->name));
char *tmp = strrstr(nam, ".ko");
*tmp = '\0';
if (!strcmp(nam, shortname)) {
if (ENABLE_FEATURE_CLEAN_UP)
free(nam);
longname = all->name;
break;
}
free(nam);
all = all->next;
}
llist_add_to_end(&deps, longname);
}
mods->dependencies = deps;
mods = mods->next;
}
#if ENABLE_FEATURE_DEPMOD_PRUNE_FANCY
/* modprobe allegedly wants dependencies without duplicates, i.e.
* mod1: mod2 mod3
* mod2: mod3
* mod3:
* implies that mod1 directly depends on mod2 and _not_ mod3 as mod3 is
* already implicitely pulled in via mod2. This leaves us with:
* mod1: mod2
* mod2: mod3
* mod3:
*/
mods = G.lst;
while (mods) {
llist_t *deps = mods->dependencies;
while (deps) {
dep_lst_t *all = G.lst;
while (all) {
if (!strcmp(all->name, deps->data)) {
llist_t *implied = all->dependencies;
while (implied) {
/* XXX:FIXME: erm, it would be nicer to just
* llist_unlink(&mods->dependencies, implied) */
llist_t *prune = mods->dependencies;
while (prune) {
if (!strcmp(implied->data, prune->data))
break;
prune = prune->link;
}
//if (prune) bb_info_msg("[%s] '%s' implies '%s', removing", mods->name, all->name, implied->data);
llist_unlink(&mods->dependencies, prune);
implied = implied->link;
}
}
all = all->next;
}
deps = deps->link;
}
mods = mods->next;
}
#endif
mods = G.lst;
/* Finally print them. */
while (mods) {
fprintf(filedes, "%s:", mods->name);
/* If we did not resolve all modules, then it's likely that we just did
* not see the names of all prerequisites (which will be NULL in this
* case). */
while (mods->dependencies) {
char *the_dep = llist_pop(&mods->dependencies);
if (the_dep)
fprintf(filedes, " %s", the_dep);
}
fprintf(filedes, "\n");
if (ENABLE_FEATURE_DEPMOD_ALIAS)
{
char *shortname =
xstrdup(bb_get_last_path_component_nostrip(mods->name));
char *tmp = strrstr(shortname, ".ko");
*tmp = '\0';
while (mods->aliases) {
fprintf(filedes, "alias %s %s\n",
(char*)llist_pop(&mods->aliases),
shortname);
}
free(shortname);
}
mods = mods->next;
}
}
if (ENABLE_FEATURE_CLEAN_UP) {
fclose_if_not_stdin(filedes);
free(moddir);
while (G.lst) {
dep_lst_t *old = G.lst;
G.lst = G.lst->next;
free(old->name);
free(old);
}
}
return ret;
}
|