Lines Matching defs:trie
27 * directory of files) into a single in-memory, lac-backed trie;
29 * - to optimize and serialize the in-memory trie to an fd;
32 * indexed by the trie, by a seeking around a serialized trie fd, without
100 * this is the main trie in-memory allocation object
127 /* there's only one of these per trie file */
289 /* file offset to root trie entry */
299 lwsl_err("%s: trie header write failed\n", __func__);
314 lws_fts_destroy(struct lws_fts **trie)
316 struct lwsac *lwsac_head = (*trie)->lwsac_head;
317 lwsac_free(&(*trie)->lwsac_input_head);
319 *trie = NULL;
642 * We created a trie entry for an earlier char in this
647 * the trie symbol at the end (when we know how much to
744 * We want to do this so we don't have to allocate trie entries
786 * parsing normally from this trie entry.
798 * start down this road. So for the current trie entry,
802 * current trie entry to turn it back to a 1-char match)
817 * Then we need to create a new child trie entry that
823 * attached to the original trie entry must be detached
891 * Lastly we need to create a new child trie
1209 * The trie entries in reverse order... because of the reversal, we have
1240 /* write the trie entry header */
1339 /* drop the correct root trie offset + file length into the header */