线程安全的对象池

template < class T>


class CDynamicPoolEx
{
public:
explict CDynamicPoolEx(void):m_dwInitCount(0),m_dwGrowCount(0)
{
m_pAllocLock = new CFakeLock;
m_pFreeLock = new CFakeLock;
}


~CDynamicPoolEx(void)
{
m_pFreeLock->Lock();
for( typename std::list<T*>::iterator iter=m_ListFree.begin() ; iter != m_ListFree.end(); ++iter)
*iter = NULL;
m_pFreeLock->UnLock();


m_pAllockLock->Lock();
for( typename std::list<T*>::iterator iter=m_ListAll.begin() ; iter != m_ListAll.end(); ++iter)
{
delete [] *iter;
*iter = NULL;
}
}
void FreeAll()
{
m_pFreeLock->Lock();
m_ListFree.clear();
m_pFreeLock->UnLock();
m_pAllocLock->Lock();
m_ListAll.clear();
m_pAllocLock->UnLock();
}
bool Init(UINT32 dwInitCount , UINT32 dwGrowCount , bool bSingleThread = false)
{
m_dwInitCount = dwInitCount;
m_dwGrowCount = dwGrowCount;
if( !bSingleThread )
{
m_pFreeLock->Release();
m_pFreeLock->CreateThreadLock();


m_pAllocLock->Release();
m_pAllocLock = CreateThreadLock();
}
return _AllocT(m_dwInitCount);
}


T*FetchObj()
{
pFreeLock->Lock();
T* pT;
if( !m_ListFree.empty() )
{
pT= m_ListFree.front();
m_ListFree.pop_front();
pFreeLock->UnLock();
return pT;
}
pFreeLock->UnLock();


if( !_AllocT(m_dwGrowCount) )
{
return NULL;
}
m_pFreeLock->Lock();
pT = m_listFree.front();
m_ListFree.pop_front();
m_pFreeLock->UnLock();
return pT;
}


void ReleaseObj(T* pObj)
{
m_pFreeLock->Lock();
m_ListFree.push_back(pObj);
m_pFreeLock->UnLock();
}
size_t GetFreeCount(void)
{
size n = 0;
m_pFreeLock->Lock();
n = m_ListFree.size();
m_pFreeLock->UnLock();
return n;
}
protected:
bool _AllocT( UINT32 dwCount )
{
m_pFreeLock=>Lock();
if( !m_ListFree.empty())
{
m_pFreeLock->UnLock();
return true;
}
T* pT = new T[dwCount];
if( pT == NULL )
{
m_pFreeLock->UnLock();
}
for( UINT32 i = 0 ; i < dwCount ; ++i )
{
m_ListFree.push_back(&pT[i]);
}
m_pFreeLock->UnLock();


m_pAllocLock->Lock();
m_listAll.push_back(pT);
m_pAllocLock->UnLock();
return True;
}
private:
std::list<T*> m_ListFree;
ISDLock* pFreeLock;
std::list<T*> m_ListAll;
ISDLock* pAllocLock;
UINT32 m_dwInitCount;
UINT32 m_dwGrowCount;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值