Lines Matching defs:RADIX_TREE_PTR_PER_NODE
57 * - the best case: about RADIX_TREE_PTR_PER_NODE items per intermediate node.
63 * [ | | | ] (intermediate node. RADIX_TREE_PTR_PER_NODE=4 in this fig)
141 #define RADIX_TREE_PTR_PER_NODE (1 << RADIX_TREE_BITS_PER_HEIGHT)
197 void *n_ptrs[RADIX_TREE_PTR_PER_NODE];
354 #if RADIX_TREE_PTR_PER_NODE > 16
358 for (i = 0, sum = 0; i < RADIX_TREE_PTR_PER_NODE; i++) {
362 #else /* RADIX_TREE_PTR_PER_NODE > 16 */
375 #if RADIX_TREE_PTR_PER_NODE > 4
381 #if RADIX_TREE_PTR_PER_NODE > 8
392 #endif /* RADIX_TREE_PTR_PER_NODE > 16 */
400 for (i = c = 0; i < RADIX_TREE_PTR_PER_NODE; i++) {
826 const unsigned int first = reverse ? RADIX_TREE_PTR_PER_NODE - 1 : 0;
827 const unsigned int last = reverse ? 0 : RADIX_TREE_PTR_PER_NODE - 1;
880 KASSERT(i < RADIX_TREE_PTR_PER_NODE);