| … | |
… | |
| 48 | }; |
48 | }; |
| 49 | |
49 | |
| 50 | char *ptr, *end; |
50 | char *ptr, *end; |
| 51 | int _size; |
51 | int _size; |
| 52 | |
52 | |
| 53 | int extend; |
53 | int extend, cextend; |
| 54 | chunk *first, *last; |
54 | chunk *first, *last; |
| 55 | |
55 | |
| 56 | void reserve (int size); |
56 | void reserve (int size); |
| 57 | void init (int initial); // allocate sinitial chunk |
57 | void init (int initial); // allocate sinitial chunk |
| 58 | void free (chunk *&chain); // free chain of chunks |
58 | void free (chunk *&chain); // free chain of chunks |
| … | |
… | |
| 161 | void add (sint32 i); |
161 | void add (sint32 i); |
| 162 | void add (sint64 i); |
162 | void add (sint64 i); |
| 163 | |
163 | |
| 164 | //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
164 | //TODO: should optimise the case printf "(name %+d)" as it comes up extremely often |
| 165 | |
165 | |
| 166 | using dynbuf::operator <<; |
166 | //using dynbuf::operator <<; // doesn't work, sometimes C++ just suxx |
|
|
167 | // instead we use an ugly template function |
|
|
168 | template<typename T> |
|
|
169 | dynbuf_text &operator << (T c) { *(dynbuf *)this << c; return *this; } |
|
|
170 | |
| 167 | dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
171 | dynbuf_text &operator << (sint16 i) { add (sint32 (i)); return *this; } |
| 168 | dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; } |
172 | dynbuf_text &operator << (uint16 i) { add (sint32 (i)); return *this; } |
| 169 | dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
173 | dynbuf_text &operator << (sint32 i) { add (sint32 (i)); return *this; } |
| 170 | dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
174 | dynbuf_text &operator << (sint64 i) { add (sint64 (i)); return *this; } |
| 171 | dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
175 | dynbuf_text &operator << (uint32 i) { add (sint64 (i)); return *this; } |
