1
0
Fork 0
mirror of https://git.rwth-aachen.de/acs/public/villas/node/ synced 2025-03-09 00:00:00 +01:00
VILLASnode/tests/unit/memory.cpp

115 lines
3.1 KiB
C++
Raw Permalink Normal View History

2016-10-30 18:39:22 -04:00
/** Unit tests for memory management
*
* @author Steffen Vogel <stvogel@eonerc.rwth-aachen.de>
2020-01-20 17:17:00 +01:00
* @copyright 2014-2020, Institute for Automation of Complex Power Systems, EONERC
2017-04-27 12:56:43 +02:00
* @license GNU General Public License (version 3)
*
* VILLASnode
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* any later version.
*
2017-04-27 12:56:43 +02:00
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
2017-04-27 12:56:43 +02:00
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
2016-10-30 18:39:22 -04:00
*********************************************************************************/
#include <criterion/criterion.h>
#include <criterion/theories.h>
#include <cerrno>
2016-10-30 18:39:22 -04:00
2018-03-26 12:50:15 +02:00
#include <villas/memory.h>
#include <villas/utils.hpp>
2018-10-20 14:24:51 +02:00
#include <villas/log.hpp>
2016-10-30 18:39:22 -04:00
2018-08-13 15:24:04 +02:00
extern void init_memory();
#define PAGESIZE (1 << 12)
#define HUGEPAGESIZE (1 << 21)
2018-07-02 14:17:50 +02:00
2016-10-30 18:39:22 -04:00
TheoryDataPoints(memory, aligned) = {
2018-08-13 15:24:04 +02:00
DataPoints(size_t, 1, 32, 55, 1 << 10, PAGESIZE, HUGEPAGESIZE),
DataPoints(size_t, 1, 8, PAGESIZE, PAGESIZE),
2019-10-26 13:28:29 +02:00
DataPoints(struct memory_type *, &memory_heap, &memory_mmap_hugetlb, &memory_mmap_hugetlb)
2016-10-30 18:39:22 -04:00
};
// cppcheck-suppress unknownMacro
2019-10-26 13:28:29 +02:00
Theory((size_t len, size_t align, struct memory_type *mt), memory, aligned, .init = init_memory) {
2016-10-30 18:39:22 -04:00
int ret;
void *ptr;
2019-10-26 13:07:02 +02:00
ptr = memory_alloc_aligned(len, align, mt);
2018-08-13 15:24:04 +02:00
cr_assert_not_null(ptr, "Failed to allocate memory");
2018-08-13 15:24:04 +02:00
cr_assert(IS_ALIGNED(ptr, align), "Memory at %p is not alligned to %#zx byte bounary", ptr, align);
2018-10-21 13:00:50 +01:00
#ifndef __APPLE__
2019-10-26 13:35:40 +02:00
if (mt == &memory_mmap_hugetlb) {
2018-08-13 15:24:04 +02:00
cr_assert(IS_ALIGNED(ptr, HUGEPAGESIZE), "Memory at %p is not alligned to %#x byte bounary", ptr, HUGEPAGESIZE);
2016-10-30 18:39:22 -04:00
}
2018-10-21 13:00:50 +01:00
#endif
ret = memory_free(ptr);
2016-10-30 18:39:22 -04:00
cr_assert_eq(ret, 0, "Failed to release memory: ret=%d, ptr=%p, len=%zu: %s", ret, ptr, len, strerror(errno));
2017-03-28 10:28:20 +02:00
}
2017-03-28 12:06:10 +02:00
Test(memory, manager, .init = init_memory) {
size_t total_size;
size_t max_block;
int ret;
void *p, *p1, *p2, *p3;
2018-07-02 14:17:50 +02:00
struct memory_type *m;
total_size = 1 << 10;
max_block = total_size - sizeof(struct memory_type) - sizeof(struct memory_block);
2019-10-26 13:07:02 +02:00
p = memory_alloc(total_size, &memory_heap);
cr_assert_not_null(p);
2018-07-02 14:17:50 +02:00
m = memory_managed(p, total_size);
cr_assert_not_null(m);
2019-10-26 13:07:02 +02:00
p1 = memory_alloc(16, m);
cr_assert_not_null(p1);
2019-10-26 13:07:02 +02:00
p2 = memory_alloc(32, m);
cr_assert_not_null(p2);
ret = memory_free(p1);
cr_assert(ret == 0);
2017-03-28 12:06:10 +02:00
2019-10-26 13:07:02 +02:00
p1 = memory_alloc_aligned(128, 128, m);
cr_assert_not_null(p1);
cr_assert(IS_ALIGNED(p1, 128));
2017-03-28 12:06:10 +02:00
2019-10-26 13:07:02 +02:00
p3 = memory_alloc_aligned(128, 256, m);
cr_assert(p3);
cr_assert(IS_ALIGNED(p3, 256));
2017-03-28 12:06:10 +02:00
ret = memory_free(p2);
cr_assert(ret == 0);
2017-03-28 12:06:10 +02:00
ret = memory_free(p1);
cr_assert(ret == 0);
2017-03-28 12:06:10 +02:00
ret = memory_free(p3);
cr_assert(ret == 0);
2017-03-28 12:06:10 +02:00
2019-10-26 13:07:02 +02:00
p1 = memory_alloc(max_block, m);
cr_assert_not_null(p1);
2017-03-28 12:06:10 +02:00
ret = memory_free(p1);
cr_assert(ret == 0);
ret = memory_free(p);
cr_assert(ret == 0);
2017-03-28 12:06:10 +02:00
}