]>
Commit | Line | Data |
---|---|---|
65eb4378 TG |
1 | /*** |
2 | This file is part of systemd. | |
3 | ||
4 | Copyright 2012 Kay Sievers <kay@vrfy.org> | |
5 | ||
6 | systemd is free software; you can redistribute it and/or modify it | |
7 | under the terms of the GNU Lesser General Public License as published by | |
8 | the Free Software Foundation; either version 2.1 of the License, or | |
9 | (at your option) any later version. | |
10 | ||
11 | systemd is distributed in the hope that it will be useful, but | |
12 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | Lesser General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU Lesser General Public License | |
17 | along with systemd; If not, see <http://www.gnu.org/licenses/>. | |
18 | ***/ | |
19 | ||
3f6fd1ba | 20 | #include <ctype.h> |
65eb4378 | 21 | #include <getopt.h> |
3f6fd1ba | 22 | #include <stdlib.h> |
65eb4378 | 23 | #include <string.h> |
65eb4378 | 24 | |
65eb4378 | 25 | #include "conf-files.h" |
65eb4378 TG |
26 | #include "hwdb-internal.h" |
27 | #include "hwdb-util.h" | |
3f6fd1ba LP |
28 | #include "mkdir.h" |
29 | #include "strbuf.h" | |
30 | #include "strv.h" | |
31 | #include "util.h" | |
32 | #include "verbs.h" | |
65eb4378 TG |
33 | |
34 | /* | |
35 | * Generic udev properties, key/value database based on modalias strings. | |
36 | * Uses a Patricia/radix trie to index all matches for efficient lookup. | |
37 | */ | |
38 | ||
39 | static const char *arg_hwdb_bin_dir = "/etc/udev"; | |
40 | static const char *arg_root = ""; | |
41 | ||
42 | static const char * const conf_file_dirs[] = { | |
43 | "/etc/udev/hwdb.d", | |
44 | UDEVLIBEXECDIR "/hwdb.d", | |
45 | NULL | |
46 | }; | |
47 | ||
48 | /* in-memory trie objects */ | |
49 | struct trie { | |
50 | struct trie_node *root; | |
51 | struct strbuf *strings; | |
52 | ||
53 | size_t nodes_count; | |
54 | size_t children_count; | |
55 | size_t values_count; | |
56 | }; | |
57 | ||
58 | struct trie_node { | |
59 | /* prefix, common part for all children of this node */ | |
60 | size_t prefix_off; | |
61 | ||
62 | /* sorted array of pointers to children nodes */ | |
63 | struct trie_child_entry *children; | |
64 | uint8_t children_count; | |
65 | ||
66 | /* sorted array of key/value pairs */ | |
67 | struct trie_value_entry *values; | |
68 | size_t values_count; | |
69 | }; | |
70 | ||
71 | /* children array item with char (0-255) index */ | |
72 | struct trie_child_entry { | |
73 | uint8_t c; | |
74 | struct trie_node *child; | |
75 | }; | |
76 | ||
77 | /* value array item with key/value pairs */ | |
78 | struct trie_value_entry { | |
79 | size_t key_off; | |
80 | size_t value_off; | |
81 | }; | |
82 | ||
83 | static int trie_children_cmp(const void *v1, const void *v2) { | |
84 | const struct trie_child_entry *n1 = v1; | |
85 | const struct trie_child_entry *n2 = v2; | |
86 | ||
87 | return n1->c - n2->c; | |
88 | } | |
89 | ||
90 | static int node_add_child(struct trie *trie, struct trie_node *node, struct trie_node *node_child, uint8_t c) { | |
91 | struct trie_child_entry *child; | |
92 | ||
93 | /* extend array, add new entry, sort for bisection */ | |
94 | child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); | |
95 | if (!child) | |
96 | return -ENOMEM; | |
97 | ||
98 | node->children = child; | |
99 | trie->children_count++; | |
100 | node->children[node->children_count].c = c; | |
101 | node->children[node->children_count].child = node_child; | |
102 | node->children_count++; | |
103 | qsort(node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); | |
104 | trie->nodes_count++; | |
105 | ||
106 | return 0; | |
107 | } | |
108 | ||
109 | static struct trie_node *node_lookup(const struct trie_node *node, uint8_t c) { | |
110 | struct trie_child_entry *child; | |
111 | struct trie_child_entry search; | |
112 | ||
113 | search.c = c; | |
114 | child = bsearch(&search, node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); | |
115 | if (child) | |
116 | return child->child; | |
117 | return NULL; | |
118 | } | |
119 | ||
120 | static void trie_node_cleanup(struct trie_node *node) { | |
121 | size_t i; | |
122 | ||
123 | for (i = 0; i < node->children_count; i++) | |
124 | trie_node_cleanup(node->children[i].child); | |
125 | free(node->children); | |
126 | free(node->values); | |
127 | free(node); | |
128 | } | |
129 | ||
130 | static void trie_free(struct trie *trie) { | |
131 | if (!trie) | |
132 | return; | |
133 | ||
134 | if (trie->root) | |
135 | trie_node_cleanup(trie->root); | |
136 | ||
137 | strbuf_cleanup(trie->strings); | |
138 | free(trie); | |
139 | } | |
140 | ||
141 | DEFINE_TRIVIAL_CLEANUP_FUNC(struct trie*, trie_free); | |
142 | ||
143 | static int trie_values_cmp(const void *v1, const void *v2, void *arg) { | |
144 | const struct trie_value_entry *val1 = v1; | |
145 | const struct trie_value_entry *val2 = v2; | |
146 | struct trie *trie = arg; | |
147 | ||
148 | return strcmp(trie->strings->buf + val1->key_off, | |
149 | trie->strings->buf + val2->key_off); | |
150 | } | |
151 | ||
152 | static int trie_node_add_value(struct trie *trie, struct trie_node *node, | |
153 | const char *key, const char *value) { | |
154 | ssize_t k, v; | |
155 | struct trie_value_entry *val; | |
156 | ||
157 | k = strbuf_add_string(trie->strings, key, strlen(key)); | |
158 | if (k < 0) | |
159 | return k; | |
160 | v = strbuf_add_string(trie->strings, value, strlen(value)); | |
161 | if (v < 0) | |
162 | return v; | |
163 | ||
164 | if (node->values_count) { | |
165 | struct trie_value_entry search = { | |
166 | .key_off = k, | |
167 | .value_off = v, | |
168 | }; | |
169 | ||
170 | val = xbsearch_r(&search, node->values, node->values_count, sizeof(struct trie_value_entry), trie_values_cmp, trie); | |
171 | if (val) { | |
172 | /* replace existing earlier key with new value */ | |
173 | val->value_off = v; | |
174 | return 0; | |
175 | } | |
176 | } | |
177 | ||
178 | /* extend array, add new entry, sort for bisection */ | |
179 | val = realloc(node->values, (node->values_count + 1) * sizeof(struct trie_value_entry)); | |
180 | if (!val) | |
181 | return -ENOMEM; | |
182 | trie->values_count++; | |
183 | node->values = val; | |
184 | node->values[node->values_count].key_off = k; | |
185 | node->values[node->values_count].value_off = v; | |
186 | node->values_count++; | |
187 | qsort_r(node->values, node->values_count, sizeof(struct trie_value_entry), trie_values_cmp, trie); | |
188 | return 0; | |
189 | } | |
190 | ||
191 | static int trie_insert(struct trie *trie, struct trie_node *node, const char *search, | |
192 | const char *key, const char *value) { | |
193 | size_t i = 0; | |
194 | int err = 0; | |
195 | ||
196 | for (;;) { | |
197 | size_t p; | |
198 | uint8_t c; | |
199 | struct trie_node *child; | |
200 | ||
201 | for (p = 0; (c = trie->strings->buf[node->prefix_off + p]); p++) { | |
202 | _cleanup_free_ char *s = NULL; | |
203 | ssize_t off; | |
204 | _cleanup_free_ struct trie_node *new_child = NULL; | |
205 | ||
206 | if (c == search[i + p]) | |
207 | continue; | |
208 | ||
209 | /* split node */ | |
210 | new_child = new0(struct trie_node, 1); | |
211 | if (!new_child) | |
212 | return -ENOMEM; | |
213 | ||
214 | /* move values from parent to child */ | |
215 | new_child->prefix_off = node->prefix_off + p+1; | |
216 | new_child->children = node->children; | |
217 | new_child->children_count = node->children_count; | |
218 | new_child->values = node->values; | |
219 | new_child->values_count = node->values_count; | |
220 | ||
221 | /* update parent; use strdup() because the source gets realloc()d */ | |
222 | s = strndup(trie->strings->buf + node->prefix_off, p); | |
223 | if (!s) | |
224 | return -ENOMEM; | |
225 | ||
226 | off = strbuf_add_string(trie->strings, s, p); | |
227 | if (off < 0) | |
228 | return off; | |
229 | ||
230 | node->prefix_off = off; | |
231 | node->children = NULL; | |
232 | node->children_count = 0; | |
233 | node->values = NULL; | |
234 | node->values_count = 0; | |
235 | err = node_add_child(trie, node, new_child, c); | |
236 | if (err < 0) | |
237 | return err; | |
238 | ||
239 | new_child = NULL; /* avoid cleanup */ | |
240 | break; | |
241 | } | |
242 | i += p; | |
243 | ||
244 | c = search[i]; | |
245 | if (c == '\0') | |
246 | return trie_node_add_value(trie, node, key, value); | |
247 | ||
248 | child = node_lookup(node, c); | |
249 | if (!child) { | |
250 | ssize_t off; | |
251 | ||
252 | /* new child */ | |
253 | child = new0(struct trie_node, 1); | |
254 | if (!child) | |
255 | return -ENOMEM; | |
256 | ||
257 | off = strbuf_add_string(trie->strings, search + i+1, strlen(search + i+1)); | |
258 | if (off < 0) { | |
259 | free(child); | |
260 | return off; | |
261 | } | |
262 | ||
263 | child->prefix_off = off; | |
264 | err = node_add_child(trie, node, child, c); | |
265 | if (err < 0) { | |
266 | free(child); | |
267 | return err; | |
268 | } | |
269 | ||
270 | return trie_node_add_value(trie, child, key, value); | |
271 | } | |
272 | ||
273 | node = child; | |
274 | i++; | |
275 | } | |
276 | } | |
277 | ||
278 | struct trie_f { | |
279 | FILE *f; | |
280 | struct trie *trie; | |
281 | uint64_t strings_off; | |
282 | ||
283 | uint64_t nodes_count; | |
284 | uint64_t children_count; | |
285 | uint64_t values_count; | |
286 | }; | |
287 | ||
288 | /* calculate the storage space for the nodes, children arrays, value arrays */ | |
289 | static void trie_store_nodes_size(struct trie_f *trie, struct trie_node *node) { | |
290 | uint64_t i; | |
291 | ||
292 | for (i = 0; i < node->children_count; i++) | |
293 | trie_store_nodes_size(trie, node->children[i].child); | |
294 | ||
295 | trie->strings_off += sizeof(struct trie_node_f); | |
296 | for (i = 0; i < node->children_count; i++) | |
297 | trie->strings_off += sizeof(struct trie_child_entry_f); | |
298 | for (i = 0; i < node->values_count; i++) | |
299 | trie->strings_off += sizeof(struct trie_value_entry_f); | |
300 | } | |
301 | ||
302 | static int64_t trie_store_nodes(struct trie_f *trie, struct trie_node *node) { | |
303 | uint64_t i; | |
304 | struct trie_node_f n = { | |
305 | .prefix_off = htole64(trie->strings_off + node->prefix_off), | |
306 | .children_count = node->children_count, | |
307 | .values_count = htole64(node->values_count), | |
308 | }; | |
309 | struct trie_child_entry_f *children = NULL; | |
310 | int64_t node_off; | |
311 | ||
312 | if (node->children_count) { | |
313 | children = new0(struct trie_child_entry_f, node->children_count); | |
314 | if (!children) | |
315 | return -ENOMEM; | |
316 | } | |
317 | ||
318 | /* post-order recursion */ | |
319 | for (i = 0; i < node->children_count; i++) { | |
320 | int64_t child_off; | |
321 | ||
322 | child_off = trie_store_nodes(trie, node->children[i].child); | |
323 | if (child_off < 0) { | |
324 | free(children); | |
325 | return child_off; | |
326 | } | |
327 | children[i].c = node->children[i].c; | |
328 | children[i].child_off = htole64(child_off); | |
329 | } | |
330 | ||
331 | /* write node */ | |
332 | node_off = ftello(trie->f); | |
333 | fwrite(&n, sizeof(struct trie_node_f), 1, trie->f); | |
334 | trie->nodes_count++; | |
335 | ||
336 | /* append children array */ | |
337 | if (node->children_count) { | |
338 | fwrite(children, sizeof(struct trie_child_entry_f), node->children_count, trie->f); | |
339 | trie->children_count += node->children_count; | |
340 | free(children); | |
341 | } | |
342 | ||
343 | /* append values array */ | |
344 | for (i = 0; i < node->values_count; i++) { | |
345 | struct trie_value_entry_f v = { | |
346 | .key_off = htole64(trie->strings_off + node->values[i].key_off), | |
347 | .value_off = htole64(trie->strings_off + node->values[i].value_off), | |
348 | }; | |
349 | ||
350 | fwrite(&v, sizeof(struct trie_value_entry_f), 1, trie->f); | |
351 | trie->values_count++; | |
352 | } | |
353 | ||
354 | return node_off; | |
355 | } | |
356 | ||
357 | static int trie_store(struct trie *trie, const char *filename) { | |
358 | struct trie_f t = { | |
359 | .trie = trie, | |
360 | }; | |
361 | _cleanup_free_ char *filename_tmp = NULL; | |
362 | int64_t pos; | |
363 | int64_t root_off; | |
364 | int64_t size; | |
365 | struct trie_header_f h = { | |
366 | .signature = HWDB_SIG, | |
367 | .tool_version = htole64(atoi(VERSION)), | |
368 | .header_size = htole64(sizeof(struct trie_header_f)), | |
369 | .node_size = htole64(sizeof(struct trie_node_f)), | |
370 | .child_entry_size = htole64(sizeof(struct trie_child_entry_f)), | |
371 | .value_entry_size = htole64(sizeof(struct trie_value_entry_f)), | |
372 | }; | |
373 | int err; | |
374 | ||
375 | /* calculate size of header, nodes, children entries, value entries */ | |
376 | t.strings_off = sizeof(struct trie_header_f); | |
377 | trie_store_nodes_size(&t, trie->root); | |
378 | ||
379 | err = fopen_temporary(filename , &t.f, &filename_tmp); | |
380 | if (err < 0) | |
381 | return err; | |
382 | fchmod(fileno(t.f), 0444); | |
383 | ||
384 | /* write nodes */ | |
385 | err = fseeko(t.f, sizeof(struct trie_header_f), SEEK_SET); | |
386 | if (err < 0) { | |
387 | fclose(t.f); | |
388 | unlink_noerrno(filename_tmp); | |
389 | return -errno; | |
390 | } | |
391 | root_off = trie_store_nodes(&t, trie->root); | |
392 | h.nodes_root_off = htole64(root_off); | |
393 | pos = ftello(t.f); | |
394 | h.nodes_len = htole64(pos - sizeof(struct trie_header_f)); | |
395 | ||
396 | /* write string buffer */ | |
397 | fwrite(trie->strings->buf, trie->strings->len, 1, t.f); | |
398 | h.strings_len = htole64(trie->strings->len); | |
399 | ||
400 | /* write header */ | |
401 | size = ftello(t.f); | |
402 | h.file_size = htole64(size); | |
403 | err = fseeko(t.f, 0, SEEK_SET); | |
404 | if (err < 0) { | |
405 | fclose(t.f); | |
406 | unlink_noerrno(filename_tmp); | |
407 | return -errno; | |
408 | } | |
409 | fwrite(&h, sizeof(struct trie_header_f), 1, t.f); | |
410 | err = ferror(t.f); | |
411 | if (err) | |
412 | err = -errno; | |
413 | fclose(t.f); | |
414 | if (err < 0 || rename(filename_tmp, filename) < 0) { | |
415 | unlink_noerrno(filename_tmp); | |
416 | return err < 0 ? err : -errno; | |
417 | } | |
418 | ||
419 | log_debug("=== trie on-disk ==="); | |
1fa2f38f | 420 | log_debug("size: %8"PRIi64" bytes", size); |
65eb4378 TG |
421 | log_debug("header: %8zu bytes", sizeof(struct trie_header_f)); |
422 | log_debug("nodes: %8"PRIu64" bytes (%8"PRIu64")", | |
423 | t.nodes_count * sizeof(struct trie_node_f), t.nodes_count); | |
424 | log_debug("child pointers: %8"PRIu64" bytes (%8"PRIu64")", | |
425 | t.children_count * sizeof(struct trie_child_entry_f), t.children_count); | |
426 | log_debug("value pointers: %8"PRIu64" bytes (%8"PRIu64")", | |
427 | t.values_count * sizeof(struct trie_value_entry_f), t.values_count); | |
428 | log_debug("string store: %8zu bytes", trie->strings->len); | |
429 | log_debug("strings start: %8"PRIu64, t.strings_off); | |
430 | ||
431 | return 0; | |
432 | } | |
433 | ||
434 | static int insert_data(struct trie *trie, char **match_list, char *line, const char *filename) { | |
435 | char *value, **entry; | |
436 | ||
437 | value = strchr(line, '='); | |
438 | if (!value) { | |
439 | log_error("Error, key/value pair expected but got '%s' in '%s':", line, filename); | |
440 | return -EINVAL; | |
441 | } | |
442 | ||
443 | value[0] = '\0'; | |
444 | value++; | |
445 | ||
446 | /* libudev requires properties to start with a space */ | |
447 | while (isblank(line[0]) && isblank(line[1])) | |
448 | line++; | |
449 | ||
450 | if (line[0] == '\0' || value[0] == '\0') { | |
451 | log_error("Error, empty key or value '%s' in '%s':", line, filename); | |
452 | return -EINVAL; | |
453 | } | |
454 | ||
455 | STRV_FOREACH(entry, match_list) | |
456 | trie_insert(trie, trie->root, *entry, line, value); | |
457 | ||
458 | return 0; | |
459 | } | |
460 | ||
461 | static int import_file(struct trie *trie, const char *filename) { | |
462 | enum { | |
463 | HW_NONE, | |
464 | HW_MATCH, | |
465 | HW_DATA, | |
466 | } state = HW_NONE; | |
467 | _cleanup_fclose_ FILE *f = NULL; | |
468 | char line[LINE_MAX]; | |
469 | _cleanup_strv_free_ char **match_list = NULL; | |
470 | char *match = NULL; | |
471 | int r; | |
472 | ||
473 | f = fopen(filename, "re"); | |
474 | if (!f) | |
475 | return -errno; | |
476 | ||
477 | while (fgets(line, sizeof(line), f)) { | |
478 | size_t len; | |
479 | char *pos; | |
480 | ||
481 | /* comment line */ | |
482 | if (line[0] == '#') | |
483 | continue; | |
484 | ||
485 | /* strip trailing comment */ | |
486 | pos = strchr(line, '#'); | |
487 | if (pos) | |
488 | pos[0] = '\0'; | |
489 | ||
490 | /* strip trailing whitespace */ | |
491 | len = strlen(line); | |
492 | while (len > 0 && isspace(line[len-1])) | |
493 | len--; | |
494 | line[len] = '\0'; | |
495 | ||
496 | switch (state) { | |
497 | case HW_NONE: | |
498 | if (len == 0) | |
499 | break; | |
500 | ||
501 | if (line[0] == ' ') { | |
502 | log_error("Error, MATCH expected but got '%s' in '%s':", line, filename); | |
503 | break; | |
504 | } | |
505 | ||
506 | /* start of record, first match */ | |
507 | state = HW_MATCH; | |
508 | ||
509 | match = strdup(line); | |
510 | if (!match) | |
511 | return -ENOMEM; | |
512 | ||
513 | r = strv_consume(&match_list, match); | |
514 | if (r < 0) | |
515 | return r; | |
516 | ||
517 | break; | |
518 | ||
519 | case HW_MATCH: | |
520 | if (len == 0) { | |
521 | log_error("Error, DATA expected but got empty line in '%s':", filename); | |
522 | state = HW_NONE; | |
523 | strv_clear(match_list); | |
524 | break; | |
525 | } | |
526 | ||
527 | /* another match */ | |
528 | if (line[0] != ' ') { | |
529 | match = strdup(line); | |
530 | if (!match) | |
531 | return -ENOMEM; | |
532 | ||
533 | r = strv_consume(&match_list, match); | |
534 | if (r < 0) | |
535 | return r; | |
536 | ||
537 | break; | |
538 | } | |
539 | ||
540 | /* first data */ | |
541 | state = HW_DATA; | |
542 | insert_data(trie, match_list, line, filename); | |
543 | break; | |
544 | ||
545 | case HW_DATA: | |
546 | /* end of record */ | |
547 | if (len == 0) { | |
548 | state = HW_NONE; | |
549 | strv_clear(match_list); | |
550 | break; | |
551 | } | |
552 | ||
553 | if (line[0] != ' ') { | |
554 | log_error("Error, DATA expected but got '%s' in '%s':", line, filename); | |
555 | state = HW_NONE; | |
556 | strv_clear(match_list); | |
557 | break; | |
558 | } | |
559 | ||
560 | insert_data(trie, match_list, line, filename); | |
561 | break; | |
562 | }; | |
563 | } | |
564 | ||
565 | return 0; | |
566 | } | |
567 | ||
caa8dab2 | 568 | static int hwdb_query(int argc, char *argv[], void *userdata) { |
65eb4378 TG |
569 | _cleanup_hwdb_unref_ sd_hwdb *hwdb = NULL; |
570 | const char *key, *value; | |
571 | const char *modalias; | |
572 | int r; | |
573 | ||
caa8dab2 TG |
574 | assert(argc >= 2); |
575 | assert(argv); | |
65eb4378 | 576 | |
caa8dab2 | 577 | modalias = argv[1]; |
65eb4378 TG |
578 | |
579 | r = sd_hwdb_new(&hwdb); | |
580 | if (r < 0) | |
581 | return r; | |
582 | ||
583 | SD_HWDB_FOREACH_PROPERTY(hwdb, modalias, key, value) | |
584 | printf("%s=%s\n", key, value); | |
585 | ||
586 | return 0; | |
587 | } | |
588 | ||
caa8dab2 | 589 | static int hwdb_update(int argc, char *argv[], void *userdata) { |
65eb4378 TG |
590 | _cleanup_free_ char *hwdb_bin = NULL; |
591 | _cleanup_(trie_freep) struct trie *trie = NULL; | |
592 | char **files, **f; | |
593 | int r; | |
594 | ||
595 | trie = new0(struct trie, 1); | |
596 | if (!trie) | |
597 | return -ENOMEM; | |
598 | ||
599 | /* string store */ | |
600 | trie->strings = strbuf_new(); | |
601 | if (!trie->strings) | |
602 | return -ENOMEM; | |
603 | ||
604 | /* index */ | |
605 | trie->root = new0(struct trie_node, 1); | |
606 | if (!trie->root) | |
607 | return -ENOMEM; | |
608 | ||
609 | trie->nodes_count++; | |
610 | ||
611 | r = conf_files_list_strv(&files, ".hwdb", arg_root, conf_file_dirs); | |
612 | if (r < 0) | |
613 | return log_error_errno(r, "failed to enumerate hwdb files: %m"); | |
614 | ||
615 | STRV_FOREACH(f, files) { | |
616 | log_debug("reading file '%s'", *f); | |
617 | import_file(trie, *f); | |
618 | } | |
619 | strv_free(files); | |
620 | ||
621 | strbuf_complete(trie->strings); | |
622 | ||
623 | log_debug("=== trie in-memory ==="); | |
624 | log_debug("nodes: %8zu bytes (%8zu)", | |
625 | trie->nodes_count * sizeof(struct trie_node), trie->nodes_count); | |
626 | log_debug("children arrays: %8zu bytes (%8zu)", | |
627 | trie->children_count * sizeof(struct trie_child_entry), trie->children_count); | |
628 | log_debug("values arrays: %8zu bytes (%8zu)", | |
629 | trie->values_count * sizeof(struct trie_value_entry), trie->values_count); | |
630 | log_debug("strings: %8zu bytes", | |
631 | trie->strings->len); | |
632 | log_debug("strings incoming: %8zu bytes (%8zu)", | |
633 | trie->strings->in_len, trie->strings->in_count); | |
634 | log_debug("strings dedup'ed: %8zu bytes (%8zu)", | |
635 | trie->strings->dedup_len, trie->strings->dedup_count); | |
636 | ||
637 | hwdb_bin = strjoin(arg_root, "/", arg_hwdb_bin_dir, "/hwdb.bin", NULL); | |
638 | if (!hwdb_bin) | |
639 | return -ENOMEM; | |
640 | ||
641 | mkdir_parents(hwdb_bin, 0755); | |
642 | r = trie_store(trie, hwdb_bin); | |
643 | if (r < 0) | |
644 | return log_error_errno(r, "Failure writing database %s: %m", hwdb_bin); | |
645 | ||
646 | return 0; | |
647 | } | |
648 | ||
649 | static void help(void) { | |
650 | printf("Usage: %s OPTIONS COMMAND\n\n" | |
424d110a LP |
651 | "Update or query the hardware database.\n\n" |
652 | " -h --help Show this help\n" | |
653 | " --version Show package version\n" | |
654 | " --usr Generate in " UDEVLIBEXECDIR " instead of /etc/udev\n" | |
655 | " -r --root=PATH Alternative root path in the filesystem\n\n" | |
65eb4378 | 656 | "Commands:\n" |
424d110a LP |
657 | " update Update the hwdb database\n" |
658 | " query MODALIAS Query database and print result\n", | |
65eb4378 TG |
659 | program_invocation_short_name); |
660 | } | |
661 | ||
662 | static int parse_argv(int argc, char *argv[]) { | |
663 | enum { | |
424d110a LP |
664 | ARG_VERSION = 0x100, |
665 | ARG_USR, | |
65eb4378 TG |
666 | }; |
667 | ||
668 | static const struct option options[] = { | |
424d110a LP |
669 | { "help", no_argument, NULL, 'h' }, |
670 | { "version", no_argument, NULL, ARG_VERSION }, | |
671 | { "usr", no_argument, NULL, ARG_USR }, | |
672 | { "root", required_argument, NULL, 'r' }, | |
65eb4378 TG |
673 | {} |
674 | }; | |
675 | ||
676 | int c; | |
677 | ||
678 | assert(argc >= 0); | |
679 | assert(argv); | |
680 | ||
681 | while ((c = getopt_long(argc, argv, "ut:r:h", options, NULL)) >= 0) { | |
682 | switch(c) { | |
424d110a LP |
683 | |
684 | case 'h': | |
685 | help(); | |
686 | return 0; | |
687 | ||
688 | case ARG_VERSION: | |
3f6fd1ba | 689 | return version(); |
424d110a | 690 | |
65eb4378 TG |
691 | case ARG_USR: |
692 | arg_hwdb_bin_dir = UDEVLIBEXECDIR; | |
693 | break; | |
424d110a | 694 | |
65eb4378 TG |
695 | case 'r': |
696 | arg_root = optarg; | |
697 | break; | |
424d110a | 698 | |
65eb4378 TG |
699 | case '?': |
700 | return -EINVAL; | |
424d110a | 701 | |
65eb4378 TG |
702 | default: |
703 | assert_not_reached("Unknown option"); | |
704 | } | |
705 | } | |
706 | ||
707 | return 1; | |
708 | } | |
709 | ||
710 | static int hwdb_main(int argc, char *argv[]) { | |
caa8dab2 TG |
711 | const Verb verbs[] = { |
712 | { "update", 1, 1, 0, hwdb_update }, | |
424d110a | 713 | { "query", 2, 2, 0, hwdb_query }, |
caa8dab2 | 714 | {}, |
65eb4378 TG |
715 | }; |
716 | ||
caa8dab2 | 717 | return dispatch_verb(argc, argv, verbs, NULL); |
65eb4378 TG |
718 | } |
719 | ||
720 | int main (int argc, char *argv[]) { | |
721 | int r; | |
722 | ||
723 | log_parse_environment(); | |
724 | log_open(); | |
725 | ||
726 | r = parse_argv(argc, argv); | |
727 | if (r <= 0) | |
728 | goto finish; | |
729 | ||
730 | r = hwdb_main(argc, argv); | |
731 | ||
732 | finish: | |
733 | return r < 0 ? EXIT_FAILURE : EXIT_SUCCESS; | |
734 | } |