RecastAlloc.h

// Modified version of Recast/Detour's source file
 
//
// Copyright (c) 2009-2010 Mikko Mononen memon@inside.org
//
// This software is provided 'as-is', without any express or implied
// warranty.  In no event will the authors be held liable for any damages
// arising from the use of this software.
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
// 1. The origin of this software must not be misrepresented; you must not
//    claim that you wrote the original software. If you use this software
//    in a product, an acknowledgment in the product documentation would be
//    appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
//    misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
//
 
#ifndef RECASTALLOC_H
#define RECASTALLOC_H
 
#include <AtomsUtils/Globals.h>
#include <cstring>
#include <cmath>
 
namespace AtomsUtils
{
enum rcAllocHint
{
    RC_ALLOC_PERM,      
    RC_ALLOC_TEMP       
};
 
//  @param[in]      size            The size, in bytes of memory, to allocate.
//  @param[in]      rcAllocHint A hint to the allocator on how long the memory is expected to be in use.
//  @return A pointer to the beginning of the allocated memory block, or null if the allocation failed.
typedef void* (rcAllocFunc)(int size, rcAllocHint hint);
 
typedef void (rcFreeFunc)(void* ptr);
 
ATOMSUTILS_EXPORT void rcAllocSetCustom(rcAllocFunc *allocFunc, rcFreeFunc *freeFunc);
 
void* rcAlloc(int size, rcAllocHint hint);
 
void rcFree(void* ptr);
 
void rcMemCpy(void* dst, void* src, int size);
 
class rcIntArray
{
    int* m_data;
    int m_size, m_cap;
    inline rcIntArray(const rcIntArray&);
    inline rcIntArray& operator=(const rcIntArray&);
public:
 
    inline rcIntArray() : m_data(0), m_size(0), m_cap(0) {}
 
    inline rcIntArray(int n) : m_data(0), m_size(0), m_cap(0) { resize(n); }
    inline ~rcIntArray() { rcFree(m_data); }
 
    void resize(int n);
 
    inline void push(int item) { resize(m_size+1); m_data[m_size-1] = item; }
 
    inline int pop() { if (m_size > 0) m_size--; return m_data[m_size]; }
 
    inline const int& operator[](int i) const { return m_data[i]; }
 
    inline int& operator[](int i) { return m_data[i]; }
 
    inline int size() const { return m_size; }
 
    // added contains()
    bool contains(int n) const;
};
 
template<class T> class rcScopedDelete
{
    T* ptr;
    int size;
    inline T* operator=(T* p);
public:
 
    inline rcScopedDelete() : ptr(0) {}
    inline rcScopedDelete(int n) { ptr = (T*)rcAlloc(sizeof(T)*n, RC_ALLOC_TEMP); size = n; }
 
    inline rcScopedDelete(T* p) : ptr(p) {}
    inline ~rcScopedDelete() { rcFree(ptr); ptr = 0; size = 0; }
 
    inline operator T*() { return ptr; }
 
    bool resizeGrow(int n);
};
 
template<class T>
bool rcScopedDelete<T>::resizeGrow(int n)
{
    if (n > size)
    {
        T* newData = (T*)rcAlloc(sizeof(T) * n, RC_ALLOC_TEMP);
        if (n && newData) rcMemCpy(newData, ptr, sizeof(T) * n);
        rcFree(ptr);
        ptr = newData;
        size = n;
    }
 
    return (ptr != 0);
}
 
template<class T>
class rcScopedStructArrayDelete
{
    int itemCount;
    T* ptr;
 
    // on purpose made private to restrict copying
    inline T* operator=(T* p);
public:
 
    inline rcScopedStructArrayDelete(const int n) : itemCount(n) { ptr = (T*)rcAlloc(sizeof(T)*n, RC_ALLOC_TEMP); }
 
    ~rcScopedStructArrayDelete()
    {
        for (int itemIndex = 0; itemIndex < itemCount; ++itemIndex)
        {
            ptr[itemIndex].~T();
        }
        rcFree(ptr);
    }
 
    inline operator T*() { return ptr; }
};
 
}
#endif