509           const uint64_t mask = (UINT64_C(1) << RADIX_TREE_BITS_PER_HEIGHT) - 1;  in radix_tree_lookup_ptr()
1171                         offset + i * (UINT64_C(1) <<  in radix_tree_dump_node()
1316           assert(radix_tree_insert_node(t, UINT64_C(10000000000), (void *)0xdea0)  in test1()
1321           assert(radix_tree_lookup_node(t, UINT64_C(10000000000)) ==  in test1()
1326           assert(!radix_tree_get_tag(t, UINT64_C(10000000000), 1));  in test1()
1328           radix_tree_set_tag(t, UINT64_C(10000000000), 2);  in test1()
1332           assert(radix_tree_get_tag(t, UINT64_C(10000000000), 2));  in test1()
1334           radix_tree_clear_tag(t, UINT64_C(10000000000), 2);  in test1()
1338           assert(!radix_tree_get_tag(t, UINT64_C(10000000000), 2));  in test1()
1362           assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,  in test1()
1364           assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,  in test1()
1366           assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,  in test1()
1368           assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,  in test1()
1380           assert(radix_tree_insert_node(t, UINT64_C(10000000001), (void *)0xfff0)  in test1()
1383           assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,  in test1()
1388           assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,  in test1()
1393           assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001),  in test1()
1399           assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001),  in test1()
1403           assert(radix_tree_remove_node(t, UINT64_C(10000000000)) ==  in test1()
1405           assert(radix_tree_remove_node(t, UINT64_C(10000000001)) ==  in test1()