内存池的C实现

mempool.h

#ifndef _MEMPOOL_H
#define _MEMPOOL_H

#include "sys.h"
#include "FreeRTOS.h"
#include "task.h"
#include "string.h"
#include "delay.h"

/* 将内存设置为0 */
#define memset0(mem, size)  memset((mem), 0, (size))

/* 一定要保证申请内存成功! */
#define my_alloc_msg(_type) _alloc_msg(sizeof(_type))
#define my_free_msg(_msg) do {if(_msg==NULL) break;_free_msg(_msg); _msg = 0;}while(0);

void msg_pool_init(void);

#endif


mempool.c

#include "mempool.h"

//>全部消息池:msg_pool[MAX_MSG][MAX_MSG_LEN]
#define     MAX_MSG_2       32
#define     MAX_MSG_4       64
#define     MAX_MSG_8       128
#define     MAX_MSG_32      128
#define     MAX_MSG_64      64
#define     MAX_MSG_128     8
#define     MAX_MSG_256     4

uint8_t     msg_pool_2[MAX_MSG_2][2];
uint8_t     msg_pool_4[MAX_MSG_4][4];
uint8_t     msg_pool_8[MAX_MSG_8][8];
uint8_t     msg_pool_32[MAX_MSG_32][32];
uint8_t     msg_pool_64[MAX_MSG_64][64];
uint8_t     msg_pool_128[MAX_MSG_128][128];
uint8_t     msg_pool_256[MAX_MSG_256][256];

void msg_pool_init(void){
    memset0(msg_pool_2,   MAX_MSG_2*2);
    memset0(msg_pool_4,   MAX_MSG_4*4);
    memset0(msg_pool_8,   MAX_MSG_8*8);
    memset0(msg_pool_32,  MAX_MSG_32*32);
    memset0(msg_pool_64,  MAX_MSG_64*64);
    memset0(msg_pool_128, MAX_MSG_128*128);
    memset0(msg_pool_256, MAX_MSG_256*256);
}

//移除消息
#define LOOP_POOL_REMOVE(MAX_MSG_x,msg_pool_x,tick_1s) \
for( i=0; i<MAX_MSG_x; ++i) {\
    if(msg_pool_x[i][0] > 0 && tick_1s-msg_pool_x[i][1] > 15) {\
        msg_pool_x[i][0] = 0;\
    }\
}

//遍历消息池查询是否存在可用空间
#define LOOP_POOL(MAX_MSG_x,msg_pool_x) \
for( i=0; i<MAX_MSG_x; ++i) {\
    if(msg_pool_x[i][0] == 0) {\
        ret = (uint8_t*)(&msg_pool_x[i]);\
        goto ok_end;\
    }\
}
//进入临界区
#define OS_ENTER_CRITICAL() \
if(0==__get_CONTROL()){ \
	state_value = taskENTER_CRITICAL_FROM_ISR(); \
}else{ \
		taskENTER_CRITICAL();\
}
//退出临界区
#define OS_EXIT_CRITICAL() \
if(0==__get_CONTROL()){\
	taskEXIT_CRITICAL_FROM_ISR(state_value);\
}else{\
	taskEXIT_CRITICAL();\
}

