Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version
Go to top

Arena Allocator, DTOR and Embedded Preallocated Buffer

, 25 Nov 2009
Arena like memory management, embedding allocations inside Arena, DTOR, context thinking
////////////////////////////////////////////////////////////////////////////////////////////////////
// \file arena_allocator.cpp : implementation of arena allocation schema
//
// Afftar: Reuven Bass - inspired by Mamasha Knows
////////////////////////////////////////////////////////////////////////////////////////////////////

#include "StdAfx.h"
#include "arena_allocator.h"



////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////


namespace unitest {

/**/
void arena_simple_usage()
{
	struct SomeSt {
		double d;
		int    i;

		SomeSt()				{;}
		SomeSt(double, int)		{;}
	};

	Arena arena;
	SomeSt* p1   = new (arena) SomeSt[20];
	double* darr = new (arena) double[4000];

	arena.DTOR(p1, 20);

	SomeSt* p4 = new (arena) SomeSt[10];
	SomeSt* p5 = new (arena) SomeSt(10., 30);

	for (int i = 10000; i-- > 0; )
		arena.DTOR(new (arena) SomeSt);

	arena.DTOR(p4, 10);
	arena.DTOR(p5);
}


/**/
void my_arena_usage()
{
	struct SomeSt {
		double d;
		int    i;

		SomeSt()				{;}
		SomeSt(double, int)		{;}
		~SomeSt()				{ printf("SomeSt::DTOR() %d\n", i); }
	};

	MyArena<256> arena;

	SomeSt* p4 = new (arena) SomeSt[3];
	SomeSt* p5 = new (arena) SomeSt(10., 30);

	p4[0].i = 10;
	p4[1].i = 20;
	p4[2].i = 30;

	p5->i = 500;

	arena.DTOR(p4, 3);
	arena.DTOR(p5);

	arena.clear();

	int st_size = sizeof(SomeSt);
	p4 = new (arena) SomeSt[3];
	p5 = new (arena) SomeSt(10., 30);

	p4[0].i = 10;
	p4[1].i = 20;
	p4[2].i = 30;

	p5->i = 500;

	arena.DTOR(p4, 3);
	arena.DTOR(p5);
}

using namespace boost::intrusive;

class MyStruct
	: public slist_base_hook<>
{
public:
	int indx_;
};

typedef slist<MyStruct> AList;

/**/
void slist_usecase()
{
	AList l1;
	AList l2;
	
	MyStruct* p = new MyStruct[3];

	p[0].indx_ = 0;
	p[1].indx_ = 1;
	p[2].indx_ = 2;

//	l1.push_back(p[0]);
//	l1.push_back(p[1]);
//	l1.push_back(p[2]);

	l2.push_front(p[0]);
	l2.push_front(p[1]);
	l2.push_front(p[2]);

	for ( AList::iterator it(l2.begin()), end(l2.end()); it != end; ++it )
		printf("%d\n", it->indx_);

	return;
}


/**/
void arena_usecases()
{
	arena_simple_usage();
	my_arena_usage();
	return;

	return;

	slist_usecase();
	return;
}

}	// namespace unitest

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)

Share

About the Author

Mamasha Knows
Chief Technology Officer Cpp2Mtl Integration Solutions
United States United States
My real name is Reuven Bass. My first article here was published under the Mamasha Knows pseudonym. It worked. So, I stay with Mamasha for a while. (If it works - do not touch it)
 
Programming became my life from thirteen. I love coding. I love beauty. I always try to combine coding and beauty.
 
RB

| Advertise | Privacy | Mobile
Web02 | 2.8.140926.1 | Last Updated 25 Nov 2009
Article Copyright 2009 by Mamasha Knows
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid