Lines Matching defs:results
807 void **results, const unsigned int maxresults, const unsigned int tagmask,
858 results[nfound] = entry_ptr(*vpp);
922 * results should be an array large enough to hold maxresults pointers.
942 * In the case of dense == true, a node returned via results[N] is always for
948 void **results, unsigned int maxresults, bool dense)
953 return gang_lookup_scan(t, &path, results, maxresults, 0, false, dense);
965 void **results, unsigned int maxresults, bool dense)
970 return gang_lookup_scan(t, &path, results, maxresults, 0, true, dense);
984 void **results, unsigned int maxresults, bool dense, unsigned int tagmask)
990 return gang_lookup_scan(t, &path, results, maxresults, tagmask, false,
1003 void **results, unsigned int maxresults, bool dense, unsigned int tagmask)
1009 return gang_lookup_scan(t, &path, results, maxresults, tagmask, true,
1191 void *results[3];
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);
1201 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==
1203 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==
1205 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
1207 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)
1209 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1)
1211 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1)
1213 assert(radix_tree_gang_lookup_tagged_node(t, 1000, results, 3, false, 1)
1215 assert(radix_tree_gang_lookup_tagged_node(t, 1000, results, 3, true, 1)
1217 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,
1219 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,
1221 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 1000, results, 3,
1223 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 1000, results, 3,
1234 memset(results, 0, sizeof(results));
1235 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);
1236 assert(results[0] == (void *)0xdeadbea0);
1237 memset(results, 0, sizeof(results));
1238 results, 3, true) == 1);
1239 assert(results[0] == (void *)0xdeadbea0);
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);
1242 memset(results, 0, sizeof(results));
1243 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==
1245 assert(results[0] == (void *)0xdeadbea0);
1246 memset(results, 0, sizeof(results));
1247 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==
1249 assert(results[0] == (void *)0xdeadbea0);
1250 memset(results, 0, sizeof(results));
1251 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
1253 assert(results[0] == (void *)0xdeadbea0);
1254 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)
1256 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1)
1258 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1)
1260 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,
1262 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,
1270 memset(results, 0, sizeof(results));
1271 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);
1272 assert(results[0] == (void *)0xdeadbea0);
1273 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0);
1274 memset(results, 0, sizeof(results));
1275 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 1);
1276 assert(results[0] == (void *)0xdeadbea0);
1277 memset(results, 0, sizeof(results));
1278 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 1);
1279 assert(results[0] == (void *)0xdeadbea0);
1280 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false)
1282 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true)
1284 memset(results, 0, sizeof(results));
1285 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
1287 memset(results, 0, sizeof(results));
1288 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true)
1290 assert(results[0] == (void *)0xdeadbea0);
1291 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1)
1293 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1)
1295 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,
1297 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3,
1345 memset(results, 0, sizeof(results));
1346 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 3);
1347 assert(results[0] == (void *)0xbea0);
1348 assert(results[1] == (void *)0x12345678);
1349 assert(results[2] == (void *)0xdea0);
1350 memset(results, 0, sizeof(results));
1351 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);
1352 assert(results[0] == (void *)0xbea0);
1353 memset(results, 0, sizeof(results));
1354 assert(radix_tree_gang_lookup_node(t, 1, results, 3, false) == 2);
1355 assert(results[0] == (void *)0x12345678);
1356 assert(results[1] == (void *)0xdea0);
1357 assert(radix_tree_gang_lookup_node(t, 1, results, 3, true) == 0);
1358 memset(results, 0, sizeof(results));
1359 assert(radix_tree_gang_lookup_node(t, 1001, results, 3, false) == 1);
1360 assert(results[0] == (void *)0xdea0);
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,
1370 memset(results, 0, sizeof(results));
1371 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 100, false, 2)
1373 assert(results[0] == (void *)0x12345678);
1374 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 100, true, 2)
1382 memset(results, 0, sizeof(results));
1383 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,
1385 assert(results[0] == (void *)0xdea0);
1386 assert(results[1] == (void *)0xfff0);
1387 memset(results, 0, sizeof(results));
1388 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3,
1390 assert(results[0] == (void *)0xdea0);
1391 assert(results[1] == (void *)0xfff0);
1392 memset(results, 0, sizeof(results));
1394 results, 3, false) == 3);
1395 assert(results[0] == (void *)0xfff0);
1396 assert(results[1] == (void *)0xdea0);
1397 assert(results[2] == (void *)0xbea0);
1398 memset(results, 0, sizeof(results));
1400 results, 3, true) == 2);
1401 assert(results[0] == (void *)0xfff0);
1402 assert(results[1] == (void *)0xdea0);
1576 struct testnode *results[TEST2_GANG_LOOKUP_NODES];
1584 (void *)results, __arraycount(results), false)) > 0) {
1585 nextidx = results[nfound - 1]->idx + 1;
1598 struct testnode *results[TEST2_GANG_LOOKUP_NODES];
1606 (void *)results, __arraycount(results), false)) > 0) {
1607 nextidx = results[nfound - 1]->idx - 1;
1623 struct testnode *results[TEST2_GANG_LOOKUP_NODES];
1629 nextidx, (void *)results, __arraycount(results),
1631 nextidx = results[nfound - 1]->idx + 1;
1646 struct testnode *results[TEST2_GANG_LOOKUP_NODES];
1653 nextidx, (void *)results, __arraycount(results),
1655 nextidx = results[nfound - 1]->idx - 1;
1677 struct testnode *results[TEST2_GANG_LOOKUP_NODES];
1683 nextidx, (void *)results, __arraycount(results),
1687 results[i]->idx);
1689 nextidx = results[nfound - 1]->idx + 1;
1709 struct testnode *results[TEST2_GANG_LOOKUP_NODES];
1717 (void *)results, __arraycount(results), false)) > 0) {
1719 assert(results[i] == radix_tree_remove_node(t,
1720 results[i]->idx));
1722 nextidx = results[nfound - 1]->idx + 1;
Indexes created Sat Sep 27 22:09:54 GMT 2025