//申请消息,并清0
void* _alloc_msg(uint16_t size){
    uint32_t i = 0;
	uint32_t state_value = 0;
    uint8_t* ret = NULL;

//_again:
	
    OS_ENTER_CRITICAL();

    if(size <=2 ){
        LOOP_POOL(MAX_MSG_2, msg_pool_2);
        LOOP_POOL(MAX_MSG_4, msg_pool_4);
        LOOP_POOL(MAX_MSG_8, msg_pool_8);
        LOOP_POOL(MAX_MSG_32, msg_pool_32);
        LOOP_POOL(MAX_MSG_64, msg_pool_64);
        LOOP_POOL(MAX_MSG_128, msg_pool_128);
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else if(size <=4 ){
        LOOP_POOL(MAX_MSG_4, msg_pool_4);
        LOOP_POOL(MAX_MSG_8, msg_pool_8);
        LOOP_POOL(MAX_MSG_32, msg_pool_32);
        LOOP_POOL(MAX_MSG_64, msg_pool_64);
        LOOP_POOL(MAX_MSG_128, msg_pool_128);
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else if(size <= 8){
        LOOP_POOL(MAX_MSG_8, msg_pool_8);
        LOOP_POOL(MAX_MSG_32, msg_pool_32);
        LOOP_POOL(MAX_MSG_64, msg_pool_64);
        LOOP_POOL(MAX_MSG_128, msg_pool_128);
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else if(size <= 32){
        LOOP_POOL(MAX_MSG_32, msg_pool_32);
        LOOP_POOL(MAX_MSG_64, msg_pool_64);
        LOOP_POOL(MAX_MSG_128, msg_pool_128);
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else if(size <= 64){
        LOOP_POOL(MAX_MSG_64, msg_pool_64);
        LOOP_POOL(MAX_MSG_128, msg_pool_128);
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else if(size <= 128){
        LOOP_POOL(MAX_MSG_128, msg_pool_128);
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else if(size <= 256){
        LOOP_POOL(MAX_MSG_256, msg_pool_256);
    }
    else{
        // 不应该出现大于256的消息
        ret = NULL;
    }
ok_end:
    if(ret != NULL) {
        ret[0] = 0xff;
        ret[1] = systemMs();
        OS_EXIT_CRITICAL();
        memset0(ret+2, size-2);
    } else {
        OS_EXIT_CRITICAL();
        //goto _again;  
    }
    return ret;
}

void _free_msg(void* msg){

    if(msg != NULL){
        uint8_t* p = msg;
        uint32_t state_value = 0;
        OS_ENTER_CRITICAL();
        p[0] = 0;
        p[1] = 0;
        OS_EXIT_CRITICAL();
    }
}





  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
内存池是一种常见的内存管理技术,它可以在程序启动时预先分配一定数量的内存空间,并将其划分为多个固定大小的块,然后在程序运行过程中动态地将这些块分配给需要使用内存的对象,从而减少内存碎片和内存分配的时间开销。下面是一个简单的内存池实现示例: ```c #include <stdio.h> #include <stdlib.h> #include <string.h> #define BLOCK_SIZE 1024 #define BLOCK_NUM 10 typedef struct _memory_block { void *start; void *end; struct _memory_block *next; } memory_block; typedef struct _memory_pool { size_t block_size; memory_block *free_list; memory_block *used_list; } memory_pool; memory_pool *memory_pool_create(size_t block_size) { memory_pool *pool = (memory_pool *) malloc(sizeof(memory_pool)); pool->block_size = block_size; pool->free_list = NULL; pool->used_list = NULL; for (int i = 0; i < BLOCK_NUM; i++) { memory_block *block = (memory_block *) malloc(sizeof(memory_block)); block->start = malloc(block_size); block->end = (char *) block->start + block_size; block->next = pool->free_list; pool->free_list = block; } return pool; } void *memory_pool_alloc(memory_pool *pool, size_t size) { memory_block *block = pool->free_list; while (block) { if ((char *) block->end - (char *) block->start >= size) { void *ptr = block->start; block->start = (char *) block->start + size; if (block->start == block->end) { pool->free_list = block->next; block->next = pool->used_list; pool->used_list = block; } return ptr; } block = block->next; } return NULL; } void memory_pool_free(memory_pool *pool) { memory_block *block = pool->used_list; while (block) { memory_block *next = block->next; free(block->start); free(block); block = next; } block = pool->free_list; while (block) { memory_block *next = block->next; free(block->start); free(block); block = next; } free(pool); } int main() { memory_pool *pool = memory_pool_create(BLOCK_SIZE); char *str1 = (char *) memory_pool_alloc(pool, 10); char *str2 = (char *) memory_pool_alloc(pool, 20); char *str3 = (char *) memory_pool_alloc(pool, 30); strcpy(str1, "hello"); strcpy(str2, "world"); strcpy(str3, "memory pool"); printf("%s %s %s\n", str1, str2, str3); memory_pool_free(pool); return 0; } ``` 该示例中,首先定义了两个结构体:memory_block表示内存块,包括起始地址、结束地址和下一个内存块的指针;memory_pool表示内存池,包括块大小、空闲链表和已用链表。 然后,定义了三个函数:memory_pool_create用于创建内存池,先分配一定数量的内存块,并将其加入空闲链表;memory_pool_alloc用于从内存池中分配一块指定大小的内存空间,遍历空闲链表,找到第一个大小足够的内存块,并将其划分为新的内存空间;memory_pool_free用于释放内存池中的所有内存块,将已用链表和空闲链表中的内存块全部释放。 最后,在main函数中创建一个内存池,并使用memory_pool_alloc从内存池中分配三个字符串空间,将其赋值并打印出来,最后使用memory_pool_free释放内存池中的所有内存块。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

DingUXiu

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值