Searched refs:trie_child_entry_f (Results 1 – 3 of 3) sorted by relevance
103 static const struct trie_child_entry_f *trie_node_children(struct udev_hwdb *hwdb, const struct tri… in trie_node_children()104 … return (const struct trie_child_entry_f *)((const char *)node + le64toh(hwdb->head->node_size)); in trie_node_children()124 const struct trie_child_entry_f *n1 = v1; in trie_children_cmp_f()125 const struct trie_child_entry_f *n2 = v2; in trie_children_cmp_f()131 struct trie_child_entry_f *child; in node_lookup_f()132 struct trie_child_entry_f search; in node_lookup_f()167 const struct trie_child_entry_f *child = &trie_node_children(hwdb, node)[i]; in trie_fnmatch_f()
59 struct trie_child_entry_f { struct
287 trie->strings_off += sizeof(struct trie_child_entry_f); in trie_store_nodes_size()299 struct trie_child_entry_f *children = NULL; in trie_store_nodes()303 children = new0(struct trie_child_entry_f, node->children_count); in trie_store_nodes()328 fwrite(children, sizeof(struct trie_child_entry_f), node->children_count, trie->f); in trie_store_nodes()360 .child_entry_size = htole64(sizeof(struct trie_child_entry_f)), in trie_store()415 t.children_count * sizeof(struct trie_child_entry_f), t.children_count); in trie_store()