1 /******************************************************************************/
2 /* pfixtools: a collection of postfix related tools */
4 /* ________________________________________________________________________ */
6 /* Redistribution and use in source and binary forms, with or without */
7 /* modification, are permitted provided that the following conditions */
10 /* 1. Redistributions of source code must retain the above copyright */
11 /* notice, this list of conditions and the following disclaimer. */
12 /* 2. Redistributions in binary form must reproduce the above copyright */
13 /* notice, this list of conditions and the following disclaimer in the */
14 /* documentation and/or other materials provided with the distribution. */
15 /* 3. The names of its contributors may not be used to endorse or promote */
16 /* products derived from this software without specific prior written */
19 /* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND */
20 /* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE */
21 /* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
22 /* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS */
23 /* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR */
24 /* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF */
25 /* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS */
26 /* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
27 /* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) */
28 /* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF */
29 /* THE POSSIBILITY OF SUCH DAMAGE. */
30 /******************************************************************************/
33 * Copyright © 2008 Florent Bruneau
41 typedef struct trie_entry_t trie_entry_t;
47 int32_t children_offset;
52 trie_entry_t *entries;
67 trie_t *trie_new(void)
69 return p_new(trie_t, 1);
72 static inline void trie_cleanup_build_data(trie_t *trie)
74 for (int i = 0 ; i < trie->keys_len ; ++i) {
75 p_delete(&trie->keys[i]);
77 p_delete(&trie->keys);
78 trie->keys_len = trie->keys_size = 0;
81 void trie_delete(trie_t **trie)
84 trie_cleanup_build_data(*trie);
85 p_delete(&(*trie)->entries);
86 p_delete(&(*trie)->c);
91 /** Check that the given entry is a prefix for the given key.
93 static inline bool trie_entry_c_match(const trie_t *trie,
94 const trie_entry_t *entry,
95 const char *key, int *pos)
97 const char *c = trie->c + entry->c_offset;
99 for (i = 0 ; i < entry->c_len ; ++i) {
100 if (key[i] != c[i]) {
113 static inline bool trie_entry_match(const trie_t *trie,
114 const trie_entry_t *entry, const char *key)
116 return !!(strcmp(trie->c + entry->c_offset, key) == 0);
119 static inline bool trie_entry_is_leaf(const trie_entry_t *entry)
121 return entry->children_len == 0;
124 /** Lookup for a child of entry matching the given entry at the given pos.
125 * Only the first character of the children is taken into account in the
126 * lookup. The current entry is assumed to match the key.
128 static inline trie_entry_t* trie_entry_child(const trie_t *trie,
129 const trie_entry_t* entry,
132 int start = entry->children_offset;
133 int end = start + entry->children_len;
136 while (start < end) {
137 int mid = (start + end) / 2;
138 trie_entry_t* child = &trie->entries[mid];
139 const char c2 = trie->c[child->c_offset];
157 #define GROW(Buffer, Added, Len, Size) \
159 const int required_size = (Len) + (Added); \
160 int next_size = (Size); \
161 if (next_size >= required_size) { \
165 next_size = p_alloc_nr(next_size); \
166 } while (next_size < required_size); \
167 p_allocgrow(&(Buffer), next_size, &(Size)); \
170 static inline void trie_grow(trie_t *trie, int delta)
172 GROW(trie->entries, delta, trie->entries_len, trie->entries_size);
175 static inline int trie_entry_new(trie_t *trie)
177 memset(trie->entries + trie->entries_len, 0, sizeof(trie_entry_t));
178 return trie->entries_len++;
181 static inline int trie_add_leaf(trie_t *trie, const char *key)
184 int len = m_strlen(key) + 1;
185 entry = &trie->entries[trie_entry_new(trie)];
186 GROW(trie->c, len, trie->c_len, trie->c_size);
187 memcpy(trie->c + trie->c_len, key, len);
188 entry->c_offset = trie->c_len;
191 return trie->entries_len - 1;
194 static inline void trie_entry_insert_child(trie_t *trie, trie_entry_t *entry,
197 if (entry->children_len == 0) {
198 entry->children_offset = pchild;
199 entry->children_len = 1;
201 if (entry->children_offset + entry->children_len != pchild) {
202 printf("Inserting child %d while offset is %d[%d]\n",
203 pchild, entry->children_offset, entry->children_len);
206 ++entry->children_len;
210 static inline void trie_entry_split(trie_t *trie, trie_entry_t *entry, int pos)
213 child = &trie->entries[trie_entry_new(trie)];
215 child->c_offset = entry->c_offset;
216 child->c_len = entry->c_len;
220 child->c_offset = entry->c_offset + pos;
221 child->c_len = entry->c_len - pos;
224 child->children_offset = entry->children_offset;
225 child->children_len = entry->children_len;
226 entry->children_offset = trie->entries_len - 1;
227 entry->children_len = 1;
230 void trie_insert(trie_t *trie, const char* key)
232 GROW(trie->keys, 1, trie->keys_len, trie->keys_size);
233 trie->keys[trie->keys_len++] = strdup(key);
237 static inline void trie_compile_aux(trie_t *trie, int id,
238 int first_key, int last_key, int offset,
245 for (int off_diff = initial_diff ; fork_pos == 0 ; ++off_diff, ++offset) {
246 current = trie->keys[first_key][offset];
247 for (int i = first_key + 1 ; i < last_key ; ++i) {
248 if (trie->keys[i][offset] != current) {
251 trie_entry_split(trie, &trie->entries[id], off_diff);
253 trie_entry_insert_child(trie, &trie->entries[id],
254 trie_add_leaf(trie, trie->keys[i] +
256 forks[fork_pos++] = i;
257 current = trie->keys[i][offset];
260 if (fork_pos == 0 && current == '\0') {
264 forks[fork_pos] = last_key;
266 const int children_len = trie->entries[id].children_len;
267 for (int i = 0 ; i < children_len ; ++i) {
268 int child = trie->entries[id].children_offset + i;
269 if (forks[i] - 1 > first_key) {
270 trie_compile_aux(trie, child, first_key, forks[i], offset, 1);
272 first_key = forks[i];
277 static inline void trie_shrink(trie_t *trie)
279 p_shrink(&trie->entries, trie->entries_len, &trie->entries_size);
280 p_shrink(&trie->c, trie->c_len, &trie->c_size);
283 static inline void trie_lock(trie_t *trie)
285 if (mlock(trie->entries, sizeof(trie_entry_t) * trie->entries_len) != 0) {
289 if (mlock(trie->c, trie->c_len) != 0) {
291 munlock(trie->entries, sizeof(trie_entry_t) * trie->entries_len);
299 void trie_compile(trie_t *trie, bool memlock)
302 # define QSORT_TYPE str_t
303 # define QSORT_BASE trie->keys
304 # define QSORT_NELT trie->keys_len
305 # define QSORT_LT(a,b) strcmp(*a, *b) < 0
309 trie_grow(trie, trie->keys_len);
310 trie_compile_aux(trie, trie_add_leaf(trie, trie->keys[0]),
311 0, trie->keys_len, 0, 0);
312 trie_cleanup_build_data(trie);
319 bool trie_lookup(const trie_t *trie, const char *key)
321 if (trie->entries_len == 0) {
324 trie_entry_t *current = trie->entries;
327 if (trie_entry_is_leaf(current)) {
328 return trie_entry_match(trie, current, key);
329 } else if (trie_entry_c_match(trie, current, key, &pos)) {
331 current = trie_entry_child(trie, current, key);
332 if (current == NULL) {
346 static inline void trie_entry_inspect(const trie_t *trie, bool show_content,
347 const trie_entry_t *entry, int level)
349 static int max_depth = 0;
350 static int leaves = 0;
351 static int depth_sum = 0;
353 if (trie_entry_is_leaf(entry)) {
354 if (level > max_depth) {
361 for (int i = 0 ; i < level ; ++i) {
364 if (entry->c_len == 0) {
365 fputs("(nil)", stdout);
367 const char *c = trie->c + entry->c_offset;
368 printf("(%d) ", entry->c_len);
369 for (int i = 0 ; i < entry->c_len ; ++i) {
373 fputs("\\0 ", stdout);
379 for (int i = entry->children_offset ;
380 i < entry->children_offset + entry->children_len ; ++i) {
381 trie_entry_inspect(trie, show_content, &trie->entries[i], level + 1);
384 printf("Average char per node: %d\n", trie->c_len / trie->entries_len);
385 printf("Number of nodes: %d\n", trie->entries_len);
386 printf("Number of leaves: %d\n", leaves);
387 printf("Max depth: %d\n", max_depth);
388 printf("Average leaf depth: %d\n", depth_sum / leaves);
389 printf("Memory used: %d\n", (trie->entries_size * sizeof(trie_entry_t))
390 + (trie->c_size) + sizeof(trie_t));
394 void trie_inspect(const trie_t *trie, bool show_content)
396 trie_entry_inspect(trie, show_content, trie->entries, 0);