Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1 | /* |
| 2 | * kmod-depmod - calculate modules.dep using libkmod. |
| 3 | * |
Lucas De Marchi | a66a6a9 | 2012-01-09 00:40:50 -0200 | [diff] [blame] | 4 | * Copyright (C) 2011-2012 ProFUSION embedded systems |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 5 | * |
| 6 | * This program is free software: you can redistribute it and/or modify |
| 7 | * it under the terms of the GNU General Public License as published by |
| 8 | * the Free Software Foundation, either version 2 of the License, or |
| 9 | * (at your option) any later version. |
| 10 | * |
| 11 | * This program is distributed in the hope that it will be useful, |
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | * GNU General Public License for more details. |
| 15 | * |
| 16 | * You should have received a copy of the GNU General Public License |
| 17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 18 | */ |
Lucas De Marchi | 0c010fa | 2011-12-28 13:33:26 -0200 | [diff] [blame] | 19 | #include "libkmod.h" |
| 20 | #include "libkmod-array.h" |
| 21 | #include "libkmod-hash.h" |
| 22 | #include "libkmod-util.h" |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 23 | |
| 24 | #include <stdio.h> |
| 25 | #include <stdlib.h> |
| 26 | #include <getopt.h> |
| 27 | #include <errno.h> |
| 28 | #include <string.h> |
| 29 | #include <syslog.h> |
| 30 | #include <limits.h> |
| 31 | #include <dirent.h> |
| 32 | #include <sys/utsname.h> |
| 33 | #include <sys/stat.h> |
| 34 | #include <regex.h> |
| 35 | #include <assert.h> |
| 36 | #include <unistd.h> |
Gustavo Sverzut Barbieri | 4b144e5 | 2011-12-23 23:19:22 -0200 | [diff] [blame] | 37 | #include <ctype.h> |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 38 | |
| 39 | #define DEFAULT_VERBOSE LOG_WARNING |
| 40 | static int verbose = DEFAULT_VERBOSE; |
| 41 | |
Gustavo Sverzut Barbieri | a627c3f | 2011-12-26 13:19:07 -0200 | [diff] [blame] | 42 | static const struct kmod_ext { |
| 43 | const char *ext; |
| 44 | size_t len; |
| 45 | } kmod_exts[] = { |
| 46 | {".ko", sizeof(".ko") - 1}, |
| 47 | #ifdef ENABLE_ZLIB |
| 48 | {".ko.gz", sizeof(".ko.gz") - 1}, |
| 49 | #endif |
| 50 | #ifdef ENABLE_XZ |
| 51 | {".ko.xz", sizeof(".ko.xz") - 1}, |
| 52 | #endif |
| 53 | {NULL, 0}, |
| 54 | }; |
| 55 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 56 | static const char CFG_BUILTIN_KEY[] = "built-in"; |
| 57 | static const char *default_cfg_paths[] = { |
| 58 | "/run/depmod.d", |
| 59 | SYSCONFDIR "/depmod.d", |
| 60 | ROOTPREFIX "/lib/depmod.d", |
| 61 | NULL |
| 62 | }; |
| 63 | |
| 64 | static const char cmdopts_s[] = "aAb:C:E:F:euqrvnP:wmVh"; |
| 65 | static const struct option cmdopts[] = { |
| 66 | {"all", no_argument, 0, 'a'}, |
| 67 | {"quick", no_argument, 0, 'A'}, |
| 68 | {"basedir", required_argument, 0, 'b'}, |
| 69 | {"config", required_argument, 0, 'C'}, |
| 70 | {"symvers", required_argument, 0, 'E'}, |
| 71 | {"filesyms", required_argument, 0, 'F'}, |
| 72 | {"errsyms", no_argument, 0, 'e'}, |
| 73 | {"unresolved-error", no_argument, 0, 'u'}, /* deprecated */ |
| 74 | {"quiet", no_argument, 0, 'q'}, /* deprecated */ |
| 75 | {"root", no_argument, 0, 'r'}, /* deprecated */ |
| 76 | {"verbose", no_argument, 0, 'v'}, |
| 77 | {"show", no_argument, 0, 'n'}, |
| 78 | {"dry-run", no_argument, 0, 'n'}, |
| 79 | {"symbol-prefix", no_argument, 0, 'P'}, |
| 80 | {"warn", no_argument, 0, 'w'}, |
| 81 | {"map", no_argument, 0, 'm'}, /* deprecated */ |
| 82 | {"version", no_argument, 0, 'V'}, |
| 83 | {"help", no_argument, 0, 'h'}, |
| 84 | {NULL, 0, 0, 0} |
| 85 | }; |
| 86 | |
| 87 | static void help(const char *progname) |
| 88 | { |
| 89 | fprintf(stderr, |
| 90 | "Usage:\n" |
| 91 | "\t%s -[aA] [options] [forced_version]\n" |
| 92 | "\n" |
| 93 | "If no arguments (except options) are given, \"depmod -a\" is assumed\n" |
| 94 | "\n" |
| 95 | "depmod will output a dependency list suitable for the modprobe utility.\n" |
| 96 | "\n" |
| 97 | "Options:\n" |
| 98 | "\t-a, --all Probe all modules\n" |
| 99 | "\t-A, --quick Only does the work if there's a new module\n" |
| 100 | "\t-e, --errsyms Report not supplied symbols\n" |
| 101 | "\t-n, --show Write the dependency file on stdout only\n" |
| 102 | "\t-P, --symbol-prefix Architecture symbol prefix\n" |
Gustavo Sverzut Barbieri | 5988652 | 2012-01-03 15:06:08 -0200 | [diff] [blame] | 103 | "\t-C, --config=PATH Read configuration from PATH\n" |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 104 | "\t-v, --verbose Enable verbose mode\n" |
| 105 | "\t-w, --warn Warn on duplicates\n" |
| 106 | "\t-V, --version show version\n" |
| 107 | "\t-h, --help show this help\n" |
| 108 | "\n" |
| 109 | "The following options are useful for people managing distributions:\n" |
| 110 | "\t-b, --basedir=DIR Use an image of a module tree.\n" |
| 111 | "\t-F, --filesyms=FILE Use the file instead of the\n" |
| 112 | "\t current kernel symbols.\n" |
| 113 | "\t-E, --symvers=FILE Use Module.symvers file to check\n" |
| 114 | "\t symbol versions.\n", |
| 115 | progname); |
| 116 | } |
| 117 | |
| 118 | static inline void _show(const char *fmt, ...) |
| 119 | { |
| 120 | va_list args; |
| 121 | |
| 122 | if (verbose <= DEFAULT_VERBOSE) |
| 123 | return; |
| 124 | |
| 125 | va_start(args, fmt); |
| 126 | vfprintf(stdout, fmt, args); |
| 127 | fflush(stdout); |
| 128 | va_end(args); |
| 129 | } |
| 130 | |
| 131 | static inline void _log(int prio, const char *fmt, ...) |
| 132 | { |
| 133 | const char *prioname; |
| 134 | char buf[32], *msg; |
| 135 | va_list args; |
| 136 | |
| 137 | if (prio > verbose) |
| 138 | return; |
| 139 | |
| 140 | va_start(args, fmt); |
| 141 | if (vasprintf(&msg, fmt, args) < 0) |
| 142 | msg = NULL; |
| 143 | va_end(args); |
| 144 | if (msg == NULL) |
| 145 | return; |
| 146 | |
| 147 | switch (prio) { |
| 148 | case LOG_CRIT: |
| 149 | prioname = "FATAL"; |
| 150 | break; |
| 151 | case LOG_ERR: |
| 152 | prioname = "ERROR"; |
| 153 | break; |
| 154 | case LOG_WARNING: |
| 155 | prioname = "WARNING"; |
| 156 | break; |
| 157 | case LOG_NOTICE: |
| 158 | prioname = "NOTICE"; |
| 159 | break; |
| 160 | case LOG_INFO: |
| 161 | prioname = "INFO"; |
| 162 | break; |
| 163 | case LOG_DEBUG: |
| 164 | prioname = "DEBUG"; |
| 165 | break; |
| 166 | default: |
| 167 | snprintf(buf, sizeof(buf), "LOG-%03d", prio); |
| 168 | prioname = buf; |
| 169 | } |
| 170 | |
| 171 | fprintf(stderr, "%s: %s", prioname, msg); |
| 172 | free(msg); |
| 173 | |
| 174 | if (prio <= LOG_CRIT) |
| 175 | exit(EXIT_FAILURE); |
| 176 | } |
| 177 | #define CRIT(...) _log(LOG_CRIT, __VA_ARGS__) |
| 178 | #define ERR(...) _log(LOG_ERR, __VA_ARGS__) |
| 179 | #define WRN(...) _log(LOG_WARNING, __VA_ARGS__) |
| 180 | #define INF(...) _log(LOG_INFO, __VA_ARGS__) |
| 181 | #define DBG(...) _log(LOG_DEBUG, __VA_ARGS__) |
| 182 | #define SHOW(...) _show(__VA_ARGS__) |
| 183 | |
| 184 | |
Gustavo Sverzut Barbieri | 0de4046 | 2011-12-23 23:11:41 -0200 | [diff] [blame] | 185 | /* binary index write *************************************************/ |
| 186 | #include <arpa/inet.h> |
Lucas De Marchi | f6cf14c | 2011-12-27 19:56:33 -0200 | [diff] [blame] | 187 | #include "macro.h" |
Gustavo Sverzut Barbieri | 0de4046 | 2011-12-23 23:11:41 -0200 | [diff] [blame] | 188 | /* BEGIN: code from module-init-tools/index.c just modified to compile here. |
| 189 | * |
| 190 | * Original copyright: |
| 191 | * index.c: module index file shared functions for modprobe and depmod |
| 192 | * Copyright (C) 2008 Alan Jenkins <alan-jenkins@tuffmail.co.uk>. |
| 193 | * |
| 194 | * These programs are free software; you can redistribute it and/or modify |
| 195 | * it under the terms of the GNU General Public License as published by |
| 196 | * the Free Software Foundation; either version 2 of the License, or |
| 197 | * (at your option) any later version. |
| 198 | * |
| 199 | * This program is distributed in the hope that it will be useful, |
| 200 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 201 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 202 | * GNU General Public License for more details. |
| 203 | * |
| 204 | * You should have received a copy of the GNU General Public License |
| 205 | * along with these programs. If not, see <http://www.gnu.org/licenses/>. |
| 206 | */ |
| 207 | |
| 208 | /* Integers are stored as 32 bit unsigned in "network" order, i.e. MSB first. |
| 209 | All files start with a magic number. |
| 210 | |
| 211 | Magic spells "BOOTFAST". Second one used on newer versioned binary files. |
| 212 | */ |
| 213 | /* #define INDEX_MAGIC_OLD 0xB007FA57 */ |
| 214 | #define INDEX_MAGIC 0xB007F457 |
| 215 | |
| 216 | /* We use a version string to keep track of changes to the binary format |
| 217 | * This is stored in the form: INDEX_MAJOR (hi) INDEX_MINOR (lo) just in |
| 218 | * case we ever decide to have minor changes that are not incompatible. |
| 219 | */ |
| 220 | |
| 221 | #define INDEX_VERSION_MAJOR 0x0002 |
| 222 | #define INDEX_VERSION_MINOR 0x0001 |
| 223 | #define INDEX_VERSION ((INDEX_VERSION_MAJOR<<16)|INDEX_VERSION_MINOR) |
| 224 | |
| 225 | /* The index file maps keys to values. Both keys and values are ASCII strings. |
| 226 | Each key can have multiple values. Values are sorted by an integer priority. |
| 227 | |
| 228 | The reader also implements a wildcard search (including range expressions) |
| 229 | where the keys in the index are treated as patterns. |
| 230 | This feature is required for module aliases. |
| 231 | */ |
| 232 | |
| 233 | /* Implementation is based on a radix tree, or "trie". |
| 234 | Each arc from parent to child is labelled with a character. |
| 235 | Each path from the root represents a string. |
| 236 | |
| 237 | == Example strings == |
| 238 | |
| 239 | ask |
| 240 | ate |
| 241 | on |
| 242 | once |
| 243 | one |
| 244 | |
| 245 | == Key == |
| 246 | + Normal node |
| 247 | * Marked node, representing a key and it's values. |
| 248 | |
| 249 | + |
| 250 | |-a-+-s-+-k-* |
| 251 | | | |
| 252 | | `-t-+-e-* |
| 253 | | |
| 254 | `-o-+-n-*-c-+-e-* |
| 255 | | |
| 256 | `-e-* |
| 257 | |
| 258 | Naive implementations tend to be very space inefficient; child pointers |
| 259 | are stored in arrays indexed by character, but most child pointers are null. |
| 260 | |
| 261 | Our implementation uses a scheme described by Wikipedia as a Patrica trie, |
| 262 | |
| 263 | "easiest to understand as a space-optimized trie where |
| 264 | each node with only one child is merged with its child" |
| 265 | |
| 266 | + |
| 267 | |-a-+-sk-* |
| 268 | | | |
| 269 | | `-te-* |
| 270 | | |
| 271 | `-on-*-ce-* |
| 272 | | |
| 273 | `-e-* |
| 274 | |
| 275 | We still use arrays of child pointers indexed by a single character; |
| 276 | the remaining characters of the label are stored as a "prefix" in the child. |
| 277 | |
| 278 | The paper describing the original Patrica trie works on individiual bits - |
| 279 | each node has a maximum of two children, which increases space efficiency. |
| 280 | However for this application it is simpler to use the ASCII character set. |
| 281 | Since the index file is read-only, it can be compressed by omitting null |
| 282 | child pointers at the start and end of arrays. |
| 283 | */ |
| 284 | |
| 285 | #define INDEX_PRIORITY_MIN UINT32_MAX |
| 286 | |
| 287 | struct index_value { |
| 288 | struct index_value *next; |
| 289 | unsigned int priority; |
| 290 | char value[0]; |
| 291 | }; |
| 292 | |
| 293 | /* In-memory index (depmod only) */ |
| 294 | |
| 295 | #define INDEX_CHILDMAX 128 |
| 296 | struct index_node { |
| 297 | char *prefix; /* path compression */ |
| 298 | struct index_value *values; |
| 299 | unsigned char first; /* range of child nodes */ |
| 300 | unsigned char last; |
| 301 | struct index_node *children[INDEX_CHILDMAX]; /* indexed by character */ |
| 302 | }; |
| 303 | |
| 304 | /* Disk format: |
| 305 | |
| 306 | uint32_t magic = INDEX_MAGIC; |
| 307 | uint32_t version = INDEX_VERSION; |
| 308 | uint32_t root_offset; |
| 309 | |
| 310 | (node_offset & INDEX_NODE_MASK) specifies the file offset of nodes: |
| 311 | |
| 312 | char[] prefix; // nul terminated |
| 313 | |
| 314 | char first; |
| 315 | char last; |
| 316 | uint32_t children[last - first + 1]; |
| 317 | |
| 318 | uint32_t value_count; |
| 319 | struct { |
| 320 | uint32_t priority; |
| 321 | char[] value; // nul terminated |
| 322 | } values[value_count]; |
| 323 | |
| 324 | (node_offset & INDEX_NODE_FLAGS) indicates which fields are present. |
Lucas De Marchi | b8542a8 | 2012-01-16 23:03:33 -0200 | [diff] [blame] | 325 | Empty prefixes are omitted, leaf nodes omit the three child-related fields. |
Gustavo Sverzut Barbieri | 0de4046 | 2011-12-23 23:11:41 -0200 | [diff] [blame] | 326 | |
| 327 | This could be optimised further by adding a sparse child format |
| 328 | (indicated using a new flag). |
| 329 | */ |
| 330 | |
| 331 | /* Format of node offsets within index file */ |
| 332 | enum node_offset { |
| 333 | INDEX_NODE_FLAGS = 0xF0000000, /* Flags in high nibble */ |
| 334 | INDEX_NODE_PREFIX = 0x80000000, |
| 335 | INDEX_NODE_VALUES = 0x40000000, |
| 336 | INDEX_NODE_CHILDS = 0x20000000, |
| 337 | |
| 338 | INDEX_NODE_MASK = 0x0FFFFFFF, /* Offset value */ |
| 339 | }; |
| 340 | |
| 341 | static struct index_node *index_create(void) |
| 342 | { |
| 343 | struct index_node *node; |
| 344 | |
| 345 | node = NOFAIL(calloc(sizeof(struct index_node), 1)); |
| 346 | node->prefix = NOFAIL(strdup("")); |
| 347 | node->first = INDEX_CHILDMAX; |
| 348 | |
| 349 | return node; |
| 350 | } |
| 351 | |
| 352 | static void index_values_free(struct index_value *values) |
| 353 | { |
| 354 | while (values) { |
| 355 | struct index_value *value = values; |
| 356 | |
| 357 | values = value->next; |
| 358 | free(value); |
| 359 | } |
| 360 | } |
| 361 | |
| 362 | static void index_destroy(struct index_node *node) |
| 363 | { |
| 364 | int c; |
| 365 | |
| 366 | for (c = node->first; c <= node->last; c++) { |
| 367 | struct index_node *child = node->children[c]; |
| 368 | |
| 369 | if (child) |
| 370 | index_destroy(child); |
| 371 | } |
| 372 | index_values_free(node->values); |
| 373 | free(node->prefix); |
| 374 | free(node); |
| 375 | } |
| 376 | |
| 377 | static void index__checkstring(const char *str) |
| 378 | { |
| 379 | int i; |
| 380 | |
| 381 | for (i = 0; str[i]; i++) { |
| 382 | int ch = str[i]; |
| 383 | |
| 384 | if (ch >= INDEX_CHILDMAX) |
| 385 | CRIT("Module index: bad character '%c'=0x%x - only 7-bit ASCII is supported:" |
| 386 | "\n%s\n", (char) ch, (int) ch, str); |
| 387 | } |
| 388 | } |
| 389 | |
| 390 | static int index_add_value(struct index_value **values, |
| 391 | const char *value, unsigned int priority) |
| 392 | { |
| 393 | struct index_value *v; |
| 394 | int duplicate = 0; |
| 395 | int len; |
| 396 | |
| 397 | /* report the presence of duplicate values */ |
| 398 | for (v = *values; v; v = v->next) { |
| 399 | if (streq(v->value, value)) |
| 400 | duplicate = 1; |
| 401 | } |
| 402 | |
| 403 | /* find position to insert value */ |
| 404 | while (*values && (*values)->priority < priority) |
| 405 | values = &(*values)->next; |
| 406 | |
| 407 | len = strlen(value); |
| 408 | v = NOFAIL(calloc(sizeof(struct index_value) + len + 1, 1)); |
| 409 | v->next = *values; |
| 410 | v->priority = priority; |
| 411 | memcpy(v->value, value, len + 1); |
| 412 | *values = v; |
| 413 | |
| 414 | return duplicate; |
| 415 | } |
| 416 | |
| 417 | static int index_insert(struct index_node *node, const char *key, |
| 418 | const char *value, unsigned int priority) |
| 419 | { |
| 420 | int i = 0; /* index within str */ |
| 421 | int ch; |
| 422 | |
| 423 | index__checkstring(key); |
| 424 | index__checkstring(value); |
| 425 | |
| 426 | while(1) { |
| 427 | int j; /* index within node->prefix */ |
| 428 | |
| 429 | /* Ensure node->prefix is a prefix of &str[i]. |
| 430 | If it is not already, then we must split node. */ |
| 431 | for (j = 0; node->prefix[j]; j++) { |
| 432 | ch = node->prefix[j]; |
| 433 | |
| 434 | if (ch != key[i+j]) { |
| 435 | char *prefix = node->prefix; |
| 436 | struct index_node *n; |
| 437 | |
| 438 | /* New child is copy of node with prefix[j+1..N] */ |
| 439 | n = NOFAIL(calloc(sizeof(struct index_node), 1)); |
| 440 | memcpy(n, node, sizeof(struct index_node)); |
| 441 | n->prefix = NOFAIL(strdup(&prefix[j+1])); |
| 442 | |
| 443 | /* Parent has prefix[0..j], child at prefix[j] */ |
| 444 | memset(node, 0, sizeof(struct index_node)); |
| 445 | prefix[j] = '\0'; |
| 446 | node->prefix = prefix; |
| 447 | node->first = ch; |
| 448 | node->last = ch; |
| 449 | node->children[ch] = n; |
| 450 | |
| 451 | break; |
| 452 | } |
| 453 | } |
| 454 | /* j is now length of node->prefix */ |
| 455 | i += j; |
| 456 | |
| 457 | ch = key[i]; |
| 458 | if(ch == '\0') |
| 459 | return index_add_value(&node->values, value, priority); |
| 460 | |
| 461 | if (!node->children[ch]) { |
| 462 | struct index_node *child; |
| 463 | |
| 464 | if (ch < node->first) |
| 465 | node->first = ch; |
| 466 | if (ch > node->last) |
| 467 | node->last = ch; |
| 468 | node->children[ch] = NOFAIL(calloc(sizeof(struct index_node), 1)); |
| 469 | |
| 470 | child = node->children[ch]; |
| 471 | child->prefix = NOFAIL(strdup(&key[i+1])); |
| 472 | child->first = INDEX_CHILDMAX; |
| 473 | index_add_value(&child->values, value, priority); |
| 474 | |
| 475 | return 0; |
| 476 | } |
| 477 | |
| 478 | /* Descend into child node and continue */ |
| 479 | node = node->children[ch]; |
| 480 | i++; |
| 481 | } |
| 482 | } |
| 483 | |
| 484 | static int index__haschildren(const struct index_node *node) |
| 485 | { |
| 486 | return node->first < INDEX_CHILDMAX; |
| 487 | } |
| 488 | |
| 489 | /* Recursive post-order traversal |
| 490 | |
| 491 | Pre-order would make for better read-side buffering / readahead / caching. |
| 492 | (post-order means you go backwards in the file as you descend the tree). |
| 493 | However, index reading is already fast enough. |
| 494 | Pre-order is simpler for writing, and depmod is already slow. |
| 495 | */ |
| 496 | static uint32_t index_write__node(const struct index_node *node, FILE *out) |
| 497 | { |
| 498 | uint32_t *child_offs = NULL; |
| 499 | int child_count = 0; |
| 500 | long offset; |
| 501 | |
| 502 | if (!node) |
| 503 | return 0; |
| 504 | |
| 505 | /* Write children and save their offsets */ |
| 506 | if (index__haschildren(node)) { |
| 507 | const struct index_node *child; |
| 508 | int i; |
| 509 | |
| 510 | child_count = node->last - node->first + 1; |
| 511 | child_offs = NOFAIL(malloc(child_count * sizeof(uint32_t))); |
| 512 | |
| 513 | for (i = 0; i < child_count; i++) { |
| 514 | child = node->children[node->first + i]; |
| 515 | child_offs[i] = htonl(index_write__node(child, out)); |
| 516 | } |
| 517 | } |
| 518 | |
| 519 | /* Now write this node */ |
| 520 | offset = ftell(out); |
| 521 | |
| 522 | if (node->prefix[0]) { |
| 523 | fputs(node->prefix, out); |
| 524 | fputc('\0', out); |
| 525 | offset |= INDEX_NODE_PREFIX; |
| 526 | } |
| 527 | |
| 528 | if (child_count) { |
| 529 | fputc(node->first, out); |
| 530 | fputc(node->last, out); |
| 531 | fwrite(child_offs, sizeof(uint32_t), child_count, out); |
| 532 | free(child_offs); |
| 533 | offset |= INDEX_NODE_CHILDS; |
| 534 | } |
| 535 | |
| 536 | if (node->values) { |
| 537 | const struct index_value *v; |
| 538 | unsigned int value_count; |
| 539 | uint32_t u; |
| 540 | |
| 541 | value_count = 0; |
| 542 | for (v = node->values; v != NULL; v = v->next) |
| 543 | value_count++; |
| 544 | u = htonl(value_count); |
| 545 | fwrite(&u, sizeof(u), 1, out); |
| 546 | |
| 547 | for (v = node->values; v != NULL; v = v->next) { |
| 548 | u = htonl(v->priority); |
| 549 | fwrite(&u, sizeof(u), 1, out); |
| 550 | fputs(v->value, out); |
| 551 | fputc('\0', out); |
| 552 | } |
| 553 | offset |= INDEX_NODE_VALUES; |
| 554 | } |
| 555 | |
| 556 | return offset; |
| 557 | } |
| 558 | |
| 559 | static void index_write(const struct index_node *node, FILE *out) |
| 560 | { |
| 561 | long initial_offset, final_offset; |
| 562 | uint32_t u; |
| 563 | |
| 564 | u = htonl(INDEX_MAGIC); |
| 565 | fwrite(&u, sizeof(u), 1, out); |
| 566 | u = htonl(INDEX_VERSION); |
| 567 | fwrite(&u, sizeof(u), 1, out); |
| 568 | |
| 569 | /* Second word is reserved for the offset of the root node */ |
| 570 | initial_offset = ftell(out); |
| 571 | u = 0; |
| 572 | fwrite(&u, sizeof(uint32_t), 1, out); |
| 573 | |
| 574 | /* Dump trie */ |
| 575 | u = htonl(index_write__node(node, out)); |
| 576 | |
| 577 | /* Update first word */ |
| 578 | final_offset = ftell(out); |
| 579 | fseek(out, initial_offset, SEEK_SET); |
| 580 | fwrite(&u, sizeof(uint32_t), 1, out); |
| 581 | fseek(out, final_offset, SEEK_SET); |
| 582 | } |
| 583 | |
| 584 | /* END: code from module-init-tools/index.c just modified to compile here. |
| 585 | */ |
| 586 | |
Lucas De Marchi | 0c010fa | 2011-12-28 13:33:26 -0200 | [diff] [blame] | 587 | /* utils (variants of libkmod-utils.c) *********************************/ |
| 588 | static const char *underscores2(const char *input, char *output, size_t outputlen) |
Gustavo Sverzut Barbieri | 92df661 | 2011-12-23 23:16:20 -0200 | [diff] [blame] | 589 | { |
| 590 | size_t i; |
| 591 | |
| 592 | for (i = 0; input[i] != '\0' && i < outputlen - 1; i++) { |
| 593 | switch (input[i]) { |
| 594 | case '-': |
| 595 | output[i] = '_'; |
| 596 | break; |
| 597 | |
| 598 | case ']': |
| 599 | WRN("Unmatched bracket in %s\n", input); |
| 600 | return NULL; |
| 601 | |
| 602 | case '[': { |
| 603 | size_t off = strcspn(input + i, "]"); |
| 604 | if (input[i + off] == '\0') { |
| 605 | WRN("Unmatched bracket in %s\n", input); |
| 606 | return NULL; |
| 607 | } |
| 608 | memcpy(output + i, input + i, off + 1); |
| 609 | i += off; |
| 610 | break; |
| 611 | } |
| 612 | |
| 613 | default: |
| 614 | output[i] = input[i]; |
| 615 | } |
| 616 | } |
| 617 | output[i] = '\0'; |
| 618 | |
| 619 | return output; |
| 620 | } |
| 621 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 622 | /* configuration parsing **********************************************/ |
| 623 | struct cfg_override { |
| 624 | struct cfg_override *next; |
| 625 | size_t len; |
| 626 | char path[]; |
| 627 | }; |
| 628 | |
| 629 | struct cfg_search { |
| 630 | struct cfg_search *next; |
| 631 | uint8_t builtin; |
| 632 | size_t len; |
| 633 | char path[]; |
| 634 | }; |
| 635 | |
| 636 | struct cfg { |
| 637 | const char *kversion; |
| 638 | char dirname[PATH_MAX]; |
| 639 | size_t dirnamelen; |
| 640 | char sym_prefix; |
| 641 | uint8_t check_symvers; |
| 642 | uint8_t print_unknown; |
| 643 | uint8_t warn_dups; |
| 644 | struct cfg_override *overrides; |
| 645 | struct cfg_search *searches; |
| 646 | }; |
| 647 | |
| 648 | static int cfg_search_add(struct cfg *cfg, const char *path, uint8_t builtin) |
| 649 | { |
| 650 | struct cfg_search *s; |
| 651 | size_t len; |
| 652 | |
| 653 | if (builtin) |
| 654 | len = 0; |
| 655 | else |
| 656 | len = strlen(path) + 1; |
| 657 | |
| 658 | s = malloc(sizeof(struct cfg_search) + len); |
| 659 | if (s == NULL) { |
| 660 | ERR("search add: out of memory\n"); |
| 661 | return -ENOMEM; |
| 662 | } |
| 663 | s->builtin = builtin; |
| 664 | if (builtin) |
| 665 | s->len = 0; |
| 666 | else { |
Gustavo Sverzut Barbieri | 026c7b4 | 2012-01-03 16:03:06 -0200 | [diff] [blame] | 667 | s->len = len - 1; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 668 | memcpy(s->path, path, len); |
| 669 | } |
| 670 | |
| 671 | DBG("search add: %s, builtin=%hhu\n", path, builtin); |
| 672 | |
| 673 | s->next = cfg->searches; |
| 674 | cfg->searches = s; |
| 675 | return 0; |
| 676 | } |
| 677 | |
| 678 | static void cfg_search_free(struct cfg_search *s) |
| 679 | { |
| 680 | free(s); |
| 681 | } |
| 682 | |
| 683 | static int cfg_override_add(struct cfg *cfg, const char *modname, const char *subdir) |
| 684 | { |
| 685 | struct cfg_override *o; |
| 686 | size_t modnamelen = strlen(modname); |
| 687 | size_t subdirlen = strlen(subdir); |
| 688 | size_t i; |
| 689 | |
Gustavo Sverzut Barbieri | 026c7b4 | 2012-01-03 16:03:06 -0200 | [diff] [blame] | 690 | o = malloc(sizeof(struct cfg_override) + subdirlen + 1 |
| 691 | + modnamelen + 1); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 692 | if (o == NULL) { |
| 693 | ERR("override add: out of memory\n"); |
| 694 | return -ENOMEM; |
| 695 | } |
Gustavo Sverzut Barbieri | 026c7b4 | 2012-01-03 16:03:06 -0200 | [diff] [blame] | 696 | memcpy(o->path, subdir, subdirlen); |
| 697 | i = subdirlen; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 698 | o->path[i] = '/'; |
| 699 | i++; |
| 700 | |
| 701 | memcpy(o->path + i, modname, modnamelen); |
| 702 | i += modnamelen; |
| 703 | o->path[i] = '\0'; /* no extension, so we can match .ko/.ko.gz */ |
| 704 | |
| 705 | o->len = i; |
| 706 | |
| 707 | DBG("override add: %s\n", o->path); |
| 708 | |
| 709 | o->next = cfg->overrides; |
| 710 | cfg->overrides = o; |
| 711 | return 0; |
| 712 | } |
| 713 | |
| 714 | static void cfg_override_free(struct cfg_override *o) |
| 715 | { |
| 716 | free(o); |
| 717 | } |
| 718 | |
| 719 | static int cfg_kernel_matches(const struct cfg *cfg, const char *pattern) |
| 720 | { |
| 721 | regex_t re; |
| 722 | int status; |
| 723 | |
| 724 | /* old style */ |
| 725 | if (streq(pattern, "*")) |
| 726 | return 1; |
| 727 | |
| 728 | if (regcomp(&re, pattern, REG_EXTENDED|REG_NOSUB) != 0) |
| 729 | return 0; |
| 730 | |
| 731 | status = regexec(&re, cfg->kversion, 0, NULL, 0); |
| 732 | regfree(&re); |
| 733 | |
| 734 | return status == 0; |
| 735 | } |
| 736 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 737 | static int cfg_file_parse(struct cfg *cfg, const char *filename) |
| 738 | { |
| 739 | char *line; |
| 740 | FILE *fp; |
| 741 | unsigned int linenum = 0; |
| 742 | int err; |
| 743 | |
| 744 | fp = fopen(filename, "r"); |
| 745 | if (fp == NULL) { |
| 746 | err = -errno; |
Gustavo Sverzut Barbieri | b0bcadd | 2012-01-03 15:04:34 -0200 | [diff] [blame] | 747 | ERR("file parse %s: %m\n", filename); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 748 | return err; |
| 749 | } |
| 750 | |
| 751 | while ((line = getline_wrapped(fp, &linenum)) != NULL) { |
| 752 | char *cmd, *saveptr; |
| 753 | |
| 754 | if (line[0] == '\0' || line[0] == '#') |
| 755 | goto done_next; |
| 756 | |
| 757 | cmd = strtok_r(line, "\t ", &saveptr); |
| 758 | if (cmd == NULL) |
| 759 | goto done_next; |
| 760 | |
| 761 | if (streq(cmd, "search")) { |
| 762 | const char *sp; |
| 763 | while ((sp = strtok_r(NULL, "\t ", &saveptr)) != NULL) { |
| 764 | uint8_t builtin = streq(sp, CFG_BUILTIN_KEY); |
| 765 | cfg_search_add(cfg, sp, builtin); |
| 766 | } |
| 767 | } else if (streq(cmd, "override")) { |
| 768 | const char *modname = strtok_r(NULL, "\t ", &saveptr); |
| 769 | const char *version = strtok_r(NULL, "\t ", &saveptr); |
| 770 | const char *subdir = strtok_r(NULL, "\t ", &saveptr); |
| 771 | |
| 772 | if (modname == NULL || version == NULL || |
| 773 | subdir == NULL) |
| 774 | goto syntax_error; |
| 775 | |
| 776 | if (!cfg_kernel_matches(cfg, version)) { |
| 777 | INF("%s:%u: override kernel did not match %s\n", |
| 778 | filename, linenum, version); |
| 779 | goto done_next; |
| 780 | } |
| 781 | |
| 782 | cfg_override_add(cfg, modname, subdir); |
| 783 | } else if (streq(cmd, "include") |
| 784 | || streq(cmd, "make_map_files")) { |
| 785 | INF("%s:%u: command %s not implemented yet\n", |
| 786 | filename, linenum, cmd); |
| 787 | } else { |
| 788 | syntax_error: |
| 789 | ERR("%s:%u: ignoring bad line starting with '%s'\n", |
| 790 | filename, linenum, cmd); |
| 791 | } |
| 792 | |
| 793 | done_next: |
| 794 | free(line); |
| 795 | } |
| 796 | |
| 797 | fclose(fp); |
| 798 | |
| 799 | return 0; |
| 800 | } |
| 801 | |
| 802 | static int cfg_files_filter_out(DIR *d, const char *dir, const char *name) |
| 803 | { |
| 804 | size_t len = strlen(name); |
| 805 | struct stat st; |
| 806 | |
| 807 | if (name[0] == '.') |
| 808 | return 1; |
| 809 | |
| 810 | if (len < 6 || !streq(name + len - 5, ".conf")) { |
| 811 | INF("All cfg files need .conf: %s/%s\n", dir, name); |
| 812 | return 1; |
| 813 | } |
| 814 | |
| 815 | fstatat(dirfd(d), name, &st, 0); |
| 816 | if (S_ISDIR(st.st_mode)) { |
| 817 | ERR("Directories inside directories are not supported: %s/%s\n", |
| 818 | dir, name); |
| 819 | return 1; |
| 820 | } |
| 821 | |
| 822 | return 0; |
| 823 | } |
| 824 | |
| 825 | struct cfg_file { |
| 826 | size_t dirlen; |
| 827 | size_t namelen; |
| 828 | const char *name; |
| 829 | char path[]; |
| 830 | }; |
| 831 | |
| 832 | static void cfg_file_free(struct cfg_file *f) |
| 833 | { |
| 834 | free(f); |
| 835 | } |
| 836 | |
| 837 | static int cfg_files_insert_sorted(struct cfg_file ***p_files, size_t *p_n_files, |
| 838 | const char *dir, const char *name) |
| 839 | { |
| 840 | struct cfg_file **files, *f; |
| 841 | size_t i, n_files, namelen, dirlen; |
| 842 | void *tmp; |
| 843 | |
| 844 | dirlen = strlen(dir); |
| 845 | if (name != NULL) |
| 846 | namelen = strlen(name); |
| 847 | else { |
| 848 | name = basename(dir); |
| 849 | namelen = strlen(name); |
Gustavo Sverzut Barbieri | 8ea02fe | 2012-01-03 15:11:58 -0200 | [diff] [blame] | 850 | dirlen -= namelen + 1; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 851 | } |
| 852 | |
| 853 | n_files = *p_n_files; |
| 854 | files = *p_files; |
| 855 | for (i = 0; i < n_files; i++) { |
| 856 | int cmp = strcmp(name, files[i]->name); |
| 857 | if (cmp == 0) { |
| 858 | DBG("Ignoring duplicate config file: %.*s/%s\n", |
| 859 | (int)dirlen, dir, name); |
| 860 | return -EEXIST; |
| 861 | } else if (cmp < 0) |
| 862 | break; |
| 863 | } |
| 864 | |
| 865 | f = malloc(sizeof(struct cfg_file) + dirlen + namelen + 2); |
| 866 | if (f == NULL) { |
| 867 | ERR("files insert sorted: out of memory\n"); |
| 868 | return -ENOMEM; |
| 869 | } |
| 870 | |
| 871 | tmp = realloc(files, sizeof(struct cfg_file *) * (n_files + 1)); |
| 872 | if (tmp == NULL) { |
| 873 | ERR("files insert sorted: out of memory\n"); |
| 874 | free(f); |
| 875 | return -ENOMEM; |
| 876 | } |
| 877 | *p_files = files = tmp; |
| 878 | |
| 879 | if (i < n_files) { |
| 880 | memmove(files + i + 1, files + i, |
| 881 | sizeof(struct cfg_file *) * (n_files - i)); |
| 882 | } |
| 883 | files[i] = f; |
| 884 | |
| 885 | f->dirlen = dirlen; |
| 886 | f->namelen = namelen; |
| 887 | f->name = f->path + dirlen + 1; |
| 888 | memcpy(f->path, dir, dirlen); |
| 889 | f->path[dirlen] = '/'; |
| 890 | memcpy(f->path + dirlen + 1, name, namelen); |
| 891 | f->path[dirlen + 1 + namelen] = '\0'; |
| 892 | |
| 893 | *p_n_files = n_files + 1; |
| 894 | return 0; |
| 895 | } |
| 896 | |
| 897 | /* |
| 898 | * Insert configuration files ignoring duplicates |
| 899 | */ |
| 900 | static int cfg_files_list(struct cfg_file ***p_files, size_t *p_n_files, |
| 901 | const char *path) |
| 902 | { |
| 903 | DIR *d; |
| 904 | int err = 0; |
| 905 | struct stat st; |
| 906 | |
| 907 | if (stat(path, &st) != 0) { |
| 908 | err = -errno; |
| 909 | DBG("could not stat '%s': %m\n", path); |
| 910 | return err; |
| 911 | } |
| 912 | |
| 913 | if (S_ISREG(st.st_mode)) { |
| 914 | cfg_files_insert_sorted(p_files, p_n_files, path, NULL); |
| 915 | return 0; |
| 916 | } if (!S_ISDIR(st.st_mode)) { |
| 917 | ERR("unsupported file mode %s: %#x\n", path, st.st_mode); |
| 918 | return -EINVAL; |
| 919 | } |
| 920 | |
| 921 | d = opendir(path); |
| 922 | if (d == NULL) { |
| 923 | ERR("files list %s: %m\n", path); |
| 924 | return -EINVAL; |
| 925 | } |
| 926 | |
| 927 | for (;;) { |
| 928 | struct dirent ent, *entp; |
| 929 | |
| 930 | err = readdir_r(d, &ent, &entp); |
| 931 | if (err != 0) { |
| 932 | ERR("reading entry %s\n", strerror(-err)); |
| 933 | break; |
| 934 | } |
| 935 | if (entp == NULL) |
| 936 | break; |
| 937 | if (cfg_files_filter_out(d, path, entp->d_name)) |
| 938 | continue; |
| 939 | |
| 940 | cfg_files_insert_sorted(p_files, p_n_files, path, entp->d_name); |
| 941 | } |
| 942 | |
| 943 | closedir(d); |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 944 | DBG("parsed configuration files from %s\n", path); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 945 | return err; |
| 946 | } |
| 947 | |
| 948 | static int cfg_load(struct cfg *cfg, const char * const *cfg_paths) |
| 949 | { |
| 950 | size_t i, n_files = 0; |
| 951 | struct cfg_file **files = NULL; |
| 952 | |
| 953 | if (cfg_paths == NULL) |
| 954 | cfg_paths = default_cfg_paths; |
| 955 | |
| 956 | for (i = 0; cfg_paths[i] != NULL; i++) |
| 957 | cfg_files_list(&files, &n_files, cfg_paths[i]); |
| 958 | |
| 959 | for (i = 0; i < n_files; i++) { |
| 960 | struct cfg_file *f = files[i]; |
| 961 | cfg_file_parse(cfg, f->path); |
| 962 | cfg_file_free(f); |
| 963 | } |
| 964 | free(files); |
| 965 | |
| 966 | /* For backward compatibility add "updates" to the head of the search |
| 967 | * list here. But only if there was no "search" option specified. |
| 968 | */ |
| 969 | if (cfg->searches == NULL) |
| 970 | cfg_search_add(cfg, "updates", 0); |
| 971 | |
| 972 | return 0; |
| 973 | } |
| 974 | |
| 975 | static void cfg_free(struct cfg *cfg) |
| 976 | { |
| 977 | while (cfg->overrides) { |
| 978 | struct cfg_override *tmp = cfg->overrides; |
| 979 | cfg->overrides = cfg->overrides->next; |
| 980 | cfg_override_free(tmp); |
| 981 | } |
| 982 | |
| 983 | while (cfg->searches) { |
| 984 | struct cfg_search *tmp = cfg->searches; |
| 985 | cfg->searches = cfg->searches->next; |
| 986 | cfg_search_free(tmp); |
| 987 | } |
| 988 | } |
| 989 | |
| 990 | |
| 991 | /* depmod calculations ***********************************************/ |
| 992 | struct mod { |
| 993 | struct kmod_module *kmod; |
| 994 | const char *path; |
| 995 | const char *relpath; /* path relative to '$ROOT/lib/modules/$VER/' */ |
| 996 | struct array deps; /* struct symbol */ |
| 997 | size_t baselen; /* points to start of basename/filename */ |
| 998 | size_t modnamelen; |
| 999 | int sort_idx; /* sort index using modules.order */ |
| 1000 | int dep_sort_idx; /* topological sort index */ |
| 1001 | uint16_t idx; /* index in depmod->modules.array */ |
| 1002 | uint16_t users; /* how many modules depend on this one */ |
| 1003 | uint8_t dep_loop : 1; |
| 1004 | char modname[]; |
| 1005 | }; |
| 1006 | |
| 1007 | struct symbol { |
| 1008 | struct mod *owner; |
| 1009 | uint64_t crc; |
| 1010 | char name[]; |
| 1011 | }; |
| 1012 | |
| 1013 | struct depmod { |
| 1014 | const struct cfg *cfg; |
| 1015 | struct kmod_ctx *ctx; |
| 1016 | struct array modules; |
| 1017 | struct hash *modules_by_relpath; |
| 1018 | struct hash *modules_by_name; |
| 1019 | struct hash *symbols; |
| 1020 | unsigned int dep_loops; |
| 1021 | }; |
| 1022 | |
| 1023 | static void mod_free(struct mod *mod) |
| 1024 | { |
| 1025 | DBG("free %p kmod=%p, path=%s\n", mod, mod->kmod, mod->path); |
| 1026 | array_free_array(&mod->deps); |
| 1027 | kmod_module_unref(mod->kmod); |
| 1028 | free(mod); |
| 1029 | } |
| 1030 | |
| 1031 | static int mod_add_dependency(struct mod *mod, struct symbol *sym) |
| 1032 | { |
| 1033 | int err; |
| 1034 | |
| 1035 | DBG("%s depends on %s %s\n", mod->path, sym->name, |
| 1036 | sym->owner != NULL ? sym->owner->path : "(unknown)"); |
| 1037 | |
| 1038 | if (sym->owner == NULL) |
| 1039 | return 0; |
| 1040 | |
| 1041 | err = array_append_unique(&mod->deps, sym->owner); |
| 1042 | if (err == -EEXIST) |
| 1043 | return 0; |
| 1044 | if (err < 0) |
| 1045 | return err; |
| 1046 | |
| 1047 | sym->owner->users++; |
| 1048 | SHOW("%s needs \"%s\": %s\n", mod->path, sym->name, sym->owner->path); |
| 1049 | return 0; |
| 1050 | } |
| 1051 | |
| 1052 | static void symbol_free(struct symbol *sym) |
| 1053 | { |
| 1054 | DBG("free %p sym=%s, owner=%p %s\n", sym, sym->name, sym->owner, |
| 1055 | sym->owner != NULL ? sym->owner->path : ""); |
| 1056 | free(sym); |
| 1057 | } |
| 1058 | |
Lucas De Marchi | f6b838e | 2012-01-14 02:03:21 -0200 | [diff] [blame] | 1059 | static int depmod_init(struct depmod *depmod, struct cfg *cfg, |
| 1060 | struct kmod_ctx *ctx) |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1061 | { |
| 1062 | int err = 0; |
| 1063 | |
| 1064 | depmod->cfg = cfg; |
| 1065 | depmod->ctx = ctx; |
| 1066 | |
| 1067 | array_init(&depmod->modules, 128); |
| 1068 | |
| 1069 | depmod->modules_by_relpath = hash_new(512, NULL); |
| 1070 | if (depmod->modules_by_relpath == NULL) { |
| 1071 | err = -errno; |
| 1072 | goto modules_by_relpath_failed; |
| 1073 | } |
| 1074 | |
| 1075 | depmod->modules_by_name = hash_new(512, NULL); |
| 1076 | if (depmod->modules_by_name == NULL) { |
| 1077 | err = -errno; |
| 1078 | goto modules_by_name_failed; |
| 1079 | } |
| 1080 | |
| 1081 | depmod->symbols = hash_new(2048, (void (*)(void *))symbol_free); |
| 1082 | if (depmod->symbols == NULL) { |
| 1083 | err = -errno; |
| 1084 | goto symbols_failed; |
| 1085 | } |
| 1086 | |
| 1087 | return 0; |
| 1088 | |
| 1089 | symbols_failed: |
| 1090 | hash_free(depmod->modules_by_name); |
| 1091 | modules_by_name_failed: |
| 1092 | hash_free(depmod->modules_by_relpath); |
| 1093 | modules_by_relpath_failed: |
| 1094 | return err; |
| 1095 | } |
| 1096 | |
| 1097 | static void depmod_shutdown(struct depmod *depmod) |
| 1098 | { |
| 1099 | size_t i; |
| 1100 | |
| 1101 | hash_free(depmod->symbols); |
| 1102 | |
| 1103 | hash_free(depmod->modules_by_relpath); |
| 1104 | |
| 1105 | hash_free(depmod->modules_by_name); |
| 1106 | |
| 1107 | for (i = 0; i < depmod->modules.count; i++) |
| 1108 | mod_free(depmod->modules.array[i]); |
| 1109 | array_free_array(&depmod->modules); |
| 1110 | |
| 1111 | kmod_unref(depmod->ctx); |
| 1112 | } |
| 1113 | |
| 1114 | static int depmod_module_add(struct depmod *depmod, struct kmod_module *kmod) |
| 1115 | { |
| 1116 | const struct cfg *cfg = depmod->cfg; |
| 1117 | const char *modname; |
| 1118 | size_t modnamelen; |
| 1119 | struct mod *mod; |
| 1120 | int err; |
| 1121 | |
| 1122 | modname = kmod_module_get_name(kmod); |
| 1123 | modnamelen = strlen(modname) + 1; |
| 1124 | |
| 1125 | mod = calloc(1, sizeof(struct mod) + modnamelen); |
| 1126 | if (mod == NULL) |
| 1127 | return -ENOMEM; |
| 1128 | mod->kmod = kmod; |
| 1129 | mod->sort_idx = depmod->modules.count + 1; |
| 1130 | mod->dep_sort_idx = INT32_MAX; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1131 | memcpy(mod->modname, modname, modnamelen); |
| 1132 | mod->modnamelen = modnamelen; |
| 1133 | |
| 1134 | array_init(&mod->deps, 4); |
| 1135 | |
| 1136 | mod->path = kmod_module_get_path(kmod); |
Gustavo Sverzut Barbieri | 026c7b4 | 2012-01-03 16:03:06 -0200 | [diff] [blame] | 1137 | mod->baselen = strrchr(mod->path, '/') - mod->path; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1138 | if (strncmp(mod->path, cfg->dirname, cfg->dirnamelen) == 0 && |
| 1139 | mod->path[cfg->dirnamelen] == '/') |
| 1140 | mod->relpath = mod->path + cfg->dirnamelen + 1; |
| 1141 | else |
| 1142 | mod->relpath = NULL; |
| 1143 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1144 | err = hash_add_unique(depmod->modules_by_name, mod->modname, mod); |
| 1145 | if (err < 0) { |
| 1146 | ERR("hash_add_unique %s: %s\n", mod->modname, strerror(-err)); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1147 | free(mod); |
| 1148 | return err; |
| 1149 | } |
| 1150 | |
| 1151 | if (mod->relpath != NULL) { |
| 1152 | err = hash_add_unique(depmod->modules_by_relpath, |
| 1153 | mod->relpath, mod); |
| 1154 | if (err < 0) { |
| 1155 | ERR("hash_add_unique %s: %s\n", |
| 1156 | mod->relpath, strerror(-err)); |
| 1157 | hash_del(depmod->modules_by_name, mod->modname); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1158 | free(mod); |
| 1159 | return err; |
| 1160 | } |
| 1161 | } |
| 1162 | |
| 1163 | DBG("add %p kmod=%p, path=%s\n", mod, kmod, mod->path); |
| 1164 | |
| 1165 | return 0; |
| 1166 | } |
| 1167 | |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1168 | static int depmod_module_del(struct depmod *depmod, struct mod *mod) |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1169 | { |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1170 | DBG("del %p kmod=%p, path=%s\n", mod, mod->kmod, mod->path); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1171 | |
| 1172 | if (mod->relpath != NULL) |
| 1173 | hash_del(depmod->modules_by_relpath, mod->relpath); |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1174 | |
| 1175 | hash_del(depmod->modules_by_name, mod->modname); |
| 1176 | |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1177 | mod_free(mod); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1178 | return 0; |
| 1179 | } |
| 1180 | |
| 1181 | /* returns if existing module @mod is higher priority than newpath. |
| 1182 | * note this is the inverse of module-init-tools is_higher_priority() |
| 1183 | */ |
| 1184 | static int depmod_module_is_higher_priority(const struct depmod *depmod, const struct mod *mod, size_t baselen, size_t namelen, size_t modnamelen, const char *newpath) |
| 1185 | { |
| 1186 | const struct cfg *cfg = depmod->cfg; |
| 1187 | const struct cfg_override *ov; |
| 1188 | const struct cfg_search *se; |
| 1189 | size_t newlen = baselen + modnamelen; |
| 1190 | size_t oldlen = mod->baselen + mod->modnamelen; |
| 1191 | const char *oldpath = mod->path; |
| 1192 | int i, bprio = -1, oldprio = -1, newprio = -1; |
| 1193 | |
Gustavo Sverzut Barbieri | 026c7b4 | 2012-01-03 16:03:06 -0200 | [diff] [blame] | 1194 | assert(strncmp(newpath, cfg->dirname, cfg->dirnamelen) == 0); |
| 1195 | assert(strncmp(oldpath, cfg->dirname, cfg->dirnamelen) == 0); |
| 1196 | |
| 1197 | newpath += cfg->dirnamelen + 1; |
| 1198 | newlen -= cfg->dirnamelen + 1; |
| 1199 | oldpath += cfg->dirnamelen + 1; |
| 1200 | oldlen -= cfg->dirnamelen + 1; |
| 1201 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1202 | DBG("comparing priorities of %s and %s\n", |
| 1203 | oldpath, newpath); |
| 1204 | |
| 1205 | for (ov = cfg->overrides; ov != NULL; ov = ov->next) { |
| 1206 | DBG("override %s\n", ov->path); |
| 1207 | if (newlen == ov->len && memcmp(ov->path, newpath, newlen) == 0) |
| 1208 | return 0; |
| 1209 | if (oldlen == ov->len && memcmp(ov->path, oldpath, oldlen) == 0) |
| 1210 | return 1; |
| 1211 | } |
| 1212 | |
| 1213 | for (i = 0, se = cfg->searches; se != NULL; se = se->next, i++) { |
| 1214 | DBG("search %s\n", se->builtin ? "built-in" : se->path); |
| 1215 | if (se->builtin) |
| 1216 | bprio = i; |
| 1217 | else if (newlen >= se->len && |
| 1218 | memcmp(se->path, newpath, se->len) == 0) |
| 1219 | newprio = i; |
| 1220 | else if (oldlen >= se->len && |
| 1221 | memcmp(se->path, oldpath, se->len) == 0) |
| 1222 | oldprio = i; |
| 1223 | } |
| 1224 | |
| 1225 | if (newprio < 0) |
| 1226 | newprio = bprio; |
| 1227 | if (oldprio < 0) |
| 1228 | oldprio = bprio; |
| 1229 | |
| 1230 | DBG("priorities: built-in: %d, old: %d, new: %d\n", |
| 1231 | bprio, newprio, oldprio); |
| 1232 | |
| 1233 | return newprio <= oldprio; |
| 1234 | } |
| 1235 | |
| 1236 | static int depmod_modules_search_file(struct depmod *depmod, size_t baselen, size_t namelen, const char *path) |
| 1237 | { |
| 1238 | struct kmod_module *kmod; |
| 1239 | struct mod *mod; |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1240 | const char *relpath; |
Lucas De Marchi | 6daceb2 | 2012-01-08 01:02:29 -0200 | [diff] [blame] | 1241 | char modname[PATH_MAX]; |
Gustavo Sverzut Barbieri | a627c3f | 2011-12-26 13:19:07 -0200 | [diff] [blame] | 1242 | const struct kmod_ext *eitr; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1243 | size_t modnamelen; |
| 1244 | uint8_t matches = 0; |
Lucas De Marchi | 18a492e | 2012-04-26 11:39:54 -0300 | [diff] [blame] | 1245 | int err; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1246 | |
Gustavo Sverzut Barbieri | a627c3f | 2011-12-26 13:19:07 -0200 | [diff] [blame] | 1247 | for (eitr = kmod_exts; eitr->ext != NULL; eitr++) { |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1248 | if (namelen <= eitr->len) |
| 1249 | continue; |
| 1250 | if (streq(path + baselen + namelen - eitr->len, eitr->ext)) { |
| 1251 | matches = 1; |
| 1252 | break; |
| 1253 | } |
| 1254 | } |
| 1255 | if (!matches) |
| 1256 | return 0; |
| 1257 | |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1258 | if (path_to_modname(path, modname, &modnamelen) == NULL) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1259 | ERR("could not get modname from path %s\n", path); |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1260 | return -EINVAL; |
| 1261 | } |
| 1262 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1263 | relpath = path + depmod->cfg->dirnamelen + 1; |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1264 | DBG("try %s (%s)\n", relpath, modname); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1265 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1266 | mod = hash_find(depmod->modules_by_name, modname); |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1267 | if (mod == NULL) |
| 1268 | goto add; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1269 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1270 | if (depmod_module_is_higher_priority(depmod, mod, baselen, |
| 1271 | namelen, modnamelen, path)) { |
| 1272 | DBG("Ignored lower priority: %s, higher: %s\n", |
| 1273 | path, mod->path); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1274 | return 0; |
| 1275 | } |
| 1276 | |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1277 | DBG("Replace lower priority %s with new module %s\n", |
| 1278 | mod->relpath, relpath); |
| 1279 | err = depmod_module_del(depmod, mod); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1280 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1281 | ERR("could not del module %s: %s\n", mod->path, strerror(-err)); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1282 | return err; |
| 1283 | } |
| 1284 | |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1285 | add: |
| 1286 | err = kmod_module_new_from_path(depmod->ctx, path, &kmod); |
| 1287 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1288 | ERR("could not create module %s: %s\n", path, strerror(-err)); |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1289 | return err; |
| 1290 | } |
| 1291 | |
| 1292 | err = depmod_module_add(depmod, kmod); |
| 1293 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1294 | ERR("could not add module %s: %s\n", |
Gustavo Sverzut Barbieri | 3db5bf9 | 2012-01-03 16:14:57 -0200 | [diff] [blame] | 1295 | path, strerror(-err)); |
| 1296 | kmod_module_unref(kmod); |
| 1297 | return err; |
| 1298 | } |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1299 | return 0; |
| 1300 | } |
| 1301 | |
| 1302 | static int depmod_modules_search_dir(struct depmod *depmod, DIR *d, size_t baselen, char *path) |
| 1303 | { |
| 1304 | struct dirent *de; |
| 1305 | int err = 0, dfd = dirfd(d); |
| 1306 | |
| 1307 | while ((de = readdir(d)) != NULL) { |
| 1308 | const char *name = de->d_name; |
| 1309 | size_t namelen; |
| 1310 | uint8_t is_dir; |
| 1311 | |
| 1312 | if (name[0] == '.' && (name[1] == '\0' || |
| 1313 | (name[1] == '.' && name[2] == '\0'))) |
| 1314 | continue; |
| 1315 | if (streq(name, "build") || streq(name, "source")) |
| 1316 | continue; |
| 1317 | namelen = strlen(name); |
| 1318 | if (baselen + namelen + 2 >= PATH_MAX) { |
| 1319 | path[baselen] = '\0'; |
| 1320 | ERR("path is too long %s%s %zd\n", path, name); |
| 1321 | continue; |
| 1322 | } |
| 1323 | memcpy(path + baselen, name, namelen + 1); |
| 1324 | |
| 1325 | if (de->d_type == DT_REG) |
| 1326 | is_dir = 0; |
| 1327 | else if (de->d_type == DT_DIR) |
| 1328 | is_dir = 1; |
| 1329 | else { |
| 1330 | struct stat st; |
| 1331 | if (fstatat(dfd, name, &st, 0) < 0) { |
| 1332 | ERR("fstatat(%d, %s): %m\n", dfd, name); |
| 1333 | continue; |
| 1334 | } else if (S_ISREG(st.st_mode)) |
| 1335 | is_dir = 0; |
| 1336 | else if (S_ISDIR(st.st_mode)) |
| 1337 | is_dir = 1; |
| 1338 | else { |
| 1339 | ERR("unsupported file type %s: %o\n", |
| 1340 | path, st.st_mode & S_IFMT); |
| 1341 | continue; |
| 1342 | } |
| 1343 | } |
| 1344 | |
| 1345 | if (is_dir) { |
| 1346 | int fd; |
| 1347 | DIR *subdir; |
| 1348 | if (baselen + namelen + 2 + NAME_MAX >= PATH_MAX) { |
| 1349 | ERR("directory path is too long %s\n", path); |
| 1350 | continue; |
| 1351 | } |
| 1352 | fd = openat(dfd, name, O_RDONLY); |
| 1353 | if (fd < 0) { |
| 1354 | ERR("openat(%d, %s, O_RDONLY): %m\n", |
| 1355 | dfd, name); |
| 1356 | continue; |
| 1357 | } |
| 1358 | subdir = fdopendir(fd); |
| 1359 | if (subdir == NULL) { |
| 1360 | ERR("fdopendir(%d): %m\n", fd); |
| 1361 | close(fd); |
| 1362 | continue; |
| 1363 | } |
| 1364 | path[baselen + namelen] = '/'; |
| 1365 | path[baselen + namelen + 1] = '\0'; |
| 1366 | err = depmod_modules_search_dir(depmod, subdir, |
| 1367 | baselen + namelen + 1, |
| 1368 | path); |
| 1369 | closedir(subdir); |
| 1370 | } else { |
| 1371 | err = depmod_modules_search_file(depmod, baselen, |
| 1372 | namelen, path); |
| 1373 | } |
| 1374 | |
| 1375 | if (err < 0) { |
| 1376 | path[baselen + namelen] = '\0'; |
| 1377 | ERR("failed %s: %s\n", path, strerror(-err)); |
| 1378 | err = 0; /* ignore errors */ |
| 1379 | } |
| 1380 | } |
| 1381 | |
| 1382 | return err; |
| 1383 | } |
| 1384 | |
| 1385 | static int depmod_modules_search(struct depmod *depmod) |
| 1386 | { |
| 1387 | char path[PATH_MAX]; |
| 1388 | DIR *d = opendir(depmod->cfg->dirname); |
| 1389 | size_t baselen; |
| 1390 | int err; |
| 1391 | if (d == NULL) { |
| 1392 | err = -errno; |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1393 | ERR("could not open directory %s: %m\n", depmod->cfg->dirname); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1394 | return err; |
| 1395 | } |
| 1396 | |
| 1397 | baselen = depmod->cfg->dirnamelen; |
| 1398 | memcpy(path, depmod->cfg->dirname, baselen); |
| 1399 | path[baselen] = '/'; |
| 1400 | baselen++; |
| 1401 | path[baselen] = '\0'; |
| 1402 | |
| 1403 | err = depmod_modules_search_dir(depmod, d, baselen, path); |
| 1404 | closedir(d); |
Lucas De Marchi | 20c6e18 | 2012-04-26 11:40:26 -0300 | [diff] [blame] | 1405 | return err; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1406 | } |
| 1407 | |
| 1408 | static int mod_cmp(const void *pa, const void *pb) { |
| 1409 | const struct mod *a = *(const struct mod **)pa; |
| 1410 | const struct mod *b = *(const struct mod **)pb; |
| 1411 | if (a->dep_loop == b->dep_loop) |
| 1412 | return a->sort_idx - b->sort_idx; |
| 1413 | else if (a->dep_loop) |
| 1414 | return 1; |
| 1415 | else if (b->dep_loop) |
| 1416 | return -1; |
| 1417 | return a->sort_idx - b->sort_idx; |
| 1418 | } |
| 1419 | |
Jan Alexander Steffens (heftig) | 00bd319 | 2012-01-11 23:17:38 +0100 | [diff] [blame] | 1420 | static int depmod_modules_build_array(struct depmod *depmod) |
| 1421 | { |
| 1422 | struct hash_iter module_iter; |
Lucas De Marchi | 33557e8 | 2012-01-14 02:04:56 -0200 | [diff] [blame] | 1423 | const void *v; |
Jan Alexander Steffens (heftig) | 00bd319 | 2012-01-11 23:17:38 +0100 | [diff] [blame] | 1424 | int err; |
| 1425 | |
| 1426 | hash_iter_init(depmod->modules_by_name, &module_iter); |
Lucas De Marchi | 33557e8 | 2012-01-14 02:04:56 -0200 | [diff] [blame] | 1427 | while (hash_iter_next(&module_iter, NULL, &v)) { |
| 1428 | struct mod *mod = (struct mod *) v; |
| 1429 | mod->idx = depmod->modules.count; |
Jan Alexander Steffens (heftig) | 00bd319 | 2012-01-11 23:17:38 +0100 | [diff] [blame] | 1430 | err = array_append(&depmod->modules, mod); |
| 1431 | if (err < 0) |
| 1432 | return err; |
| 1433 | } |
| 1434 | |
| 1435 | return 0; |
| 1436 | } |
| 1437 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1438 | static void depmod_modules_sort(struct depmod *depmod) |
| 1439 | { |
| 1440 | char order_file[PATH_MAX], line[PATH_MAX]; |
| 1441 | FILE *fp; |
| 1442 | unsigned idx = 0, total = 0; |
| 1443 | |
| 1444 | snprintf(order_file, sizeof(order_file), "%s/modules.order", |
| 1445 | depmod->cfg->dirname); |
| 1446 | fp = fopen(order_file, "r"); |
| 1447 | if (fp == NULL) { |
Lucas De Marchi | 56406fd | 2012-01-04 20:53:10 -0200 | [diff] [blame] | 1448 | WRN("could not open %s: %m\n", order_file); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1449 | return; |
| 1450 | } |
| 1451 | |
| 1452 | while (fgets(line, sizeof(line), fp) != NULL) { |
| 1453 | size_t len = strlen(line); |
| 1454 | idx++; |
| 1455 | if (len == 0) |
| 1456 | continue; |
| 1457 | if (line[len - 1] != '\n') { |
| 1458 | ERR("%s:%u corrupted line misses '\\n'\n", |
| 1459 | order_file, idx); |
| 1460 | goto corrupted; |
| 1461 | } |
| 1462 | } |
| 1463 | total = idx + 1; |
| 1464 | idx = 0; |
| 1465 | fseek(fp, 0, SEEK_SET); |
| 1466 | while (fgets(line, sizeof(line), fp) != NULL) { |
| 1467 | size_t len = strlen(line); |
| 1468 | struct mod *mod; |
| 1469 | |
| 1470 | idx++; |
| 1471 | if (len == 0) |
| 1472 | continue; |
| 1473 | line[len - 1] = '\0'; |
| 1474 | |
| 1475 | mod = hash_find(depmod->modules_by_relpath, line); |
| 1476 | if (mod == NULL) |
| 1477 | continue; |
| 1478 | mod->sort_idx = idx - total; |
| 1479 | } |
| 1480 | |
| 1481 | array_sort(&depmod->modules, mod_cmp); |
| 1482 | for (idx = 0; idx < depmod->modules.count; idx++) { |
| 1483 | struct mod *m = depmod->modules.array[idx]; |
| 1484 | m->idx = idx; |
| 1485 | } |
| 1486 | |
| 1487 | corrupted: |
| 1488 | fclose(fp); |
| 1489 | } |
| 1490 | |
Lucas De Marchi | f6b838e | 2012-01-14 02:03:21 -0200 | [diff] [blame] | 1491 | static int depmod_symbol_add(struct depmod *depmod, const char *name, |
| 1492 | uint64_t crc, const struct mod *owner) |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1493 | { |
| 1494 | size_t namelen; |
| 1495 | int err; |
| 1496 | struct symbol *sym; |
| 1497 | |
| 1498 | if (name[0] == depmod->cfg->sym_prefix) |
| 1499 | name++; |
| 1500 | |
| 1501 | namelen = strlen(name) + 1; |
| 1502 | sym = malloc(sizeof(struct symbol) + namelen); |
| 1503 | if (sym == NULL) |
| 1504 | return -ENOMEM; |
| 1505 | |
| 1506 | sym->owner = (struct mod *)owner; |
| 1507 | sym->crc = crc; |
| 1508 | memcpy(sym->name, name, namelen); |
| 1509 | |
| 1510 | err = hash_add(depmod->symbols, sym->name, sym); |
| 1511 | if (err < 0) { |
| 1512 | free(sym); |
| 1513 | return err; |
| 1514 | } |
| 1515 | |
| 1516 | DBG("add %p sym=%s, owner=%p %s\n", sym, sym->name, owner, |
| 1517 | owner != NULL ? owner->path : ""); |
| 1518 | |
| 1519 | return 0; |
| 1520 | } |
| 1521 | |
Lucas De Marchi | f6b838e | 2012-01-14 02:03:21 -0200 | [diff] [blame] | 1522 | static struct symbol *depmod_symbol_find(const struct depmod *depmod, |
| 1523 | const char *name) |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1524 | { |
| 1525 | if (name[0] == '.') /* PPC64 needs this: .foo == foo */ |
| 1526 | name++; |
| 1527 | if (name[0] == depmod->cfg->sym_prefix) |
| 1528 | name++; |
| 1529 | return hash_find(depmod->symbols, name); |
| 1530 | } |
| 1531 | |
| 1532 | static int depmod_load_symbols(struct depmod *depmod) |
| 1533 | { |
| 1534 | const struct mod **itr, **itr_end; |
| 1535 | |
| 1536 | DBG("load symbols (%zd modules)\n", depmod->modules.count); |
| 1537 | |
| 1538 | itr = (const struct mod **)depmod->modules.array; |
| 1539 | itr_end = itr + depmod->modules.count; |
| 1540 | for (; itr < itr_end; itr++) { |
| 1541 | const struct mod *mod = *itr; |
| 1542 | struct kmod_list *l, *list = NULL; |
| 1543 | int err = kmod_module_get_symbols(mod->kmod, &list); |
| 1544 | if (err < 0) { |
| 1545 | DBG("ignoring %s: no symbols: %s\n", |
| 1546 | mod->path, strerror(-err)); |
| 1547 | continue; |
| 1548 | } |
| 1549 | kmod_list_foreach(l, list) { |
| 1550 | const char *name = kmod_module_symbol_get_symbol(l); |
| 1551 | uint64_t crc = kmod_module_symbol_get_crc(l); |
| 1552 | depmod_symbol_add(depmod, name, crc, mod); |
| 1553 | } |
| 1554 | kmod_module_symbols_free_list(list); |
| 1555 | } |
| 1556 | |
| 1557 | DBG("loaded symbols (%zd modules, %zd symbols)\n", |
| 1558 | depmod->modules.count, hash_get_count(depmod->symbols)); |
| 1559 | |
| 1560 | return 0; |
| 1561 | } |
| 1562 | |
| 1563 | static int depmod_load_module_dependencies(struct depmod *depmod, struct mod *mod) |
| 1564 | { |
| 1565 | const struct cfg *cfg = depmod->cfg; |
| 1566 | struct kmod_list *l, *list = NULL; |
| 1567 | int err = kmod_module_get_dependency_symbols(mod->kmod, &list); |
| 1568 | if (err < 0) { |
| 1569 | DBG("ignoring %s: no dependency symbols: %s\n", |
| 1570 | mod->path, strerror(-err)); |
| 1571 | return 0; |
| 1572 | } |
| 1573 | |
| 1574 | DBG("do dependencies of %s\n", mod->path); |
| 1575 | kmod_list_foreach(l, list) { |
| 1576 | const char *name = kmod_module_dependency_symbol_get_symbol(l); |
| 1577 | uint64_t crc = kmod_module_dependency_symbol_get_crc(l); |
Gustavo Sverzut Barbieri | 0de4046 | 2011-12-23 23:11:41 -0200 | [diff] [blame] | 1578 | int bindtype = kmod_module_dependency_symbol_get_bind(l); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1579 | struct symbol *sym = depmod_symbol_find(depmod, name); |
Gustavo Sverzut Barbieri | 0de4046 | 2011-12-23 23:11:41 -0200 | [diff] [blame] | 1580 | uint8_t is_weak = bindtype == KMOD_SYMBOL_WEAK; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1581 | |
| 1582 | if (sym == NULL) { |
| 1583 | DBG("%s needs (%c) unknown symbol %s\n", |
Gustavo Sverzut Barbieri | 0de4046 | 2011-12-23 23:11:41 -0200 | [diff] [blame] | 1584 | mod->path, bindtype, name); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 1585 | if (cfg->print_unknown && !is_weak) |
| 1586 | WRN("%s needs unknown symbol %s\n", |
| 1587 | mod->path, name); |
| 1588 | continue; |
| 1589 | } |
| 1590 | |
| 1591 | if (cfg->check_symvers && sym->crc != crc && !is_weak) { |
| 1592 | DBG("symbol %s (%#"PRIx64") module %s (%#"PRIx64")\n", |
| 1593 | sym->name, sym->crc, mod->path, crc); |
| 1594 | if (cfg->print_unknown) |
| 1595 | WRN("%s disagrees about version of symbol %s\n", |
| 1596 | mod->path, name); |
| 1597 | } |
| 1598 | |
| 1599 | mod_add_dependency(mod, sym); |
| 1600 | } |
| 1601 | kmod_module_dependency_symbols_free_list(list); |
| 1602 | return 0; |
| 1603 | } |
| 1604 | |
| 1605 | static int depmod_load_dependencies(struct depmod *depmod) |
| 1606 | { |
| 1607 | struct mod **itr, **itr_end; |
| 1608 | |
| 1609 | DBG("load dependencies (%zd modules, %zd symbols)\n", |
| 1610 | depmod->modules.count, hash_get_count(depmod->symbols)); |
| 1611 | |
| 1612 | itr = (struct mod **)depmod->modules.array; |
| 1613 | itr_end = itr + depmod->modules.count; |
| 1614 | for (; itr < itr_end; itr++) { |
| 1615 | struct mod *mod = *itr; |
| 1616 | depmod_load_module_dependencies(depmod, mod); |
| 1617 | } |
| 1618 | |
| 1619 | DBG("loaded dependencies (%zd modules, %zd symbols)\n", |
| 1620 | depmod->modules.count, hash_get_count(depmod->symbols)); |
| 1621 | |
| 1622 | return 0; |
| 1623 | } |
| 1624 | |
| 1625 | static int dep_cmp(const void *pa, const void *pb) |
| 1626 | { |
| 1627 | const struct mod *a = *(const struct mod **)pa; |
| 1628 | const struct mod *b = *(const struct mod **)pb; |
| 1629 | if (a->dep_loop == b->dep_loop) |
| 1630 | return a->dep_sort_idx - b->dep_sort_idx; |
| 1631 | else if (a->dep_loop) |
| 1632 | return 1; |
| 1633 | else if (b->dep_loop) |
| 1634 | return -1; |
| 1635 | return a->dep_sort_idx - b->dep_sort_idx; |
| 1636 | } |
| 1637 | |
| 1638 | static void depmod_sort_dependencies(struct depmod *depmod) |
| 1639 | { |
| 1640 | struct mod **itr, **itr_end; |
| 1641 | itr = (struct mod **)depmod->modules.array; |
| 1642 | itr_end = itr + depmod->modules.count; |
| 1643 | for (; itr < itr_end; itr++) { |
| 1644 | struct mod *m = *itr; |
| 1645 | if (m->deps.count > 1) |
| 1646 | array_sort(&m->deps, dep_cmp); |
| 1647 | } |
| 1648 | } |
| 1649 | |
| 1650 | static int depmod_calculate_dependencies(struct depmod *depmod) |
| 1651 | { |
| 1652 | const struct mod **itrm; |
| 1653 | uint16_t *users, *roots, *sorted; |
| 1654 | uint16_t i, n_roots = 0, n_sorted = 0, n_mods = depmod->modules.count; |
| 1655 | |
| 1656 | users = malloc(sizeof(uint16_t) * n_mods * 3); |
| 1657 | if (users == NULL) |
| 1658 | return -ENOMEM; |
| 1659 | roots = users + n_mods; |
| 1660 | sorted = roots + n_mods; |
| 1661 | |
| 1662 | DBG("calculate dependencies and ordering (%zd modules)\n", n_mods); |
| 1663 | |
| 1664 | assert(depmod->modules.count < UINT16_MAX); |
| 1665 | |
| 1666 | /* populate modules users (how many modules uses it) */ |
| 1667 | itrm = (const struct mod **)depmod->modules.array; |
| 1668 | for (i = 0; i < n_mods; i++, itrm++) { |
| 1669 | const struct mod *m = *itrm; |
| 1670 | users[i] = m->users; |
| 1671 | if (users[i] == 0) { |
| 1672 | roots[n_roots] = i; |
| 1673 | n_roots++; |
| 1674 | } |
| 1675 | } |
| 1676 | |
| 1677 | /* topological sort (outputs modules without users first) */ |
| 1678 | while (n_roots > 0) { |
| 1679 | const struct mod **itr_dst, **itr_dst_end; |
| 1680 | struct mod *src; |
| 1681 | uint16_t src_idx = roots[--n_roots]; |
| 1682 | |
| 1683 | src = depmod->modules.array[src_idx]; |
| 1684 | src->dep_sort_idx = n_sorted; |
| 1685 | sorted[n_sorted] = src_idx; |
| 1686 | n_sorted++; |
| 1687 | |
| 1688 | itr_dst = (const struct mod **)src->deps.array; |
| 1689 | itr_dst_end = itr_dst + src->deps.count; |
| 1690 | for (; itr_dst < itr_dst_end; itr_dst++) { |
| 1691 | const struct mod *dst = *itr_dst; |
| 1692 | uint16_t dst_idx = dst->idx; |
| 1693 | assert(users[dst_idx] > 0); |
| 1694 | users[dst_idx]--; |
| 1695 | if (users[dst_idx] == 0) { |
| 1696 | roots[n_roots] = dst_idx; |
| 1697 | n_roots++; |
| 1698 | } |
| 1699 | } |
| 1700 | } |
| 1701 | |
| 1702 | if (n_sorted < n_mods) { |
| 1703 | WRN("found %hu modules in dependency cycles!\n", |
| 1704 | n_mods - n_sorted); |
| 1705 | for (i = 0; i < n_mods; i++) { |
| 1706 | struct mod *m; |
| 1707 | if (users[i] == 0) |
| 1708 | continue; |
| 1709 | m = depmod->modules.array[i]; |
| 1710 | WRN("%s in dependency cycle!\n", m->path); |
| 1711 | m->dep_loop = 1; |
| 1712 | m->dep_sort_idx = INT32_MAX; |
| 1713 | depmod->dep_loops++; |
| 1714 | } |
| 1715 | } |
| 1716 | |
| 1717 | depmod_sort_dependencies(depmod); |
| 1718 | |
| 1719 | DBG("calculated dependencies and ordering (%u loops, %zd modules)\n", |
| 1720 | depmod->dep_loops, n_mods); |
| 1721 | |
| 1722 | free(users); |
| 1723 | return 0; |
| 1724 | } |
| 1725 | |
| 1726 | static int depmod_load(struct depmod *depmod) |
| 1727 | { |
| 1728 | int err; |
| 1729 | |
| 1730 | err = depmod_load_symbols(depmod); |
| 1731 | if (err < 0) |
| 1732 | return err; |
| 1733 | |
| 1734 | err = depmod_load_dependencies(depmod); |
| 1735 | if (err < 0) |
| 1736 | return err; |
| 1737 | |
| 1738 | err = depmod_calculate_dependencies(depmod); |
| 1739 | if (err < 0) |
| 1740 | return err; |
| 1741 | |
| 1742 | return 0; |
| 1743 | } |
| 1744 | |
Gustavo Sverzut Barbieri | 8e3505c | 2011-12-23 20:53:16 -0200 | [diff] [blame] | 1745 | static size_t mod_count_all_dependencies(const struct mod *mod) |
| 1746 | { |
| 1747 | size_t i, count = 0; |
| 1748 | for (i = 0; i < mod->deps.count; i++) { |
| 1749 | const struct mod *d = mod->deps.array[i]; |
| 1750 | count += 1 + mod_count_all_dependencies(d); |
| 1751 | } |
| 1752 | return count; |
| 1753 | } |
| 1754 | |
| 1755 | static int mod_fill_all_unique_dependencies(const struct mod *mod, const struct mod **deps, size_t n_deps, size_t *last) |
| 1756 | { |
| 1757 | size_t i; |
| 1758 | int err = 0; |
| 1759 | for (i = 0; i < mod->deps.count; i++) { |
| 1760 | const struct mod *d = mod->deps.array[i]; |
| 1761 | size_t j; |
| 1762 | uint8_t exists = 0; |
| 1763 | |
| 1764 | for (j = 0; j < *last; j++) { |
| 1765 | if (deps[j] == d) { |
| 1766 | exists = 1; |
| 1767 | break; |
| 1768 | } |
| 1769 | } |
| 1770 | |
| 1771 | if (exists) |
| 1772 | continue; |
| 1773 | |
| 1774 | if (*last >= n_deps) |
| 1775 | return -ENOSPC; |
| 1776 | deps[*last] = d; |
| 1777 | (*last)++; |
| 1778 | err = mod_fill_all_unique_dependencies(d, deps, n_deps, last); |
| 1779 | if (err < 0) |
| 1780 | break; |
| 1781 | } |
| 1782 | return err; |
| 1783 | } |
| 1784 | |
| 1785 | static const struct mod **mod_get_all_sorted_dependencies(const struct mod *mod, size_t *n_deps) |
| 1786 | { |
| 1787 | const struct mod **deps; |
| 1788 | size_t last = 0; |
| 1789 | |
| 1790 | *n_deps = mod_count_all_dependencies(mod); |
| 1791 | if (*n_deps == 0) |
| 1792 | return NULL; |
| 1793 | |
| 1794 | deps = malloc(sizeof(struct mod *) * (*n_deps)); |
| 1795 | if (deps == NULL) |
| 1796 | return NULL; |
| 1797 | |
| 1798 | if (mod_fill_all_unique_dependencies(mod, deps, *n_deps, &last) < 0) { |
| 1799 | free(deps); |
| 1800 | return NULL; |
| 1801 | } |
| 1802 | |
| 1803 | qsort(deps, last, sizeof(struct mod *), dep_cmp); |
| 1804 | *n_deps = last; |
| 1805 | return deps; |
| 1806 | } |
| 1807 | |
| 1808 | static inline const char *mod_get_compressed_path(const struct mod *mod) |
| 1809 | { |
| 1810 | if (mod->relpath != NULL) |
| 1811 | return mod->relpath; |
| 1812 | return mod->path; |
| 1813 | } |
| 1814 | |
| 1815 | static int output_deps(struct depmod *depmod, FILE *out) |
| 1816 | { |
| 1817 | size_t i; |
| 1818 | |
| 1819 | for (i = 0; i < depmod->modules.count; i++) { |
| 1820 | const struct mod **deps, *mod = depmod->modules.array[i]; |
| 1821 | const char *p = mod_get_compressed_path(mod); |
| 1822 | size_t j, n_deps; |
| 1823 | |
| 1824 | if (mod->dep_loop) { |
| 1825 | DBG("Ignored %s due dependency loops\n", p); |
| 1826 | continue; |
| 1827 | } |
| 1828 | |
| 1829 | fprintf(out, "%s:", p); |
| 1830 | |
| 1831 | if (mod->deps.count == 0) |
| 1832 | goto end; |
| 1833 | |
| 1834 | deps = mod_get_all_sorted_dependencies(mod, &n_deps); |
| 1835 | if (deps == NULL) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1836 | ERR("could not get all sorted dependencies of %s\n", p); |
Gustavo Sverzut Barbieri | 8e3505c | 2011-12-23 20:53:16 -0200 | [diff] [blame] | 1837 | goto end; |
| 1838 | } |
| 1839 | |
| 1840 | for (j = 0; j < n_deps; j++) { |
| 1841 | const struct mod *d = deps[j]; |
| 1842 | if (d->dep_loop) { |
| 1843 | DBG("Ignored %s (dependency of %s) " |
| 1844 | "due dependency loops\n", |
| 1845 | mod_get_compressed_path(d), p); |
| 1846 | continue; |
| 1847 | } |
| 1848 | fprintf(out, " %s", mod_get_compressed_path(d)); |
| 1849 | } |
| 1850 | free(deps); |
| 1851 | end: |
| 1852 | putc('\n', out); |
| 1853 | } |
| 1854 | |
| 1855 | return 0; |
| 1856 | } |
| 1857 | |
Gustavo Sverzut Barbieri | 7436788 | 2011-12-23 23:21:48 -0200 | [diff] [blame] | 1858 | static int output_deps_bin(struct depmod *depmod, FILE *out) |
| 1859 | { |
| 1860 | struct index_node *idx; |
| 1861 | size_t i; |
| 1862 | |
| 1863 | if (out == stdout) |
| 1864 | return 0; |
| 1865 | |
| 1866 | idx = index_create(); |
| 1867 | if (idx == NULL) |
| 1868 | return -ENOMEM; |
| 1869 | |
| 1870 | for (i = 0; i < depmod->modules.count; i++) { |
| 1871 | const struct mod **deps, *mod = depmod->modules.array[i]; |
| 1872 | const char *p = mod_get_compressed_path(mod); |
| 1873 | char *line; |
| 1874 | size_t j, n_deps, linepos, linelen, slen; |
| 1875 | int duplicate; |
| 1876 | |
| 1877 | if (mod->dep_loop) { |
| 1878 | DBG("Ignored %s due dependency loops\n", p); |
| 1879 | continue; |
| 1880 | } |
| 1881 | |
| 1882 | deps = mod_get_all_sorted_dependencies(mod, &n_deps); |
| 1883 | if (deps == NULL && n_deps > 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 1884 | ERR("could not get all sorted dependencies of %s\n", p); |
Gustavo Sverzut Barbieri | 7436788 | 2011-12-23 23:21:48 -0200 | [diff] [blame] | 1885 | continue; |
| 1886 | } |
| 1887 | |
| 1888 | linelen = strlen(p) + 1; |
| 1889 | for (j = 0; j < n_deps; j++) { |
| 1890 | const struct mod *d = deps[j]; |
| 1891 | if (d->dep_loop) { |
| 1892 | DBG("Ignored %s (dependency of %s) " |
| 1893 | "due dependency loops\n", |
| 1894 | mod_get_compressed_path(d), p); |
| 1895 | continue; |
| 1896 | } |
| 1897 | linelen += 1 + strlen(mod_get_compressed_path(d)); |
| 1898 | } |
| 1899 | |
| 1900 | line = malloc(linelen + 1); |
| 1901 | if (line == NULL) { |
| 1902 | free(deps); |
| 1903 | ERR("modules.deps.bin: out of memory\n"); |
| 1904 | continue; |
| 1905 | } |
| 1906 | |
| 1907 | linepos = 0; |
| 1908 | slen = strlen(p); |
| 1909 | memcpy(line + linepos, p, slen); |
| 1910 | linepos += slen; |
| 1911 | line[linepos] = ':'; |
| 1912 | linepos++; |
| 1913 | |
| 1914 | for (j = 0; j < n_deps; j++) { |
| 1915 | const struct mod *d = deps[j]; |
| 1916 | const char *dp; |
| 1917 | if (d->dep_loop) |
| 1918 | continue; |
| 1919 | line[linepos] = ' '; |
| 1920 | linepos++; |
| 1921 | |
| 1922 | dp = mod_get_compressed_path(d); |
| 1923 | slen = strlen(dp); |
| 1924 | memcpy(line + linepos, dp, slen); |
| 1925 | linepos += slen; |
| 1926 | } |
| 1927 | line[linepos] = '\0'; |
| 1928 | |
| 1929 | duplicate = index_insert(idx, mod->modname, line, mod->idx); |
| 1930 | if (duplicate && depmod->cfg->warn_dups) |
| 1931 | WRN("duplicate module deps:\n%s\n", line); |
| 1932 | free(line); |
Lucas De Marchi | ea1b8c3 | 2011-12-27 14:18:32 -0200 | [diff] [blame] | 1933 | free(deps); |
Gustavo Sverzut Barbieri | 7436788 | 2011-12-23 23:21:48 -0200 | [diff] [blame] | 1934 | } |
| 1935 | |
| 1936 | index_write(idx, out); |
| 1937 | index_destroy(idx); |
| 1938 | |
| 1939 | return 0; |
| 1940 | } |
| 1941 | |
Gustavo Sverzut Barbieri | 0d13174 | 2011-12-23 01:43:01 -0200 | [diff] [blame] | 1942 | static int output_aliases(struct depmod *depmod, FILE *out) |
| 1943 | { |
| 1944 | size_t i; |
| 1945 | |
| 1946 | fputs("# Aliases extracted from modules themselves.\n", out); |
| 1947 | |
| 1948 | for (i = 0; i < depmod->modules.count; i++) { |
| 1949 | const struct mod *mod = depmod->modules.array[i]; |
| 1950 | struct kmod_list *l, *list = NULL; |
| 1951 | int r = kmod_module_get_info(mod->kmod, &list); |
| 1952 | if (r < 0 || list == NULL) |
| 1953 | continue; |
| 1954 | kmod_list_foreach(l, list) { |
| 1955 | const char *key = kmod_module_info_get_key(l); |
| 1956 | const char *value = kmod_module_info_get_value(l); |
| 1957 | |
| 1958 | if (!streq(key, "alias")) |
| 1959 | continue; |
| 1960 | |
| 1961 | fprintf(out, "alias %s %s\n", |
| 1962 | value, kmod_module_get_name(mod->kmod)); |
| 1963 | } |
| 1964 | kmod_module_info_free_list(list); |
| 1965 | } |
| 1966 | |
| 1967 | return 0; |
| 1968 | } |
| 1969 | |
Gustavo Sverzut Barbieri | ec77abb | 2011-12-23 23:21:09 -0200 | [diff] [blame] | 1970 | static int output_aliases_bin(struct depmod *depmod, FILE *out) |
| 1971 | { |
| 1972 | char buf[1024]; |
| 1973 | struct index_node *idx; |
| 1974 | size_t i; |
| 1975 | |
| 1976 | if (out == stdout) |
| 1977 | return 0; |
| 1978 | |
| 1979 | idx = index_create(); |
| 1980 | if (idx == NULL) |
| 1981 | return -ENOMEM; |
| 1982 | |
| 1983 | for (i = 0; i < depmod->modules.count; i++) { |
| 1984 | const struct mod *mod = depmod->modules.array[i]; |
| 1985 | struct kmod_list *l, *list = NULL; |
| 1986 | int r = kmod_module_get_info(mod->kmod, &list); |
| 1987 | if (r < 0 || list == NULL) |
| 1988 | continue; |
| 1989 | kmod_list_foreach(l, list) { |
| 1990 | const char *key = kmod_module_info_get_key(l); |
| 1991 | const char *value = kmod_module_info_get_value(l); |
| 1992 | const char *modname, *alias; |
| 1993 | int duplicate; |
| 1994 | |
| 1995 | if (!streq(key, "alias")) |
| 1996 | continue; |
| 1997 | |
Lucas De Marchi | 0c010fa | 2011-12-28 13:33:26 -0200 | [diff] [blame] | 1998 | alias = underscores2(value, buf, sizeof(buf)); |
Gustavo Sverzut Barbieri | ec77abb | 2011-12-23 23:21:09 -0200 | [diff] [blame] | 1999 | if (alias == NULL) |
| 2000 | continue; |
| 2001 | |
| 2002 | modname = kmod_module_get_name(mod->kmod); |
| 2003 | duplicate = index_insert(idx, alias, modname, |
| 2004 | mod->idx); |
| 2005 | if (duplicate && depmod->cfg->warn_dups) |
| 2006 | WRN("duplicate module alias:\n%s %s\n", |
| 2007 | alias, modname); |
| 2008 | } |
| 2009 | kmod_module_info_free_list(list); |
| 2010 | } |
| 2011 | |
| 2012 | index_write(idx, out); |
| 2013 | index_destroy(idx); |
| 2014 | |
| 2015 | return 0; |
| 2016 | } |
| 2017 | |
Gustavo Sverzut Barbieri | 8bc830e | 2011-12-23 01:37:07 -0200 | [diff] [blame] | 2018 | static int output_softdeps(struct depmod *depmod, FILE *out) |
| 2019 | { |
| 2020 | size_t i; |
| 2021 | |
| 2022 | fputs("# Soft dependencies extracted from modules themselves.\n", out); |
| 2023 | fputs("# Copy, with a .conf extension, to /etc/modprobe.d to use " |
| 2024 | "it with modprobe.\n", out); |
| 2025 | |
| 2026 | for (i = 0; i < depmod->modules.count; i++) { |
| 2027 | const struct mod *mod = depmod->modules.array[i]; |
| 2028 | struct kmod_list *l, *list = NULL; |
| 2029 | int r = kmod_module_get_info(mod->kmod, &list); |
| 2030 | if (r < 0 || list == NULL) |
| 2031 | continue; |
| 2032 | kmod_list_foreach(l, list) { |
| 2033 | const char *key = kmod_module_info_get_key(l); |
| 2034 | const char *value = kmod_module_info_get_value(l); |
| 2035 | |
| 2036 | if (!streq(key, "softdep")) |
| 2037 | continue; |
| 2038 | |
| 2039 | fprintf(out, "softdep %s %s\n", |
| 2040 | kmod_module_get_name(mod->kmod), value); |
| 2041 | } |
| 2042 | kmod_module_info_free_list(list); |
| 2043 | } |
| 2044 | |
| 2045 | return 0; |
| 2046 | } |
| 2047 | |
Gustavo Sverzut Barbieri | 9a14d0e | 2011-12-23 01:27:28 -0200 | [diff] [blame] | 2048 | static int output_symbols(struct depmod *depmod, FILE *out) |
| 2049 | { |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2050 | struct hash_iter iter; |
Rolf Eike Beer | 55021be | 2012-01-06 13:33:11 +0100 | [diff] [blame] | 2051 | const void *v; |
Gustavo Sverzut Barbieri | 9a14d0e | 2011-12-23 01:27:28 -0200 | [diff] [blame] | 2052 | |
| 2053 | fputs("# Aliases for symbols, used by symbol_request().\n", out); |
| 2054 | |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2055 | hash_iter_init(depmod->symbols, &iter); |
| 2056 | |
Rolf Eike Beer | 55021be | 2012-01-06 13:33:11 +0100 | [diff] [blame] | 2057 | while (hash_iter_next(&iter, NULL, &v)) { |
| 2058 | const struct symbol *sym = v; |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2059 | if (sym->owner == NULL) |
| 2060 | continue; |
| 2061 | |
| 2062 | fprintf(out, "alias symbol:%s %s\n", |
| 2063 | sym->name, sym->owner->modname); |
Gustavo Sverzut Barbieri | 9a14d0e | 2011-12-23 01:27:28 -0200 | [diff] [blame] | 2064 | } |
| 2065 | |
| 2066 | return 0; |
| 2067 | } |
| 2068 | |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2069 | static int output_symbols_bin(struct depmod *depmod, FILE *out) |
| 2070 | { |
| 2071 | struct index_node *idx; |
| 2072 | char alias[1024]; |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2073 | size_t baselen = sizeof("symbol:") - 1; |
| 2074 | struct hash_iter iter; |
Rolf Eike Beer | 55021be | 2012-01-06 13:33:11 +0100 | [diff] [blame] | 2075 | const void *v; |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2076 | |
| 2077 | if (out == stdout) |
| 2078 | return 0; |
| 2079 | |
| 2080 | idx = index_create(); |
| 2081 | if (idx == NULL) |
| 2082 | return -ENOMEM; |
| 2083 | |
| 2084 | memcpy(alias, "symbol:", baselen); |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2085 | hash_iter_init(depmod->symbols, &iter); |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2086 | |
Rolf Eike Beer | 55021be | 2012-01-06 13:33:11 +0100 | [diff] [blame] | 2087 | while (hash_iter_next(&iter, NULL, &v)) { |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2088 | int duplicate; |
Rolf Eike Beer | 55021be | 2012-01-06 13:33:11 +0100 | [diff] [blame] | 2089 | const struct symbol *sym = v; |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2090 | |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2091 | if (sym->owner == NULL) |
| 2092 | continue; |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2093 | |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2094 | strcpy(alias + baselen, sym->name); |
| 2095 | duplicate = index_insert(idx, alias, sym->owner->modname, |
| 2096 | sym->owner->idx); |
| 2097 | |
| 2098 | if (duplicate && depmod->cfg->warn_dups) |
| 2099 | WRN("duplicate module syms:\n%s %s\n", |
| 2100 | alias, sym->owner->modname); |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2101 | } |
| 2102 | |
| 2103 | index_write(idx, out); |
| 2104 | index_destroy(idx); |
Lucas De Marchi | 5cd1306 | 2011-12-27 13:27:42 -0200 | [diff] [blame] | 2105 | |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2106 | return 0; |
| 2107 | } |
| 2108 | |
Gustavo Sverzut Barbieri | 4b144e5 | 2011-12-23 23:19:22 -0200 | [diff] [blame] | 2109 | static int output_builtin_bin(struct depmod *depmod, FILE *out) |
| 2110 | { |
| 2111 | FILE *in; |
| 2112 | struct index_node *idx; |
Lucas De Marchi | 6daceb2 | 2012-01-08 01:02:29 -0200 | [diff] [blame] | 2113 | char infile[PATH_MAX], line[PATH_MAX], modname[PATH_MAX]; |
Gustavo Sverzut Barbieri | 4b144e5 | 2011-12-23 23:19:22 -0200 | [diff] [blame] | 2114 | |
| 2115 | if (out == stdout) |
| 2116 | return 0; |
| 2117 | |
| 2118 | snprintf(infile, sizeof(infile), "%s/modules.builtin", |
| 2119 | depmod->cfg->dirname); |
| 2120 | in = fopen(infile, "r"); |
| 2121 | if (in == NULL) { |
| 2122 | int err = -errno; |
Lucas De Marchi | 56406fd | 2012-01-04 20:53:10 -0200 | [diff] [blame] | 2123 | WRN("could not open %s: %m\n", infile); |
Gustavo Sverzut Barbieri | 4b144e5 | 2011-12-23 23:19:22 -0200 | [diff] [blame] | 2124 | return err; |
| 2125 | } |
| 2126 | |
| 2127 | idx = index_create(); |
| 2128 | if (idx == NULL) { |
| 2129 | fclose(in); |
| 2130 | return -ENOMEM; |
| 2131 | } |
| 2132 | |
| 2133 | while (fgets(line, sizeof(line), in) != NULL) { |
| 2134 | if (!isalpha(line[0])) { |
| 2135 | ERR("Invalid modules.builtin line: %s\n", line); |
| 2136 | continue; |
| 2137 | } |
| 2138 | |
| 2139 | path_to_modname(line, modname, NULL); |
| 2140 | index_insert(idx, modname, "", 0); |
| 2141 | } |
| 2142 | |
| 2143 | index_write(idx, out); |
| 2144 | index_destroy(idx); |
| 2145 | fclose(in); |
| 2146 | |
| 2147 | return 0; |
| 2148 | } |
| 2149 | |
Gustavo Sverzut Barbieri | 25c4151 | 2011-12-23 00:55:33 -0200 | [diff] [blame] | 2150 | static int output_devname(struct depmod *depmod, FILE *out) |
| 2151 | { |
| 2152 | size_t i; |
| 2153 | |
| 2154 | fputs("# Device nodes to trigger on-demand module loading.\n", out); |
| 2155 | |
| 2156 | for (i = 0; i < depmod->modules.count; i++) { |
| 2157 | const struct mod *mod = depmod->modules.array[i]; |
| 2158 | struct kmod_list *l, *list = NULL; |
| 2159 | const char *devname = NULL; |
| 2160 | char type = '\0'; |
| 2161 | unsigned int major = 0, minor = 0; |
| 2162 | int r; |
| 2163 | |
| 2164 | r = kmod_module_get_info(mod->kmod, &list); |
| 2165 | if (r < 0 || list == NULL) |
| 2166 | continue; |
| 2167 | |
| 2168 | kmod_list_foreach(l, list) { |
| 2169 | const char *key = kmod_module_info_get_key(l); |
| 2170 | const char *value = kmod_module_info_get_value(l); |
| 2171 | unsigned int maj, min; |
| 2172 | |
| 2173 | if (!streq(key, "alias")) |
| 2174 | continue; |
| 2175 | |
| 2176 | if (strstartswith(value, "devname:")) |
| 2177 | devname = value + sizeof("devname:") - 1; |
| 2178 | else if (sscanf(value, "char-major-%u-%u", |
| 2179 | &maj, &min) == 2) { |
| 2180 | type = 'c'; |
| 2181 | major = maj; |
| 2182 | minor = min; |
| 2183 | } else if (sscanf(value, "block-major-%u-%u", |
| 2184 | &maj, &min) == 2) { |
| 2185 | type = 'b'; |
| 2186 | major = maj; |
| 2187 | minor = min; |
| 2188 | } |
| 2189 | |
| 2190 | if (type != '\0' && devname != NULL) { |
| 2191 | fprintf(out, "%s %s %c%u:%u\n", |
| 2192 | kmod_module_get_name(mod->kmod), |
| 2193 | devname, type, major, minor); |
| 2194 | break; |
| 2195 | } |
| 2196 | } |
| 2197 | kmod_module_info_free_list(list); |
| 2198 | } |
| 2199 | |
| 2200 | return 0; |
| 2201 | } |
| 2202 | |
| 2203 | static int depmod_output(struct depmod *depmod, FILE *out) |
| 2204 | { |
| 2205 | static const struct depfile { |
| 2206 | const char *name; |
| 2207 | int (*cb)(struct depmod *depmod, FILE *out); |
| 2208 | } *itr, depfiles[] = { |
Gustavo Sverzut Barbieri | 8e3505c | 2011-12-23 20:53:16 -0200 | [diff] [blame] | 2209 | {"modules.dep", output_deps}, |
Gustavo Sverzut Barbieri | 7436788 | 2011-12-23 23:21:48 -0200 | [diff] [blame] | 2210 | {"modules.dep.bin", output_deps_bin}, |
Gustavo Sverzut Barbieri | 0d13174 | 2011-12-23 01:43:01 -0200 | [diff] [blame] | 2211 | {"modules.alias", output_aliases}, |
Gustavo Sverzut Barbieri | ec77abb | 2011-12-23 23:21:09 -0200 | [diff] [blame] | 2212 | {"modules.alias.bin", output_aliases_bin}, |
Gustavo Sverzut Barbieri | 8bc830e | 2011-12-23 01:37:07 -0200 | [diff] [blame] | 2213 | {"modules.softdep", output_softdeps}, |
Gustavo Sverzut Barbieri | 9a14d0e | 2011-12-23 01:27:28 -0200 | [diff] [blame] | 2214 | {"modules.symbols", output_symbols}, |
Gustavo Sverzut Barbieri | 75a9723 | 2011-12-23 23:20:44 -0200 | [diff] [blame] | 2215 | {"modules.symbols.bin", output_symbols_bin}, |
Gustavo Sverzut Barbieri | 4b144e5 | 2011-12-23 23:19:22 -0200 | [diff] [blame] | 2216 | {"modules.builtin.bin", output_builtin_bin}, |
Gustavo Sverzut Barbieri | 25c4151 | 2011-12-23 00:55:33 -0200 | [diff] [blame] | 2217 | {"modules.devname", output_devname}, |
| 2218 | {NULL, NULL} |
| 2219 | }; |
| 2220 | const char *dname = depmod->cfg->dirname; |
| 2221 | int dfd, err = 0; |
| 2222 | |
| 2223 | if (out != NULL) |
| 2224 | dfd = -1; |
| 2225 | else { |
| 2226 | dfd = open(dname, O_RDONLY); |
| 2227 | if (dfd < 0) { |
| 2228 | err = -errno; |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2229 | CRIT("could not open directory %s: %m\n", dname); |
Gustavo Sverzut Barbieri | 25c4151 | 2011-12-23 00:55:33 -0200 | [diff] [blame] | 2230 | return err; |
| 2231 | } |
| 2232 | } |
| 2233 | |
| 2234 | for (itr = depfiles; itr->name != NULL; itr++) { |
| 2235 | FILE *fp = out; |
| 2236 | char tmp[NAME_MAX] = ""; |
| 2237 | int r; |
| 2238 | |
| 2239 | if (fp == NULL) { |
| 2240 | int flags = O_CREAT | O_TRUNC | O_WRONLY; |
| 2241 | int mode = 0644; |
| 2242 | int fd; |
| 2243 | |
| 2244 | snprintf(tmp, sizeof(tmp), "%s.tmp", itr->name); |
| 2245 | fd = openat(dfd, tmp, flags, mode); |
| 2246 | if (fd < 0) { |
| 2247 | ERR("openat(%s, %s, %o, %o): %m\n", |
| 2248 | dname, tmp, flags, mode); |
| 2249 | continue; |
| 2250 | } |
| 2251 | fp = fdopen(fd, "wb"); |
| 2252 | if (fp == NULL) { |
| 2253 | ERR("fdopen(%d=%s/%s): %m\n", fd, dname, tmp); |
| 2254 | close(fd); |
| 2255 | continue; |
| 2256 | } |
| 2257 | } |
| 2258 | |
| 2259 | r = itr->cb(depmod, fp); |
| 2260 | if (fp == out) |
| 2261 | continue; |
| 2262 | |
| 2263 | fclose(fp); |
| 2264 | if (r < 0) { |
| 2265 | if (unlinkat(dfd, tmp, 0) != 0) |
| 2266 | ERR("unlinkat(%s, %s): %m\n", dname, tmp); |
| 2267 | } else { |
| 2268 | unlinkat(dfd, itr->name, 0); |
| 2269 | if (renameat(dfd, tmp, dfd, itr->name) != 0) { |
| 2270 | err = -errno; |
| 2271 | CRIT("renameat(%s, %s, %s, %s): %m\n", |
| 2272 | dname, tmp, dname, itr->name); |
| 2273 | break; |
| 2274 | } |
| 2275 | } |
| 2276 | } |
| 2277 | |
| 2278 | if (dfd >= 0) |
| 2279 | close(dfd); |
| 2280 | return err; |
| 2281 | } |
| 2282 | |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2283 | static void depmod_add_fake_syms(struct depmod *depmod) |
| 2284 | { |
| 2285 | /* __this_module is magic inserted by kernel loader. */ |
| 2286 | depmod_symbol_add(depmod, "__this_module", 0, NULL); |
| 2287 | /* On S390, this is faked up too */ |
| 2288 | depmod_symbol_add(depmod, "_GLOBAL_OFFSET_TABLE_", 0, NULL); |
| 2289 | } |
| 2290 | |
| 2291 | static int depmod_load_symvers(struct depmod *depmod, const char *filename) |
| 2292 | { |
| 2293 | char line[10240]; |
| 2294 | FILE *fp; |
| 2295 | unsigned int linenum = 0; |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2296 | |
| 2297 | fp = fopen(filename, "r"); |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2298 | if (fp == NULL) { |
| 2299 | int err = -errno; |
| 2300 | DBG("load symvers: %s: %m\n", filename); |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2301 | return err; |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2302 | } |
| 2303 | DBG("load symvers: %s\n", filename); |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2304 | |
| 2305 | /* eg. "0xb352177e\tfind_first_bit\tvmlinux\tEXPORT_SYMBOL" */ |
| 2306 | while (fgets(line, sizeof(line), fp) != NULL) { |
| 2307 | const char *ver, *sym, *where; |
| 2308 | char *verend; |
| 2309 | uint64_t crc; |
| 2310 | |
| 2311 | linenum++; |
| 2312 | |
| 2313 | ver = strtok(line, " \t"); |
| 2314 | sym = strtok(NULL, " \t"); |
| 2315 | where = strtok(NULL, " \t"); |
| 2316 | if (!ver || !sym || !where) |
| 2317 | continue; |
| 2318 | |
| 2319 | if (!streq(where, "vmlinux")) |
| 2320 | continue; |
| 2321 | |
| 2322 | crc = strtoull(ver, &verend, 16); |
| 2323 | if (verend[0] != '\0') { |
| 2324 | ERR("%s:%u Invalid symbol version %s: %m\n", |
| 2325 | filename, linenum, ver); |
| 2326 | continue; |
| 2327 | } |
| 2328 | |
| 2329 | depmod_symbol_add(depmod, sym, crc, NULL); |
| 2330 | } |
| 2331 | depmod_add_fake_syms(depmod); |
| 2332 | |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2333 | DBG("loaded symvers: %s\n", filename); |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2334 | |
| 2335 | fclose(fp); |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2336 | return 0; |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2337 | } |
| 2338 | |
| 2339 | static int depmod_load_system_map(struct depmod *depmod, const char *filename) |
| 2340 | { |
| 2341 | const char ksymstr[] = "__ksymtab_"; |
| 2342 | const size_t ksymstr_len = sizeof(ksymstr) - 1; |
| 2343 | char line[10240]; |
| 2344 | FILE *fp; |
| 2345 | unsigned int linenum = 0; |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2346 | |
| 2347 | fp = fopen(filename, "r"); |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2348 | if (fp == NULL) { |
| 2349 | int err = -errno; |
| 2350 | DBG("load System.map: %s: %m\n", filename); |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2351 | return err; |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2352 | } |
| 2353 | DBG("load System.map: %s\n", filename); |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2354 | |
| 2355 | /* eg. c0294200 R __ksymtab_devfs_alloc_devnum */ |
| 2356 | while (fgets(line, sizeof(line), fp) != NULL) { |
| 2357 | char *p, *end; |
| 2358 | |
| 2359 | linenum++; |
| 2360 | |
| 2361 | p = strchr(line, ' '); |
| 2362 | if (p == NULL) |
| 2363 | goto invalid_syntax; |
| 2364 | p++; |
| 2365 | p = strchr(p, ' '); |
| 2366 | if (p == NULL) |
| 2367 | goto invalid_syntax; |
| 2368 | p++; |
| 2369 | |
| 2370 | /* Covers gpl-only and normal symbols. */ |
| 2371 | if (strncmp(p, ksymstr, ksymstr_len) != 0) |
| 2372 | continue; |
| 2373 | |
| 2374 | end = strchr(p, '\n'); |
| 2375 | if (end != NULL) |
| 2376 | *end = '\0'; |
| 2377 | |
| 2378 | depmod_symbol_add(depmod, p + ksymstr_len, 0, NULL); |
| 2379 | continue; |
| 2380 | |
| 2381 | invalid_syntax: |
| 2382 | ERR("%s:%u: invalid line: %s\n", filename, linenum, line); |
| 2383 | } |
| 2384 | depmod_add_fake_syms(depmod); |
| 2385 | |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2386 | DBG("loaded System.map: %s\n", filename); |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2387 | |
| 2388 | fclose(fp); |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2389 | return 0; |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2390 | } |
Gustavo Sverzut Barbieri | 25c4151 | 2011-12-23 00:55:33 -0200 | [diff] [blame] | 2391 | |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2392 | |
| 2393 | static int depfile_up_to_date_dir(DIR *d, time_t mtime, size_t baselen, char *path) |
| 2394 | { |
| 2395 | struct dirent *de; |
| 2396 | int err = 1, dfd = dirfd(d); |
| 2397 | |
| 2398 | while ((de = readdir(d)) != NULL) { |
| 2399 | const char *name = de->d_name; |
| 2400 | size_t namelen; |
| 2401 | struct stat st; |
| 2402 | |
| 2403 | if (name[0] == '.' && (name[1] == '\0' || |
| 2404 | (name[1] == '.' && name[2] == '\0'))) |
| 2405 | continue; |
| 2406 | if (streq(name, "build") || streq(name, "source")) |
| 2407 | continue; |
| 2408 | namelen = strlen(name); |
| 2409 | if (baselen + namelen + 2 >= PATH_MAX) { |
| 2410 | path[baselen] = '\0'; |
| 2411 | ERR("path is too long %s%s %zd\n", path, name); |
| 2412 | continue; |
| 2413 | } |
| 2414 | |
| 2415 | if (fstatat(dfd, name, &st, 0) < 0) { |
| 2416 | ERR("fstatat(%d, %s): %m\n", dfd, name); |
| 2417 | continue; |
| 2418 | } |
| 2419 | |
| 2420 | if (S_ISDIR(st.st_mode)) { |
| 2421 | int fd; |
| 2422 | DIR *subdir; |
| 2423 | memcpy(path + baselen, name, namelen + 1); |
| 2424 | if (baselen + namelen + 2 + NAME_MAX >= PATH_MAX) { |
| 2425 | ERR("directory path is too long %s\n", path); |
| 2426 | continue; |
| 2427 | } |
| 2428 | fd = openat(dfd, name, O_RDONLY); |
| 2429 | if (fd < 0) { |
| 2430 | ERR("openat(%d, %s, O_RDONLY): %m\n", |
| 2431 | dfd, name); |
| 2432 | continue; |
| 2433 | } |
| 2434 | subdir = fdopendir(fd); |
| 2435 | if (subdir == NULL) { |
| 2436 | ERR("fdopendir(%d): %m\n", fd); |
| 2437 | close(fd); |
| 2438 | continue; |
| 2439 | } |
| 2440 | path[baselen + namelen] = '/'; |
| 2441 | path[baselen + namelen + 1] = '\0'; |
| 2442 | err = depfile_up_to_date_dir(subdir, mtime, |
| 2443 | baselen + namelen + 1, |
| 2444 | path); |
| 2445 | closedir(subdir); |
| 2446 | } else if (S_ISREG(st.st_mode)) { |
Gustavo Sverzut Barbieri | a627c3f | 2011-12-26 13:19:07 -0200 | [diff] [blame] | 2447 | const struct kmod_ext *eitr; |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2448 | uint8_t matches = 0; |
Gustavo Sverzut Barbieri | a627c3f | 2011-12-26 13:19:07 -0200 | [diff] [blame] | 2449 | for (eitr = kmod_exts; eitr->ext != NULL; eitr++) { |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2450 | if (namelen <= eitr->len) |
| 2451 | continue; |
| 2452 | if (streq(name + namelen - eitr->len, eitr->ext)) { |
| 2453 | matches = 1; |
| 2454 | break; |
| 2455 | } |
| 2456 | } |
| 2457 | if (!matches) |
| 2458 | continue; |
| 2459 | memcpy(path + baselen, name, namelen + 1); |
| 2460 | err = st.st_mtime <= mtime; |
| 2461 | if (err == 0) { |
| 2462 | DBG("%s %"PRIu64" is newer than %"PRIu64"\n", |
| 2463 | path, (uint64_t)st.st_mtime, |
| 2464 | (uint64_t)mtime); |
| 2465 | } |
| 2466 | } else { |
| 2467 | ERR("unsupported file type %s: %o\n", |
| 2468 | path, st.st_mode & S_IFMT); |
| 2469 | continue; |
| 2470 | } |
| 2471 | |
| 2472 | if (err == 0) |
| 2473 | break; /* outdated! */ |
| 2474 | else if (err < 0) { |
| 2475 | path[baselen + namelen] = '\0'; |
| 2476 | ERR("failed %s: %s\n", path, strerror(-err)); |
| 2477 | err = 1; /* ignore errors */ |
| 2478 | } |
| 2479 | } |
| 2480 | |
| 2481 | return err; |
| 2482 | } |
| 2483 | |
| 2484 | /* uptodate: 1, outdated: 0, errors < 0 */ |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2485 | static int depfile_up_to_date(const char *dirname) |
| 2486 | { |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2487 | char path[PATH_MAX]; |
| 2488 | DIR *d = opendir(dirname); |
| 2489 | struct stat st; |
| 2490 | size_t baselen; |
| 2491 | int err; |
| 2492 | if (d == NULL) { |
| 2493 | err = -errno; |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2494 | ERR("could not open directory %s: %m\n", dirname); |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2495 | return err; |
| 2496 | } |
| 2497 | |
| 2498 | if (fstatat(dirfd(d), "modules.dep", &st, 0) != 0) { |
| 2499 | err = -errno; |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2500 | ERR("could not fstatat(%s, modules.dep): %m\n", dirname); |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2501 | closedir(d); |
| 2502 | return err; |
| 2503 | } |
| 2504 | |
| 2505 | baselen = strlen(dirname); |
| 2506 | memcpy(path, dirname, baselen); |
| 2507 | path[baselen] = '/'; |
| 2508 | baselen++; |
| 2509 | path[baselen] = '\0'; |
| 2510 | |
| 2511 | err = depfile_up_to_date_dir(d, st.st_mtime, baselen, path); |
| 2512 | closedir(d); |
| 2513 | return err; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2514 | } |
| 2515 | |
| 2516 | static int is_version_number(const char *version) |
| 2517 | { |
| 2518 | unsigned int d1, d2; |
| 2519 | return (sscanf(version, "%u.%u", &d1, &d2) == 2); |
| 2520 | } |
| 2521 | |
Lucas De Marchi | f6cf14c | 2011-12-27 19:56:33 -0200 | [diff] [blame] | 2522 | static int do_depmod(int argc, char *argv[]) |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2523 | { |
| 2524 | FILE *out = NULL; |
Lucas De Marchi | 31f1d0d | 2012-01-14 02:04:31 -0200 | [diff] [blame] | 2525 | int err = 0, all = 0, maybe_all = 0, n_config_paths = 0; |
Lucas De Marchi | e15a56a | 2012-01-14 02:46:58 -0200 | [diff] [blame] | 2526 | char *root = NULL; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2527 | const char **config_paths = NULL; |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2528 | const char *system_map = NULL; |
| 2529 | const char *module_symvers = NULL; |
| 2530 | const char *null_kmod_config = NULL; |
| 2531 | struct utsname un; |
| 2532 | struct kmod_ctx *ctx = NULL; |
| 2533 | struct cfg cfg; |
| 2534 | struct depmod depmod; |
| 2535 | |
| 2536 | memset(&cfg, 0, sizeof(cfg)); |
| 2537 | memset(&depmod, 0, sizeof(depmod)); |
| 2538 | |
| 2539 | for (;;) { |
| 2540 | int c, idx = 0; |
| 2541 | c = getopt_long(argc, argv, cmdopts_s, cmdopts, &idx); |
| 2542 | if (c == -1) |
| 2543 | break; |
| 2544 | switch (c) { |
| 2545 | case 'a': |
| 2546 | all = 1; |
| 2547 | break; |
| 2548 | case 'A': |
| 2549 | maybe_all = 1; |
| 2550 | break; |
| 2551 | case 'b': |
Lucas De Marchi | e15a56a | 2012-01-14 02:46:58 -0200 | [diff] [blame] | 2552 | root = path_make_absolute_cwd(optarg); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2553 | break; |
| 2554 | case 'C': { |
| 2555 | size_t bytes = sizeof(char *) * (n_config_paths + 2); |
| 2556 | void *tmp = realloc(config_paths, bytes); |
| 2557 | if (!tmp) { |
| 2558 | fputs("Error: out-of-memory\n", stderr); |
| 2559 | goto cmdline_failed; |
| 2560 | } |
| 2561 | config_paths = tmp; |
| 2562 | config_paths[n_config_paths] = optarg; |
| 2563 | n_config_paths++; |
| 2564 | config_paths[n_config_paths] = NULL; |
| 2565 | break; |
| 2566 | } |
| 2567 | case 'E': |
| 2568 | module_symvers = optarg; |
| 2569 | cfg.check_symvers = 1; |
| 2570 | break; |
| 2571 | case 'F': |
| 2572 | system_map = optarg; |
| 2573 | break; |
| 2574 | case 'e': |
| 2575 | cfg.print_unknown = 1; |
| 2576 | break; |
| 2577 | case 'v': |
| 2578 | verbose++; |
| 2579 | break; |
| 2580 | case 'n': |
| 2581 | out = stdout; |
| 2582 | break; |
| 2583 | case 'P': |
| 2584 | if (optarg[1] != '\0') { |
| 2585 | CRIT("-P only takes a single char\n"); |
| 2586 | goto cmdline_failed; |
| 2587 | } |
| 2588 | cfg.sym_prefix = optarg[0]; |
| 2589 | break; |
| 2590 | case 'w': |
| 2591 | cfg.warn_dups = 1; |
| 2592 | break; |
| 2593 | case 'u': |
| 2594 | case 'q': |
| 2595 | case 'r': |
| 2596 | case 'm': |
| 2597 | if (idx > 0) { |
| 2598 | fprintf(stderr, |
| 2599 | "ignored deprecated option --%s\n", |
| 2600 | cmdopts[idx].name); |
| 2601 | } else { |
| 2602 | fprintf(stderr, |
| 2603 | "ignored deprecated option -%c\n", c); |
| 2604 | } |
| 2605 | break; |
| 2606 | case 'h': |
Lucas De Marchi | aa156c9 | 2012-01-05 08:15:51 -0200 | [diff] [blame] | 2607 | help(basename(argv[0])); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2608 | free(config_paths); |
| 2609 | return EXIT_SUCCESS; |
| 2610 | case 'V': |
| 2611 | puts(PACKAGE " version " VERSION); |
| 2612 | free(config_paths); |
| 2613 | return EXIT_SUCCESS; |
| 2614 | case '?': |
| 2615 | goto cmdline_failed; |
| 2616 | default: |
| 2617 | fprintf(stderr, |
| 2618 | "Error: unexpected getopt_long() value '%c'.\n", |
| 2619 | c); |
| 2620 | goto cmdline_failed; |
| 2621 | } |
| 2622 | } |
| 2623 | |
| 2624 | if (optind < argc && is_version_number(argv[optind])) { |
| 2625 | cfg.kversion = argv[optind]; |
| 2626 | optind++; |
| 2627 | } else { |
| 2628 | if (uname(&un) < 0) { |
| 2629 | CRIT("uname() failed: %s\n", strerror(errno)); |
| 2630 | goto cmdline_failed; |
| 2631 | } |
| 2632 | cfg.kversion = un.release; |
| 2633 | } |
| 2634 | |
| 2635 | cfg.dirnamelen = snprintf(cfg.dirname, PATH_MAX, |
| 2636 | "%s" ROOTPREFIX "/lib/modules/%s", |
Lucas De Marchi | e15a56a | 2012-01-14 02:46:58 -0200 | [diff] [blame] | 2637 | root == NULL ? "" : root, cfg.kversion); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2638 | |
| 2639 | if (optind == argc) |
| 2640 | all = 1; |
| 2641 | |
| 2642 | if (maybe_all) { |
| 2643 | if (out == stdout) |
| 2644 | goto done; |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2645 | /* ignore up-to-date errors (< 0) */ |
| 2646 | if (depfile_up_to_date(cfg.dirname) == 1) { |
| 2647 | DBG("%s/modules.dep is up to date!\n", cfg.dirname); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2648 | goto done; |
Gustavo Sverzut Barbieri | 18cd9da | 2011-12-24 11:16:40 -0200 | [diff] [blame] | 2649 | } |
| 2650 | DBG("%s/modules.dep is outdated, do -a\n", cfg.dirname); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2651 | all = 1; |
| 2652 | } |
| 2653 | |
| 2654 | ctx = kmod_new(cfg.dirname, &null_kmod_config); |
| 2655 | if (ctx == NULL) { |
| 2656 | CRIT("kmod_new(\"%s\", {NULL}) failed: %m\n", cfg.dirname); |
| 2657 | goto cmdline_failed; |
| 2658 | } |
| 2659 | kmod_set_log_priority(ctx, verbose); |
| 2660 | |
| 2661 | err = depmod_init(&depmod, &cfg, ctx); |
| 2662 | if (err < 0) { |
| 2663 | CRIT("depmod_init: %s\n", strerror(-err)); |
| 2664 | goto depmod_init_failed; |
| 2665 | } |
| 2666 | ctx = NULL; /* owned by depmod */ |
| 2667 | |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2668 | if (module_symvers != NULL) { |
| 2669 | err = depmod_load_symvers(&depmod, module_symvers); |
| 2670 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2671 | CRIT("could not load %s: %s\n", module_symvers, |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2672 | strerror(-err)); |
| 2673 | goto cmdline_failed; |
| 2674 | } |
| 2675 | } else if (system_map != NULL) { |
| 2676 | err = depmod_load_system_map(&depmod, system_map); |
| 2677 | if (err < 0) { |
Khem Raj | 035cbdc | 2012-02-02 23:09:59 -0800 | [diff] [blame] | 2678 | CRIT("could not load %s: %s\n", system_map, |
Gustavo Sverzut Barbieri | 4a0e46d | 2011-12-24 10:31:55 -0200 | [diff] [blame] | 2679 | strerror(-err)); |
| 2680 | goto cmdline_failed; |
| 2681 | } |
| 2682 | } else if (cfg.print_unknown) { |
| 2683 | WRN("-e needs -E or -F\n"); |
| 2684 | cfg.print_unknown = 0; |
| 2685 | } |
| 2686 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2687 | if (all) { |
| 2688 | err = cfg_load(&cfg, config_paths); |
| 2689 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2690 | CRIT("could not load configuration files\n"); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2691 | goto cmdline_modules_failed; |
| 2692 | } |
| 2693 | err = depmod_modules_search(&depmod); |
| 2694 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2695 | CRIT("could not search modules: %s\n", strerror(-err)); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2696 | goto cmdline_modules_failed; |
| 2697 | } |
| 2698 | } else { |
Lucas De Marchi | 31f1d0d | 2012-01-14 02:04:31 -0200 | [diff] [blame] | 2699 | int i; |
| 2700 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2701 | for (i = optind; i < argc; i++) { |
| 2702 | const char *path = argv[i]; |
| 2703 | struct kmod_module *mod; |
| 2704 | |
| 2705 | if (path[0] != '/') { |
Gustavo Sverzut Barbieri | b0bcadd | 2012-01-03 15:04:34 -0200 | [diff] [blame] | 2706 | CRIT("%s: not absolute path.\n", path); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2707 | goto cmdline_modules_failed; |
| 2708 | } |
| 2709 | |
| 2710 | err = kmod_module_new_from_path(depmod.ctx, path, &mod); |
| 2711 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2712 | CRIT("could not create module %s: %s\n", |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2713 | path, strerror(-err)); |
| 2714 | goto cmdline_modules_failed; |
| 2715 | } |
| 2716 | |
| 2717 | err = depmod_module_add(&depmod, mod); |
| 2718 | if (err < 0) { |
Dave Reisner | 6369837 | 2012-01-04 10:41:50 -0500 | [diff] [blame] | 2719 | CRIT("could not add module %s: %s\n", |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2720 | path, strerror(-err)); |
| 2721 | kmod_module_unref(mod); |
| 2722 | goto cmdline_modules_failed; |
| 2723 | } |
| 2724 | } |
| 2725 | } |
| 2726 | |
Jan Alexander Steffens (heftig) | 00bd319 | 2012-01-11 23:17:38 +0100 | [diff] [blame] | 2727 | err = depmod_modules_build_array(&depmod); |
| 2728 | if (err < 0) { |
| 2729 | CRIT("could not build module array: %s\n", |
| 2730 | strerror(-err)); |
| 2731 | goto cmdline_modules_failed; |
| 2732 | } |
| 2733 | |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2734 | depmod_modules_sort(&depmod); |
| 2735 | err = depmod_load(&depmod); |
| 2736 | if (err < 0) |
| 2737 | goto cmdline_modules_failed; |
| 2738 | |
Gustavo Sverzut Barbieri | 25c4151 | 2011-12-23 00:55:33 -0200 | [diff] [blame] | 2739 | err = depmod_output(&depmod, out); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2740 | |
| 2741 | done: |
| 2742 | depmod_shutdown(&depmod); |
| 2743 | cfg_free(&cfg); |
| 2744 | free(config_paths); |
| 2745 | return err >= 0 ? EXIT_SUCCESS : EXIT_FAILURE; |
| 2746 | |
| 2747 | cmdline_modules_failed: |
| 2748 | depmod_shutdown(&depmod); |
| 2749 | depmod_init_failed: |
| 2750 | if (ctx != NULL) |
| 2751 | kmod_unref(ctx); |
| 2752 | cmdline_failed: |
| 2753 | cfg_free(&cfg); |
| 2754 | free(config_paths); |
Lucas De Marchi | e15a56a | 2012-01-14 02:46:58 -0200 | [diff] [blame] | 2755 | free(root); |
Gustavo Sverzut Barbieri | 64b8b58 | 2011-12-22 20:23:11 -0200 | [diff] [blame] | 2756 | return EXIT_FAILURE; |
| 2757 | } |
Lucas De Marchi | f6cf14c | 2011-12-27 19:56:33 -0200 | [diff] [blame] | 2758 | |
| 2759 | #ifndef KMOD_BUNDLE_TOOL |
| 2760 | int main(int argc, char *argv[]) |
| 2761 | { |
| 2762 | return do_depmod(argc, argv); |
| 2763 | } |
| 2764 | |
| 2765 | #else |
| 2766 | #include "kmod.h" |
| 2767 | |
| 2768 | const struct kmod_cmd kmod_cmd_compat_depmod = { |
| 2769 | .name = "depmod", |
| 2770 | .cmd = do_depmod, |
| 2771 | .help = "compat depmod command", |
| 2772 | }; |
| 2773 | |
| 2774 | #endif |