| 1 |
/* |
| 2 |
* This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
| 5 |
* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 |
* |
| 8 |
* Crossfire TRT is free software: you can redistribute it and/or modify |
| 9 |
* it under the terms of the GNU General Public License as published by |
| 10 |
* the Free Software Foundation, either version 3 of the License, or |
| 11 |
* (at your option) any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, |
| 14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 |
* GNU General Public License for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the GNU General Public License |
| 19 |
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 |
* |
| 21 |
* The authors can be reached via e-mail to <crossfire@schmorp.de> |
| 22 |
*/ |
| 23 |
|
| 24 |
#ifndef DYNBUF_H__ |
| 25 |
#define DYNBUF_H__ |
| 26 |
|
| 27 |
#include <cstring> |
| 28 |
#include <cassert> |
| 29 |
|
| 30 |
#include "util.h" |
| 31 |
#include "shstr.h" |
| 32 |
|
| 33 |
// this is a "buffer" that can grow fast |
| 34 |
// and is still somewhat space-efficient. |
| 35 |
// unlike obstacks or other data structures, |
| 36 |
// it never moves data around. basically, |
| 37 |
// this is a fast strstream without the overhead. |
| 38 |
|
| 39 |
struct dynbuf |
| 40 |
{ |
| 41 |
protected: |
| 42 |
struct chunk |
| 43 |
{ |
| 44 |
chunk *next; |
| 45 |
int alloc; |
| 46 |
int size; |
| 47 |
char data[0]; |
| 48 |
}; |
| 49 |
|
| 50 |
char *ptr, *end; |
| 51 |
int _size; |
| 52 |
|
| 53 |
int extend; |
| 54 |
chunk *first, *last; |
| 55 |
|
| 56 |
void reserve (int size); |
| 57 |
void init (int initial); // allocate sinitial chunk |
| 58 |
void free (chunk *&chain); // free chain of chunks |
| 59 |
char *_linearise (); |
| 60 |
void finalise (); |
| 61 |
|
| 62 |
public: |
| 63 |
|
| 64 |
// initial - the size of the initial chunk to be allocated |
| 65 |
// extend - first incremental step when buffer size exceeded |
| 66 |
dynbuf (int initial = 4096, int extend = 16384) |
| 67 |
: extend (extend) |
| 68 |
{ |
| 69 |
init (initial); |
| 70 |
} |
| 71 |
|
| 72 |
~dynbuf () |
| 73 |
{ |
| 74 |
free (first); |
| 75 |
} |
| 76 |
|
| 77 |
// resets the dynbuf, but does not free the first chunk |
| 78 |
// which is either of size "initial" or the size of the last |
| 79 |
// linearise |
| 80 |
void clear (); |
| 81 |
|
| 82 |
int size () const { return _size + (ptr - last->data); } |
| 83 |
bool empty () const { return !size (); } |
| 84 |
|
| 85 |
void linearise (void *data); |
| 86 |
char *linearise () // does not 0-terminate(!) |
| 87 |
{ |
| 88 |
return first->next ? _linearise () : first->data; |
| 89 |
} |
| 90 |
|
| 91 |
int room () const { return end - ptr; } |
| 92 |
|
| 93 |
char *force (int size) |
| 94 |
{ |
| 95 |
if (expect_false (ptr + size >= end)) |
| 96 |
reserve (size); |
| 97 |
|
| 98 |
return ptr; |
| 99 |
} |
| 100 |
|
| 101 |
char *falloc (int size) |
| 102 |
{ |
| 103 |
char *res = ptr; |
| 104 |
ptr += size; |
| 105 |
return res; |
| 106 |
} |
| 107 |
|
| 108 |
char *alloc (int size) |
| 109 |
{ |
| 110 |
force (size); |
| 111 |
return falloc (size); |
| 112 |
} |
| 113 |
|
| 114 |
void fadd (char c) { *ptr++ = c; } |
| 115 |
void fadd (unsigned char c) { fadd (char (c)); } |
| 116 |
void fadd (const void *p, int len) |
| 117 |
{ |
| 118 |
memcpy (falloc (len), p, len); |
| 119 |
} |
| 120 |
|
| 121 |
void add (const void *p, int len) |
| 122 |
{ |
| 123 |
force (len); |
| 124 |
fadd (p, len); |
| 125 |
} |
| 126 |
|
| 127 |
void add (char c) |
| 128 |
{ |
| 129 |
alloc (1)[0] = c; |
| 130 |
} |
| 131 |
|
| 132 |
void add (const char *s) |
| 133 |
{ |
| 134 |
add (s, strlen (s)); |
| 135 |
} |
| 136 |
|
| 137 |
void add (const shstr &s) |
| 138 |
{ |
| 139 |
add (s.s, s.length ()); |
| 140 |
} |
| 141 |
|
| 142 |
//TODO |
| 143 |
//void add_destructive (dynbuf &buf); |
| 144 |
|
| 145 |
dynbuf &operator << (char c) { add (c); return *this; } |
| 146 |
dynbuf &operator << (unsigned char c) { return *this << char (c); } |
| 147 |
dynbuf &operator << (const char *s) { add (s); return *this; } |
| 148 |
dynbuf &operator << (const shstr &s) { add (s); return *this; } |
| 149 |
dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } |
| 150 |
|
| 151 |
operator std::string (); |
| 152 |
}; |
| 153 |
|
| 154 |
struct dynbuf_text : dynbuf |
| 155 |
{ |
| 156 |
dynbuf_text (int initial = 4096, int extend = 16384) |
| 157 |
: dynbuf (initial, extend) |
| 158 |
{ } |
| 159 |
|
| 160 |
using dynbuf::add; |
| 161 |
void add (sint32 i); |
| 162 |
void add (sint64 i); |
| 163 |
|
| 164 |
//TODO: should optimise the case printf "(name %+d)" as it comes up extreemly often |
| 165 |
|
| 166 |
using dynbuf::operator <<; |
| 167 |
dynbuf &operator << (sint16 i) { add (sint32 (i)); return *this; } |
| 168 |
dynbuf &operator << (uint16 i) { add (sint32 (i)); return *this; } |
| 169 |
dynbuf &operator << (sint32 i) { add (sint32 (i)); return *this; } |
| 170 |
dynbuf &operator << (sint64 i) { add (sint64 (i)); return *this; } |
| 171 |
dynbuf &operator << (uint32 i) { add (sint64 (i)); return *this; } |
| 172 |
dynbuf &operator << (uint64 i) { add (sint64 (i)); return *this; } |
| 173 |
|
| 174 |
void printf (const char *format, ...); |
| 175 |
void vprintf (const char *format, va_list ap); |
| 176 |
|
| 177 |
void add_abilities (const char *name, uint32 abilities); |
| 178 |
void add_paths (const char *name, uint32 paths); |
| 179 |
|
| 180 |
// returns the string, linearised and with trailing \0 |
| 181 |
operator const char * (); |
| 182 |
}; |
| 183 |
|
| 184 |
#endif |
| 185 |
|
