62         struct trie_node *child;  member
79         struct trie_child_entry *child;  in node_add_child()  local
82 …   child = reallocarray(node->children, node->children_count + 1, sizeof(struct trie_child_entry));  in node_add_child()
83         if (!child)  in node_add_child()
86         node->children = child;  in node_add_child()
89         node->children[node->children_count].child = node_child;  in node_add_child()
98         struct trie_child_entry *child;  in node_lookup()  local
102         child = typesafe_bsearch(&search, node->children, node->children_count, trie_children_cmp);  in node_lookup()
103         if (child)  in node_lookup()
104                 return child->child;  in node_lookup()
113                 trie_node_cleanup(node->children[i].child);  in trie_node_cleanup()
198                 struct trie_node *child;  in trie_insert()  local
247                 child = node_lookup(node, c);  in trie_insert()
248                 if (!child) {  in trie_insert()
269                         child = TAKE_PTR(new_child);  in trie_insert()
270 … return trie_node_add_value(trie, child, key, value, filename, file_priority, line_number, compat);  in trie_insert()
273                 node = child;  in trie_insert()
290                 trie_store_nodes_size(trie, node->children[i].child, compat);  in trie_store_nodes_size()
318                 child_off = trie_store_nodes(trie, node->children[i].child, compat);  in trie_store_nodes()