一個簡易內存池（C++）

做這個內存池主要是為了完成一道面試題，題目在代碼中。

代碼

#include <iostream>
#include<string>
#include <list>
using namespace std;

//一個簡單的內存池，池中保存3塊內存分別為1k,2k,4k
//實現池子的malloc（size）和free(void*)操作
//不考慮跨塊申請內存情況

class node
{
public:
    int offset;//相對於起始地址偏移
    bool flag;//是有效地址還是已經分配地址
    int len;
    node()
    {
        offset=0;
        flag=true;
        len=0;
    }
    node(int sz)
    {
        offset=0;
        flag=true;
        len=sz;
    }
};

class memPool
{
public:
    memPool()
    {
        m_First_Count= 1024;
        m_Second_Count = 2*1024;
        m_Third_Count = 4*1024;
        m_First_Address = new char[m_First_Count];
        m_Second_Address = new char[m_Second_Count];
        m_Third_Address = new char[m_Third_Count];
        
        first.insert(first.begin(),new node(1024));        
        second.insert(second.begin(),new node(1024*2));        
        third.insert(third.begin(),new node(1024*4));
    }
    ~memPool()
    {
        delete[]m_First_Address;
        delete[]m_Second_Address;
        delete[]m_Third_Address;
        m_First_Address = NULL;
        m_Second_Address = NULL;
        m_Third_Address = NULL;

    }
    char* myMalloc(const int memSize)
    {
        //采用首次適應算法
        list<node*>::iterator it;
        if (memSize <= m_First_Count)
        {
            it = first.begin();
            while(it!=first.end())
            {
                if (((*it)->len)>= memSize &&(*it)->flag == true)
                {
                    (*it)->flag = false;
                    int temp = (*it)->len;
                    (*it)->len = memSize;
                    if (temp - memSize >0)
                    {
                        node *obj = new node;
                        obj->flag=true;
                        obj->len = temp - memSize;
                        obj->offset = (*it)->offset + memSize;
                        it++;
                        first.insert(it,obj);
                        it--;
                        it--;
                        m_First_Count-=memSize;
                        cout << "malloc "<< memSize << " in first memery"<<endl;
                        return m_First_Address+(*it)->offset;
                    }
                }
                it++;
            }
            
        }

        if (memSize <= m_Second_Count)
        {
            it = second.begin();
            while(it!=second.end())
            {
                if (((*it)->len)>= memSize&&(*it)->flag == true)
                {
                    (*it)->flag = false;
                    int temp = (*it)->len;
                    (*it)->len = memSize;
                    if (temp - memSize >0)
                    {
                        node *obj = new node;
                        obj->flag=true;
                        obj->len = temp - memSize;
                        obj->offset = (*it)->offset + memSize;
                        it++;
                        second.insert(it,obj);
                        it--;
                        it--;
                        m_Second_Count-=memSize;
                        cout << "malloc "<< memSize << "in second memery"<<endl;
                        return m_Second_Address+(*it)->offset;
                    }
                }
                it++;
            }
            
        }

        if (memSize <= m_Third_Count)
        {
            it = third.begin();
            while(it!=third.end())
            {
                if (((*it)->len)>= memSize&&(*it)->flag == true)
                {
                    (*it)->flag = false;
                    int temp = (*it)->len;
                    (*it)->len = memSize;
                    if (temp - memSize >0)
                    {
                        node *obj=new node;
                        obj->flag=true;
                        obj->len = temp - memSize;
                        obj->offset = (*it)->offset + memSize;
                        it++;
                        third.insert(it,obj);
                        it--;
                        it--;
                        m_Third_Count-=memSize;
                        cout << "malloc "<< memSize << "in third memery"<<endl;
                        return m_Third_Address+(*it)->offset;
                    }
                }
                it++;
            }
            
        }

        cout<<"no memery\n";
        return NULL;

    }
/************************************************************************/
/* 算法思路是第一步定位這個指針位於哪一個內存塊，第二步在對應內存塊中找到*/
/*其node，然后判斷node前后是否都為有效內存，也就是沒有被利用的內存塊*/
/************************************************************************/
    void memFree(void* address_arg)
    {
        char *freeAddress= static_cast<char*>(address_arg);
        int offset;
        list<node*>::iterator it;
        if (freeAddress >= m_First_Address && freeAddress < (m_First_Address+1024))//位於第一塊
        {
            offset = freeAddress - m_First_Address;
            it = first.begin();

            while(it!= first.end())//定位offset
            {
                if (offset == (*it)->offset)
                    break;

                it++;
            }
            if (it == first.end())//沒有找到offset
            {
                cout << "In first memery,there is no memery of freeaddress"<<endl;
                return;
            }
            
            if((*it)->flag == true)//找到offset，但是這塊內存沒有分配
            {
                cout << "In first memery,the freeAddress is valid,you can't free it"<<endl;
                return;
            }
            (*it)->flag = true;
            
            int len = (*it)->len;
            int count=0;
            if (it!=first.end())//判斷it后繼節點是否被分配
            {
                it++;
                if ((*it)->flag == true)
                {
                    len+=(*it)->len;
                    count++;
                }
                it--;
            }
            if (it!=first.begin())
            {
                it--;
                if ((*it)->flag == true)
                {
                    len+=(*it)->len;
                    count++;
                }
                else
                    it++;
            }
            (*it)->len = len;
            it++;
            while(count--)
            {
                it = first.erase(it);//erase返回刪除節點的后繼節點        
                
            }        
            
            cout << "free success"<<endl;
            return;

        }
        else if (freeAddress >= m_Second_Address && freeAddress < (m_Second_Address+1024*2))//位於第二塊
        {
            offset = freeAddress - m_Second_Address;
            it = second.begin();

            while(it!= second.end())//定位offset
            {
                if (offset == (*it)->offset)
                    break;

                it++;
            }
            if (it == second.end())//沒有找到offset
            {
                cout << "In second memery,there is no memery of freeaddress"<<endl;
                return;
            }

            if((*it)->flag == true)//找到offset，但是這塊內存沒有分配
            {
                cout << "In second memery,the freeAddress is valid,you can't free it"<<endl;
                return;
            }
            (*it)->flag = true;

            int len = (*it)->len;
            int count=0;
            if (it!=second.end())//判斷it后繼節點是否被分配
            {
                it++;
                if ((*it)->flag == true)
                {
                    len+=(*it)->len;
                    count++;
                }
                it--;
            }
            if (it!=second.begin())
            {
                it--;
                if ((*it)->flag == true)
                {
                    len+=(*it)->len;
                    count++;
                }
                else
                    it++;
            }
            (*it)->len = len;
            it++;
            while(count--)
            {
                it = second.erase(it);
            }        

            cout << "free success"<<endl;
            return;
        }
        else if (freeAddress >= m_Third_Address && freeAddress < (m_Third_Address+1024*4))//位於第三塊
        {
            offset = freeAddress - m_Third_Address;
            it = third.begin();

            while(it!= third.end())//定位offset
            {
                if (offset == (*it)->offset)
                    break;

                it++;
            }
            if (it == third.end())//沒有找到offset
            {
                cout << "In third memery,there is no memery of freeaddress"<<endl;
                return;
            }

            if((*it)->flag == true)//找到offset，但是這塊內存沒有分配
            {
                cout << "In third memery,the freeAddress is valid,you can't free it"<<endl;
                return;
            }
            (*it)->flag = true;

            int len = (*it)->len;
            int count=0;
            if (it!=third.end())//判斷it后繼節點是否被分配
            {
                it++;
                if ((*it)->flag == true)
                {
                    len+=(*it)->len;
                    count++;
                }
                it--;
            }
            if (it!=third.begin())
            {
                it--;
                if ((*it)->flag == true)
                {
                    len+=(*it)->len;
                    count++;
                }
                else
                    it++;
            }
            (*it)->len = len;
            it++;
            while(count--)
            {
                it = third.erase(it);
            }        

            cout << "free success"<<endl;
            return;
        }
        else
        {
            cout << "the memery to be freed is invalid\n";
        }
        return;
    }
private:
    char *m_First_Address;//每一塊內存起始地址
    char *m_Second_Address;
    char *m_Third_Address;
    int m_First_Count;//剩余有效地址大小，不一定是連續，是第一塊內存中所有有效之和
    int m_Second_Count;
    int m_Third_Count;
    list<node*> first;
    list<node*> second;
    list<node*> third;

};
int main()
{
    memPool obj;
    char *ptr1 = obj.myMalloc(10);    
    char *ptr2 = obj.myMalloc(100);
    char *ptr3 = obj.myMalloc(500);
    char *ptr4 = obj.myMalloc(4*1024+1);
    obj.memFree(ptr2);
    obj.memFree(ptr3);

    return 0;
}