KUDr@3900: /* $Id$ */
KUDr@3900: 
KUDr@3900: #ifndef  BLOB_HPP
KUDr@3900: #define  BLOB_HPP
KUDr@3900: 
KUDr@3900: template <class Titem_>
KUDr@3900: FORCEINLINE void MemCpyT(Titem_* d, const Titem_* s, int num_items = 1)
KUDr@3900: {
KUDr@3900: 	memcpy(d, s, num_items * sizeof(Titem_));
KUDr@3900: }
KUDr@3900: 
KUDr@3900: 
KUDr@3900: /** Base class for simple binary blobs.
rubidium@4549:  *  Item is byte.
rubidium@4549:  *  The word 'simple' means:
rubidium@4549:  *    - no configurable allocator type (always made from heap)
rubidium@4549:  *    - no smart deallocation - deallocation must be called from the same
rubidium@4549:  *        module (DLL) where the blob was allocated
rubidium@4549:  *    - no configurable allocation policy (how big blocks should be allocated)
rubidium@4549:  *    - no extra ownership policy (i.e. 'copy on write') when blob is copied
rubidium@4549:  *    - no thread synchronization at all */
KUDr@3900: class CBlobBaseSimple {
KUDr@3900: protected:
rubidium@4434: 	struct CHdr {
KUDr@3900: 		int    m_size;      // actual blob size in bytes
KUDr@3900: 		int    m_max_size;  // maximum (allocated) size in bytes
KUDr@3900: 	};
KUDr@3900: 
KUDr@3900: 	union {
KUDr@3900: 		int8   *m_pData;
KUDr@3900: 		CHdr   *m_pHdr_1;
KUDr@3900: 	} ptr_u;
KUDr@3900: 
KUDr@3900: public:
KUDr@5082: 	static const int Ttail_reserve = 4; // four extra bytes will be always allocated and zeroed at the end
KUDr@3900: 
KUDr@3900: 	FORCEINLINE CBlobBaseSimple() { InitEmpty(); }
KUDr@3900: 	FORCEINLINE CBlobBaseSimple(const CBlobBaseSimple& src)
KUDr@3900: 	{
KUDr@3900: 		InitEmpty();
KUDr@3900: 		AppendRaw(src);
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE ~CBlobBaseSimple() { Free(); }
KUDr@3900: protected:
KUDr@3900: 	FORCEINLINE void InitEmpty() { static CHdr hdrEmpty[] = {{0, 0}, {0, 0}}; ptr_u.m_pHdr_1 = &hdrEmpty[1]; }
KUDr@3900: 	FORCEINLINE void Init(CHdr* hdr) { ptr_u.m_pHdr_1 = &hdr[1]; }
KUDr@3900: 	FORCEINLINE CHdr& Hdr() { return ptr_u.m_pHdr_1[-1]; }
KUDr@3900: 	FORCEINLINE const CHdr& Hdr() const { return ptr_u.m_pHdr_1[-1]; }
KUDr@3900: 	FORCEINLINE int& RawSizeRef() { return Hdr().m_size; };
KUDr@3900: 
KUDr@3900: public:
KUDr@3900: 	FORCEINLINE bool IsEmpty() const { return RawSize() == 0; }
KUDr@3900: 	FORCEINLINE int RawSize() const { return Hdr().m_size; };
KUDr@3900: 	FORCEINLINE int MaxRawSize() const { return Hdr().m_max_size; };
KUDr@3900: 	FORCEINLINE int8* RawData() { return ptr_u.m_pData; }
KUDr@3900: 	FORCEINLINE const int8* RawData() const { return ptr_u.m_pData; }
KUDr@5093: #if 0 // reenable when needed
KUDr@3900: 	FORCEINLINE uint32 Crc32() const {return CCrc32::Calc(RawData(), RawSize());}
KUDr@5093: #endif //0
KUDr@3900: 	FORCEINLINE void Clear() { RawSizeRef() = 0; }
KUDr@3900: 	FORCEINLINE void Free() { if (MaxRawSize() > 0) {RawFree(&Hdr()); InitEmpty();} }
KUDr@3900: 	FORCEINLINE void CopyFrom(const CBlobBaseSimple& src) { Clear(); AppendRaw(src); }
KUDr@3900: 	FORCEINLINE void MoveFrom(CBlobBaseSimple& src) { Free(); ptr_u.m_pData = src.ptr_u.m_pData; src.InitEmpty(); }
KUDr@3900: 	FORCEINLINE void Swap(CBlobBaseSimple& src) { int8 *tmp = ptr_u.m_pData; ptr_u.m_pData = src.ptr_u.m_pData; src.ptr_u.m_pData = tmp; }
KUDr@3900: 
KUDr@3900: 	FORCEINLINE void AppendRaw(int8 *p, int num_bytes)
KUDr@3900: 	{
KUDr@3900: 		assert(p != NULL);
KUDr@3900: 		if (num_bytes > 0) {
KUDr@3900: 			memcpy(GrowRawSize(num_bytes), p, num_bytes);
rubidium@4434: 		} else {
KUDr@3900: 			assert(num_bytes >= 0);
KUDr@3900: 		}
KUDr@3900: 	}
KUDr@3900: 
KUDr@3900: 	FORCEINLINE void AppendRaw(const CBlobBaseSimple& src)
KUDr@3900: 	{
KUDr@3900: 		if (!src.IsEmpty())
KUDr@3900: 			memcpy(GrowRawSize(src.RawSize()), src.RawData(), src.RawSize());
KUDr@3900: 	}
KUDr@3900: 
KUDr@3900: 	/** Reallocate if there is no free space for num_bytes bytes.
rubidium@4549: 	 *  @return pointer to the new data to be added */
KUDr@3900: 	FORCEINLINE int8* MakeRawFreeSpace(int num_bytes)
KUDr@3900: 	{
KUDr@3900: 		assert(num_bytes >= 0);
KUDr@3900: 		int new_size = RawSize() + num_bytes;
KUDr@3900: 		if (new_size > MaxRawSize()) SmartAlloc(new_size);
KUDr@3900: 		FixTail();
KUDr@3900: 		return ptr_u.m_pData + RawSize();
KUDr@3900: 	}
KUDr@3900: 
KUDr@3900: 	/** Increase RawSize() by num_bytes.
rubidium@4549: 	 *  @return pointer to the new data added */
KUDr@3900: 	FORCEINLINE int8* GrowRawSize(int num_bytes)
KUDr@3900: 	{
KUDr@3900: 		int8* pNewData = MakeRawFreeSpace(num_bytes);
KUDr@3900: 		RawSizeRef() += num_bytes;
KUDr@3900: 		return pNewData;
KUDr@3900: 	}
KUDr@3900: 
KUDr@3900: 	/** Decrease RawSize() by num_bytes. */
KUDr@3900: 	FORCEINLINE void ReduceRawSize(int num_bytes)
KUDr@3900: 	{
KUDr@3900: 		if (MaxRawSize() > 0 && num_bytes > 0) {
KUDr@3900: 			assert(num_bytes <= RawSize());
KUDr@3900: 			if (num_bytes < RawSize()) RawSizeRef() -= num_bytes;
KUDr@3900: 			else RawSizeRef() = 0;
KUDr@3900: 		}
KUDr@3900: 	}
KUDr@3900: 	/** reallocate blob data if needed */
KUDr@3900: 	void SmartAlloc(int new_size)
KUDr@3900: 	{
KUDr@3900: 		int old_max_size = MaxRawSize();
KUDr@3900: 		if (old_max_size >= new_size) return;
KUDr@3900: 		// calculate minimum block size we need to allocate
KUDr@3900: 		int min_alloc_size = sizeof(CHdr) + new_size + Ttail_reserve;
KUDr@3900: 		// ask allocation policy for some reasonable block size
KUDr@3900: 		int alloc_size = AllocPolicy(min_alloc_size);
KUDr@3900: 		// allocate new block
rubidium@4434: 		CHdr* pNewHdr = RawAlloc(alloc_size);
KUDr@3900: 		// setup header
KUDr@3900: 		pNewHdr->m_size = RawSize();
KUDr@3900: 		pNewHdr->m_max_size = alloc_size - (sizeof(CHdr) + Ttail_reserve);
KUDr@3900: 		// copy existing data
KUDr@3900: 		if (RawSize() > 0)
KUDr@3900: 			memcpy(pNewHdr + 1, ptr_u.m_pData, pNewHdr->m_size);
KUDr@3900: 		// replace our block with new one
KUDr@3900: 		CHdr* pOldHdr = &Hdr();
KUDr@3900: 		Init(pNewHdr);
KUDr@3900: 		if (old_max_size > 0)
KUDr@3900: 			RawFree(pOldHdr);
KUDr@3900: 	}
KUDr@3900: 	/** simple allocation policy - can be optimized later */
KUDr@3900: 	FORCEINLINE static int AllocPolicy(int min_alloc)
KUDr@3900: 	{
KUDr@3900: 		if (min_alloc < (1 << 9)) {
KUDr@3900: 			if (min_alloc < (1 << 5)) return (1 << 5);
KUDr@3900: 			return (min_alloc < (1 << 7)) ? (1 << 7) : (1 << 9);
KUDr@3900: 		}
KUDr@3900: 		if (min_alloc < (1 << 15)) {
KUDr@3900: 			if (min_alloc < (1 << 11)) return (1 << 11);
KUDr@3900: 			return (min_alloc < (1 << 13)) ? (1 << 13) : (1 << 15);
KUDr@3900: 		}
KUDr@3900: 		if (min_alloc < (1 << 20)) {
KUDr@3900: 			if (min_alloc < (1 << 17)) return (1 << 17);
KUDr@3900: 			return (min_alloc < (1 << 19)) ? (1 << 19) : (1 << 20);
KUDr@3900: 		}
KUDr@3900: 		min_alloc = (min_alloc | ((1 << 20) - 1)) + 1;
KUDr@3900: 		return min_alloc;
KUDr@3900: 	}
KUDr@3900: 
KUDr@3900: 	/** all allocation should happen here */
KUDr@3900: 	static FORCEINLINE CHdr* RawAlloc(int num_bytes) { return (CHdr*)malloc(num_bytes); }
KUDr@3900: 	/** all deallocations should happen here */
KUDr@3900: 	static FORCEINLINE void RawFree(CHdr* p) { free(p); }
KUDr@3900: 	/** fixing the four bytes at the end of blob data - useful when blob is used to hold string */
KUDr@3900: 	FORCEINLINE void FixTail()
KUDr@3900: 	{
KUDr@3900: 		if (MaxRawSize() > 0) {
KUDr@3900: 			int8 *p = &ptr_u.m_pData[RawSize()];
KUDr@3900: 			for (int i = 0; i < Ttail_reserve; i++) p[i] = 0;
KUDr@3900: 		}
KUDr@3900: 	}
KUDr@3900: };
KUDr@3900: 
KUDr@3900: template <class Titem_, class Tbase_ = CBlobBaseSimple>
KUDr@3900: class CBlobT : public CBlobBaseSimple {
KUDr@3900: 	// make template arguments public:
KUDr@3900: public:
KUDr@3900: 	typedef Titem_ Titem;
KUDr@3900: 	typedef Tbase_ Tbase;
KUDr@3900: 
KUDr@5082: 	static const int Titem_size = sizeof(Titem);
KUDr@3900: 
KUDr@3900: 	FORCEINLINE CBlobT() : Tbase() {}
KUDr@3900: 	FORCEINLINE CBlobT(const Tbase& src) : Tbase(src) {assert((RawSize() % Titem_size) == 0);}
KUDr@3900: 	FORCEINLINE ~CBlobT() { Free(); }
KUDr@3900: 	FORCEINLINE void CheckIdx(int idx) { assert(idx >= 0); assert(idx < Size()); }
KUDr@3900: 	FORCEINLINE Titem* Data() { return (Titem*)RawData(); }
KUDr@3900: 	FORCEINLINE const Titem* Data() const { return (const Titem*)RawData(); }
KUDr@3900: 	FORCEINLINE Titem* Data(int idx) { CheckIdx(idx); return (Data() + idx); }
KUDr@3900: 	FORCEINLINE const Titem* Data(int idx) const { CheckIdx(idx); return (Data() + idx); }
KUDr@3900: 	FORCEINLINE int Size() const { return (RawSize() / Titem_size); }
KUDr@3900: 	FORCEINLINE void Free()
KUDr@3900: 	{
KUDr@3900: 		assert((RawSize() % Titem_size) == 0);
KUDr@3900: 		int old_size = Size();
KUDr@3900: 		if (old_size > 0) {
KUDr@3900: 			// destroy removed items;
KUDr@3900: 			Titem* pI_last_to_destroy = Data(0);
KUDr@3900: 			for (Titem* pI = Data(old_size - 1); pI >= pI_last_to_destroy; pI--) pI->~Titem_();
KUDr@3900: 		}
KUDr@3900: 		Tbase::Free();
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE Titem* GrowSizeNC(int num_items) { return (Titem*)GrowRawSize(num_items * Titem_size); }
KUDr@3900: 	FORCEINLINE Titem* GrowSizeC(int num_items)
KUDr@3900: 	{
KUDr@3900: 		Titem* pI = GrowSizeNC(num_items);
KUDr@3900: 		for (int i = num_items; i > 0; i--, pI++) new (pI) Titem();
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE void ReduceSize(int num_items)
KUDr@3900: 	{
KUDr@3900: 		assert((RawSize() % Titem_size) == 0);
KUDr@3900: 		int old_size = Size();
KUDr@3900: 		assert(num_items <= old_size);
KUDr@3900: 		int new_size = (num_items <= old_size) ? (old_size - num_items) : 0;
KUDr@3900: 		// destroy removed items;
KUDr@3900: 		Titem* pI_last_to_destroy = Data(new_size);
KUDr@3900: 		for (Titem* pI = Data(old_size - 1); pI >= pI_last_to_destroy; pI--) pI->~Titem();
KUDr@3900: 		// remove them
KUDr@3900: 		ReduceRawSize(num_items * Titem_size);
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE Titem* AppendNew()
KUDr@3900: 	{
KUDr@3900: 		Titem& dst = *GrowSizeNC(1);
KUDr@3900: 		Titem* pNewItem = new (&dst) Titem();
KUDr@3900: 		return pNewItem;
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE Titem* Append(const Titem& src)
KUDr@3900: 	{
KUDr@3900: 		Titem& dst = *GrowSizeNC(1);
KUDr@3900: 		Titem* pNewItem = new (&dst) Titem(src);
KUDr@3900: 		return pNewItem;
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE Titem* Append(const Titem* pSrc, int num_items)
KUDr@3900: 	{
KUDr@3900: 		Titem* pDst = GrowSizeNC(num_items);
KUDr@3900: 		Titem* pDstOrg = pDst;
KUDr@3900: 		Titem* pDstEnd = pDst + num_items;
KUDr@3900: 		while (pDst < pDstEnd) new (pDst++) Titem(*(pSrc++));
KUDr@3900: 		return pDstOrg;
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE void RemoveBySwap(int idx)
KUDr@3900: 	{
KUDr@3900: 		CheckIdx(idx);
KUDr@3900: 		// destroy removed item
KUDr@3900: 		Titem* pRemoved = Data(idx);
KUDr@3900: 		RemoveBySwap(pRemoved);
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE void RemoveBySwap(Titem* pItem)
KUDr@3900: 	{
KUDr@3900: 		Titem* pLast = Data(Size() - 1);
KUDr@3900: 		assert(pItem >= Data() && pItem <= pLast);
KUDr@3900: 		// move last item to its new place
KUDr@3900: 		if (pItem != pLast) {
KUDr@3900: 			pItem->~Titem_();
KUDr@3900: 			new (pItem) Titem_(*pLast);
KUDr@3900: 		}
KUDr@3900: 		// destroy the last item
KUDr@3900: 		pLast->~Titem_();
KUDr@3900: 		// and reduce the raw blob size
KUDr@3900: 		ReduceRawSize(Titem_size);
KUDr@3900: 	}
KUDr@3900: 	FORCEINLINE Titem* MakeFreeSpace(int num_items) { return (Titem*)MakeRawFreeSpace(num_items * Titem_size); }
KUDr@3900: };
KUDr@3900: 
KUDr@3900: // simple string implementation
KUDr@3900: struct CStrA : public CBlobT<char>
KUDr@3900: {
KUDr@3900: 	typedef CBlobT<char> base;
KUDr@3900: 	CStrA(const char* str = NULL) {Append(str);}
KUDr@3900: 	FORCEINLINE CStrA(const CBlobBaseSimple& src) : base(src) {}
KUDr@3900: 	void Append(const char* str) {if (str != NULL && str[0] != '\0') base::Append(str, (int)strlen(str));}
KUDr@3900: };
KUDr@3900: 
KUDr@3900: #endif /* BLOB_HPP */