101         struct trie_child_entry_f search;  in node_lookup_f()  local
103         search.c = c;  in node_lookup_f()
104 …child = bsearch(&search, (const char *)node + le64toh(hwdb->head->node_size), node->children_count,  in node_lookup_f()
183                           struct linebuf *buf, const char *search) {  in trie_fnmatch_f()  argument
197 …            err = trie_fnmatch_f(hwdb, trie_node_from_off(hwdb, child->child_off), 0, buf, search);  in trie_fnmatch_f()
203         if (le64toh(node->values_count) && fnmatch(linebuf_get(buf), search, 0) == 0)  in trie_fnmatch_f()
214 static int trie_search_f(sd_hwdb *hwdb, const char *search) {  in trie_search_f()  argument
232                                         return trie_fnmatch_f(hwdb, node, p, &buf, search + i + p);  in trie_search_f()
233                                 if (c != search[i + p])  in trie_search_f()
242                         err = trie_fnmatch_f(hwdb, child, 0, &buf, search + i);  in trie_search_f()
251                         err = trie_fnmatch_f(hwdb, child, 0, &buf, search + i);  in trie_search_f()
260                         err = trie_fnmatch_f(hwdb, child, 0, &buf, search + i);  in trie_search_f()
266                 if (search[i] == '\0') {  in trie_search_f()
277                 child = node_lookup_f(hwdb, node, search[i]);  in trie_search_f()