The data is not made a child of the tree: the nodes are made children of the
data. So we must explicitly free the data objects.
int main(void)
{
trbt_tree_t *rb;
int main(void)
{
trbt_tree_t *rb;
- void *ctx = talloc_init("toplevel");
+ void *ctx = talloc_strdup(NULL, "toplevel");
rb = trbt_create(ctx, 0);
ok1(rb);
rb = trbt_create(ctx, 0);
ok1(rb);
/* All are children of rb, so this is clean. */
talloc_free(rb);
/* All are children of rb, so this is clean. */
talloc_free(rb);
+ /* No memory leaks? */
+ ok1(talloc_total_blocks(ctx) == 1);
+ talloc_free(ctx);
+
/* This exits depending on whether all tests passed */
return exit_status();
}
/* This exits depending on whether all tests passed */
return exit_status();
}
int main(void)
{
trbt_tree_t *rb;
int main(void)
{
trbt_tree_t *rb;
- void *ctx = talloc_init("toplevel");
+ void *ctx = talloc_strdup(NULL, "toplevel");
char *data, *data2;
/* This is how many tests you plan to run */
char *data, *data2;
/* This is how many tests you plan to run */
rb = trbt_create(ctx, 0);
ok1(rb);
rb = trbt_create(ctx, 0);
ok1(rb);
/* Insert with callback on existing. */
trbt_insert32_callback(rb, 0, insert_callback, data2);
ok1(strcmp(trbt_lookup32(rb, 0), "insert_callback") == 0);
/* Insert with callback on existing. */
trbt_insert32_callback(rb, 0, insert_callback, data2);
ok1(strcmp(trbt_lookup32(rb, 0), "insert_callback") == 0);
+ data2 = trbt_lookup32(rb, 1);
trbt_delete32(rb, 1);
ok1(trbt_lookup32(rb, 1) == NULL);
ok1(trbt_lookup32(rb, 0));
trbt_delete32(rb, 1);
ok1(trbt_lookup32(rb, 1) == NULL);
ok1(trbt_lookup32(rb, 0));
/* This should free everything. */
talloc_free(trbt_lookup32(rb, 0));
talloc_free(rb);
/* This should free everything. */
talloc_free(trbt_lookup32(rb, 0));
talloc_free(rb);
+ /* No memory leaks? */
+ ok1(talloc_total_blocks(ctx) == 1);
+ talloc_free(ctx);
+
/* This exits depending on whether all tests passed */
return exit_status();
}
/* This exits depending on whether all tests passed */
return exit_status();
}