Lines Matching refs:radix_tree_lookup_node
765 * radix_tree_lookup_node:
772 radix_tree_lookup_node(struct radix_tree *t, uint64_t idx)
927 * indexes. I.e. an index for which radix_tree_lookup_node would returns NULL.
932 * obtained by repeated calls of radix_tree_lookup_node with increasing index.
1195 assert(radix_tree_lookup_node(t, 0) == NULL);
1196 assert(radix_tree_lookup_node(t, 1000) == NULL);
1232 assert(radix_tree_lookup_node(t, 0) == (void *)0xdeadbea0);
1233 assert(radix_tree_lookup_node(t, 1000) == NULL);
1268 assert(radix_tree_lookup_node(t, 0) == NULL);
1269 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
1311 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
1314 assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0);
1315 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
1319 assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0);
1320 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
1321 assert(radix_tree_lookup_node(t, UINT64_C(10000000000)) ==
1494 while (radix_tree_lookup_node(t, n->idx) != NULL) {
1514 assert(radix_tree_lookup_node(t, n->idx) == n);