48     struct bt_root_t *tree = bt_create_tree(rn, compare, release);  in ktest_bitree_case1()  local
49     assert(tree != NULL);  in ktest_bitree_case1()
50     assert(tree->bt_node == rn);  in ktest_bitree_case1()
51     assert(tree->cmp == compare);  in ktest_bitree_case1()
52     assert(tree->release == release);  in ktest_bitree_case1()
53     assert(tree->size == 1);  in ktest_bitree_case1()
60         int last_size = tree->size;  in ktest_bitree_case1()
61         val = bt_insert(tree, tv2);  in ktest_bitree_case1()
63         assert(last_size + 1 == tree->size);  in ktest_bitree_case1()
69         int last_size = tree->size;  in ktest_bitree_case1()
70         val = bt_insert(tree, tv3);  in ktest_bitree_case1()
72         assert(last_size + 1 == tree->size);  in ktest_bitree_case1()
76     assert(((struct test_value_t *)tree->bt_node->left->value)->tv == tv2->tv);  in ktest_bitree_case1()
77     assert(((struct test_value_t *)tree->bt_node->right->value)->tv == tv3->tv);  in ktest_bitree_case1()
82     assert(bt_query(tree, tv2, (uint64_t*)(&node2)) == 0);  in ktest_bitree_case1()
91         int last_size = tree->size;  in ktest_bitree_case1()
92         val = bt_insert(tree, tv4);  in ktest_bitree_case1()
94         assert(last_size + 1 == tree->size);  in ktest_bitree_case1()
104     assert(bt_query(tree, tv_not_exists, (uint64_t*)(&node_not_exists)) == -1);  in ktest_bitree_case1()
109     assert(bt_delete(tree, rn->value) == 0);  in ktest_bitree_case1()
110     assert(((struct test_value_t *)tree->bt_node->value)->tv != 20);  in ktest_bitree_case1()
111     assert(tree->bt_node->right == NULL);  in ktest_bitree_case1()
114     assert(bt_destroy_tree(tree) == 0);  in ktest_bitree_case1()