mirror of
https://github.com/DarkFlippers/unleashed-firmware
synced 2024-12-18 08:43:10 +00:00
274c12fc56
* Streams: string stream * String stream: updated insert/delete api * Streams: generic stream interface and string stream implementation * Streams: helpers for insert and delete_and_insert * FFF: now compatible with streams * MinUnit: introduced tests with arguments * FFF: stream access violation * Streams: copy data between streams * Streams: file stream * FFF: documentation * FFStream: documentation * FFF: alloc as file * MinUnit: support for nested tests * Streams: changed delete_and_insert, now it returns success flag. Added ability dump stream inner parameters and data to cout. * FFF: simplified file open function * Streams: unit tests * FFF: tests * Streams: declare cache_size constant as define, to allow variable modified arrays * FFF: lib moved to a separate folder * iButton: new FFF * RFID: new FFF * Animations: new FFF * IR: new FFF * NFC: new FFF * Flipper file format: delete lib * U2F: new FFF * Subghz: new FFF and streams * Streams: read line * Streams: split * FuriCore: implement memset with extra asserts * FuriCore: implement extra heap asserts without inventing memset * Scene manager: protected access to the scene id stack with a size check * NFC worker: dirty fix for issue where hal_nfc was busy on app start * Furi: update allocator to erase memory on allocation. Replace furi_alloc with malloc. * FuriCore: cleanup memmgr code. * Furi HAL: furi_hal_init is split into critical and non-critical parts. The critical part is currently clock and console. * Memmgr: added ability to track allocations and deallocations through console. * FFStream: some speedup * Streams, FF: minor fixes * Tests: restore * File stream: a slightly more thread-safe version of file_stream_delete_and_insert Co-authored-by: Aleksandr Kutuzov <alleteam@gmail.com>
100 lines
3.2 KiB
C
100 lines
3.2 KiB
C
#include "minunit.h"
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdbool.h>
|
|
|
|
// this test is not accurate, but gives a basic understanding
|
|
// that memory management is working fine
|
|
|
|
// do not include memmgr.h here
|
|
// we also test that we are linking against stdlib
|
|
extern size_t memmgr_get_free_heap(void);
|
|
extern size_t memmgr_get_minimum_free_heap(void);
|
|
|
|
// current heap managment realization consume:
|
|
// X bytes after allocate and 0 bytes after allocate and free,
|
|
// where X = sizeof(void*) + sizeof(size_t), look to BlockLink_t
|
|
const size_t heap_overhead_max_size = sizeof(void*) + sizeof(size_t);
|
|
|
|
bool heap_equal(size_t heap_size, size_t heap_size_old) {
|
|
// heap borders with overhead
|
|
const size_t heap_low = heap_size_old - heap_overhead_max_size;
|
|
const size_t heap_high = heap_size_old + heap_overhead_max_size;
|
|
|
|
// not extact, so we must test it against bigger numbers than "overhead size"
|
|
const bool result = ((heap_size >= heap_low) && (heap_size <= heap_high));
|
|
|
|
// debug allocation info
|
|
if(!result) {
|
|
printf("\n(hl: %zu) <= (p: %zu) <= (hh: %zu)\n", heap_low, heap_size, heap_high);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
void test_furi_memmgr() {
|
|
size_t heap_size = 0;
|
|
size_t heap_size_old = 0;
|
|
const int alloc_size = 128;
|
|
|
|
void* ptr = NULL;
|
|
void* original_ptr = NULL;
|
|
|
|
// do not include furi memmgr.h case
|
|
#ifdef FURI_MEMMGR_GUARD
|
|
mu_fail("do not link against furi memmgr.h");
|
|
#endif
|
|
|
|
// allocate memory case
|
|
heap_size_old = memmgr_get_free_heap();
|
|
ptr = malloc(alloc_size);
|
|
heap_size = memmgr_get_free_heap();
|
|
mu_assert_pointers_not_eq(ptr, NULL);
|
|
mu_assert(heap_equal(heap_size, heap_size_old - alloc_size), "allocate failed");
|
|
|
|
// free memory case
|
|
heap_size_old = memmgr_get_free_heap();
|
|
free(ptr);
|
|
ptr = NULL;
|
|
heap_size = memmgr_get_free_heap();
|
|
mu_assert(heap_equal(heap_size, heap_size_old + alloc_size), "free failed");
|
|
|
|
// reallocate memory case
|
|
|
|
// get filled array with some data
|
|
original_ptr = malloc(alloc_size);
|
|
mu_assert_pointers_not_eq(original_ptr, NULL);
|
|
for(int i = 0; i < alloc_size; i++) {
|
|
*(unsigned char*)(original_ptr + i) = i;
|
|
}
|
|
|
|
// malloc array and copy data
|
|
ptr = malloc(alloc_size);
|
|
mu_assert_pointers_not_eq(ptr, NULL);
|
|
memcpy(ptr, original_ptr, alloc_size);
|
|
|
|
// reallocate array
|
|
heap_size_old = memmgr_get_free_heap();
|
|
ptr = realloc(ptr, alloc_size * 2);
|
|
heap_size = memmgr_get_free_heap();
|
|
mu_assert(heap_equal(heap_size, heap_size_old - alloc_size), "reallocate failed");
|
|
mu_assert_int_eq(memcmp(original_ptr, ptr, alloc_size), 0);
|
|
free(original_ptr);
|
|
free(ptr);
|
|
|
|
// allocate and zero-initialize array (calloc)
|
|
original_ptr = malloc(alloc_size);
|
|
mu_assert_pointers_not_eq(original_ptr, NULL);
|
|
|
|
for(int i = 0; i < alloc_size; i++) {
|
|
*(unsigned char*)(original_ptr + i) = 0;
|
|
}
|
|
heap_size_old = memmgr_get_free_heap();
|
|
ptr = calloc(1, alloc_size);
|
|
heap_size = memmgr_get_free_heap();
|
|
mu_assert(heap_equal(heap_size, heap_size_old - alloc_size), "callocate failed");
|
|
mu_assert_int_eq(memcmp(original_ptr, ptr, alloc_size), 0);
|
|
|
|
free(original_ptr);
|
|
free(ptr);
|
|
}
|