mirror of
https://github.com/minetest/irrlicht.git
synced 2024-11-09 17:23:50 +01:00
2ae2a551a6
GLES drivers adapted, but only did make compile-tests. git-svn-id: svn://svn.code.sf.net/p/irrlicht/code/branches/ogl-es@6038 dfc29bdd-3216-0410-991c-e03cc46cb475
125 lines
2.5 KiB
C++
125 lines
2.5 KiB
C++
// Copyright (C) 2002-2012 Nikolaus Gebhardt
|
|
// This file is part of the "Irrlicht Engine" and the "irrXML" project.
|
|
// For conditions of distribution and use, see copyright notice in irrlicht.h and irrXML.h
|
|
|
|
#ifndef __IRR_ALLOCATOR_H_INCLUDED__
|
|
#define __IRR_ALLOCATOR_H_INCLUDED__
|
|
|
|
#include "irrTypes.h"
|
|
#include <new>
|
|
// necessary for older compilers
|
|
#include <memory.h>
|
|
|
|
namespace irr
|
|
{
|
|
namespace core
|
|
{
|
|
|
|
#ifdef DEBUG_CLIENTBLOCK
|
|
#undef DEBUG_CLIENTBLOCK
|
|
#define DEBUG_CLIENTBLOCK new
|
|
#endif
|
|
|
|
//! Very simple allocator implementation, containers using it can be used across dll boundaries
|
|
template<typename T>
|
|
class irrAllocator
|
|
{
|
|
public:
|
|
|
|
//! Destructor
|
|
virtual ~irrAllocator() {}
|
|
|
|
//! Allocate memory for an array of objects
|
|
T* allocate(size_t cnt)
|
|
{
|
|
return (T*)internal_new(cnt* sizeof(T));
|
|
}
|
|
|
|
//! Deallocate memory for an array of objects
|
|
void deallocate(T* ptr)
|
|
{
|
|
internal_delete(ptr);
|
|
}
|
|
|
|
//! Construct an element
|
|
void construct(T* ptr, const T&e)
|
|
{
|
|
new ((void*)ptr) T(e);
|
|
}
|
|
|
|
//! Destruct an element
|
|
void destruct(T* ptr)
|
|
{
|
|
ptr->~T();
|
|
}
|
|
|
|
protected:
|
|
|
|
virtual void* internal_new(size_t cnt)
|
|
{
|
|
return operator new(cnt);
|
|
}
|
|
|
|
virtual void internal_delete(void* ptr)
|
|
{
|
|
operator delete(ptr);
|
|
}
|
|
|
|
};
|
|
|
|
|
|
//! Fast allocator, only to be used in containers inside the same memory heap.
|
|
/** Containers using it are NOT able to be used it across dll boundaries. Use this
|
|
when using in an internal class or function or when compiled into a static lib */
|
|
template<typename T>
|
|
class irrAllocatorFast
|
|
{
|
|
public:
|
|
|
|
//! Allocate memory for an array of objects
|
|
T* allocate(size_t cnt)
|
|
{
|
|
return (T*)operator new(cnt* sizeof(T));
|
|
}
|
|
|
|
//! Deallocate memory for an array of objects
|
|
void deallocate(T* ptr)
|
|
{
|
|
operator delete(ptr);
|
|
}
|
|
|
|
//! Construct an element
|
|
void construct(T* ptr, const T&e)
|
|
{
|
|
new ((void*)ptr) T(e);
|
|
}
|
|
|
|
//! Destruct an element
|
|
void destruct(T* ptr)
|
|
{
|
|
ptr->~T();
|
|
}
|
|
};
|
|
|
|
|
|
|
|
#ifdef DEBUG_CLIENTBLOCK
|
|
#undef DEBUG_CLIENTBLOCK
|
|
#define DEBUG_CLIENTBLOCK new( _CLIENT_BLOCK, __FILE__, __LINE__)
|
|
#endif
|
|
|
|
//! defines an allocation strategy (used only by irr::array so far)
|
|
enum eAllocStrategy
|
|
{
|
|
ALLOC_STRATEGY_SAFE = 0, // increase size by 1
|
|
ALLOC_STRATEGY_DOUBLE = 1, // double size when under 500 elements, beyond that increase by 1/4th size. Plus a small constant.
|
|
ALLOC_STRATEGY_SQRT = 2 // not implemented
|
|
};
|
|
|
|
|
|
} // end namespace core
|
|
} // end namespace irr
|
|
|
|
#endif
|
|
|