common/lib/libc/gen/radixtree.c

197

void *n_ptrs[RADIX_TREE_PTR_PER_NODE];

common/lib/libc/gen/radixtree.c

354

#if RADIX_TREE_PTR_PER_NODE > 16

common/lib/libc/gen/radixtree.c

358

for (i = 0, sum = 0; i < RADIX_TREE_PTR_PER_NODE; i++) {

common/lib/libc/gen/radixtree.c

375

#if RADIX_TREE_PTR_PER_NODE > 4

common/lib/libc/gen/radixtree.c

381

#if RADIX_TREE_PTR_PER_NODE > 8

common/lib/libc/gen/radixtree.c

400

for (i = c = 0; i < RADIX_TREE_PTR_PER_NODE; i++) {

common/lib/libc/gen/radixtree.c

826

const unsigned int first = reverse ? RADIX_TREE_PTR_PER_NODE - 1 : 0;

common/lib/libc/gen/radixtree.c

827

const unsigned int last = reverse ? 0 : RADIX_TREE_PTR_PER_NODE - 1;

common/lib/libc/gen/radixtree.c

880

KASSERT(i < RADIX_TREE_PTR_PER_NODE);