2022-09-19 05:46:55 -04:00
|
|
|
/*
|
2023-01-31 03:41:56 -05:00
|
|
|
* SPDX-FileCopyrightText: 2022-2023 Espressif Systems (Shanghai) CO LTD
|
2022-09-19 05:46:55 -04:00
|
|
|
*
|
|
|
|
* SPDX-License-Identifier: Unlicense OR CC0-1.0
|
|
|
|
*/
|
2017-01-27 02:01:51 -05:00
|
|
|
/*
|
2017-03-08 06:44:57 -05:00
|
|
|
Generic test for malloc/free
|
2017-01-27 02:01:51 -05:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <esp_types.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#include "freertos/FreeRTOS.h"
|
|
|
|
#include "freertos/task.h"
|
|
|
|
#include "freertos/semphr.h"
|
|
|
|
#include "freertos/queue.h"
|
|
|
|
#include "unity.h"
|
2017-09-22 04:02:39 -04:00
|
|
|
#include "esp_heap_caps.h"
|
2017-01-27 02:01:51 -05:00
|
|
|
|
2017-09-22 04:02:39 -04:00
|
|
|
#include "sdkconfig.h"
|
|
|
|
|
|
|
|
|
|
|
|
static int **allocatedMem;
|
|
|
|
static int noAllocated;
|
|
|
|
|
2019-07-16 05:33:30 -04:00
|
|
|
static int tryAllocMem(void) {
|
2017-09-22 04:02:39 -04:00
|
|
|
int i, j;
|
|
|
|
const int allocateMaxK=1024*5; //try to allocate a max of 5MiB
|
2017-05-03 04:03:28 -04:00
|
|
|
|
2017-09-22 04:02:39 -04:00
|
|
|
allocatedMem=malloc(sizeof(int *)*allocateMaxK);
|
|
|
|
if (!allocatedMem) return 0;
|
2017-05-03 04:03:28 -04:00
|
|
|
|
2017-09-22 04:02:39 -04:00
|
|
|
for (i=0; i<allocateMaxK; i++) {
|
|
|
|
allocatedMem[i]=malloc(1024);
|
|
|
|
if (allocatedMem[i]==NULL) break;
|
|
|
|
for (j=0; j<1024/4; j++) allocatedMem[i][j]=(0xdeadbeef);
|
2017-03-08 06:44:57 -05:00
|
|
|
}
|
|
|
|
noAllocated=i;
|
2017-09-22 04:02:39 -04:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2017-05-03 04:03:28 -04:00
|
|
|
|
2019-07-16 05:33:30 -04:00
|
|
|
static void tryAllocMemFree(void) {
|
2017-09-22 04:02:39 -04:00
|
|
|
int i, j;
|
2017-03-08 06:44:57 -05:00
|
|
|
for (i=0; i<noAllocated; i++) {
|
|
|
|
for (j=0; j<1024/4; j++) {
|
2017-09-22 04:02:39 -04:00
|
|
|
TEST_ASSERT(allocatedMem[i][j]==(0xdeadbeef));
|
2017-03-08 06:44:57 -05:00
|
|
|
}
|
2017-09-22 04:02:39 -04:00
|
|
|
free(allocatedMem[i]);
|
2017-03-08 06:44:57 -05:00
|
|
|
}
|
2017-09-22 04:02:39 -04:00
|
|
|
free(allocatedMem);
|
2017-01-27 02:01:51 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-05-03 04:03:28 -04:00
|
|
|
TEST_CASE("Malloc/overwrite, then free all available DRAM", "[heap]")
|
2017-01-27 02:01:51 -05:00
|
|
|
{
|
2017-03-08 06:44:57 -05:00
|
|
|
int m1=0, m2=0;
|
|
|
|
m1=tryAllocMem();
|
2017-09-22 04:02:39 -04:00
|
|
|
tryAllocMemFree();
|
2017-03-08 06:44:57 -05:00
|
|
|
m2=tryAllocMem();
|
2017-09-22 04:02:39 -04:00
|
|
|
tryAllocMemFree();
|
2017-03-08 06:44:57 -05:00
|
|
|
printf("Could allocate %dK on first try, %dK on 2nd try.\n", m1, m2);
|
|
|
|
TEST_ASSERT(m1==m2);
|
2017-01-27 02:01:51 -05:00
|
|
|
}
|
|
|
|
|
2017-09-22 04:02:39 -04:00
|
|
|
#if CONFIG_SPIRAM_USE_MALLOC
|
|
|
|
|
|
|
|
#if (CONFIG_SPIRAM_MALLOC_RESERVE_INTERNAL > 1024)
|
|
|
|
TEST_CASE("Check if reserved DMA pool still can allocate even when malloc()'ed memory is exhausted", "[heap]")
|
|
|
|
{
|
|
|
|
char** dmaMem=malloc(sizeof(char*)*512);
|
|
|
|
assert(dmaMem);
|
|
|
|
int m=tryAllocMem();
|
|
|
|
int i=0;
|
|
|
|
for (i=0; i<512; i++) {
|
|
|
|
dmaMem[i]=heap_caps_malloc(1024, MALLOC_CAP_DMA);
|
|
|
|
if (dmaMem[i]==NULL) break;
|
|
|
|
}
|
|
|
|
for (int j=0; j<i; j++) free(dmaMem[j]);
|
|
|
|
free(dmaMem);
|
|
|
|
tryAllocMemFree();
|
|
|
|
printf("Could allocate %dK of DMA memory after allocating all of %dK of normal memory.\n", i, m);
|
|
|
|
TEST_ASSERT(i);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-06-18 02:24:49 -04:00
|
|
|
#endif
|
|
|
|
|
2018-08-29 00:52:03 -04:00
|
|
|
|
|
|
|
/* As you see, we are desperately trying to outsmart the compiler, so that it
|
|
|
|
* doesn't warn about oversized allocations in the next two unit tests.
|
|
|
|
* To be removed when we switch to GCC 8.2 and add
|
|
|
|
* -Wno-alloc-size-larger-than=PTRDIFF_MAX to CFLAGS for this file.
|
|
|
|
*/
|
|
|
|
void* (*g_test_malloc_ptr)(size_t) = &malloc;
|
|
|
|
void* (*g_test_calloc_ptr)(size_t, size_t) = &calloc;
|
|
|
|
|
|
|
|
void* test_malloc_wrapper(size_t size)
|
|
|
|
{
|
|
|
|
return (*g_test_malloc_ptr)(size);
|
|
|
|
}
|
|
|
|
|
|
|
|
void* test_calloc_wrapper(size_t count, size_t size)
|
|
|
|
{
|
|
|
|
return (*g_test_calloc_ptr)(count, size);
|
|
|
|
}
|
|
|
|
|
2018-06-18 02:24:49 -04:00
|
|
|
TEST_CASE("alloc overflows should all fail", "[heap]")
|
|
|
|
{
|
2019-03-10 19:49:51 -04:00
|
|
|
/* allocates 8 bytes if size_t overflows */
|
2018-08-29 00:52:03 -04:00
|
|
|
TEST_ASSERT_NULL(test_calloc_wrapper(SIZE_MAX / 2 + 4, 2));
|
2018-06-18 02:24:49 -04:00
|
|
|
|
|
|
|
/* will overflow if any poisoning is enabled
|
|
|
|
(should fail for sensible OOM reasons, otherwise) */
|
2018-08-29 00:52:03 -04:00
|
|
|
TEST_ASSERT_NULL(test_malloc_wrapper(SIZE_MAX - 1));
|
|
|
|
TEST_ASSERT_NULL(test_calloc_wrapper(SIZE_MAX - 1, 1));
|
2019-03-10 19:49:51 -04:00
|
|
|
|
|
|
|
/* will overflow when the size is rounded up to word align it */
|
|
|
|
TEST_ASSERT_NULL(heap_caps_malloc(SIZE_MAX-1, MALLOC_CAP_32BIT));
|
|
|
|
|
|
|
|
TEST_ASSERT_NULL(heap_caps_malloc(SIZE_MAX-1, MALLOC_CAP_EXEC));
|
2018-06-18 02:24:49 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("unreasonable allocs should all fail", "[heap]")
|
|
|
|
{
|
2018-08-29 00:52:03 -04:00
|
|
|
TEST_ASSERT_NULL(test_calloc_wrapper(16, 1024*1024));
|
|
|
|
TEST_ASSERT_NULL(test_malloc_wrapper(16*1024*1024));
|
|
|
|
TEST_ASSERT_NULL(test_malloc_wrapper(SIZE_MAX / 2));
|
|
|
|
TEST_ASSERT_NULL(test_malloc_wrapper(SIZE_MAX - 256));
|
|
|
|
TEST_ASSERT_NULL(test_malloc_wrapper(xPortGetFreeHeapSize() - 1));
|
2018-06-18 02:24:49 -04:00
|
|
|
}
|
|
|
|
|
2020-03-17 14:58:25 -04:00
|
|
|
TEST_CASE("malloc(0) should return a NULL pointer", "[heap]")
|
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
p = malloc(0);
|
|
|
|
TEST_ASSERT(p == NULL);
|
|
|
|
}
|
2022-08-08 03:39:25 -04:00
|
|
|
|
|
|
|
static bool failure_occured = false;
|
|
|
|
|
|
|
|
static void test_alloc_failure_callback(size_t size, uint32_t caps, const char * function_name)
|
|
|
|
{
|
|
|
|
failure_occured = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("malloc/calloc(0) should not call failure callback", "[heap]")
|
|
|
|
{
|
|
|
|
void* ptr = NULL;
|
|
|
|
esp_err_t ret = heap_caps_register_failed_alloc_callback(test_alloc_failure_callback);
|
|
|
|
TEST_ASSERT(ret == ESP_OK);
|
|
|
|
ptr = malloc(0);
|
|
|
|
TEST_ASSERT_NULL(ptr);
|
|
|
|
/* Check that our callback was NOT called */
|
|
|
|
TEST_ASSERT_FALSE(failure_occured);
|
|
|
|
/* Do the same thing for calloc */
|
|
|
|
ptr = calloc(0, 0);
|
|
|
|
TEST_ASSERT_NULL(ptr);
|
|
|
|
TEST_ASSERT_FALSE(failure_occured);
|
|
|
|
}
|
2023-01-31 03:41:56 -05:00
|
|
|
|
|
|
|
TEST_CASE("test get allocated size", "[heap]")
|
|
|
|
{
|
|
|
|
const size_t iterations = 32;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < iterations; i++) {
|
|
|
|
// minimum block size is 12, so to avoid unecessary logic in the test,
|
|
|
|
// set the minimum requested size to 12.
|
|
|
|
const size_t alloc_size = rand() % 1024 + 12;
|
|
|
|
|
|
|
|
void *ptr = heap_caps_malloc(alloc_size, MALLOC_CAP_DEFAULT);
|
|
|
|
TEST_ASSERT_NOT_NULL(ptr);
|
|
|
|
|
|
|
|
// test that the heap_caps_get_allocated_size() returns the right number of bytes (aligned to 4 bytes
|
|
|
|
// since the heap component aligns to 4 bytes)
|
|
|
|
const size_t aligned_size = (alloc_size + 3) & ~3;
|
|
|
|
printf("initial size: %d, requested size : %d, allocated size: %d\n", alloc_size, aligned_size, heap_caps_get_allocated_size(ptr));
|
|
|
|
TEST_ASSERT_EQUAL(aligned_size, heap_caps_get_allocated_size(ptr));
|
|
|
|
|
|
|
|
heap_caps_free(ptr);
|
|
|
|
}
|
|
|
|
}
|