+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 (!array_lock(trie->entries)) {
+ UNIXERR("mlock");
+ }
+ if (!array_lock(trie->c)) {
+ UNIXERR("mlock");
+ }
+ if (mlock(trie, sizeof(trie_t)) != 0) {
+ UNIXERR("mlock");
+ return;
+ }
+ trie->locked = true;
+}
+
+void trie_unlock(trie_t *trie)
+{
+ if (!trie->locked) {
+ return;
+ }
+ array_unlock(trie->entries);
+ array_unlock(trie->c);
+ munlock(trie, sizeof(trie_t));
+ trie->locked = false;
+}