51         struct trie_child_entry *children;  member
82 …   child = reallocarray(node->children, node->children_count + 1, sizeof(struct trie_child_entry));  in node_add_child()
86         node->children = child;  in node_add_child()
88         node->children[node->children_count].c = c;  in node_add_child()
89         node->children[node->children_count].child = node_child;  in node_add_child()
91         typesafe_qsort(node->children, node->children_count, trie_children_cmp);  in node_add_child()
102         child = typesafe_bsearch(&search, node->children, node->children_count, trie_children_cmp);  in node_lookup()
113                 trie_node_cleanup(node->children[i].child);  in trie_node_cleanup()
114         free(node->children);  in trie_node_cleanup()
216                                 .children = node->children,  in trie_insert()
290                 trie_store_nodes_size(trie, node->children[i].child, compat);  in trie_store_nodes_size()
305         _cleanup_free_ struct trie_child_entry_f *children = NULL;  in trie_store_nodes()  local
309                 children = new(struct trie_child_entry_f, node->children_count);  in trie_store_nodes()
310                 if (!children)  in trie_store_nodes()
318                 child_off = trie_store_nodes(trie, node->children[i].child, compat);  in trie_store_nodes()
322                 children[i] = (struct trie_child_entry_f) {  in trie_store_nodes()
323                         .c = node->children[i].c,  in trie_store_nodes()
335                 fwrite(children, sizeof(struct trie_child_entry_f), node->children_count, trie->f);  in trie_store_nodes()