radix_tree_gang_lookup_node_reverse
assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==
assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==
assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)
assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==
assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==
assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)
assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false)
assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true)
assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)
assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001),
assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001),
while ((nfound = radix_tree_gang_lookup_node_reverse(t, nextidx,
unsigned int radix_tree_gang_lookup_node_reverse(struct radix_tree *, uint64_t,
(backward ? radix_tree_gang_lookup_node_reverse :