采用boost内存数据库技术和线程池技术开发的内存池技术，支持内存回收，碎片合并

/* * MemoryPool.cpp * * Created on: 2009-7-14 * Author: yul */ #include "MemoryPool.h" #include <numeric> MemoryPool::MemoryPool(IAllocator *Allocator, DWORD dwChunkSize_, DWORD dwIncrease_ , DWORD dwGap_ ) : m_dwChunkSize(dwChunkSize_), m_dwIncrease(dwIncrease_), m_dwExpiredSecond(120), m_pAllocator(Allocator) //,ThreadPool(GetThreadPool< typename shared_ptr<LOKI_THREAD_POOL_TYPE> >()) { //GetThreadPool< typename smart_pool<LOKI_THREAD_POOL_TYPE> >() //ThreadPool->size_controller().resize(LOKI_THREAD_POOL_NUM); //TRACE("%s\n",typeid(ThreadModel).name()); m_dwGap = 1; while((dwGap_>>=1)) { m_dwGap <<= 1; } #if 0 //Not Lazy first Preallocate MemoryTrunk memoryTrunk = Preallocate(dwChunkSize); assert(memoryTrunk.lpVoid); FreeTable.insert(memoryTrunk); #endif } void MemoryPool::SetAllocatorPolicy(IAllocator *Allocator) { boost::recursive_mutex::scoped_lock lock(m_Mutex); //Lock Lock (this); m_pAllocator = Allocator; } MemoryPool::~MemoryPool() { //ThreadPool->empty(); //ClearThreadPool< typename smart_pool<LOKI_THREAD_POOL_TYPE> >(); { boost::recursive_mutex::scoped_lock lock(m_Mutex); //Lock Lock (this); // cout<< __FUNCTION__<<"Total Memory:"<< (GetFreeMemSize()>>10)<<"Allocate Memory:"<<(GetAllocMemSize()>>10)<<endl; MemoryTable::nth_index<0>::type &idx=get<0>(AllocateTable); for( nth_index_iterator<MemoryTable,0>::type it = idx.begin();it!= idx.end();it++ /*it = idx.begin()*/) { //MemoryTrunk memoryTrunk; MemoryTrunk memoryTrunk = *it; #if 0 Free(memoryTrunk.lpVoid); #else FreeTable.insert(memoryTrunk); #endif } AllocateTable.clear(); { //合并空闲内存块 //Stop to Schedule FreeRun freeCache.clear(); //Stop to Schedule ClearExpire m_dwExpiredSecond = 0; (*LogMessage)<< log4cpp::Priority::INFO <<__FUNCTION__<<"Before Trim"; size_t size = Trim(); if ( size ) { //nth_index<MemoryTable,3>::type &idxFree3=get<3>(FreeTable); //std::copy ( idxFree3.begin(), idxFree3.end() , // std::ostream_iterator<long *> ( std::cout, " ") ); //cout<< __FUNCTION__<<"Trim "<<size<<"Total "<<FreeTable.size()<<" Chunk"<<"Total Memory:"<< (GetFreeMemSize()>>10)<<"Allocate Memory:"<<(GetAllocMemSize()>>10)<<endl; // (*LogMessage)<< log4cpp::Priority::INFO<<__FUNCTION__<<"Trim "<<size<<"Total "<<FreeTable.size()<<" Chunk"<<"Total Memory:"<< (GetFreeMemSize()>>10)<<"Allocate Memory:"<<(GetAllocMemSize()>>10); } (*LogMessage)<< log4cpp::Priority::INFO <<__FUNCTION__<<"After Trim"; } } //if(!GlobalPolicy<>::SingletonPolicy<typename smart_pool<lifo_pool> >::BeDestroyed()) // ThreadPool->join(GetTimeStamp(5)); { boost::recursive_mutex::scoped_lock lock(m_Mutex); //Lock Lock (this); //最后释放内存块 //TRACE("End\n"); nth_index<MemoryTable,0>::type &idxFree=get<0>(FreeTable); for( nth_index_iterator<MemoryTable,0>::type it = idxFree.begin();it!= idxFree.end();it++ /*= idxFree.begin()*/) { MemoryTrunk memoryTrunk = *it; // (*LogMessage)<< log4cpp::Priority::INFO<<__FUNCTION__<<" Deallocate Trunk "<<memoryTrunk.m_RawChunkID; // cout<<"Deallocate Trunk"<<memoryTrunk.ulID<<endl; /* TRACE("Deallocate Trunk [%d] 0x%lx size %d K Raw Chunk Size %d K\n", memoryTrunk.ulID, memoryTrunk.m_lpVoid, memoryTrunk.m_dwChunkSize>>10, memoryTrunk.m_dwRawChunkSize>>10 );*/ //AllocFactory::Instance(AllocatorID). //memoryTrunk.m_pAllocator->deallocate(memoryTrunk.lpVoid,memoryTrunk.dwChunkSize); memoryTrunk.Deallocate(); } FreeTable.clear(); //MemoryTable_Allocator.ChunkCache.clear(); //MemoryTable_Allocator.get_allocator().purge_memory(); //MemoryTable_Allocator::purge_memory(); //boost::pool<Allocator>::purge_memory(); //ThreadPool->empty(); ThreadPoolSingleton<>::GetInstance().size_controller().resize(0); ThreadPoolSingleton<>::GetInstance().clear(); } //ThreadPool->empty(); } LPVOID MemoryPool::Malloc(DWORD dwUseSize,DWORD dwGap_ ) { //Profile(PerformanceTest); if (dwUseSize==0) return NULL; /* DWORD dwThread = GetCurrentThreadId(); if ( IsThreadReEnter(dwThread) && !ThreadIDCache.count(dwThread)) { HANDLE hThread = OpenThread(THREAD_TERMINATE |THREAD_QUERY_INFORMATION,TRUE ,dwThread); if (hThread ) { //if (!AcquireThreadHandleSet.count(hThread)) Lock Lock (this); AcquireThreadHandleSet.insert(hThread); ThreadIDCache[dwThread] = hThread; } } */ boost::recursive_mutex::scoped_lock lock(m_Mutex); //Lock Lock (this); //Lazy first Preallocate static bool bInitOnce = false; //boost::function<void (typename thisType)> func = InitOnce; if(!bInitOnce) bInitOnce = (bInitOnce ? bInitOnce:RunNtimes<1>(boost::bind(&MemoryPool::InitOnce,this))); DWORD dwChunkSize; if (dwGap_ && dwGap_ != m_dwGap) { DWORD dwResult = 1; while((dwGap_>>=1)) { dwResult <<= 1; } dwGap_ = dwResult; } if(!dwGap_) dwChunkSize = dwUseSize; else dwChunkSize = (( dwUseSize + dwGap_ )/ dwGap_)* dwGap_; DWORD dwGuardSize = dwChunkSize - dwUseSize; nth_index<MemoryTable,1>::type &idx=get<1>(FreeTable); nth_index_iterator<MemoryTable,1>::type it = idx.lower_bound(dwUseSize); nth_index<MemoryTable,2>::type &idx2=get<2>(FreeTable); nth_index_iterator<MemoryTable,2>::type it2; //ASSERT(it->dwSize >= dwSize); do { it2 = idx2.lower_bound(dwChunkSize); if ( it != idx.end() && it->m_dwChunkSize >= dwChunkSize ) {//Find Invoke Free Reusable Memory //MemoryTrunk allocateTrunk , freeTrunk; // (*LogMessage)<< log4cpp::Priority::INFO // <<__FUNCTION__<<" find free chunk "<<"dwChunkSize = "<<dwChunkSize; MemoryTrunk freeTrunk = *it; idx.erase(it); //Not Need To Merge freeCache.erase(freeTrunk.m_lpVoid); assert(freeTrunk.m_dwUseSize >= dwUseSize && freeTrunk.m_dwChunkSize >= dwChunkSize); if (//dwChunkSize == freeTrunk.dwChunkSize /*&&*/ freeTrunk.m_dwUseSize == dwUseSize) { assert(freeTrunk.m_dwChunkSize >= dwChunkSize ); if (freeTrunk.m_dwChunkSize == dwChunkSize) {//accuracy Match Memory Block MemoryTrunk allocateTrunk = freeTrunk;/*(