Lines Matching refs:values_count
43 size_t values_count; member
56 size_t values_count; member
154 if (node->values_count) { in trie_node_add_value()
160 … val = typesafe_bsearch_r(&search, node->values, node->values_count, trie_values_cmp, trie); in trie_node_add_value()
173 val = reallocarray(node->values, node->values_count + 1, sizeof(struct trie_value_entry)); in trie_node_add_value()
176 trie->values_count++; in trie_node_add_value()
178 node->values[node->values_count] = (struct trie_value_entry) { in trie_node_add_value()
185 node->values_count++; in trie_node_add_value()
186 typesafe_qsort_r(node->values, node->values_count, trie_values_cmp, trie); in trie_node_add_value()
219 .values_count = node->values_count, in trie_insert()
284 uint64_t values_count; member
295 for (uint64_t i = 0; i < node->values_count; i++) in trie_store_nodes_size()
303 .values_count = htole64(node->values_count), in trie_store_nodes()
340 for (uint64_t i = 0; i < node->values_count; i++) { in trie_store_nodes()
351 trie->values_count += node->values_count; in trie_store_nodes()
423 …t.values_count * (compat ? sizeof(struct trie_value_entry_f) : sizeof(struct trie_value_entry2_f))… in trie_store()
629 trie->values_count * sizeof(struct trie_value_entry), trie->values_count); in hwdb_update()