Lines Matching refs:assert
126 #include <assert.h>
132 #define KASSERT assert
1160 assert((radix_tree_sum_node(n) & RADIX_TREE_TAG_MASK) ==
1195 assert(radix_tree_lookup_node(t, 0) == NULL);
1196 assert(radix_tree_lookup_node(t, 1000) == NULL);
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,
1225 assert(radix_tree_empty_tree_p(t));
1226 assert(radix_tree_empty_tagged_tree_p(t, 1));
1227 assert(radix_tree_empty_tagged_tree_p(t, 2));
1228 assert(radix_tree_insert_node(t, 0, (void *)0xdeadbea0) == 0);
1229 assert(!radix_tree_empty_tree_p(t));
1230 assert(radix_tree_empty_tagged_tree_p(t, 1));
1231 assert(radix_tree_empty_tagged_tree_p(t, 2));
1232 assert(radix_tree_lookup_node(t, 0) == (void *)0xdeadbea0);
1233 assert(radix_tree_lookup_node(t, 1000) == NULL);
1235 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1);
1236 assert(results[0] == (void *)0xdeadbea0);
1238 assert
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);
1243 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) ==
1245 assert(results[0] == (void *)0xdeadbea0);
1247 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) ==
1249 assert(results[0] == (void *)0xdeadbea0);
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,
1264 assert(radix_tree_insert_node(t, 1000, (void *)0xdeadbea0) == 0);
1265 assert(radix_tree_remove_node(t, 0) == (void *)0xdeadbea0);
1266 assert(!radix_tree_empty_tree_p(t));
1268 assert(radix_tree_lookup_node(t, 0) == NULL);
1269 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
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);
1275 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 1);
1276 assert(results[0] == (void *)0xdeadbea0);
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)
1285 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false)
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,
1299 assert(!radix_tree_get_tag(t, 1000, 1));
1300 assert(!radix_tree_get_tag(t, 1000, 2));
1301 assert(radix_tree_get_tag(t, 1000, 2 | 1) == 0);
1302 assert(radix_tree_empty_tagged_tree_p(t, 1));
1303 assert(radix_tree_empty_tagged_tree_p(t, 2));
1305 assert(!radix_tree_get_tag(t, 1000, 1));
1306 assert(radix_tree_get_tag(t, 1000, 2));
1307 assert(radix_tree_get_tag(t, 1000, 2 | 1) == 2);
1308 assert(radix_tree_empty_tagged_tree_p(t, 1));
1309 assert(!radix_tree_empty_tagged_tree_p(t, 2));
1311 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
1312 assert(radix_tree_insert_node(t, 0, (void *)0xbea0) == 0);
1314 assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0);
1315 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0);
1316 assert(radix_tree_insert_node(t, UINT64_C(10000000000), (void *)0xdea0)
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)) ==
1324 assert(!radix_tree_get_tag(t, 0, 2));
1325 assert(radix_tree_get_tag(t, 1000, 2));
1326 assert(!radix_tree_get_tag(t, UINT64_C(10000000000), 1));
1330 assert(radix_tree_get_tag(t, 0, 2));
1331 assert(radix_tree_get_tag(t, 1000, 2));
1332 assert(radix_tree_get_tag(t, UINT64_C(10000000000), 2));
1336 assert(!radix_tree_get_tag(t, 0, 2));
1337 assert(radix_tree_get_tag(t, 1000, 2));
1338 assert(!radix_tree_get_tag(t, UINT64_C(10000000000), 2));
1340 assert(radix_tree_replace_node(t, 1000, (void *)0x12345678) ==
1342 assert(!radix_tree_get_tag(t, 1000, 1));
1343 assert(radix_tree_get_tag(t, 1000, 2));
1344 assert(radix_tree_get_tag(t, 1000, 2 | 1) == 2);
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);
1351 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1);
1352 assert(results[0] == (void *)0xbea0);
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);
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,
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)
1376 assert(entry_tagmask(t->t_root) != 0);
1377 assert(radix_tree_remove_node(t, 1000) == (void *)0x12345678);
1378 assert(entry_tagmask(t->t_root) == 0);
1380 assert(radix_tree_insert_node(t, UINT64_C(10000000001), (void *)0xfff0)
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);
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);
1393 assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001),
1395 assert(results[0] == (void *)0xfff0);
1396 assert(results[1] == (void *)0xdea0);
1397 assert(results[2] == (void *)0xbea0);
1399 assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001),
1401 assert(results[0] == (void *)0xfff0);
1402 assert(results[1] == (void *)0xdea0);
1403 assert(radix_tree_remove_node(t, UINT64_C(10000000000)) ==
1405 assert(radix_tree_remove_node(t, UINT64_C(10000000001)) ==
1408 assert(radix_tree_remove_node(t, 0) == (void *)0xbea0);
1456 assert(count == ntagged[tag]);
1458 assert(count >= ntagged[tag]);
1506 assert((n->tagged[tag] ? tagmask : 0) ==
1514 assert(radix_tree_lookup_node(t, n->idx) == n);
1528 assert((tagged & ~tagmask) == 0);
1530 assert((tagmask & (1 << tag)) == 0 ||
1591 assert(total == nnodes);
1613 assert(total == nnodes);
1637 assert(tagmask != 0 || total == 0);
1664 assert(tagmask != 0 || total == 0);
1700 assert(total <= ntagged[tag]);
1719 assert(results[i] == radix_tree_remove_node(t,
1728 assert(total == nnodes - removed);
1733 assert(radix_tree_empty_tree_p(t));
1735 assert(radix_tree_empty_tagged_tree_p(t, tagmask));
Indexes created Sat Sep 20 22:09:52 GMT 2025