#ifndef DYNBUF_H__ #define DYNBUF_H__ #include #include #include "shstr.h" // this is a "buffer" that can grow fast // and is still somewhat space-efficient. // unlike obstacks or other data structures, // it never moves data around. basically, // this is a fast strstream without the overhead. struct dynbuf { protected: struct chunk { chunk *next; int alloc; int size; char data[0]; }; char *ptr, *end; int ext; int _size; chunk *first, *last; void _reserve (int size); void clear (); void finish (); public: dynbuf (int initial = 4096, int extend = 16384); ~dynbuf (); int size () const { return _size + (ptr - last->data); } bool empty () const { return !size (); } void linearise (void *data); char *linearise (); // does not 0-terminate(!) int room () const { return end - ptr; } char *force (int size) { if (ptr + size >= end) _reserve (size); return ptr; } char *alloc (int size) { char *res = force (size); ptr += size; return res; } void fadd (char c) { *ptr++ = c; } void fadd (unsigned char c) { fadd (char (c)); } void add (const void *p, int len) { memcpy (alloc (len), p, len); } void add (char c) { alloc (1)[0] = c; } void add (const char *s) { add (s, strlen (s)); } void add (const shstr &s) { add (s.s, s.length ()); } //TODO //void add_destructive (dynbuf &buf); dynbuf &operator << (char c) { add (c); return *this; } dynbuf &operator << (unsigned char c) { return *this << char (c); } dynbuf &operator << (const char *s) { add (s); return *this; } dynbuf &operator << (const shstr &s) { add (s); return *this; } dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } operator std::string (); }; struct dynbuf_text : dynbuf { dynbuf_text (int initial = 4096, int extend = 16384) : dynbuf (initial, extend) { } using dynbuf::add; static const int max_sint32_size = 11; static const int max_sint64_size = 20; void add (sint32 i); void add (sint64 i); void printf (const char *format, ...); }; #endif