TFreeList Class Reference

#include <TFreeList.h>

Classes
struct	Node

Public Member Functions
	TFreeList (TUINT a_uiItemSize, TINT a_iInitialSize, TINT a_iGrowSize, const TCHAR *a_pchName)
Node *	Allocate (TINT a_iNumber, TINT a_iSize)
void	SetCapacity (TINT a_iNewCapacity)
TINT	GetCapacity () const
TINT	GetGrowSize () const
void	SetGrowSize (TINT a_iGrowSize)
void *	New (TUINT a_uiSize)
void	Delete (void *a_Ptr)

Detailed Description

Definition at line 27 of file TFreeList.h.

Constructor & Destructor Documentation

TFreeList()

TFreeList::TFreeList	(	TUINT	a_uiItemSize,
		TINT	a_iInitialSize,
		TINT	a_iGrowSize,
		const TCHAR *	a_pchName )

Definition at line 12 of file TFreeList.cpp.

{
    m_uiItemSize  = a_uiItemSize;
    m_iCapacity   = 0;
    m_pMemoryHeap = TNULL;
    TASSERT( m_iGrowSize >= 0 );
    TASSERT( a_iInitialSize >= 0 );
    SetGrowSize( a_iGrowSize );
 
    m_pPrevList  = ms_pLastList;
    ms_pLastList = this;
}

Member Function Documentation

Allocate()

TFreeList::Node * TFreeList::Allocate	(	TINT	a_iNumber,
		TINT	a_iSize )

Definition at line 25 of file TFreeList.cpp.

{
    TASSERT( a_iNumber > 0 );
    m_iCapacity += a_iNumber;
 
    Node* pNewNode = TREINTERPRETCAST( Node*, TMalloc( a_iNumber * a_iSize + sizeof( Node ), m_pMemoryHeap ) );
 
    pNewNode->pNext  = m_RootNode.pNext;
    m_RootNode.pNext = pNewNode;
 
    auto  pData = pNewNode + 1;
    Node* pNext = TNULL;
 
    for ( TINT i = a_iNumber - 1; i != 0; i-- )
    {
        pData->pNext = pNext;
        pNext        = pData;
 
        pData = TREINTERPRETCAST( Node*, TREINTERPRETCAST( uintptr_t, pData ) + a_iSize );
    }
 
    m_LastNode.pNext = pNext;
    return pData;
}

Delete()

void TFreeList::Delete

(

void *

a_Ptr

)

Definition at line 81 of file TFreeList.cpp.

{
    Node* pNode = TSTATICCAST( Node, a_Ptr );
 
    if ( m_LastNode.pNext != TNULL )
    {
        pNode->pNext     = m_LastNode.pNext;
        m_LastNode.pNext = pNode;
    }
    else
    {
        m_LastNode.pNext = pNode;
        pNode->pNext     = TNULL;
    }
}

GetCapacity()

TINT TFreeList::GetCapacity ( ) const

inline

Definition at line 41 of file TFreeList.h.

{ return m_iCapacity; }

GetGrowSize()

TINT TFreeList::GetGrowSize ( ) const

inline

Definition at line 42 of file TFreeList.h.

{ return m_iGrowSize; }

New()

void * TFreeList::New

(

TUINT

a_uiSize

)

Definition at line 61 of file TFreeList.cpp.

{
    if ( a_uiSize != m_uiItemSize )
    {
        return TMalloc( a_uiSize, TNULL );
    }
 
    auto pNode = m_LastNode.pNext;
 
    if ( pNode != TNULL )
    {
        m_LastNode.pNext = pNode->pNext;
        return pNode;
    }
    else
    {
        return Allocate( m_iGrowSize, a_uiSize );
    }
}

SetCapacity()

void TFreeList::SetCapacity

(

TINT

a_iNewCapacity

)

Definition at line 50 of file TFreeList.cpp.

{
    if ( m_iCapacity < a_iNewCapacity )
    {
        auto pNode = Allocate( a_iNewCapacity - m_iCapacity, m_uiItemSize );
 
        pNode->pNext     = m_LastNode.pNext;
        m_LastNode.pNext = pNode;
    }
}

SetGrowSize()

void TFreeList::SetGrowSize ( TINT a_iGrowSize )

inline

Definition at line 44 of file TFreeList.h.

{ a_iGrowSize < 0 ? m_iGrowSize = 8 : m_iGrowSize = a_iGrowSize; }

---

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

• D:/_dev/OpenBarnyard/Source/Toshi/Source/Toshi/TFreeList.h
• D:/_dev/OpenBarnyard/Source/Toshi/Source/Toshi/TFreeList.cpp