#pragma once
/****************************************************************************
Copyright (c) 2006, Radon Labs GmbH
Copyright (c) 2011-2013,WebJet Business Division,CYOU
 
http://www.genesis-3d.com.cn

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
****************************************************************************/

#include "core/types.h"
#include "memory/heap.h"
#include "memory/poolarrayallocator.h"

//------------------------------------------------------------------------------
namespace Util
{
class Blob
{
public:
    /// static Setup method, called by SysFunc::Setup()
    static void Setup();
    /// static Shutdown method called by SysFunc::Exit
    static void Shutdown();
    /// override new operator
    void* operator new(size_t s);
    /// override delete operator
    void operator delete(void* ptr);

    /// default constructor
    Blob();
    /// constructor
    Blob(const void* ptr, SizeT size);
    /// reserve N bytes
    Blob(SizeT size);
    /// copy constructor
    Blob(const Blob& rhs);
    /// destructor
    ~Blob();
    /// assignment operator
    void operator=(const Blob& rhs);
    
    /// equality operator
    bool operator==(const Blob& rhs) const;
    /// inequality operator
    bool operator!=(const Blob& rhs) const;
    /// greater operator
    bool operator>(const Blob& rhs) const;
    /// less operator
    bool operator<(const Blob& rhs) const;
    /// greater-equal operator
    bool operator>=(const Blob& rhs) const;
    /// less-eqial operator
    bool operator<=(const Blob& rhs) const;
    
    /// return true if the blob contains data
    bool IsValid() const;
    /// reserve N bytes
    void Reserve(SizeT size);
    /// trim the size member (without re-allocating!)
    void Trim(SizeT size);
    /// set blob contents
    void Set(const void* ptr, SizeT size);
    /// get blob ptr
    void* GetPtr() const;
    /// get blob size
    SizeT Size() const;
    /// get a hash code (compatible with Util::HashTable)
    IndexT HashCode() const;

private:
    /// delete content
    void Delete();
    /// allocate internal buffer
    void Allocate(SizeT size);
    /// copy content
    void Copy(const void* ptr, SizeT size);
    /// do a binary comparison between this and other blob
    int BinaryCompare(const Blob& rhs) const;

    static Memory::Heap* DataHeap;

    void* ptr;
    SizeT size;
    SizeT allocSize;
};

//------------------------------------------------------------------------------
/**
*/
__forceinline void*
Blob::operator new(size_t size)
{
    #if NEBULA3_DEBUG
    n_assert(size == sizeof(Blob));
    #endif

    #if NEBULA3_OBJECTS_USE_MEMORYPOOL
        return Memory::ObjectPoolAllocator->Alloc(size);
    #else
        return Memory::Alloc(Memory::ObjectHeap, size);
    #endif
}

//------------------------------------------------------------------------------
/**
*/
__forceinline void
Blob::operator delete(void* ptr)
{
    #if NEBULA3_OBJECTS_USE_MEMORYPOOL
        return Memory::ObjectPoolAllocator->Free(ptr, sizeof(Blob));
    #else
        return Memory::Free(Memory::ObjectHeap, ptr);
    #endif
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Setup()
{
    n_assert(0 == DataHeap);
    DataHeap = n_new(Memory::Heap("Util.Blob.DataHeap"));
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Shutdown()
{
    n_assert(0 != DataHeap);
    n_delete(DataHeap);
    DataHeap = 0;
}

//------------------------------------------------------------------------------
/**
*/
inline
Blob::Blob() :
    ptr(0),
    size(0),
    allocSize(0)
{
    // empty
}

//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::IsValid() const
{
    return (0 != this->ptr);
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Delete()
{
    if (this->IsValid())
    {
        n_assert(0 != DataHeap);
        DataHeap->Free((void*)this->ptr);
        this->ptr = 0;
        this->size = 0;
        this->allocSize = 0;
    }
}

//------------------------------------------------------------------------------
/**
*/
inline
Blob::~Blob()
{
    this->Delete();
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Allocate(SizeT s)
{
    n_assert(!this->IsValid());
    n_assert(0 != DataHeap);
    this->ptr = DataHeap->Alloc(s);
    this->allocSize = s;
    this->size = s;
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Copy(const void* fromPtr, SizeT fromSize)
{
    n_assert((0 != fromPtr) && (fromSize > 0));

    // only re-allocate if not enough space
    if ((0 == this->ptr) || (this->allocSize < fromSize))
    {
        this->Delete();
        this->Allocate(fromSize);
    }
    this->size = fromSize;
    Memory::Copy(fromPtr, (void*) this->ptr, fromSize);
}

//------------------------------------------------------------------------------
/**
*/
inline
Blob::Blob(const void* fromPtr, SizeT fromSize) :
    ptr(0),
    size(0),
    allocSize(0)
{    
    this->Copy(fromPtr, fromSize);
}

//------------------------------------------------------------------------------
/**
*/
inline
Blob::Blob(const Blob& rhs) :
    ptr(0),
    size(0),
    allocSize(0)
{
    if (rhs.IsValid())
    {
        this->Copy(rhs.ptr, rhs.size);
    }
}

//------------------------------------------------------------------------------
/**
*/
inline
Blob::Blob(SizeT s) :
    ptr(0),
    size(0),
    allocSize(0)
{
    this->Allocate(s);
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::operator=(const Blob& rhs)
{
    if (rhs.IsValid())
    {
        this->Copy(rhs.ptr, rhs.size);
    }
}

//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::operator==(const Blob& rhs) const
{
    return (this->BinaryCompare(rhs) == 0);
}
            
//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::operator!=(const Blob& rhs) const
{
    return (this->BinaryCompare(rhs) != 0);
}

//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::operator>(const Blob& rhs) const
{
    return (this->BinaryCompare(rhs) > 0);
}
            
//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::operator<(const Blob& rhs) const
{
    return (this->BinaryCompare(rhs) < 0);
}

//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::operator>=(const Blob& rhs) const
{
    return (this->BinaryCompare(rhs) >= 0);
}
            
//------------------------------------------------------------------------------
/**
*/
inline bool
Blob::operator<=(const Blob& rhs) const
{
    return (this->BinaryCompare(rhs) <= 0);
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Reserve(SizeT s)
{
    if (this->allocSize < s)
    {
        this->Delete();
        this->Allocate(s);
    }
    this->size = s;
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Trim(SizeT trimSize)
{
    n_assert(trimSize <= this->size);
    this->size = trimSize;
}

//------------------------------------------------------------------------------
/**
*/
inline void
Blob::Set(const void* fromPtr, SizeT fromSize)
{
    this->Copy(fromPtr, fromSize);
}

//------------------------------------------------------------------------------
/**
*/
inline void*
Blob::GetPtr() const
{
    n_assert(this->IsValid());
    return this->ptr;
}

//------------------------------------------------------------------------------
/**
*/
inline SizeT
Blob::Size() const
{
    n_assert(this->IsValid());
    return this->size;
}

//------------------------------------------------------------------------------
/**
*/
inline IndexT
Blob::HashCode() const
{
    IndexT hash = 0;
    const char* charPtr = (const char*) this->ptr;
    IndexT i;
    for (i = 0; i < this->size; i++)
    {
        hash += charPtr[i];
        hash += hash << 10;
        hash ^= hash >>  6;
    }
    hash += hash << 3;
    hash ^= hash >> 11;
    hash += hash << 15;
    hash &= ~(1<<31);       // don't return a negative number (in case IndexT is defined signed)
    return hash;
}

} // namespace Util
//------------------------------------------------------------------------------