Lines Matching refs:radix_tree_gang_lookup_node
94 * radix_tree_gang_lookup_node function and its varients.
801 * a helper routine for radix_tree_gang_lookup_node and its variants.
917 * radix_tree_gang_lookup_node:
947 radix_tree_gang_lookup_node(struct radix_tree *t, uint64_t idx,
959 * Same as radix_tree_gang_lookup_node except that this one scans the
976 * Same as radix_tree_gang_lookup_node except that this one only returns
1197 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 0);
1198 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);
1199 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0);
1200 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0);
1235 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);
1238 assert(radix_tree_gang_lookup_node
1240 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0);
1241 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0);
1271 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);
1273 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);
1275 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 1);
1278 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 1);
1346 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 3);
1351 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);
1354 assert(radix_tree_gang_lookup_node(t, 1, results, 3, false) == 2);
1357 assert(radix_tree_gang_lookup_node(t, 1, results, 3, true) == 0);
1359 assert(radix_tree_gang_lookup_node(t, 1001, results, 3, false) == 1);
1361 assert(radix_tree_gang_lookup_node(t, 1001, results, 3, true) == 0);
1362 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,
1364 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000001), results, 3,
1366 assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,
1368 assert(radix_tree_gang_lookup_node(t, UINT64_C(1000000000000), results,
1383 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,
1388 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,
1583 while ((nfound = radix_tree_gang_lookup_node(t, nextidx,
1716 while ((nfound = radix_tree_gang_lookup_node(t, nextidx,