/* * Copyright (C) 2005-2008 MaNGOS * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #ifndef _BYTEBUFFER_H #define _BYTEBUFFER_H #include "Common.h" #include "Errors.h" #include "Log.h" #include "Utilities/ByteConverter.h" class ByteBuffer { public: const static size_t DEFAULT_SIZE = 0x1000; // constructor ByteBuffer(): _rpos(0), _wpos(0) { _storage.reserve(DEFAULT_SIZE); } // constructor ByteBuffer(size_t res): _rpos(0), _wpos(0) { _storage.reserve(res); } // copy constructor ByteBuffer(const ByteBuffer &buf): _rpos(buf._rpos), _wpos(buf._wpos), _storage(buf._storage) { } void clear() { _storage.clear(); _rpos = _wpos = 0; } template void append(T value) { EndianConvert(value); append((uint8 *)&value, sizeof(value)); } template void put(size_t pos,T value) { EndianConvert(value); put(pos,(uint8 *)&value,sizeof(value)); } ByteBuffer &operator<<(uint8 value) { append(value); return *this; } ByteBuffer &operator<<(uint16 value) { append(value); return *this; } ByteBuffer &operator<<(uint32 value) { append(value); return *this; } ByteBuffer &operator<<(uint64 value) { append(value); return *this; } // signed as in 2e complement ByteBuffer &operator<<(int8 value) { append(value); return *this; } ByteBuffer &operator<<(int16 value) { append(value); return *this; } ByteBuffer &operator<<(int32 value) { append(value); return *this; } ByteBuffer &operator<<(int64 value) { append(value); return *this; } // floating points ByteBuffer &operator<<(float value) { append(value); return *this; } ByteBuffer &operator<<(double value) { append(value); return *this; } ByteBuffer &operator<<(const std::string &value) { append((uint8 const *)value.c_str(), value.length()); append((uint8)0); return *this; } ByteBuffer &operator<<(const char *str) { append((uint8 const *)str, str ? strlen(str) : 0); append((uint8)0); return *this; } ByteBuffer &operator>>(bool &value) { value = read() > 0 ? true : false; return *this; } ByteBuffer &operator>>(uint8 &value) { value = read(); return *this; } ByteBuffer &operator>>(uint16 &value) { value = read(); return *this; } ByteBuffer &operator>>(uint32 &value) { value = read(); return *this; } ByteBuffer &operator>>(uint64 &value) { value = read(); return *this; } //signed as in 2e complement ByteBuffer &operator>>(int8 &value) { value = read(); return *this; } ByteBuffer &operator>>(int16 &value) { value = read(); return *this; } ByteBuffer &operator>>(int32 &value) { value = read(); return *this; } ByteBuffer &operator>>(int64 &value) { value = read(); return *this; } ByteBuffer &operator>>(float &value) { value = read(); return *this; } ByteBuffer &operator>>(double &value) { value = read(); return *this; } ByteBuffer &operator>>(std::string& value) { value.clear(); while (rpos() < size()) // prevent crash at wrong string format in packet { char c=read(); if (c==0) break; value+=c; } return *this; } uint8 operator[](size_t pos) { return read(pos); } size_t rpos() const { return _rpos; } size_t rpos(size_t rpos_) { _rpos = rpos_; return _rpos; }; size_t wpos() const { return _wpos; } size_t wpos(size_t wpos_) { _wpos = wpos_; return _wpos; } template T read() { T r=read(_rpos); _rpos += sizeof(T); return r; }; template T read(size_t pos) const { ASSERT(pos + sizeof(T) <= size() || PrintPosError(false,pos,sizeof(T))); T val = *((T const*)&_storage[pos]); EndianConvert(val); return val; } void read(uint8 *dest, size_t len) { ASSERT(_rpos + len <= size() || PrintPosError(false,_rpos,len)); memcpy(dest, &_storage[_rpos], len); _rpos += len; } const uint8 *contents() const { return &_storage[0]; } size_t size() const { return _storage.size(); } bool empty() const { return _storage.empty(); } void resize(size_t newsize) { _storage.resize(newsize); _rpos = 0; _wpos = size(); }; void reserve(size_t ressize) { if (ressize > size()) _storage.reserve(ressize); }; void append(const std::string& str) { append((uint8 const*)str.c_str(),str.size() + 1); } void append(const char *src, size_t cnt) { return append((const uint8 *)src, cnt); } template void append(const T *src, size_t cnt) { return append((const uint8 *)src, cnt*sizeof(T)); } void append(const uint8 *src, size_t cnt) { if (!cnt) return; ASSERT(size() < 10000000); if (_storage.size() < _wpos + cnt) _storage.resize(_wpos + cnt); memcpy(&_storage[_wpos], src, cnt); _wpos += cnt; } void append(const ByteBuffer& buffer) { if(buffer.size()) append(buffer.contents(),buffer.size()); } void appendPackGUID(uint64 guid) { size_t mask_position = wpos(); *this << uint8(0); for(uint8 i = 0; i < 8; i++) { if(guid & 0xFF) { _storage[mask_position] |= uint8(1<>= 8; } } void put(size_t pos, const uint8 *src, size_t cnt) { ASSERT(pos + cnt <= size() || PrintPosError(true,pos,cnt)); memcpy(&_storage[pos], src, cnt); } void print_storage() { if(!sLog.IsOutDebug()) // optimize disabled debug output return; sLog.outDebug("STORAGE_SIZE: %u", size() ); for(uint32 i = 0; i < size(); i++) sLog.outDebugInLine("%u - ", read(i) ); sLog.outDebug(" "); } void textlike() { if(!sLog.IsOutDebug()) // optimize disabled debug output return; sLog.outDebug("STORAGE_SIZE: %u", size() ); for(uint32 i = 0; i < size(); i++) sLog.outDebugInLine("%c", read(i) ); sLog.outDebug(" "); } void hexlike() { if(!sLog.IsOutDebug()) // optimize disabled debug output return; uint32 j = 1, k = 1; sLog.outDebug("STORAGE_SIZE: %u", size() ); if(sLog.IsIncludeTime()) sLog.outDebugInLine(" "); for(uint32 i = 0; i < size(); i++) { if ((i == (j*8)) && ((i != (k*16)))) { if (read(i) < 0x0F) { sLog.outDebugInLine("| 0%X ", read(i) ); } else { sLog.outDebugInLine("| %X ", read(i) ); } ++j; } else if (i == (k*16)) { if (read(i) < 0x0F) { sLog.outDebugInLine("\n"); if(sLog.IsIncludeTime()) sLog.outDebugInLine(" "); sLog.outDebugInLine("0%X ", read(i) ); } else { sLog.outDebugInLine("\n"); if(sLog.IsIncludeTime()) sLog.outDebugInLine(" "); sLog.outDebugInLine("%X ", read(i) ); } ++k; ++j; } else { if (read(i) < 0x0F) { sLog.outDebugInLine("0%X ", read(i) ); } else { sLog.outDebugInLine("%X ", read(i) ); } } } sLog.outDebugInLine("\n"); } protected: bool PrintPosError(bool add, size_t pos, size_t esize) const { sLog.outError("ERROR: Attempt %s in ByteBuffer (pos: %u size: %u) value with size: %u",(add ? "put" : "get"),pos, size(), esize); // assert must fail after function call return false; } size_t _rpos, _wpos; std::vector _storage; }; template ByteBuffer &operator<<(ByteBuffer &b, std::vector v) { b << (uint32)v.size(); for (typename std::vector::iterator i = v.begin(); i != v.end(); i++) { b << *i; } return b; } template ByteBuffer &operator>>(ByteBuffer &b, std::vector &v) { uint32 vsize; b >> vsize; v.clear(); while(vsize--) { T t; b >> t; v.push_back(t); } return b; } template ByteBuffer &operator<<(ByteBuffer &b, std::list v) { b << (uint32)v.size(); for (typename std::list::iterator i = v.begin(); i != v.end(); i++) { b << *i; } return b; } template ByteBuffer &operator>>(ByteBuffer &b, std::list &v) { uint32 vsize; b >> vsize; v.clear(); while(vsize--) { T t; b >> t; v.push_back(t); } return b; } template ByteBuffer &operator<<(ByteBuffer &b, std::map &m) { b << (uint32)m.size(); for (typename std::map::iterator i = m.begin(); i != m.end(); i++) { b << i->first << i->second; } return b; } template ByteBuffer &operator>>(ByteBuffer &b, std::map &m) { uint32 msize; b >> msize; m.clear(); while(msize--) { K k; V v; b >> k >> v; m.insert(make_pair(k, v)); } return b; } #endif