• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-13-stable/sys/contrib/openzfs/tests/zfs-tests/cmd/btree_test/

Lines Matching refs:bt

88 verify_contents(avl_tree_t *avl, zfs_btree_t *bt)
98 ASSERT3U(avl_numnodes(avl), ==, zfs_btree_numnodes(bt));
101 data = zfs_btree_first(bt, &bt_idx);
104 data = zfs_btree_last(bt, &bt_idx);
110 data = zfs_btree_next(bt, &bt_idx, &bt_idx);
113 data = zfs_btree_prev(bt, &bt_idx, &bt_idx);
120 verify_node(avl_tree_t *avl, zfs_btree_t *bt, int_node_t *node)
128 ASSERT3U(avl_numnodes(avl), ==, zfs_btree_numnodes(bt));
129 ASSERT3P((rv = (uint64_t *)zfs_btree_find(bt, &data, &bt_idx)), !=,
132 ASSERT3P(zfs_btree_get(bt, &bt_idx), !=, NULL);
133 ASSERT3S(data, ==, *(uint64_t *)zfs_btree_get(bt, &bt_idx));
136 ASSERT3P((rv = zfs_btree_next(bt, &bt_idx, &bt_idx2)), !=,
138 ASSERT3P(rv, ==, zfs_btree_get(bt, &bt_idx2));
141 ASSERT3U(data, ==, *(uint64_t *)zfs_btree_last(bt, &bt_idx));
145 ASSERT3P((rv = zfs_btree_prev(bt, &bt_idx, &bt_idx2)), !=,
147 ASSERT3P(rv, ==, zfs_btree_get(bt, &bt_idx2));
150 ASSERT3U(data, ==, *(uint64_t *)zfs_btree_first(bt, &bt_idx));
160 find_without_index(zfs_btree_t *bt, char *why)
164 zfs_btree_add(bt, &i);
165 if ((p = (u_longlong_t *)zfs_btree_find(bt, &i, NULL)) == NULL ||
174 if ((p = (u_longlong_t *)zfs_btree_find(bt, &i, NULL)) != NULL) {
184 insert_find_remove(zfs_btree_t *bt, char *why)
190 zfs_btree_add(bt, &i);
191 if ((p = (u_longlong_t *)zfs_btree_find(bt, &i, &bt_idx)) == NULL) {
198 ASSERT3S(zfs_btree_numnodes(bt), ==, 1);
199 zfs_btree_verify(bt);
202 zfs_btree_remove(bt, &i);
203 if ((p = (u_longlong_t *)zfs_btree_find(bt, &i, &bt_idx)) != NULL) {
207 ASSERT3S(zfs_btree_numnodes(bt), ==, 0);
208 zfs_btree_verify(bt);
219 drain_tree(zfs_btree_t *bt, char *why)
237 if ((p = (uint64_t *)zfs_btree_find(bt, &randval, &bt_idx)) !=
241 zfs_btree_add_idx(bt, &randval, &bt_idx);
255 ASSERT3U(avl_numnodes(&avl), ==, zfs_btree_numnodes(bt));
258 data = zfs_btree_first(bt, &bt_idx);
261 data = zfs_btree_last(bt, &bt_idx);
264 zfs_btree_remove_idx(bt, &bt_idx);
273 *(uint64_t *)zfs_btree_first(bt, NULL));
275 ASSERT3U(node->data, ==, *(uint64_t *)zfs_btree_last(bt, NULL));
277 ASSERT3S(zfs_btree_numnodes(bt), ==, 0);
295 stress_tree(zfs_btree_t *bt, char *why)
325 ASSERT3P(zfs_btree_find(bt, &randval, &bt_idx), ==,
327 zfs_btree_add_idx(bt, &randval, &bt_idx);
328 verify_node(&avl, bt, node);
331 verify_node(&avl, bt, ret);
332 zfs_btree_remove(bt, &randval);
338 zfs_btree_verify(bt);
342 verify_contents(&avl, bt);
345 zfs_btree_verify(bt);
364 while ((rv = zfs_btree_destroy_nodes(bt, &idx)) != NULL)
366 zfs_btree_verify(bt);
377 insert_duplicate(zfs_btree_t *bt)
382 if ((p = (uint64_t *)zfs_btree_find(bt, &i, &bt_idx)) != NULL) {
386 zfs_btree_add_idx(bt, &i, &bt_idx);
387 if ((p = (uint64_t *)zfs_btree_find(bt, &i, &bt_idx)) == NULL) {
393 zfs_btree_add_idx(bt, &i, NULL);
403 remove_missing(zfs_btree_t *bt)
408 if ((p = (uint64_t *)zfs_btree_find(bt, &i, &bt_idx)) != NULL) {
414 zfs_btree_remove(bt, &i);
420 do_negative_test(zfs_btree_t *bt, char *test_name)
427 rval = insert_duplicate(bt);
429 rval = remove_missing(bt);
459 zfs_btree_t bt;
500 zfs_btree_create(&bt, zfs_btree_compare, sizeof (uint64_t));
507 return (do_negative_test(&bt, negative_test));
518 return (stress_tree(&bt, NULL));
530 retval = test->func(&bt, why);
543 while ((rv = zfs_btree_destroy_nodes(&bt, &idx)) != NULL)
545 zfs_btree_verify(&bt);
550 zfs_btree_verify(&bt);