* Copyright © 2008 Florent Bruneau
*/
-#include <sys/mman.h>
-
#include "array.h"
#include "str.h"
#include "trie.h"
{
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)
if (trie->locked) {
return;
}
- if (mlock(trie->entries.data, sizeof(trie_entry_t) * trie->entries.len) != 0) {
+ if (!array_lock(trie->entries)) {
UNIXERR("mlock");
return;
}
- if (mlock(trie->c.data, trie->c.len) != 0) {
+ if (!array_lock(trie->c)) {
UNIXERR("mlock");
- munlock(trie->entries.data, sizeof(trie_entry_t) * trie->entries.len);
+ array_unlock(trie->entries);
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->entries);
trie->locked = false;
}