An allocation policy for use with AllocatedObject and STLAllocator, which aligns memory at a given boundary (which should be a power of 2). More...
#include <OgreMemoryNedPooling.h>
Public Types | |
typedef int | IsValidAlignment [Alignment<=128 &&((Alignment &(Alignment-1))==0)?+1:-1] |
Static Public Member Functions | |
static void * | allocateBytes (size_t count, const char *file=0, int line=0, const char *func=0) |
static void | deallocateBytes (void *ptr) |
static size_t | getMaxAllocationSize () |
Get the maximum size of a single allocation. | |
Private Member Functions | |
NedPoolingAlignedPolicy () |
An allocation policy for use with AllocatedObject and STLAllocator, which aligns memory at a given boundary (which should be a power of 2).
This is the class that actually does the allocation and deallocation of physical memory, and is what you will want to provide a custom version of if you wish to change how memory is allocated.
Definition at line 103 of file OgreMemoryNedPooling.h.
typedef int Ogre::NedPoolingAlignedPolicy< Alignment >::IsValidAlignment[Alignment<=128 &&((Alignment &(Alignment-1))==0)?+1:-1] |
Definition at line 108 of file OgreMemoryNedPooling.h.
Ogre::NedPoolingAlignedPolicy< Alignment >::NedPoolingAlignedPolicy | ( | ) | [private] |
Definition at line 128 of file OgreMemoryNedPooling.h.
static void* Ogre::NedPoolingAlignedPolicy< Alignment >::allocateBytes | ( | size_t | count, | |
const char * | file = 0 , |
|||
int | line = 0 , |
|||
const char * | func = 0 | |||
) | [static] |
Definition at line 110 of file OgreMemoryNedPooling.h.
static void Ogre::NedPoolingAlignedPolicy< Alignment >::deallocateBytes | ( | void * | ptr | ) | [static] |
Definition at line 116 of file OgreMemoryNedPooling.h.
static size_t Ogre::NedPoolingAlignedPolicy< Alignment >::getMaxAllocationSize | ( | ) | [static] |
Get the maximum size of a single allocation.
Definition at line 122 of file OgreMemoryNedPooling.h.
Copyright © 2012 Torus Knot Software Ltd
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.
Last modified Fri May 25 23:38:12 2012