Lines Matching refs:RADIX_TREE_PTR_PER_NODE
51 * the best case: about RADIX_TREE_PTR_PER_NODE items per intermediate node.
97 #define RADIX_TREE_PTR_PER_NODE (1 << RADIX_TREE_BITS_PER_HEIGHT)
156 void *n_ptrs[RADIX_TREE_PTR_PER_NODE];
173 for (i = 0; i < RADIX_TREE_PTR_PER_NODE; i++) {
307 for (i = 0; i < RADIX_TREE_PTR_PER_NODE; i++) {
467 KASSERT(n->n_nptrs < RADIX_TREE_PTR_PER_NODE);
482 KASSERT(n->n_nptrs < RADIX_TREE_PTR_PER_NODE);
687 const unsigned int first = reverse ? RADIX_TREE_PTR_PER_NODE - 1 : 0;
688 const unsigned int last = reverse ? 0 : RADIX_TREE_PTR_PER_NODE - 1;
744 KASSERT(i < RADIX_TREE_PTR_PER_NODE);