Lines Matching defs:succ
690 struct pctrie_node *succ;
697 * the trie, we use "succ" to remember the last branching-off point,
704 * "succ". If "succ" is not NULL, then that lookup is guaranteed to
707 succ = NULL;
720 succ = node;
731 succ = node;
740 if (succ == NULL)
742 if (succ != node) {
747 slot = pctrie_slot(succ, index) + 1;
748 KASSERT((succ->pn_popmap >> slot) != 0,
750 __func__, slot, succ));
751 slot += ffs(succ->pn_popmap >> slot) - 1;
752 succ = pctrie_node_load(&succ->pn_child[slot], NULL,
757 * Find the value in the subtree rooted at "succ" with the least index.
759 while (!pctrie_isleaf(succ)) {
760 KASSERT(succ->pn_popmap != 0,
761 ("%s: no popmap children in node %p", __func__, succ));
762 slot = ffs(succ->pn_popmap) - 1;
763 succ = pctrie_node_load(&succ->pn_child[slot], NULL,
766 return (pctrie_toval(succ));