2 This file is part of systemd.
4 Copyright 2012 Kay Sievers <kay@vrfy.org>
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.
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.
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/>.
25 #include "alloc-util.h"
26 #include "conf-files.h"
30 #include "hwdb-internal.h"
31 #include "hwdb-util.h"
34 #include "selinux-util.h"
36 #include "string-util.h"
42 * Generic udev properties, key/value database based on modalias strings.
43 * Uses a Patricia/radix trie to index all matches for efficient lookup.
46 static const char *arg_hwdb_bin_dir
= "/etc/udev";
47 static const char *arg_root
= "";
49 static const char * const conf_file_dirs
[] = {
51 UDEVLIBEXECDIR
"/hwdb.d",
55 /* in-memory trie objects */
57 struct trie_node
*root
;
58 struct strbuf
*strings
;
61 size_t children_count
;
66 /* prefix, common part for all children of this node */
69 /* sorted array of pointers to children nodes */
70 struct trie_child_entry
*children
;
71 uint8_t children_count
;
73 /* sorted array of key/value pairs */
74 struct trie_value_entry
*values
;
78 /* children array item with char (0-255) index */
79 struct trie_child_entry
{
81 struct trie_node
*child
;
84 /* value array item with key/value pairs */
85 struct trie_value_entry
{
90 uint16_t file_priority
;
93 static int trie_children_cmp(const void *v1
, const void *v2
) {
94 const struct trie_child_entry
*n1
= v1
;
95 const struct trie_child_entry
*n2
= v2
;
100 static int node_add_child(struct trie
*trie
, struct trie_node
*node
, struct trie_node
*node_child
, uint8_t c
) {
101 struct trie_child_entry
*child
;
103 /* extend array, add new entry, sort for bisection */
104 child
= realloc(node
->children
, (node
->children_count
+ 1) * sizeof(struct trie_child_entry
));
108 node
->children
= child
;
109 trie
->children_count
++;
110 node
->children
[node
->children_count
].c
= c
;
111 node
->children
[node
->children_count
].child
= node_child
;
112 node
->children_count
++;
113 qsort(node
->children
, node
->children_count
, sizeof(struct trie_child_entry
), trie_children_cmp
);
119 static struct trie_node
*node_lookup(const struct trie_node
*node
, uint8_t c
) {
120 struct trie_child_entry
*child
;
121 struct trie_child_entry search
;
124 child
= bsearch(&search
, node
->children
, node
->children_count
, sizeof(struct trie_child_entry
), trie_children_cmp
);
130 static void trie_node_cleanup(struct trie_node
*node
) {
133 for (i
= 0; i
< node
->children_count
; i
++)
134 trie_node_cleanup(node
->children
[i
].child
);
135 free(node
->children
);
140 static void trie_free(struct trie
*trie
) {
145 trie_node_cleanup(trie
->root
);
147 strbuf_cleanup(trie
->strings
);
151 DEFINE_TRIVIAL_CLEANUP_FUNC(struct trie
*, trie_free
);
153 static int trie_values_cmp(const void *v1
, const void *v2
, void *arg
) {
154 const struct trie_value_entry
*val1
= v1
;
155 const struct trie_value_entry
*val2
= v2
;
156 struct trie
*trie
= arg
;
158 return strcmp(trie
->strings
->buf
+ val1
->key_off
,
159 trie
->strings
->buf
+ val2
->key_off
);
162 static int trie_node_add_value(struct trie
*trie
, struct trie_node
*node
,
163 const char *key
, const char *value
,
164 const char *filename
, uint16_t file_priority
, uint32_t line_number
) {
166 struct trie_value_entry
*val
;
168 k
= strbuf_add_string(trie
->strings
, key
, strlen(key
));
171 v
= strbuf_add_string(trie
->strings
, value
, strlen(value
));
174 fn
= strbuf_add_string(trie
->strings
, filename
, strlen(filename
));
178 if (node
->values_count
) {
179 struct trie_value_entry search
= {
184 val
= xbsearch_r(&search
, node
->values
, node
->values_count
, sizeof(struct trie_value_entry
), trie_values_cmp
, trie
);
186 /* At this point we have 2 identical properties on the same match-string.
187 * Since we process files in order, we just replace the previous value.
190 val
->filename_off
= fn
;
191 val
->file_priority
= file_priority
;
192 val
->line_number
= line_number
;
197 /* extend array, add new entry, sort for bisection */
198 val
= realloc(node
->values
, (node
->values_count
+ 1) * sizeof(struct trie_value_entry
));
201 trie
->values_count
++;
203 node
->values
[node
->values_count
].key_off
= k
;
204 node
->values
[node
->values_count
].value_off
= v
;
205 node
->values
[node
->values_count
].filename_off
= fn
;
206 node
->values
[node
->values_count
].file_priority
= file_priority
;
207 node
->values
[node
->values_count
].line_number
= line_number
;
208 node
->values_count
++;
209 qsort_r(node
->values
, node
->values_count
, sizeof(struct trie_value_entry
), trie_values_cmp
, trie
);
213 static int trie_insert(struct trie
*trie
, struct trie_node
*node
, const char *search
,
214 const char *key
, const char *value
,
215 const char *filename
, uint16_t file_priority
, uint32_t line_number
) {
222 struct trie_node
*child
;
224 for (p
= 0; (c
= trie
->strings
->buf
[node
->prefix_off
+ p
]); p
++) {
225 _cleanup_free_
char *s
= NULL
;
227 _cleanup_free_
struct trie_node
*new_child
= NULL
;
229 if (c
== search
[i
+ p
])
233 new_child
= new0(struct trie_node
, 1);
237 /* move values from parent to child */
238 new_child
->prefix_off
= node
->prefix_off
+ p
+1;
239 new_child
->children
= node
->children
;
240 new_child
->children_count
= node
->children_count
;
241 new_child
->values
= node
->values
;
242 new_child
->values_count
= node
->values_count
;
244 /* update parent; use strdup() because the source gets realloc()d */
245 s
= strndup(trie
->strings
->buf
+ node
->prefix_off
, p
);
249 off
= strbuf_add_string(trie
->strings
, s
, p
);
253 node
->prefix_off
= off
;
254 node
->children
= NULL
;
255 node
->children_count
= 0;
257 node
->values_count
= 0;
258 err
= node_add_child(trie
, node
, new_child
, c
);
262 new_child
= NULL
; /* avoid cleanup */
269 return trie_node_add_value(trie
, node
, key
, value
, filename
, file_priority
, line_number
);
271 child
= node_lookup(node
, c
);
276 child
= new0(struct trie_node
, 1);
280 off
= strbuf_add_string(trie
->strings
, search
+ i
+1, strlen(search
+ i
+1));
286 child
->prefix_off
= off
;
287 err
= node_add_child(trie
, node
, child
, c
);
293 return trie_node_add_value(trie
, child
, key
, value
, filename
, file_priority
, line_number
);
304 uint64_t strings_off
;
306 uint64_t nodes_count
;
307 uint64_t children_count
;
308 uint64_t values_count
;
311 /* calculate the storage space for the nodes, children arrays, value arrays */
312 static void trie_store_nodes_size(struct trie_f
*trie
, struct trie_node
*node
) {
315 for (i
= 0; i
< node
->children_count
; i
++)
316 trie_store_nodes_size(trie
, node
->children
[i
].child
);
318 trie
->strings_off
+= sizeof(struct trie_node_f
);
319 for (i
= 0; i
< node
->children_count
; i
++)
320 trie
->strings_off
+= sizeof(struct trie_child_entry_f
);
321 for (i
= 0; i
< node
->values_count
; i
++)
322 trie
->strings_off
+= sizeof(struct trie_value_entry2_f
);
325 static int64_t trie_store_nodes(struct trie_f
*trie
, struct trie_node
*node
) {
327 struct trie_node_f n
= {
328 .prefix_off
= htole64(trie
->strings_off
+ node
->prefix_off
),
329 .children_count
= node
->children_count
,
330 .values_count
= htole64(node
->values_count
),
332 struct trie_child_entry_f
*children
= NULL
;
335 if (node
->children_count
) {
336 children
= new0(struct trie_child_entry_f
, node
->children_count
);
341 /* post-order recursion */
342 for (i
= 0; i
< node
->children_count
; i
++) {
345 child_off
= trie_store_nodes(trie
, node
->children
[i
].child
);
350 children
[i
].c
= node
->children
[i
].c
;
351 children
[i
].child_off
= htole64(child_off
);
355 node_off
= ftello(trie
->f
);
356 fwrite(&n
, sizeof(struct trie_node_f
), 1, trie
->f
);
359 /* append children array */
360 if (node
->children_count
) {
361 fwrite(children
, sizeof(struct trie_child_entry_f
), node
->children_count
, trie
->f
);
362 trie
->children_count
+= node
->children_count
;
366 /* append values array */
367 for (i
= 0; i
< node
->values_count
; i
++) {
368 struct trie_value_entry2_f v
= {
369 .key_off
= htole64(trie
->strings_off
+ node
->values
[i
].key_off
),
370 .value_off
= htole64(trie
->strings_off
+ node
->values
[i
].value_off
),
371 .filename_off
= htole64(trie
->strings_off
+ node
->values
[i
].filename_off
),
372 .line_number
= htole32(node
->values
[i
].line_number
),
373 .file_priority
= htole16(node
->values
[i
].file_priority
),
376 fwrite(&v
, sizeof(struct trie_value_entry2_f
), 1, trie
->f
);
377 trie
->values_count
++;
383 static int trie_store(struct trie
*trie
, const char *filename
) {
387 _cleanup_free_
char *filename_tmp
= NULL
;
391 struct trie_header_f h
= {
392 .signature
= HWDB_SIG
,
393 .tool_version
= htole64(atoi(VERSION
)),
394 .header_size
= htole64(sizeof(struct trie_header_f
)),
395 .node_size
= htole64(sizeof(struct trie_node_f
)),
396 .child_entry_size
= htole64(sizeof(struct trie_child_entry_f
)),
397 .value_entry_size
= htole64(sizeof(struct trie_value_entry2_f
)),
401 /* calculate size of header, nodes, children entries, value entries */
402 t
.strings_off
= sizeof(struct trie_header_f
);
403 trie_store_nodes_size(&t
, trie
->root
);
405 err
= fopen_temporary(filename
, &t
.f
, &filename_tmp
);
408 fchmod(fileno(t
.f
), 0444);
411 err
= fseeko(t
.f
, sizeof(struct trie_header_f
), SEEK_SET
);
414 unlink_noerrno(filename_tmp
);
417 root_off
= trie_store_nodes(&t
, trie
->root
);
418 h
.nodes_root_off
= htole64(root_off
);
420 h
.nodes_len
= htole64(pos
- sizeof(struct trie_header_f
));
422 /* write string buffer */
423 fwrite(trie
->strings
->buf
, trie
->strings
->len
, 1, t
.f
);
424 h
.strings_len
= htole64(trie
->strings
->len
);
428 h
.file_size
= htole64(size
);
429 err
= fseeko(t
.f
, 0, SEEK_SET
);
432 unlink_noerrno(filename_tmp
);
435 fwrite(&h
, sizeof(struct trie_header_f
), 1, t
.f
);
440 if (err
< 0 || rename(filename_tmp
, filename
) < 0) {
441 unlink_noerrno(filename_tmp
);
442 return err
< 0 ? err
: -errno
;
445 log_debug("=== trie on-disk ===");
446 log_debug("size: %8"PRIi64
" bytes", size
);
447 log_debug("header: %8zu bytes", sizeof(struct trie_header_f
));
448 log_debug("nodes: %8"PRIu64
" bytes (%8"PRIu64
")",
449 t
.nodes_count
* sizeof(struct trie_node_f
), t
.nodes_count
);
450 log_debug("child pointers: %8"PRIu64
" bytes (%8"PRIu64
")",
451 t
.children_count
* sizeof(struct trie_child_entry_f
), t
.children_count
);
452 log_debug("value pointers: %8"PRIu64
" bytes (%8"PRIu64
")",
453 t
.values_count
* sizeof(struct trie_value_entry2_f
), t
.values_count
);
454 log_debug("string store: %8zu bytes", trie
->strings
->len
);
455 log_debug("strings start: %8"PRIu64
, t
.strings_off
);
460 static int insert_data(struct trie
*trie
, char **match_list
, char *line
,
461 const char *filename
, uint16_t file_priority
, uint32_t line_number
) {
462 char *value
, **entry
;
464 value
= strchr(line
, '=');
466 log_error("Error, key/value pair expected but got '%s' in '%s':", line
, filename
);
473 /* libudev requires properties to start with a space */
474 while (isblank(line
[0]) && isblank(line
[1]))
477 if (line
[0] == '\0' || value
[0] == '\0') {
478 log_error("Error, empty key or value '%s' in '%s':", line
, filename
);
482 STRV_FOREACH(entry
, match_list
)
483 trie_insert(trie
, trie
->root
, *entry
, line
, value
, filename
, file_priority
, line_number
);
488 static int import_file(struct trie
*trie
, const char *filename
, uint16_t file_priority
) {
494 _cleanup_fclose_
FILE *f
= NULL
;
496 _cleanup_strv_free_
char **match_list
= NULL
;
497 uint32_t line_number
= 0;
501 f
= fopen(filename
, "re");
505 while (fgets(line
, sizeof(line
), f
)) {
515 /* strip trailing comment */
516 pos
= strchr(line
, '#');
520 /* strip trailing whitespace */
522 while (len
> 0 && isspace(line
[len
-1]))
531 if (line
[0] == ' ') {
532 log_error("Error, MATCH expected but got '%s' in '%s':", line
, filename
);
536 /* start of record, first match */
539 match
= strdup(line
);
543 r
= strv_consume(&match_list
, match
);
551 log_error("Error, DATA expected but got empty line in '%s':", filename
);
553 strv_clear(match_list
);
558 if (line
[0] != ' ') {
559 match
= strdup(line
);
563 r
= strv_consume(&match_list
, match
);
572 insert_data(trie
, match_list
, line
, filename
, file_priority
, line_number
);
579 strv_clear(match_list
);
583 if (line
[0] != ' ') {
584 log_error("Error, DATA expected but got '%s' in '%s':", line
, filename
);
586 strv_clear(match_list
);
590 insert_data(trie
, match_list
, line
, filename
, file_priority
, line_number
);
598 static int hwdb_query(int argc
, char *argv
[], void *userdata
) {
599 _cleanup_(sd_hwdb_unrefp
) sd_hwdb
*hwdb
= NULL
;
600 const char *key
, *value
;
601 const char *modalias
;
609 r
= sd_hwdb_new(&hwdb
);
613 SD_HWDB_FOREACH_PROPERTY(hwdb
, modalias
, key
, value
)
614 printf("%s=%s\n", key
, value
);
619 static int hwdb_update(int argc
, char *argv
[], void *userdata
) {
620 _cleanup_free_
char *hwdb_bin
= NULL
;
621 _cleanup_(trie_freep
) struct trie
*trie
= NULL
;
623 uint16_t file_priority
= 1;
626 trie
= new0(struct trie
, 1);
631 trie
->strings
= strbuf_new();
636 trie
->root
= new0(struct trie_node
, 1);
642 r
= conf_files_list_strv(&files
, ".hwdb", arg_root
, conf_file_dirs
);
644 return log_error_errno(r
, "failed to enumerate hwdb files: %m");
646 STRV_FOREACH(f
, files
) {
647 log_debug("reading file '%s'", *f
);
648 import_file(trie
, *f
, file_priority
++);
652 strbuf_complete(trie
->strings
);
654 log_debug("=== trie in-memory ===");
655 log_debug("nodes: %8zu bytes (%8zu)",
656 trie
->nodes_count
* sizeof(struct trie_node
), trie
->nodes_count
);
657 log_debug("children arrays: %8zu bytes (%8zu)",
658 trie
->children_count
* sizeof(struct trie_child_entry
), trie
->children_count
);
659 log_debug("values arrays: %8zu bytes (%8zu)",
660 trie
->values_count
* sizeof(struct trie_value_entry
), trie
->values_count
);
661 log_debug("strings: %8zu bytes",
663 log_debug("strings incoming: %8zu bytes (%8zu)",
664 trie
->strings
->in_len
, trie
->strings
->in_count
);
665 log_debug("strings dedup'ed: %8zu bytes (%8zu)",
666 trie
->strings
->dedup_len
, trie
->strings
->dedup_count
);
668 hwdb_bin
= strjoin(arg_root
, "/", arg_hwdb_bin_dir
, "/hwdb.bin");
672 mkdir_parents_label(hwdb_bin
, 0755);
673 r
= trie_store(trie
, hwdb_bin
);
675 return log_error_errno(r
, "Failure writing database %s: %m", hwdb_bin
);
677 return label_fix(hwdb_bin
, false, false);
680 static void help(void) {
681 printf("Usage: %s OPTIONS COMMAND\n\n"
682 "Update or query the hardware database.\n\n"
683 " -h --help Show this help\n"
684 " --version Show package version\n"
685 " --usr Generate in " UDEVLIBEXECDIR
" instead of /etc/udev\n"
686 " -r --root=PATH Alternative root path in the filesystem\n\n"
688 " update Update the hwdb database\n"
689 " query MODALIAS Query database and print result\n",
690 program_invocation_short_name
);
693 static int parse_argv(int argc
, char *argv
[]) {
699 static const struct option options
[] = {
700 { "help", no_argument
, NULL
, 'h' },
701 { "version", no_argument
, NULL
, ARG_VERSION
},
702 { "usr", no_argument
, NULL
, ARG_USR
},
703 { "root", required_argument
, NULL
, 'r' },
712 while ((c
= getopt_long(argc
, argv
, "ut:r:h", options
, NULL
)) >= 0) {
723 arg_hwdb_bin_dir
= UDEVLIBEXECDIR
;
734 assert_not_reached("Unknown option");
741 static int hwdb_main(int argc
, char *argv
[]) {
742 const Verb verbs
[] = {
743 { "update", 1, 1, 0, hwdb_update
},
744 { "query", 2, 2, 0, hwdb_query
},
748 return dispatch_verb(argc
, argv
, verbs
, NULL
);
751 int main (int argc
, char *argv
[]) {
754 log_parse_environment();
757 r
= parse_argv(argc
, argv
);
763 r
= hwdb_main(argc
, argv
);
766 return r
< 0 ? EXIT_FAILURE
: EXIT_SUCCESS
;