Searched refs:trie_child_entry_f (Results 1 – 3 of 3) sorted by relevance
67 static const struct trie_child_entry_f *trie_node_child(sd_hwdb *hwdb, const struct trie_node_f *no… in trie_node_child()72 return (const struct trie_child_entry_f *)base; in trie_node_child()93 const struct trie_child_entry_f *n1 = v1; in trie_children_cmp_f()94 const struct trie_child_entry_f *n2 = v2; in trie_children_cmp_f()100 struct trie_child_entry_f *child; in node_lookup_f()101 struct trie_child_entry_f search; in node_lookup_f()194 const struct trie_child_entry_f *child = trie_node_child(hwdb, node, i); in trie_fnmatch_f()
60 struct trie_child_entry_f { struct
294 trie->strings_off += sizeof(struct trie_child_entry_f); in trie_store_nodes_size()305 _cleanup_free_ struct trie_child_entry_f *children = NULL; in trie_store_nodes()309 children = new(struct trie_child_entry_f, node->children_count); in trie_store_nodes()322 children[i] = (struct trie_child_entry_f) { in trie_store_nodes()335 fwrite(children, sizeof(struct trie_child_entry_f), node->children_count, trie->f); in trie_store_nodes()369 .child_entry_size = htole64(sizeof(struct trie_child_entry_f)), in trie_store()421 t.children_count * sizeof(struct trie_child_entry_f), t.children_count); in trie_store()