common/lib/libc/gen/radixtree.c

1197

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 0);

common/lib/libc/gen/radixtree.c

1198

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1199

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0);

common/lib/libc/gen/radixtree.c

1200

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1235

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1238

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);

common/lib/libc/gen/radixtree.c

1240

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0);

common/lib/libc/gen/radixtree.c

1241

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1271

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1273

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1275

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1278

assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 1);

common/lib/libc/gen/radixtree.c

1346

assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 3);

common/lib/libc/gen/radixtree.c

1351

assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);

common/lib/libc/gen/radixtree.c

1354

assert(radix_tree_gang_lookup_node(t, 1, results, 3, false) == 2);

common/lib/libc/gen/radixtree.c

1357

assert(radix_tree_gang_lookup_node(t, 1, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1359

assert(radix_tree_gang_lookup_node(t, 1001, results, 3, false) == 1);

common/lib/libc/gen/radixtree.c

1361

assert(radix_tree_gang_lookup_node(t, 1001, results, 3, true) == 0);

common/lib/libc/gen/radixtree.c

1362

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,

common/lib/libc/gen/radixtree.c

1364

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,

common/lib/libc/gen/radixtree.c

1366

assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,

common/lib/libc/gen/radixtree.c

1368

assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,

common/lib/libc/gen/radixtree.c

1383

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,

common/lib/libc/gen/radixtree.c

1388

assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,

common/lib/libc/gen/radixtree.c

1583

while ((nfound = radix_tree_gang_lookup_node(t, nextidx,

common/lib/libc/gen/radixtree.c

1716

while ((nfound = radix_tree_gang_lookup_node(t, nextidx,

sys/arch/x86/x86/pmap.c

3264

n = radix_tree_gang_lookup_node(&pmap->pm_obj[0].uo_pages, 0,

sys/sys/radixtree.h

69

unsigned int radix_tree_gang_lookup_node(struct radix_tree *, uint64_t,

sys/uvm/uvm_page_array.c

166

radix_tree_gang_lookup_node)(