Function cb_each

cbtree.c:121–150

}

int cb_each(struct cb_tree *t, const uint8_t *kpfx, size_t klen,
	    cb_iter fn, void *arg)
{
	struct cb_node *p = t->root;
	struct cb_node *top = p;
	size_t i = 0;
	uint8_t *p_key;

	if (!p)
		return 0; /* empty tree */

	/* Walk tree, maintaining top pointer */
	while (1 & (uintptr_t)p) {
		struct cb_node *q = cb_node_of(p);
		uint8_t c = q->byte < klen ? kpfx[q->byte] : 0;
		size_t direction = (1 + (q->otherbits | c)) >> 8;

		p = q->child[direction];
		if (q->byte < klen)
			top = p;
	}

	p_key = cb_node_key(t, p);
	for (i = 0; i < klen; i++) {
		if (p_key[i] != kpfx[i])
			return 0; /* "best" match failed */
	}

	return cb_descend(top, fn, arg);
}