void
cpool_free(cpool_t *p, uint32_t obj)
{
assert(p);
if (obj < p->start || obj > p->end || obj >= p->mx) {
return;
}
if (obj == p->mx) {
// Decrease max obj ID.
// Note that this implementation doesn't decrease mx for all cases;
// decreasing mx properly would require a periodic sort of the freelist,
// and a O(n) loop from the end. Doesn't save _that_ much memory.
p->mx = (obj - 1);
return;
}
// Add to free list.
cvector_add(&p->freelist, (cvector_item_t)obj);
}
int coat_alloc(coat_t *t, uint32_t arg[COAT_ARGS], cvector_item_t *out_obj) {
assert(t);
// Allocate new ID.
int id = cpool_alloc(&t->pool);
if (!id || id == COAT_INVALID_ID) {
goto error;
}
// Potentially expand ID table vector.
while (cvector_count(&t->table) <= id) {
if (t->oat_expand) {
t->oat_expand(&t->table);
continue;
}
// Defaults to adding NULL pointers to fill ID table.
cvector_add(&t->table, (cvector_item_t) NULL);
}
cvector_item_t obj = cvector_get(&t->table, id);
if (!obj && t->oat_create) {
// Create object structure and store it.
obj = t->oat_create(t, id, arg);
if (!obj) {
goto error;
}
cvector_set(&t->table, id, obj);
}
if (out_obj) {
(*out_obj) = obj;
}
return id;
error:
if (id) cpool_free(&t->pool, id);
return COAT_INVALID_ID;
}
static int
test_cvector(void)
{
test_start("cvector");
// Src: https://gist.github.com/EmilHernvall/953968
cvector_t v;
cvector_init(&v);
cvector_add(&v, (cvector_item_t)1); cvector_add(&v, (cvector_item_t)2);
cvector_add(&v, (cvector_item_t)3); cvector_add(&v, (cvector_item_t)4);
cvector_add(&v, (cvector_item_t)5);
test_assert(cvector_count(&v) == (int)5);
test_assert(cvector_get(&v, 0) == (cvector_item_t)1);
test_assert(cvector_get(&v, 1) == (cvector_item_t)2);
test_assert(cvector_get(&v, 2) == (cvector_item_t)3);
test_assert(cvector_get(&v, 3) == (cvector_item_t)4);
test_assert(cvector_get(&v, 4) == (cvector_item_t)5);
cvector_delete(&v, 1);
cvector_delete(&v, 3);
test_assert(cvector_count(&v) == (int)3);
test_assert(cvector_get(&v, 0) == (cvector_item_t)1);
test_assert(cvector_get(&v, 1) == (cvector_item_t)3);
test_assert(cvector_get(&v, 2) == (cvector_item_t)4);
cvector_free(&v);
int vcStress = 10000;
for (int i = 0; i < vcStress; i++) {
int data = ((i << 2) * 0xcafebabe) ^ 0xdeadbeef;
cvector_add(&v, (cvector_item_t)data);
test_assert(cvector_count(&v) == (int)(i + 1));
test_assert(cvector_get(&v, i) == (cvector_item_t)data);
data = (data << 7) ^ 0xbaabaabb;
cvector_set(&v, i, (cvector_item_t)data);
test_assert(cvector_count(&v) == (int)(i + 1));
test_assert(cvector_get(&v, i) == (cvector_item_t)data);
}
cvector_free(&v);
return test_success();
}
