/*
* pmemobj_root -- returns root object
*/
PMEMoid
pmemobj_root(PMEMobjpool *pop, size_t size)
{
LOG(3, "pop %p size %zu", pop, size);
return pmemobj_root_construct(pop, size, NULL, NULL);
}
int
main(int argc, char *argv[])
{
START(argc, argv, "obj_constructor");
if (argc != 2)
UT_FATAL("usage: %s file-name", argv[0]);
const char *path = argv[1];
PMEMobjpool *pop = NULL;
int ret;
TOID(struct root) root;
TOID(struct node) node;
if ((pop = pmemobj_create(path, POBJ_LAYOUT_NAME(constr),
0, S_IWUSR | S_IRUSR)) == NULL)
UT_FATAL("!pmemobj_create: %s", path);
/*
* Allocate memory until OOM, so we can check later if the alloc
* cancellation didn't damage the heap in any way.
*/
int allocs = 0;
while (pmemobj_alloc(pop, NULL, sizeof (struct node), 1,
NULL, NULL) == 0)
allocs++;
UT_ASSERTne(allocs, 0);
PMEMoid oid;
PMEMoid next;
POBJ_FOREACH_SAFE(pop, oid, next)
pmemobj_free(&oid);
errno = 0;
root.oid = pmemobj_root_construct(pop, sizeof (struct root),
root_constr_cancel, NULL);
UT_ASSERT(TOID_IS_NULL(root));
UT_ASSERTeq(errno, ECANCELED);
errno = 0;
ret = pmemobj_alloc(pop, NULL, sizeof (struct node), 1,
node_constr_cancel, NULL);
UT_ASSERTeq(ret, -1);
UT_ASSERTeq(errno, ECANCELED);
/* the same number of allocations should be possible. */
while (pmemobj_alloc(pop, NULL, sizeof (struct node), 1,
NULL, NULL) == 0)
allocs--;
UT_ASSERTeq(allocs, 0);
POBJ_FOREACH_SAFE(pop, oid, next)
pmemobj_free(&oid);
root.oid = pmemobj_root_construct(pop, sizeof (struct root),
NULL, NULL);
UT_ASSERT(!TOID_IS_NULL(root));
errno = 0;
node.oid = pmemobj_list_insert_new(pop, offsetof(struct node, next),
&D_RW(root)->list, OID_NULL, 0, sizeof (struct node),
1, node_constr_cancel, NULL);
UT_ASSERT(TOID_IS_NULL(node));
UT_ASSERTeq(errno, ECANCELED);
pmemobj_close(pop);
DONE(NULL);
}
