/* * Copyright (C) 2005,2006 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 #include #include #include class ByteBufferException { public: ByteBufferException(const char *act, uint32 rp, uint32 wp, uint32 rs, uint32 cs) { action = act; rpos = rp; wpos = wp; readsize = rs; cursize = cs; } uint32 rpos, wpos, readsize, cursize; const char *action; }; class ByteBuffer { public: class error { }; const static size_t DEFAULT_SIZE = 0xFF; ByteBuffer(): _rpos(0), _wpos(0) { _storage.reserve(DEFAULT_SIZE); } ByteBuffer(size_t res): _rpos(0), _wpos(0) { _storage.reserve(res); } 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) { append((uint8 *)&value, sizeof(value)); } template void put(size_t pos,T value) { put(pos,(uint8 *)&value,sizeof(value)); } ByteBuffer &operator<<(bool value) { append((char)value); return *this; } 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; } ByteBuffer &operator<<(float value) { append(value); return *this; } ByteBuffer &operator<<(double value) { append(value); return *this; } ByteBuffer &operator<<(const std::string &value) { append((uint8 *)value.c_str(), value.length()); append((uint8)0); return *this; } ByteBuffer &operator<<(const char *str) { append((uint8 *)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; } ByteBuffer &operator>>(float &value) { value = read(); return *this; } ByteBuffer &operator>>(double &value) { value = read(); return *this; } ByteBuffer &operator>>(std::string& value) { value.clear(); while (true) { char c=read(); if (c==0) break; value+=c; } return *this; } uint8 operator[](size_t pos) { return read(pos); } size_t rpos() { return _rpos; }; size_t rpos(size_t rpos) { _rpos = rpos < _storage.capacity() ? rpos : _storage.capacity(); return _rpos; }; size_t wpos() { return _wpos; } size_t wpos(size_t wpos) { _wpos = wpos < _storage.capacity() ? wpos : _storage.capacity(); return _wpos; } template T read() { T r=read(_rpos); _rpos += sizeof(T); return r; }; template T read(size_t pos) const { if(pos + sizeof(T) > size()) throw ByteBufferException("read", pos, _wpos, sizeof(T), size()); return *((T*)&_storage[pos]); } void read(uint8 *dest, size_t len) { if (_rpos + len <= size()) { memcpy(dest, &_storage[_rpos], len); } else { throw ByteBufferException("read-into", _rpos, _wpos, len, size()); } _rpos += len; } const uint8 *contents() const { return &_storage[0]; }; inline size_t size() const { return _storage.size(); }; 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((const uint8 *)str.c_str(),str.size() + 1); } void append(const char *src, size_t cnt) { return append((const uint8 *)src, cnt); } void append(const uint8 *src, size_t cnt) { if (!cnt) return; 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 put(size_t pos, const uint8 *src, size_t cnt) { memcpy(&_storage[pos], src, cnt); } void print_storage() { printf("STORAGE_SIZE: %u\n", size() ); for(uint32 i = 0; i < size(); i++) printf("%u - ", read(i) ); printf("\n"); } void textlike() { printf("STORAGE_SIZE: %u\n", size() ); for(uint32 i = 0; i < size(); i++) printf("%c", read(i) ); printf("\n"); } void hexlike() { uint32 j = 1, k = 1; printf("STORAGE_SIZE: %u\n", size() ); for(uint32 i = 0; i < size(); i++) { if ((i == (j*8)) && ((i != (k*16)))) { if (read(i) < 0x0F) { printf("| 0%X ", read(i) ); } else { printf("| %X ", read(i) ); } j++; } else if (i == (k*16)) { if (read(i) < 0x0F) { printf("\n0%X ", read(i) ); } else { printf("\n%X ", read(i) ); } k++; j++; } else { if (read(i) < 0x0F) { printf("0%X ", read(i) ); } else { printf("%X ", read(i) ); } } } printf("\n"); } protected: 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