* Copyright © 2008 Florent Bruneau
*/
-#include <sys/mman.h>
-
#include "array.h"
#include "str.h"
#include "trie.h"
ARRAY(trie_entry_t)
struct trie_t {
- trie_entry_t_array_t entries;
- char_array_t c;
- char_array_t keys;
- int_array_t keys_offset;
+ A(trie_entry_t) entries;
+ A(char) c;
+ A(char) keys;
+ A(int) keys_offset;
bool locked;
};
return !!(strcmp(array_ptr(trie->c, entry->c_offset), key) == 0);
}
+static inline bool trie_entry_prefix(const trie_t *trie,
+ const trie_entry_t *entry, const char *key)
+{
+ return !!(strncmp(array_ptr(trie->c, entry->c_offset), key, entry->c_len) == 0);
+}
+
static inline bool trie_entry_is_leaf(const trie_entry_t *entry)
{
return entry->children_len == 0;
{
const trie_entry_t e = TRIE_ENTRY_INIT;
array_add(trie->entries, e);
- return trie->entries.len;
+ return trie->entries.len - 1;
}
static inline int trie_add_leaf(trie_t *trie, const char *key)
}
}
+bool trie_prefix(const trie_t *trie, const char *key)
+{
+ assert(trie->keys.len == 0L && "Can't lookup: trie not compiled");
+ if (trie->entries.len == 0) {
+ return false;
+ } else {
+ trie_entry_t *current = array_ptr(trie->entries, 0);
+ while (true) {
+ int pos = 0;
+ if (trie_entry_is_leaf(current)) {
+ return trie_entry_prefix(trie, current, key);
+ } else if (trie_entry_c_match(trie, current, key, &pos)) {
+ key += pos;
+ current = trie_entry_child(trie, current, key);
+ if (current == NULL) {
+ return false;
+ }
+ } else {
+ return false;
+ }
+ }
+ }
+}
+
void trie_lock(trie_t *trie)
{
if (trie->locked) {
return;
}
- if (mlock(trie->entries.data, sizeof(trie_entry_t) * trie->entries.len) != 0) {
+ if (!array_lock(trie->entries)) {
+ UNIXERR("mlock");
+ }
+ if (!array_lock(trie->c)) {
UNIXERR("mlock");
- return;
}
- if (mlock(trie->c.data, trie->c.len) != 0) {
+ if (mlock(trie, sizeof(trie_t)) != 0) {
UNIXERR("mlock");
- munlock(trie->entries.data, sizeof(trie_entry_t) * trie->entries.len);
return;
}
trie->locked = true;
if (!trie->locked) {
return;
}
- munlock(trie->entries.data, sizeof(trie_entry_t) * trie->entries.len);
- munlock(trie->c.data, trie->c.len);
+ array_unlock(trie->entries);
+ array_unlock(trie->c);
+ munlock(trie, sizeof(trie_t));
trie->locked = false;
}