kopia lustrzana https://github.com/pimoroni/pimoroni-pico
108 wiersze
2.2 KiB
C++
108 wiersze
2.2 KiB
C++
#include <new>
|
|
#include <cstdint>
|
|
#include <cstdlib>
|
|
#include <cstring>
|
|
#include <cstdio>
|
|
|
|
enum allocator_mode {
|
|
FIXED_HEAP = 0,
|
|
MICROPYTHON
|
|
};
|
|
|
|
static uint32_t alloc_bytes = 0;
|
|
static uint32_t alloc_count = 0;
|
|
static uint32_t free_count = 0;
|
|
|
|
static allocator_mode mode = FIXED_HEAP;
|
|
static constexpr size_t cpp_heap_size = 10 * 1024 / 4;
|
|
static uint32_t cpp_heap[cpp_heap_size];
|
|
static uint32_t ptr = 0;
|
|
static char cpp_err_buf[128] = {0};
|
|
|
|
extern "C" {
|
|
#include "cppmem.h"
|
|
|
|
mp_obj_t cpp_mem_set_allocator_mode(mp_obj_t new_mode) {
|
|
mode = (allocator_mode)mp_obj_get_int(new_mode);
|
|
return mp_const_none;
|
|
}
|
|
|
|
mp_obj_t cpp_mem_get_allocator_mode() {
|
|
return mp_obj_new_int((int)mode);
|
|
}
|
|
|
|
mp_obj_t cpp_mem_get_alloc_bytes() {
|
|
return mp_obj_new_int(alloc_bytes);
|
|
}
|
|
|
|
mp_obj_t cpp_mem_get_alloc_count() {
|
|
return mp_obj_new_int(alloc_count);
|
|
}
|
|
|
|
mp_obj_t cpp_mem_get_free_count() {
|
|
return mp_obj_new_int(free_count);
|
|
}
|
|
|
|
void mpy_free(void *p) {
|
|
return m_free(p);
|
|
}
|
|
|
|
void* mpy_malloc(size_t n) {
|
|
return m_malloc(n);
|
|
}
|
|
|
|
}
|
|
|
|
std::size_t alloc_size(std::size_t n) {
|
|
std::size_t s = n / 4;
|
|
if(n & 0b11) s++;
|
|
return s;
|
|
}
|
|
|
|
void* stat_new(std::size_t n) {
|
|
if(mode == MICROPYTHON) {
|
|
return mpy_malloc(n);
|
|
}
|
|
std::size_t s = alloc_size(n);
|
|
if(ptr + s > cpp_heap_size) {
|
|
snprintf(cpp_err_buf, sizeof(cpp_err_buf), "Failed to allocate %d bytes.", s * 4);
|
|
mp_raise_msg(&mp_type_RuntimeError, cpp_err_buf);
|
|
return nullptr;
|
|
}
|
|
alloc_bytes += s * 4;
|
|
alloc_count ++;
|
|
void *result = &cpp_heap[ptr];
|
|
//memset(result, n, 0);
|
|
ptr += s;
|
|
return result;
|
|
//return std::malloc(n);
|
|
}
|
|
|
|
void stat_free(void *p) {
|
|
if(mode == MICROPYTHON) {
|
|
return mpy_free(p);
|
|
}
|
|
free_count ++;
|
|
//return std::free(p);
|
|
return;
|
|
}
|
|
|
|
void *operator new(std::size_t n) {
|
|
return stat_new(n);
|
|
}
|
|
|
|
void *operator new[](std::size_t n) {
|
|
return stat_new(n);
|
|
}
|
|
|
|
void operator delete(void *p) { stat_free(p); }
|
|
|
|
void operator delete[](void *p) noexcept { stat_free(p); }
|
|
|
|
#if __cpp_sized_deallocation
|
|
|
|
void operator delete(void *p, __unused std::size_t n) noexcept { stat_free(p); }
|
|
|
|
void operator delete[](void *p, __unused std::size_t n) noexcept { stat_free(p); }
|
|
|
|
#endif |