/* find node in trie and keep node stack (if slen > 0) */
static node_ptr hattrie_find_ns(node_ptr **s, size_t *sp, size_t slen,
const char **key, size_t *len)
{
assert(*(*s)[*sp].flag & NODE_TYPE_TRIE);
if (*len == 0) return (*s)[*sp]; /* parent, as sp == 0 */
node_ptr node = hattrie_consume_ns(s, sp, slen, key, len, 1);
/* using pure trie and couldn't find the key, return stack top */
if (node.flag == NULL) {
node = (*s)[*sp];
}
/* if the trie node consumes value, use it */
if (*node.flag & NODE_TYPE_TRIE) {
if (!(node.t->flag & NODE_HAS_VAL)) {
node.flag = NULL;
}
return node;
}
/* pure bucket holds only key suffixes, skip current char */
if (*node.flag & NODE_TYPE_PURE_BUCKET) {
++*key;
--*len;
}
/* do not scan bucket, it's not needed for this operation */
return node;
}
/*! \brief Consume key. */
static inline node_ptr hattrie_consume(node_ptr *parent, const char **key,
size_t *key_len, unsigned min_len)
{
size_t sp = 0;
return hattrie_consume_ns(&parent, &sp, 0, key, key_len, min_len);
}
static inline node_ptr hattrie_consume(node_ptr *parent, const char **k,
size_t *l, unsigned brk)
{
size_t sp = 0;
return hattrie_consume_ns(&parent, &sp, 0, k, l, brk);
}
