定长内存池,是一次性申请一大块内存,然后用一次拿一点,不用了就交给自由链表,当需要的时候,先从自由链表中拿,如果自由链表中没有,再从内存块中拿,内存块用完的话,再一次性申请一块大的内存,这样可以减少系统函数申请内存,提高效率。程序如下:
#pragma once
#include<iostream>
#include<time.h>
#include<vector>
using std::cout;
using std::endl;
template<class T>
class ObjectPool
{
public:
T* New()
{
T* obj = nullptr;
if (_freeList)//先从自由链表中那,如果自由链表不为空
{
void* next = *(void**)_freeList;//用void**解引用后,如果是64位的和32位的,都可以。
obj = (T*)_freeList;
_freeList = next;
}
else
{
if (_remainBytes < sizeof(T))
{
_remainBytes = 128 * 1024;//申请定长内存
_memory = (char*)malloc(_remainBytes);
if (_memory == nullptr)
{
printf("error\n");
exit(-1);
}
}
obj = (T*)_memory;
size_t objSize = sizeof(T) < sizeof(void*) ? sizeof(void*) : sizeof(T);
_memory += objSize;
_remainBytes -= objSize;
}
new(obj)T;
return obj;
}
void Delete(T* obj)
{
obj->~T();//释放内存,将不用的内存放到自由链表中,用的是头插
*(void**)obj = _freeList;
_freeList = obj;
}
private:
char* _memory = nullptr;//一块大的内存
void* _freeList = nullptr;
size_t _remainBytes = 0;
};
struct TreeNode
{
int _val;
TreeNode* _left;
TreeNode* _right;
TreeNode()
:_val(0)
, _left(nullptr)
, _right(nullptr)
{}
};
void TestObjectPool()//进行测试
{
// 申请释放的轮次
const size_t Rounds = 5;
// 每轮申请释放多少次
const size_t N = 100000;
std::vector<TreeNode*> v1;
v1.reserve(N);
size_t begin1 = clock();
for (size_t j = 0; j < Rounds; ++j)
{
for (int i = 0; i < N; ++i)
{
v1.push_back(new TreeNode);
}
for (int i = 0; i < N; ++i)
{
delete v1[i];
}
v1.clear();
}
size_t end1 = clock();
std::vector<TreeNode*> v2;
v2.reserve(N);
ObjectPool<TreeNode> TNPool;
size_t begin2 = clock();
for (size_t j = 0; j < Rounds; ++j)
{
for (int i = 0; i < N; ++i)
{
v2.push_back(TNPool.New());
}
for (int i = 0; i < N; ++i)
{
TNPool.Delete(v2[i]);
}
v2.clear();
}
size_t end2 = clock();
cout << "new cost time:" << end1 - begin1 << endl;
cout << "object pool cost time:" << end2 - begin2 << endl;
}
从程序上看,是被优化的。