Lines Matching refs:assert
132 #define KASSERT assert
1160 assert((radix_tree_sum_node(n) & RADIX_TREE_TAG_MASK) == in radix_tree_dump_node()
1195 assert(radix_tree_lookup_node(t, 0) == NULL); in test1()
1196 assert(radix_tree_lookup_node(t, 1000) == NULL); in test1()
1197 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 0); in test1()
1198 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0); in test1()
1199 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0); in test1()
1200 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0); in test1()
1201 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) == in test1()
1203 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) == in test1()
1205 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false) in test1()
1207 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true) in test1()
1209 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1) in test1()
1211 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1) in test1()
1213 assert(radix_tree_gang_lookup_tagged_node(t, 1000, results, 3, false, 1) in test1()
1215 assert(radix_tree_gang_lookup_tagged_node(t, 1000, results, 3, true, 1) in test1()
1217 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3, in test1()
1219 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3, in test1()
1221 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 1000, results, 3, in test1()
1223 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 1000, results, 3, in test1()
1225 assert(radix_tree_empty_tree_p(t)); in test1()
1226 assert(radix_tree_empty_tagged_tree_p(t, 1)); in test1()
1227 assert(radix_tree_empty_tagged_tree_p(t, 2)); in test1()
1228 assert(radix_tree_insert_node(t, 0, (void *)0xdeadbea0) == 0); in test1()
1229 assert(!radix_tree_empty_tree_p(t)); in test1()
1230 assert(radix_tree_empty_tagged_tree_p(t, 1)); in test1()
1231 assert(radix_tree_empty_tagged_tree_p(t, 2)); in test1()
1232 assert(radix_tree_lookup_node(t, 0) == (void *)0xdeadbea0); in test1()
1233 assert(radix_tree_lookup_node(t, 1000) == NULL); in test1()
1235 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1); in test1()
1236 assert(results[0] == (void *)0xdeadbea0); in test1()
1238 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1); in test1()
1239 assert(results[0] == (void *)0xdeadbea0); in test1()
1240 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 0); in test1()
1241 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 0); in test1()
1243 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) == in test1()
1245 assert(results[0] == (void *)0xdeadbea0); in test1()
1247 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) == in test1()
1249 assert(results[0] == (void *)0xdeadbea0); in test1()
1251 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false) in test1()
1253 assert(results[0] == (void *)0xdeadbea0); in test1()
1254 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true) in test1()
1256 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1) in test1()
1258 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1) in test1()
1260 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3, in test1()
1262 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3, in test1()
1264 assert(radix_tree_insert_node(t, 1000, (void *)0xdeadbea0) == 0); in test1()
1265 assert(radix_tree_remove_node(t, 0) == (void *)0xdeadbea0); in test1()
1266 assert(!radix_tree_empty_tree_p(t)); in test1()
1268 assert(radix_tree_lookup_node(t, 0) == NULL); in test1()
1269 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0); in test1()
1271 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 1); in test1()
1272 assert(results[0] == (void *)0xdeadbea0); in test1()
1273 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 0); in test1()
1275 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, false) == 1); in test1()
1276 assert(results[0] == (void *)0xdeadbea0); in test1()
1278 assert(radix_tree_gang_lookup_node(t, 1000, results, 3, true) == 1); in test1()
1279 assert(results[0] == (void *)0xdeadbea0); in test1()
1280 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, false) in test1()
1282 assert(radix_tree_gang_lookup_node_reverse(t, 0, results, 3, true) in test1()
1285 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, false) in test1()
1288 assert(radix_tree_gang_lookup_node_reverse(t, 1000, results, 3, true) in test1()
1290 assert(results[0] == (void *)0xdeadbea0); in test1()
1291 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, false, 1) in test1()
1293 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 3, true, 1) in test1()
1295 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3, in test1()
1297 assert(radix_tree_gang_lookup_tagged_node_reverse(t, 0, results, 3, in test1()
1299 assert(!radix_tree_get_tag(t, 1000, 1)); in test1()
1300 assert(!radix_tree_get_tag(t, 1000, 2)); in test1()
1301 assert(radix_tree_get_tag(t, 1000, 2 | 1) == 0); in test1()
1302 assert(radix_tree_empty_tagged_tree_p(t, 1)); in test1()
1303 assert(radix_tree_empty_tagged_tree_p(t, 2)); in test1()
1305 assert(!radix_tree_get_tag(t, 1000, 1)); in test1()
1306 assert(radix_tree_get_tag(t, 1000, 2)); in test1()
1307 assert(radix_tree_get_tag(t, 1000, 2 | 1) == 2); in test1()
1308 assert(radix_tree_empty_tagged_tree_p(t, 1)); in test1()
1309 assert(!radix_tree_empty_tagged_tree_p(t, 2)); in test1()
1311 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0); in test1()
1312 assert(radix_tree_insert_node(t, 0, (void *)0xbea0) == 0); in test1()
1314 assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0); in test1()
1315 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0); in test1()
1316 assert(radix_tree_insert_node(t, UINT64_C(10000000000), (void *)0xdea0) in test1()
1319 assert(radix_tree_lookup_node(t, 0) == (void *)0xbea0); in test1()
1320 assert(radix_tree_lookup_node(t, 1000) == (void *)0xdeadbea0); in test1()
1321 assert(radix_tree_lookup_node(t, UINT64_C(10000000000)) == in test1()
1324 assert(!radix_tree_get_tag(t, 0, 2)); in test1()
1325 assert(radix_tree_get_tag(t, 1000, 2)); in test1()
1326 assert(!radix_tree_get_tag(t, UINT64_C(10000000000), 1)); in test1()
1330 assert(radix_tree_get_tag(t, 0, 2)); in test1()
1331 assert(radix_tree_get_tag(t, 1000, 2)); in test1()
1332 assert(radix_tree_get_tag(t, UINT64_C(10000000000), 2)); in test1()
1336 assert(!radix_tree_get_tag(t, 0, 2)); in test1()
1337 assert(radix_tree_get_tag(t, 1000, 2)); in test1()
1338 assert(!radix_tree_get_tag(t, UINT64_C(10000000000), 2)); in test1()
1340 assert(radix_tree_replace_node(t, 1000, (void *)0x12345678) == in test1()
1342 assert(!radix_tree_get_tag(t, 1000, 1)); in test1()
1343 assert(radix_tree_get_tag(t, 1000, 2)); in test1()
1344 assert(radix_tree_get_tag(t, 1000, 2 | 1) == 2); in test1()
1346 assert(radix_tree_gang_lookup_node(t, 0, results, 3, false) == 3); in test1()
1347 assert(results[0] == (void *)0xbea0); in test1()
1348 assert(results[1] == (void *)0x12345678); in test1()
1349 assert(results[2] == (void *)0xdea0); in test1()
1351 assert(radix_tree_gang_lookup_node(t, 0, results, 3, true) == 1); in test1()
1352 assert(results[0] == (void *)0xbea0); in test1()
1354 assert(radix_tree_gang_lookup_node(t, 1, results, 3, false) == 2); in test1()
1355 assert(results[0] == (void *)0x12345678); in test1()
1356 assert(results[1] == (void *)0xdea0); in test1()
1357 assert(radix_tree_gang_lookup_node(t, 1, results, 3, true) == 0); in test1()
1359 assert(radix_tree_gang_lookup_node(t, 1001, results, 3, false) == 1); in test1()
1360 assert(results[0] == (void *)0xdea0); in test1()
1361 assert(radix_tree_gang_lookup_node(t, 1001, results, 3, true) == 0); 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()
1371 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 100, false, 2) in test1()
1373 assert(results[0] == (void *)0x12345678); in test1()
1374 assert(radix_tree_gang_lookup_tagged_node(t, 0, results, 100, true, 2) in test1()
1376 assert(entry_tagmask(t->t_root) != 0); in test1()
1377 assert(radix_tree_remove_node(t, 1000) == (void *)0x12345678); in test1()
1378 assert(entry_tagmask(t->t_root) == 0); 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()
1385 assert(results[0] == (void *)0xdea0); in test1()
1386 assert(results[1] == (void *)0xfff0); in test1()
1388 assert(radix_tree_gang_lookup_node(t, UINT64_C(10000000000), results, 3, in test1()
1390 assert(results[0] == (void *)0xdea0); in test1()
1391 assert(results[1] == (void *)0xfff0); in test1()
1393 assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001), in test1()
1395 assert(results[0] == (void *)0xfff0); in test1()
1396 assert(results[1] == (void *)0xdea0); in test1()
1397 assert(results[2] == (void *)0xbea0); in test1()
1399 assert(radix_tree_gang_lookup_node_reverse(t, UINT64_C(10000000001), in test1()
1401 assert(results[0] == (void *)0xfff0); in test1()
1402 assert(results[1] == (void *)0xdea0); 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()
1408 assert(radix_tree_remove_node(t, 0) == (void *)0xbea0); in test1()
1456 assert(count == ntagged[tag]); in check_tag_count()
1458 assert(count >= ntagged[tag]); in check_tag_count()
1506 assert((n->tagged[tag] ? tagmask : 0) == in test2()
1514 assert(radix_tree_lookup_node(t, n->idx) == n); in test2()
1528 assert((tagged & ~tagmask) == 0); in test2()
1530 assert((tagmask & (1 << tag)) == 0 || in test2()
1591 assert(total == nnodes); in test2()
1613 assert(total == nnodes); in test2()
1637 assert(tagmask != 0 || total == 0); in test2()
1664 assert(tagmask != 0 || total == 0); in test2()
1700 assert(total <= ntagged[tag]); in test2()
1719 assert(results[i] == radix_tree_remove_node(t, in test2()
1728 assert(total == nnodes - removed); in test2()
1733 assert(radix_tree_empty_tree_p(t)); in test2()
1735 assert(radix_tree_empty_tagged_tree_p(t, tagmask)); in test2()