| 1 |
#ifndef DYNBUF_H__ |
| 2 |
#define DYNBUF_H__ |
| 3 |
|
| 4 |
#include <cstring> |
| 5 |
#include <cassert> |
| 6 |
|
| 7 |
#include "shstr.h" |
| 8 |
|
| 9 |
// this is a "buffer" that can grow fast |
| 10 |
// and is still somewhat space-efficient. |
| 11 |
// unlike obstacks or other data structures, |
| 12 |
// it never moves data around. basically, |
| 13 |
// this is a fast strstream without the overhead. |
| 14 |
|
| 15 |
struct dynbuf |
| 16 |
{ |
| 17 |
protected: |
| 18 |
struct chunk |
| 19 |
{ |
| 20 |
chunk *next; |
| 21 |
int alloc; |
| 22 |
int size; |
| 23 |
char data[0]; |
| 24 |
}; |
| 25 |
|
| 26 |
char *ptr, *end; |
| 27 |
int ext; |
| 28 |
int _size; |
| 29 |
|
| 30 |
chunk *first, *last; |
| 31 |
|
| 32 |
void _reserve (int size); |
| 33 |
void _clear (); |
| 34 |
void clear (); |
| 35 |
void finish (); |
| 36 |
|
| 37 |
public: |
| 38 |
|
| 39 |
dynbuf (int initial = 4096, int extend = 16384); |
| 40 |
~dynbuf (); |
| 41 |
|
| 42 |
int size () const { return _size + (ptr - last->data); } |
| 43 |
bool empty () const { return !size (); } |
| 44 |
|
| 45 |
void linearise (void *data); |
| 46 |
char *linearise (); // does not 0-terminate(!) |
| 47 |
|
| 48 |
int room () const { return end - ptr; } |
| 49 |
|
| 50 |
char *force (int size) |
| 51 |
{ |
| 52 |
if (ptr + size >= end) |
| 53 |
_reserve (size); |
| 54 |
|
| 55 |
return ptr; |
| 56 |
} |
| 57 |
|
| 58 |
char *alloc (int size) |
| 59 |
{ |
| 60 |
char *res = force (size); |
| 61 |
ptr += size; |
| 62 |
return res; |
| 63 |
} |
| 64 |
|
| 65 |
void fadd (char c) { *ptr++ = c; } |
| 66 |
void fadd (unsigned char c) { fadd (char (c)); } |
| 67 |
|
| 68 |
void add (const void *p, int len) |
| 69 |
{ |
| 70 |
memcpy (alloc (len), p, len); |
| 71 |
} |
| 72 |
|
| 73 |
void add (char c) |
| 74 |
{ |
| 75 |
alloc (1)[0] = c; |
| 76 |
} |
| 77 |
|
| 78 |
void add (const char *s) |
| 79 |
{ |
| 80 |
add (s, strlen (s)); |
| 81 |
} |
| 82 |
|
| 83 |
void add (const shstr &s) |
| 84 |
{ |
| 85 |
add (s.s, s.length ()); |
| 86 |
} |
| 87 |
|
| 88 |
//TODO |
| 89 |
//void add_destructive (dynbuf &buf); |
| 90 |
|
| 91 |
dynbuf &operator << (char c) { add (c); return *this; } |
| 92 |
dynbuf &operator << (unsigned char c) { return *this << char (c); } |
| 93 |
dynbuf &operator << (const char *s) { add (s); return *this; } |
| 94 |
dynbuf &operator << (const shstr &s) { add (s); return *this; } |
| 95 |
dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
| 96 |
|
| 97 |
operator std::string (); |
| 98 |
}; |
| 99 |
|
| 100 |
struct dynbuf_text : dynbuf |
| 101 |
{ |
| 102 |
dynbuf_text (int initial = 4096, int extend = 16384) |
| 103 |
: dynbuf (initial, extend) |
| 104 |
{ } |
| 105 |
|
| 106 |
using dynbuf::add; |
| 107 |
|
| 108 |
static const int max_sint32_size = 11; |
| 109 |
static const int max_sint64_size = 20; |
| 110 |
|
| 111 |
void add (sint32 i); |
| 112 |
void add (sint64 i); |
| 113 |
|
| 114 |
void printf (const char *format, ...); |
| 115 |
}; |
| 116 |
|
| 117 |
#endif |
| 118 |
|
