经典内存池的一种技术实现方案

经典内存池的一种技术实现方案
/*** mempool.h***/
template<int ObjectSize, int NumofObjects=20>
class MemPool {
private:
    const int MemBlockSize;//每个内存块的大小
    const int ItemSize; //每个内存节点的大小
    struct _FreeNode {
        _FreeNode* pNext;
        char data[objectSize];
    };
    
    struct _MemBlock {
        _MemBlock* pNext;
        _FreeNode data[NumofObjects];
    };
    _MemBlock* pMemBlockHeader;
    _FreeNode* pFreeNodeHeader;

public:
    MemPool():ItemSize(objectSize + sizeof(_FreeNode*)),
        MemBlockSize(sizeof(_MemBlock*) + NumofObjects*(objectSize + sizeof(_FreeNode*))) {
            pMemBlockHeader = NULL;
            pFreeNodeHeader = NULL;
        }
    ~MemPool(){
        _MemBlock* ptr;
        while(pMemBlockHeader){
            ptr = pMemBlockHeader->pNext;
            delete pMemBlockHeader;
            pMemBlockHeader = ptr;
        }
    }

    void* malloc();
    void free(void*);
};

template<int ObjectSize, int NumofObjects>
void* MemPool<ObjectSize, NumofObjects>::malloc(){
    if (pFreeNodeHeader == NULL){
        _MemBlock* pNewBlock = new _MemBlock;
        pNewBlock->data[0].pNext = NULL;
        for(int i = 1; i < NumofObjects; i++){
            pNewBlock->data[i].pNext = pNewBlock->data[i-1];
        }
        pFreeNodeHeader = &pNewBlock->data[NumofObjects-1];
        pNewBlock->pNext = pMemBlockHeader;
        pMemBlockHeader = pNewBlock;
    }
    void* pFreeNode = pFreeNodeHeader;
    pFreeNodeHeader = pFreeNodeHeader->pNext;
    return pFreeNode;
}

template<int ObjectSize, int NumofObjects>
void MemPool<ObjectSize, NumofObjects>::free(void* p){
    _FreeNode* pNode = (_FreeNode*)p;
    pNode->pNext = pFreeNodeHeader;
    pFreeNodeHeader = pNode;
}

/*** end of mempool.h***/

/*** main.cpp***/

#include <iostream>
#include "mempool.h"
using namespace std;
class ActualClass {
    static int count;
    int num[10];
public:
    ActualClass(){
        count++;
        for(int i = 0;i < 10; i++)
        {
            num[i] = count+i;
        }
    }
    void show(){
        cout << this << ":";
        for(int i = 0; i < 10; i++){
            cout << num[i] << "";
        }
        cout << endl;
    }
    
    void* operator new(size_t size);
    vpid operator delete(void* p);
};

class theMemoryPool{
    static MemPool<sizeof(ActualClass), 2>mp;
    friend class ActualClass;
};

void* ActualClass::operator new(size_t size) {
    return theMemoryPool::mp.malloc();
}

void ActualClass::operator delete(void* p){
    theMemoryPool::mp.free(p);
}

MemPool<sizeof(ActualClass, 2)>theMemoryPool::mp;
int ActualClass::count;

int main(){
    ActualClass* p1 = new ActualClass;
    p1->show();
    ActualClass* p2 = new ActualClass;
    p2->show();
    
    delete p1;
    p1 = new ActualClass;
    p1->show();
    ActualClass* p3 = new ActualClass;
    p3->show();
    delete p1;
    delete p2;
    delete p3;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值