Mercurial > molko
view tests/test-alloc.c @ 344:9641a7eaa4d2
js: add sprite bindings
author | David Demelier <markand@malikania.fr> |
---|---|
date | Sun, 17 Oct 2021 18:10:01 +0200 |
parents | f5a5bbb77122 |
children | 460c78706989 |
line wrap: on
line source
/* * test-alloc.c -- test allocators * * Copyright (c) 2020-2021 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. */ #include <rexo.h> #include <core/alloc.h> struct point { int x; int y; }; RX_TEST_CASE(test, array_simple) { struct point *points; RX_REQUIRE((points = alloc_array0(2, sizeof (*points)))); RX_INT_REQUIRE_EQUAL(points[0].x, 0); RX_INT_REQUIRE_EQUAL(points[0].y, 0); RX_INT_REQUIRE_EQUAL(points[1].x, 0); RX_INT_REQUIRE_EQUAL(points[1].y, 0); points[0].x = 10; points[0].y = 20; points[1].x = 30; points[1].y = 40; RX_REQUIRE((points = alloc_rearray0(points, 2, 4, sizeof (*points)))); RX_INT_REQUIRE_EQUAL(points[0].x, 10); RX_INT_REQUIRE_EQUAL(points[0].y, 20); RX_INT_REQUIRE_EQUAL(points[1].x, 30); RX_INT_REQUIRE_EQUAL(points[1].y, 40); RX_INT_REQUIRE_EQUAL(points[2].x, 0); RX_INT_REQUIRE_EQUAL(points[2].y, 0); RX_INT_REQUIRE_EQUAL(points[3].x, 0); RX_INT_REQUIRE_EQUAL(points[3].y, 0); } RX_TEST_CASE(test, pool_simple) { struct alloc_pool pool; struct point *p; RX_REQUIRE(alloc_pool_init(&pool, sizeof (*p), NULL) == 0); RX_UINT_REQUIRE_EQUAL(pool.elemsize, sizeof (*p)); RX_UINT_REQUIRE_EQUAL(pool.size, 0); RX_UINT_REQUIRE_EQUAL(pool.capacity, ALLOC_POOL_INIT_DEFAULT); /* 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; } RX_UINT_REQUIRE_EQUAL(pool.size, pool.capacity); /* Verify values are correct. */ for (size_t i = 0; i < pool.size; ++i) { p = ((struct point *)pool.data) + i; RX_INT_REQUIRE_EQUAL(p->x, (int)i + 1); RX_INT_REQUIRE_EQUAL(p->y, (int)i + 1); } /* Now it should reallocate. */ p = alloc_pool_new(&pool); p->x = 9999; p->y = 9999; RX_REQUIRE(pool.capacity > pool.size); alloc_pool_finish(&pool); RX_PTR_REQUIRE_EQUAL(pool.data, NULL); RX_UINT_REQUIRE_EQUAL(pool.elemsize, 0U); RX_UINT_REQUIRE_EQUAL(pool.size, 0U); RX_UINT_REQUIRE_EQUAL(pool.capacity, 0U); } int main(int argc, char **argv) { return rx_main(0, NULL, argc, (const char **)argv) == RX_SUCCESS ? 0 : 1; }