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