diff tests/test-alloc.c @ 228:2734223d3daf

core: add a alloc_pool module A miniamlist expandable array that gros each time new data is required, ideal where data must be allocated dynamically without knowing in advance the number of items.
author David Demelier <markand@malikania.fr>
date Thu, 19 Nov 2020 14:11:11 +0100
parents
children 9b758eb84556
line wrap: on
line diff
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/tests/test-alloc.c	Thu Nov 19 14:11:11 2020 +0100
@@ -0,0 +1,89 @@
+/*
+ * test-alloc.c -- test allocators
+ *
+ * Copyright (c) 2020 David Demelier <markand@malikania.fr>
+ *
+ * Permission to use, copy, modify, and/or distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ */
+
+#define GREATEST_USE_ABBREVS 0
+#include <greatest.h>
+
+#include <core/alloc.h>
+
+struct point {
+	int x;
+	int y;
+};
+
+GREATEST_TEST
+test_basics_simple(void)
+{
+	struct alloc_pool pool;
+	struct point *p;
+
+	GREATEST_ASSERT(alloc_pool_init(&pool, sizeof (*p), NULL));
+	GREATEST_ASSERT_EQ(sizeof (*p), pool.elemsize);
+	GREATEST_ASSERT_EQ(0, pool.size);
+	GREATEST_ASSERT_EQ(ALLOC_POOL_INIT_DEFAULT, pool.capacity);
+
+	/* Create until we reach the capacity. */
+	for (size_t i = 0; i < pool.capacity; ++i) {
+		p = alloc_pool_new(&pool);
+		p->x = (int)i + 1;
+		p->y = (int)i + 1;
+	}
+
+	GREATEST_ASSERT_EQ(pool.size, pool.capacity);
+
+	/* Verify values are correct. */
+	for (size_t i = 0; i < pool.size; ++i) {
+		p = ((struct point *)pool.data) + i;
+
+		GREATEST_ASSERT_EQ((int)i + 1, p->x);
+		GREATEST_ASSERT_EQ((int)i + 1, p->y);
+	}
+
+	/* Now it should reallocate. */
+	p = alloc_pool_new(&pool);
+	p->x = 9999;
+	p->y = 9999;
+
+	GREATEST_ASSERT(pool.capacity > pool.size);
+
+	alloc_pool_finish(&pool);
+
+	GREATEST_ASSERT_EQ(NULL, pool.data);
+	GREATEST_ASSERT_EQ(0, pool.elemsize);
+	GREATEST_ASSERT_EQ(0, pool.size);
+	GREATEST_ASSERT_EQ(0, pool.capacity);
+
+	GREATEST_PASS();
+}
+
+GREATEST_SUITE(suite_basics)
+{
+	GREATEST_RUN_TEST(test_basics_simple);
+}
+
+GREATEST_MAIN_DEFS();
+
+int
+main(int argc, char **argv)
+{
+	GREATEST_MAIN_BEGIN();
+	GREATEST_RUN_SUITE(suite_basics);
+	GREATEST_MAIN_END();
+
+	return 0;
+}