Embedded/pikapython
1
0
Fork 0
mirror of https://gitee.com/Lyon1998/pikapython.git synced 2025-01-29 17:22:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

skip 8 bit

Browse Source
This commit is contained in:
lyon 2021-11-16 10:20:28 +08:00
parent 9a14d1bc58
commit 88645154ca
12 changed files with 11 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

0
port/linux/api-make-linux.sh Normal file → Executable file
View File

0
port/linux/api-make-win10.sh Normal file → Executable file
View File

0
port/linux/api-make.sh Normal file → Executable file
View File

0
port/linux/gtest.sh Normal file → Executable file
View File

0
port/linux/init.sh Normal file → Executable file
View File

0
port/linux/make.sh Normal file → Executable file
View File

0
port/linux/package/pikascript/rust-msc-latest-linux Normal file → Executable file
View File

0
port/linux/pull-core.sh Normal file → Executable file
View File

0
port/linux/push-core.sh Normal file → Executable file
View File

0
port/linux/test-banchmark.sh Normal file → Executable file
View File

0
port/linux/update-compiler.sh Normal file → Executable file
View File

20
src/dataMemory.c
View File

@ -33,7 +33,7 @@ PikaMemInfo pikaMemInfo = {0};
void* pikaMalloc(uint32_t size) { void* pikaMalloc(uint32_t size) {
/* pika memory lock */ /* pika memory lock */
while(__isLocked_pikaMemory()){ while (__isLocked_pikaMemory()) {
} }
pikaMemInfo.heapUsed += size; pikaMemInfo.heapUsed += size;
if (pikaMemInfo.heapUsedMax < pikaMemInfo.heapUsed) { if (pikaMemInfo.heapUsedMax < pikaMemInfo.heapUsed) {
@ -53,8 +53,8 @@ void* pikaMalloc(uint32_t size) {
void pikaFree(void* mem, uint32_t size) { void pikaFree(void* mem, uint32_t size) {
/* pika memory lock */ /* pika memory lock */
while(__isLocked_pikaMemory()){ while (__isLocked_pikaMemory()) {
} }
__platformDisableIrqHandle(); __platformDisableIrqHandle();
__impl_pikaFree(mem, size); __impl_pikaFree(mem, size);
__platformEnableIrqHandle(); __platformEnableIrqHandle();
@ -146,9 +146,11 @@ void* pool_malloc(Pool* pool, uint32_t size) {
for (uint32_t block_index = pool->block_index_min_free; for (uint32_t block_index = pool->block_index_min_free;
block_index < block_index_max; block_index++) { block_index < block_index_max; block_index++) {
/* 8 bit is not free */ /* 8 bit is not free */
if(0xFF == bitmap_getByte(pool->bitmap, block_index)){ uint8_t bitmap_byte = bitmap_getByte(pool->bitmap, block_index);
// block_index = aline_by(block_index, 8) - 1; if (0xFF == bitmap_byte) {
// continue; block_index = 8 * (block_index / 8) + 7;
block_num_found = 0;
continue;
} }
/* found a free block */ /* found a free block */
if (0 == bitmap_get(pool->bitmap, block_index)) { if (0 == bitmap_get(pool->bitmap, block_index)) {
@ -189,11 +191,11 @@ void pool_free(Pool* pool, void* mem, uint32_t size) {
return; return;
} }
uint32_t aline_by(uint32_t size, uint32_t aline){ uint32_t aline_by(uint32_t size, uint32_t aline) {
if(size == 0){ if (size == 0) {
return 0; return 0;
} }
return ((size - 1)/aline + 1) * aline; return ((size - 1) / aline + 1) * aline;
} }
BitMap bitmap_init(uint32_t size) { BitMap bitmap_init(uint32_t size) {