| … | |
… | |
| 2 | #define DYNBUF_H__ |
2 | #define DYNBUF_H__ |
| 3 | |
3 | |
| 4 | #include <cstring> |
4 | #include <cstring> |
| 5 | #include <cassert> |
5 | #include <cassert> |
| 6 | |
6 | |
|
|
7 | #include "util.h" |
| 7 | #include "shstr.h" |
8 | #include "shstr.h" |
| 8 | |
9 | |
| 9 | // this is a "buffer" that can grow fast |
10 | // this is a "buffer" that can grow fast |
| 10 | // and is still somewhat space-efficient. |
11 | // and is still somewhat space-efficient. |
| 11 | // unlike obstacks or other data structures, |
12 | // unlike obstacks or other data structures, |
| … | |
… | |
| 21 | int alloc; |
22 | int alloc; |
| 22 | int size; |
23 | int size; |
| 23 | char data[0]; |
24 | char data[0]; |
| 24 | }; |
25 | }; |
| 25 | |
26 | |
| 26 | char *ptr; |
27 | char *ptr, *end; |
| 27 | int room; |
|
|
| 28 | int ext; |
28 | int ext; |
| 29 | int _size; |
29 | int _size; |
| 30 | |
30 | |
| 31 | chunk *first, *last; |
31 | chunk *first, *last; |
| 32 | |
32 | |
| 33 | void _reserve (int size); |
33 | void _reserve (int size); |
|
|
34 | void _clear (); |
| 34 | void clear (); |
35 | void clear (); |
| 35 | void finish (); |
36 | void finish (); |
| 36 | |
37 | |
| 37 | public: |
38 | public: |
| 38 | |
39 | |
| 39 | dynbuf (int initial = 4096, int extend = 16384); |
40 | dynbuf (int initial = 4096, int extend = 16384); |
| 40 | ~dynbuf (); |
41 | ~dynbuf (); |
| 41 | |
42 | |
| 42 | int size () { return _size + (ptr - last->data); } |
43 | int size () const { return _size + (ptr - last->data); } |
|
|
44 | bool empty () const { return !size (); } |
| 43 | |
45 | |
| 44 | void linearise (void *data); |
46 | void linearise (void *data); |
| 45 | char *linearise (); |
47 | char *linearise (); // does not 0-terminate(!) |
|
|
48 | |
|
|
49 | int room () const { return end - ptr; } |
| 46 | |
50 | |
| 47 | char *force (int size) |
51 | char *force (int size) |
| 48 | { |
52 | { |
| 49 | if (room < size) |
53 | if (expect_false (ptr + size >= end)) |
| 50 | _reserve (size); |
54 | _reserve (size); |
| 51 | |
55 | |
| 52 | return ptr; |
56 | return ptr; |
| 53 | } |
57 | } |
| 54 | |
58 | |
| 55 | char *alloc (int size) |
59 | char *alloc (int size) |
| 56 | { |
60 | { |
| 57 | char *res = force (size); |
61 | char *res = force (size); |
| 58 | |
|
|
| 59 | room -= size; |
|
|
| 60 | ptr += size; |
62 | ptr += size; |
| 61 | |
|
|
| 62 | return res; |
63 | return res; |
| 63 | } |
64 | } |
| 64 | |
65 | |
| 65 | void fadd (char c) { --room; *ptr++ = c; } |
66 | void fadd (char c) { *ptr++ = c; } |
| 66 | void fadd (unsigned char c) { fadd (char (c)); } |
67 | void fadd (unsigned char c) { fadd (char (c)); } |
| 67 | |
68 | |
| 68 | void add (const void *p, int len) |
69 | void add (const void *p, int len) |
| 69 | { |
70 | { |
| 70 | memcpy (alloc (len), p, len); |
71 | memcpy (alloc (len), p, len); |
| … | |
… | |
| 89 | //void add_destructive (dynbuf &buf); |
90 | //void add_destructive (dynbuf &buf); |
| 90 | |
91 | |
| 91 | dynbuf &operator << (char c) { add (c); return *this; } |
92 | dynbuf &operator << (char c) { add (c); return *this; } |
| 92 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
93 | dynbuf &operator << (unsigned char c) { return *this << char (c); } |
| 93 | dynbuf &operator << (const char *s) { add (s); return *this; } |
94 | dynbuf &operator << (const char *s) { add (s); return *this; } |
|
|
95 | dynbuf &operator << (const shstr &s) { add (s); return *this; } |
| 94 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
96 | dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
| 95 | |
97 | |
| 96 | operator std::string (); |
98 | operator std::string (); |
| 97 | }; |
99 | }; |
| 98 | |
100 | |
| … | |
… | |
| 112 | |
114 | |
| 113 | void printf (const char *format, ...); |
115 | void printf (const char *format, ...); |
| 114 | }; |
116 | }; |
| 115 | |
117 | |
| 116 | #endif |
118 | #endif |
|
|
119 | |
