70         base += le64toh(hwdb->head->node_size);  in trie_node_child()
71         base += idx * le64toh(hwdb->head->child_entry_size);  in trie_node_child()
78         base += le64toh(hwdb->head->node_size);  in trie_node_value()
79         base += node->children_count * le64toh(hwdb->head->child_entry_size);  in trie_node_value()
80         base += idx * le64toh(hwdb->head->value_entry_size);  in trie_node_value()
85         return (const struct trie_node_f *)(hwdb->map + le64toh(off));  in trie_node_from_off()
89         return hwdb->map + le64toh(off);  in trie_string()
104 …child = bsearch(&search, (const char *)node + le64toh(hwdb->head->node_size), node->children_count,  in node_lookup_f()
105                         le64toh(hwdb->head->child_entry_size), trie_children_cmp_f);  in node_lookup_f()
128         if (le64toh(hwdb->head->value_entry_size) >= sizeof(struct trie_value_entry2_f)) {  in hwdb_add_property()
203         if (le64toh(node->values_count) && fnmatch(linebuf_get(buf), search, 0) == 0)  in trie_fnmatch_f()
204                 for (i = 0; i < le64toh(node->values_count); i++) {  in trie_fnmatch_f()
269                         for (n = 0; n < le64toh(node->values_count); n++) {  in trie_search_f()
325             (size_t) hwdb->st.st_size != le64toh(hwdb->head->file_size))  in sd_hwdb_new()
331         log_debug("tool version:          %"PRIu64, le64toh(hwdb->head->tool_version));  in sd_hwdb_new()
333         log_debug("header size       %8"PRIu64" bytes", le64toh(hwdb->head->header_size));  in sd_hwdb_new()
334         log_debug("strings           %8"PRIu64" bytes", le64toh(hwdb->head->strings_len));  in sd_hwdb_new()
335         log_debug("nodes             %8"PRIu64" bytes", le64toh(hwdb->head->nodes_len));  in sd_hwdb_new()