/* The suite cleanup function.
* Closes the temporary resources used by the tests.
* Returns zero on success, non-zero otherwise.
*/
int clean_supremum(void)
{
avltree_destroy(&avl_tree_2);
return 0;
}
/* The suite cleanup function.
* Closes the temporary resources used by the tests.
* Returns zero on success, non-zero otherwise.
*/
int clean_suite100(void)
{
avltree_destroy(&avl_tree_100);
return 0;
}
/* The suite cleanup function.
* Closes the temporary resources used by the tests.
* Returns zero on success, non-zero otherwise.
*/
int clean_suite2(void)
{
avltree_destroy(&avl_tree_2);
return 0;
}
/* The suite cleanup function.
* Closes the temporary resources used by the tests.
* Returns zero on success, non-zero otherwise.
*/
int clean_suite1(void)
{
if (avltree_size(&avl_tree_1) > 0)
avl_unit_clear_tree(&avl_tree_1);
avltree_destroy(&avl_tree_1);
return 0;
}
void
dict_deinit(void)
{
#ifdef AVLTREE
avltree_destroy(root);
#else
hash_table_destroy(root);
#endif
root = NULL;
}
static void source_delete(struct dsp_source_t *source)
{
avltree_destroy(&source->list);
mem_delete(source->sink[0]);
mem_free(source);
}
static void sink_delete(struct dsp_sink_t *sink)
{
avltree_destroy(&sink->list);
mem_delete(sink->source[0]);
mem_free(sink);
}
static void file_list_free(struct avltree_node *aa)
{
struct file_list_s *a = avltree_container_of(aa, struct file_list_s, node);
avltree_destroy(&a->members, file_list_free);
free(a);
}
void avl_unit_clear_and_destroy_tree(struct avltree *t)
{
avl_unit_clear_tree(t);
avltree_destroy(t);
}
