42         size_t children_count;  member
52         uint8_t children_count;  member
82 …   child = reallocarray(node->children, node->children_count + 1, sizeof(struct trie_child_entry));  in node_add_child()
87         trie->children_count++;  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()
90         node->children_count++;  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()
112         for (size_t i = 0; i < node->children_count; i++)  in trie_node_cleanup()
217                                 .children_count = node->children_count,  in trie_insert()
283         uint64_t children_count;  member
289         for (uint64_t i = 0; i < node->children_count; i++)  in trie_store_nodes_size()
293         for (uint64_t i = 0; i < node->children_count; i++)  in trie_store_nodes_size()
302                 .children_count = node->children_count,  in trie_store_nodes()
308         if (node->children_count) {  in trie_store_nodes()
309                 children = new(struct trie_child_entry_f, node->children_count);  in trie_store_nodes()
315         for (uint64_t i = 0; i < node->children_count; i++) {  in trie_store_nodes()
334         if (node->children_count) {  in trie_store_nodes()
335                 fwrite(children, sizeof(struct trie_child_entry_f), node->children_count, trie->f);  in trie_store_nodes()
336                 trie->children_count += node->children_count;  in trie_store_nodes()
421                   t.children_count * sizeof(struct trie_child_entry_f), t.children_count);  in trie_store()
627                   trie->children_count * sizeof(struct trie_child_entry), trie->children_count);  in hwdb_update()