bool locked;
};
-
trie_t *trie_new()
{
return p_new(trie_t, 1);
next_size = p_alloc_nr(next_size);
} while (trie->entries_len + delta > next_size);
p_allocgrow(&trie->entries, next_size, &trie->entries_size);
- printf("After grow: %d\n", trie->entries_size);
}
static inline int trie_entry_new(trie_t *trie)
{
trie_entry_t *entry;
entry = &trie->entries[trie_entry_new(trie)];
- entry->c = m_strdup(key);
+ entry->c = strdup(key); /* don't use m_strdup
+ since m_strdup("") == NULL */
entry->c_len = m_strlen(key) + 1;
entry->c_own = true;
return trie->entries_len - 1;