Arena Class Reference

#include <lockedpool.h>

Inheritance diagram for Arena:

Classes
struct	Stats
	Memory statistics. More...

Public Member Functions
	Arena (void *base, size_t size, size_t alignment)
virtual	~Arena ()
	Arena (const Arena &other)=delete
Arena &	operator= (const Arena &)=delete
void *	alloc (size_t size)
	Allocate size bytes from this arena. More...
void	free (void *ptr)
	Free a previously allocated chunk of memory. More...
Stats	stats () const
	Get arena usage statistics. More...
bool	addressInArena (void *ptr) const
	Return whether a pointer points inside this arena. More...

Private Types
typedef std::multimap< size_t, void * >	SizeToChunkSortedMap
typedef std::unordered_map< void *, SizeToChunkSortedMap::const_iterator >	ChunkToSizeMap

Private Attributes
SizeToChunkSortedMap	size_to_free_chunk
	Map to enable O(log(n)) best-fit allocation, as it's sorted by size. More...
ChunkToSizeMap	chunks_free
	Map from begin of free chunk to its node in size_to_free_chunk. More...
ChunkToSizeMap	chunks_free_end
	Map from end of free chunk to its node in size_to_free_chunk. More...
std::unordered_map< void *, size_t >	chunks_used
	Map from begin of used chunk to its size. More...
void *	base
	Base address of arena. More...
void *	end
	End address of arena. More...
size_t	alignment
	Minimum chunk alignment. More...

Detailed Description

Definition at line 48 of file lockedpool.h.

Member Typedef Documentation

ChunkToSizeMap

typedef std::unordered_map<void*, SizeToChunkSortedMap::const_iterator> Arena::ChunkToSizeMap

private

Definition at line 96 of file lockedpool.h.

SizeToChunkSortedMap

typedef std::multimap<size_t, void*> Arena::SizeToChunkSortedMap

private

Definition at line 92 of file lockedpool.h.

Constructor & Destructor Documentation

Arena() [1/2]

Arena::Arena	(	void *	base,
		size_t	size,
		size_t	alignment
	)

Definition at line 40 of file lockedpool.cpp.

~Arena()

Arena::~Arena ( )

virtualdefault

Arena() [2/2]

Arena::Arena ( const Arena &  other )

delete

Member Function Documentation

addressInArena()

bool Arena::addressInArena ( void *  ptr ) const

inline

Return whether a pointer points inside this arena.

This returns base <= ptr < (base+size) so only use it for (inclusive) chunk starting addresses.

Definition at line 90 of file lockedpool.h.

alloc()

void * Arena::alloc

(

size_t

size

)

Allocate size bytes from this arena.

Returns pointer on success, or 0 if memory is full or the application tried to allocate 0 bytes.

Definition at line 51 of file lockedpool.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

free()

void Arena::free

(

void *

ptr

)

Free a previously allocated chunk of memory.

Freeing the zero pointer has no effect. Raises std::runtime_error in case of error.

Definition at line 87 of file lockedpool.cpp.

Here is the caller graph for this function:

operator=()

Arena & Arena::operator= ( const Arena &  )

delete

stats()

Arena::Stats Arena::stats

(

)

const

Get arena usage statistics.

Definition at line 125 of file lockedpool.cpp.

Here is the caller graph for this function:

Member Data Documentation

alignment

size_t Arena::alignment

private

Minimum chunk alignment.

Definition at line 110 of file lockedpool.h.

base

void* Arena::base

private

Base address of arena.

Definition at line 106 of file lockedpool.h.

chunks_free

ChunkToSizeMap Arena::chunks_free

private

Map from begin of free chunk to its node in size_to_free_chunk.

Definition at line 98 of file lockedpool.h.

chunks_free_end

ChunkToSizeMap Arena::chunks_free_end

private

Map from end of free chunk to its node in size_to_free_chunk.

Definition at line 100 of file lockedpool.h.

chunks_used

std::unordered_map<void*, size_t> Arena::chunks_used

private

Map from begin of used chunk to its size.

Definition at line 103 of file lockedpool.h.

end

void* Arena::end

private

End address of arena.

Definition at line 108 of file lockedpool.h.

size_to_free_chunk

SizeToChunkSortedMap Arena::size_to_free_chunk

private

Map to enable O(log(n)) best-fit allocation, as it's sorted by size.

Definition at line 94 of file lockedpool.h.

---

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

• src/support/lockedpool.h
• src/support/lockedpool.cpp