|
|
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 | |
| 1 | #ifndef DYNBUF_H__ |
24 | #ifndef DYNBUF_H__ |
| 2 | #define DYNBUF_H__ |
25 | #define DYNBUF_H__ |
| 3 | |
26 | |
| 4 | #include <cstring> |
27 | #include <cstring> |
| 5 | #include <cassert> |
28 | #include <cassert> |
| 6 | |
29 | |
|
|
30 | #include "util.h" |
| 7 | #include "shstr.h" |
31 | #include "shstr.h" |
| 8 | |
32 | |
| 9 | // this is a "buffer" that can grow fast |
33 | // this is a "buffer" that can grow fast |
| 10 | // and is still somewhat space-efficient. |
34 | // and is still somewhat space-efficient. |
| 11 | // unlike obstacks or other data structures, |
35 | // unlike obstacks or other data structures, |
| … | |
… | |
| 47 | |
71 | |
| 48 | int room () const { return end - ptr; } |
72 | int room () const { return end - ptr; } |
| 49 | |
73 | |
| 50 | char *force (int size) |
74 | char *force (int size) |
| 51 | { |
75 | { |
| 52 | if (ptr + size >= end) |
76 | if (expect_false (ptr + size >= end)) |
| 53 | _reserve (size); |
77 | _reserve (size); |
| 54 | |
78 | |
| 55 | return ptr; |
79 | return ptr; |
| 56 | } |
80 | } |
| 57 | |
81 | |
|
|
82 | char *falloc (int size) |
|
|
83 | { |
|
|
84 | char *res = ptr; |
|
|
85 | ptr += size; |
|
|
86 | return res; |
|
|
87 | } |
|
|
88 | |
| 58 | char *alloc (int size) |
89 | char *alloc (int size) |
| 59 | { |
90 | { |
| 60 | char *res = force (size); |
91 | force (size); |
| 61 | ptr += size; |
92 | return falloc (size); |
| 62 | return res; |
|
|
| 63 | } |
93 | } |
| 64 | |
94 | |
| 65 | void fadd (char c) { *ptr++ = c; } |
95 | void fadd (char c) { *ptr++ = c; } |
| 66 | void fadd (unsigned char c) { fadd (char (c)); } |
96 | void fadd (unsigned char c) { fadd (char (c)); } |
|
|
97 | void fadd (const void *p, int len) |
|
|
98 | { |
|
|
99 | memcpy (falloc (len), p, len); |
|
|
100 | } |
| 67 | |
101 | |
| 68 | void add (const void *p, int len) |
102 | void add (const void *p, int len) |
| 69 | { |
103 | { |
| 70 | memcpy (alloc (len), p, len); |
104 | force (len); |
|
|
105 | fadd (p, len); |
| 71 | } |
106 | } |
| 72 | |
107 | |
| 73 | void add (char c) |
108 | void add (char c) |
| 74 | { |
109 | { |
| 75 | alloc (1)[0] = c; |
110 | alloc (1)[0] = c; |
| … | |
… | |
| 103 | : dynbuf (initial, extend) |
138 | : dynbuf (initial, extend) |
| 104 | { } |
139 | { } |
| 105 | |
140 | |
| 106 | using dynbuf::add; |
141 | using dynbuf::add; |
| 107 | |
142 | |
| 108 | static const int max_sint32_size = 11; |
|
|
| 109 | static const int max_sint64_size = 20; |
|
|
| 110 | |
|
|
| 111 | void add (sint32 i); |
143 | void add (sint32 i); |
| 112 | void add (sint64 i); |
144 | void add (sint64 i); |
| 113 | |
145 | |
| 114 | void printf (const char *format, ...); |
146 | void printf (const char *format, ...); |
| 115 | }; |
147 | }; |
