A generic pool allocator where all allocations have up to a certain chunk size. More...

#include <PoolAllocator.hpp>

Inheritance diagram for Grindstone::Memory::Allocators::GenericPoolAllocator:

Public Member Functions
void	Initialize (void *ownedMemory, size_t totalSize, size_t sizePerChunk)

bool	Initialize (size_t sizePerChunk, size_t maxChunkCount)

void *	Allocate ()

void	Deallocate (size_t index)

void	Deallocate (void *ptr)

Public Member Functions inherited from Grindstone::Memory::Allocators::BasePoolAllocator
void	Clear ()

void	ClearAndZero ()

void	Destroy ()

bool	IsEmpty () const

size_t	GetUsedCount () const

Additional Inherited Members
Protected Member Functions inherited from Grindstone::Memory::Allocators::BasePoolAllocator
void *	AllocateImpl ()

void	SetupLinkedList ()

void	DeallocateImpl (size_t index)

void	DeallocateImpl (void *ptr)

Protected Attributes inherited from Grindstone::Memory::Allocators::BasePoolAllocator
size_t	totalMemorySize = 0

size_t	chunkSize = 0

size_t	usedChunkCount = 0

size_t	totalChunkCount = 0

FreeLink *	headFreePtr = nullptr

void *	memory = nullptr

bool	hasAllocatedOwnMemory = false

std::function< void(void *)>	deleteFn

Detailed Description

A generic pool allocator where all allocations have up to a certain chunk size.

Memory in a linear allocator is allocated sequentially, similar to a StackAllocator, one after the other. This removes the possibility of fragmentation, but with LinearAllocators specifically, they are never deallocated. Also known as an arena allocator.

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

/github/workspace/sources/code/Common/Memory/Allocators/PoolAllocator.hpp
/github/workspace/sources/code/Common/Memory/Allocators/PoolAllocator.cpp

Public Member Functions

Additional Inherited Members

Detailed Description