Click here to Skip to main content
15,894,405 members
Articles / Programming Languages / C++

A Fast Efficient Allocator for Small Blocks of Memory

Rate me:
Please Sign up or sign in to vote.
2.85/5 (11 votes)
20 Feb 2008CPOL9 min read 54.5K   731   27  
Describes building a fast and efficient small block memory allocator (with full source).
// memtest.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"

class block;
class initializer;

class rtAllocator
{
public:
	static void* alloc(long ls);
	static void free(void* p);

	static const int bdCount = 129;
private:
	friend class initializer;
	// must be called before first alloc
	static void init();

	static int findBlockIndex(void* b);
	static block* findBlockInArray(void* p);

	static void addBlockToArray(block* b);
	static void removeBlockFromArray(block* b);

	static block* mFreeBlocks[bdCount];
	static long mBlockCount;
	static long mBlockArraySize;
	static block** mBlockArray; 
	static block** mBlockArrayEnd;
	static bool mInited;
	static block* mLastFoundBlock;
	static char mBDIndexLookup[1025];
};

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
United States United States
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions