diff options
author | Tavian Barnes <tavianator@tavianator.com> | 2023-05-10 15:43:31 -0400 |
---|---|---|
committer | Tavian Barnes <tavianator@tavianator.com> | 2023-05-10 15:43:31 -0400 |
commit | 3929ddedca049ac6f9dcbe88f85233b6ec1a415a (patch) | |
tree | 94d792e509ea480b26ef57e8f35b56015931a0a9 /src/trie.c | |
parent | 8368e139c176dcde3b125f4a180ff868729b1862 (diff) | |
download | bfs-3929ddedca049ac6f9dcbe88f85233b6ec1a415a.tar.xz |
config: s/BFS_FLEX_SIZEOF/flex_sizeof/
Diffstat (limited to 'src/trie.c')
-rw-r--r-- | src/trie.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -336,7 +336,7 @@ struct trie_leaf *trie_find_prefix(const struct trie *trie, const char *key) { /** Create a new leaf, holding a copy of the given key. */ static struct trie_leaf *trie_leaf_alloc(struct trie *trie, const void *key, size_t length) { - struct trie_leaf *leaf = malloc(BFS_FLEX_SIZEOF(struct trie_leaf, key, length)); + struct trie_leaf *leaf = malloc(flex_sizeof(struct trie_leaf, key, length)); if (!leaf) { return NULL; } @@ -363,7 +363,7 @@ static size_t trie_node_size(unsigned int size) { // Node size must be a power of two assert(is_power_of_two(size)); - return BFS_FLEX_SIZEOF(struct trie_node, children, size); + return flex_sizeof(struct trie_node, children, size); } #if defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ |