void btree::rrelease(btnode* &pn) { if(pn != NULL) { rrelease(pn->ltree); rrelease(pn->rtree); // leaf delete pn; } }
END_TEST START_TEST(refcount_bad_release) { if(fork()) { int x; wait(&x); ck_assert_int_eq(WEXITSTATUS(x), BAD_REF_RELEASE); } else { void * x = rmalloc(2 * sizeof(int)); rrelease(x); rrelease(x); } }
void btree::release() { rrelease(entry); entry = NULL; }