Lines Matching refs:trie_node
38 struct trie_node *root;
46 struct trie_node { struct
62 struct trie_node *child; argument
78 static int node_add_child(struct trie *trie, struct trie_node *node, struct trie_node *node_child, … in node_add_child()
97 static struct trie_node *node_lookup(const struct trie_node *node, uint8_t c) { in node_lookup()
108 static void trie_node_cleanup(struct trie_node *node) { in trie_node_cleanup()
135 static int trie_node_add_value(struct trie *trie, struct trie_node *node, in trie_node_add_value()
190 static int trie_insert(struct trie *trie, struct trie_node *node, const char *search, in trie_insert()
198 struct trie_node *child; in trie_insert()
201 _cleanup_free_ struct trie_node *new_child = NULL; in trie_insert()
209 new_child = new(struct trie_node, 1); in trie_insert()
214 *new_child = (struct trie_node) { in trie_insert()
231 *node = (struct trie_node) { in trie_insert()
249 _cleanup_free_ struct trie_node *new_child = NULL; in trie_insert()
253 new_child = new(struct trie_node, 1); in trie_insert()
261 *new_child = (struct trie_node) { in trie_insert()
288 static void trie_store_nodes_size(struct trie_f *trie, struct trie_node *node, bool compat) { in trie_store_nodes_size()
299 static int64_t trie_store_nodes(struct trie_f *trie, struct trie_node *node, bool compat) { in trie_store_nodes()
604 trie->root = new0(struct trie_node, 1); in hwdb_update()
625 trie->nodes_count * sizeof(struct trie_node), trie->nodes_count); in hwdb_update()