radix_tree_lookup_node
assert(radix_tree_lookup_node(t, 0) == NULL);
assert(radix_tree_lookup_node(t, 1000) == NULL);
assert(radix_tree_lookup_node(t, 0) == (void *)0xdeadbea0);
assert(radix_tree_lookup_node(t, 1000) == NULL);
assert(radix_tree_lookup_node(t, 0) == NULL);
assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0);
assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0);
assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
assert(radix_tree_lookup_node(t, UINT64_C(10000000000)) ==
while (radix_tree_lookup_node(t, n->idx) != NULL) {
assert(radix_tree_lookup_node(t, n->idx) == n);
pg = radix_tree_lookup_node(&uobj->uo_pages, off >> PAGE_SHIFT);
void *radix_tree_lookup_node(struct radix_tree *, uint64_t);
pg = radix_tree_lookup_node(&obj->uo_pages, off >> PAGE_SHIFT);