mem_block_manager< T >

#include <mem_block_mgr.h>

Data Structures
struct	entry

Public Member Functions
	~mem_block_manager ()
T *	copy (const T *ptr, int size)
void	mark_as_free ()

Private Attributes
ptr_list_t< entry >	list

Detailed Description

template<class T>
class mem_block_manager< T >

Definition at line 8 of file mem_block_mgr.h.

---

Data Structure Documentation

struct mem_block_manager::entry

template<class T>
struct mem_block_manager< T >::entry

Definition at line 10 of file mem_block_mgr.h.

Data Fields
mem_block_t< T >	block
bool	used

Constructor & Destructor Documentation

template<class T >

mem_block_manager< T >::~mem_block_manager ( )

inline

Definition at line 68 of file mem_block_mgr.h.

{list.delete_all();}

Member Function Documentation

template<class T >

T* mem_block_manager< T >::copy ( const T *  ptr, int  size  )

inline

Definition at line 17 of file mem_block_mgr.h.

    {
        int n;
        int found_size = -1,found_index = -1;
        for(n=0;n<list.get_count();n++)
        {
            if (!list[n]->used)
            {
                int block_size = list[n]->block.get_size();
                if (found_size<0)
                {
                    found_index=n; found_size = block_size;
                }
                else if (found_size<size)
                {
                    if (block_size>found_size)
                    {
                        found_index=n; found_size = block_size;
                    }
                }
                else if (found_size>size)
                {
                    if (block_size>=size && block_size<found_size)
                    {
                        found_index=n; found_size = block_size;
                    }
                }

                if (found_size==size) break;
            }
        }
        if (found_index>=0)
        {
            list[found_index]->used = true;
            return list[found_index]->block.copy(ptr,size);             
        }
        entry * new_entry = new entry;
        new_entry->used = true;
        list.add_item(new_entry);
        return new_entry->block.copy(ptr,size);
    }

template<class T >

void mem_block_manager< T >::mark_as_free ( )

inline

Definition at line 59 of file mem_block_mgr.h.

    {
        int n;
        for(n=0;n<list.get_count();n++)
        {
            list[n]->used = false;
        }
    }

Field Documentation

template<class T >

ptr_list_t<entry> mem_block_manager< T >::list

private

Definition at line 15 of file mem_block_mgr.h.

---

The documentation for this class was generated from the following file:

• pfc/mem_block_mgr.h