blob: b2e46c89f95265483076d8c0c4a5bff2ef52035e [file] [log] [blame]
Damien68f59a92013-10-20 14:39:58 +01001#include <stdio.h>
2#include <stdarg.h>
3#include <string.h>
4#include "misc.h"
5
6// returned value is always at least 1 greater than argument
7#define ROUND_ALLOC(a) (((a) & ((~0) - 7)) + 8)
8
Paul Sokolovsky5d2499c2014-01-13 23:15:23 +02009void vstr_init(vstr_t *vstr, int alloc) {
10 vstr->alloc = alloc;
Damien68f59a92013-10-20 14:39:58 +010011 vstr->len = 0;
12 vstr->buf = m_new(char, vstr->alloc);
13 if (vstr->buf == NULL) {
Damien68f59a92013-10-20 14:39:58 +010014 vstr->had_error = true;
15 return;
16 }
17 vstr->buf[0] = 0;
18 vstr->had_error = false;
19}
20
21void vstr_clear(vstr_t *vstr) {
Damien732407f2013-12-29 19:33:23 +000022 m_del(char, vstr->buf, vstr->alloc);
Damien68f59a92013-10-20 14:39:58 +010023 vstr->buf = NULL;
24}
25
Damien8b3a7c22013-10-23 20:20:17 +010026vstr_t *vstr_new(void) {
Damien68f59a92013-10-20 14:39:58 +010027 vstr_t *vstr = m_new(vstr_t, 1);
28 if (vstr == NULL) {
29 return NULL;
30 }
Paul Sokolovsky5d2499c2014-01-13 23:15:23 +020031 vstr_init(vstr, 32);
32 return vstr;
33}
34
35vstr_t *vstr_new_size(int alloc) {
36 vstr_t *vstr = m_new(vstr_t, 1);
37 if (vstr == NULL) {
38 return NULL;
39 }
40 vstr_init(vstr, alloc);
Damien68f59a92013-10-20 14:39:58 +010041 return vstr;
42}
43
44void vstr_free(vstr_t *vstr) {
45 if (vstr != NULL) {
Damien732407f2013-12-29 19:33:23 +000046 m_del(char, vstr->buf, vstr->alloc);
47 m_del_obj(vstr_t, vstr);
Damien68f59a92013-10-20 14:39:58 +010048 }
49}
50
51void vstr_reset(vstr_t *vstr) {
52 vstr->len = 0;
53 vstr->buf[0] = 0;
54 vstr->had_error = false;
55}
56
57bool vstr_had_error(vstr_t *vstr) {
58 return vstr->had_error;
59}
60
61char *vstr_str(vstr_t *vstr) {
62 if (vstr->had_error) {
63 return NULL;
64 }
65 return vstr->buf;
66}
67
68int vstr_len(vstr_t *vstr) {
69 if (vstr->had_error) {
70 return 0;
71 }
72 return vstr->len;
73}
74
Paul Sokolovsky5d2499c2014-01-13 23:15:23 +020075// Extend vstr strictly to by requested size, return pointer to newly added chunk
76char *vstr_extend(vstr_t *vstr, int size) {
77 char *new_buf = m_renew(char, vstr->buf, vstr->alloc, vstr->alloc + size);
78 if (new_buf == NULL) {
79 vstr->had_error = true;
80 return NULL;
81 }
82 char *p = new_buf + vstr->alloc;
83 vstr->alloc += size;
84 vstr->buf = new_buf;
85 return p;
86}
87
88// Shrink vstr to be given size
89bool vstr_set_size(vstr_t *vstr, int size) {
90 char *new_buf = m_renew(char, vstr->buf, vstr->alloc, size);
91 if (new_buf == NULL) {
92 vstr->had_error = true;
93 return false;
94 }
95 vstr->buf = new_buf;
96 vstr->alloc = vstr->len = size;
97 return true;
98}
99
100// Shrink vstr allocation to its actual length
101bool vstr_shrink(vstr_t *vstr) {
102 return vstr_set_size(vstr, vstr->len);
103}
104
Damien68f59a92013-10-20 14:39:58 +0100105bool vstr_ensure_extra(vstr_t *vstr, int size) {
106 if (vstr->len + size + 1 > vstr->alloc) {
107 int new_alloc = ROUND_ALLOC((vstr->len + size + 1) * 2);
Damien732407f2013-12-29 19:33:23 +0000108 char *new_buf = m_renew(char, vstr->buf, vstr->alloc, new_alloc);
Damien68f59a92013-10-20 14:39:58 +0100109 if (new_buf == NULL) {
110 vstr->had_error = true;
111 return false;
112 }
113 vstr->alloc = new_alloc;
114 vstr->buf = new_buf;
115 }
116 return true;
117}
118
119void vstr_hint_size(vstr_t *vstr, int size) {
120 // it's not an error if we fail to allocate for the size hint
121 bool er = vstr->had_error;
122 vstr_ensure_extra(vstr, size);
123 vstr->had_error = er;
124}
125
126char *vstr_add_len(vstr_t *vstr, int len) {
127 if (vstr->had_error || !vstr_ensure_extra(vstr, len)) {
128 return NULL;
129 }
130 char *buf = vstr->buf + vstr->len;
131 vstr->len += len;
132 vstr->buf[vstr->len] = 0;
133 return buf;
134}
135
136void vstr_add_byte(vstr_t *vstr, byte v) {
137 byte *buf = (byte*)vstr_add_len(vstr, 1);
138 if (buf == NULL) {
139 return;
140 }
141 buf[0] = v;
142}
143
144void vstr_add_char(vstr_t *vstr, unichar c) {
145 // TODO UNICODE
146 byte *buf = (byte*)vstr_add_len(vstr, 1);
147 if (buf == NULL) {
148 return;
149 }
150 buf[0] = c;
151}
152
153void vstr_add_str(vstr_t *vstr, const char *str) {
154 vstr_add_strn(vstr, str, strlen(str));
155}
156
157void vstr_add_strn(vstr_t *vstr, const char *str, int len) {
158 if (vstr->had_error || !vstr_ensure_extra(vstr, len)) {
159 return;
160 }
161 memmove(vstr->buf + vstr->len, str, len);
162 vstr->len += len;
163 vstr->buf[vstr->len] = 0;
164}
165
166/*
167void vstr_add_le16(vstr_t *vstr, unsigned short v) {
168 byte *buf = (byte*)vstr_add_len(vstr, 2);
169 if (buf == NULL) {
170 return;
171 }
172 encode_le16(buf, v);
173}
174
175void vstr_add_le32(vstr_t *vstr, unsigned int v) {
176 byte *buf = (byte*)vstr_add_len(vstr, 4);
177 if (buf == NULL) {
178 return;
179 }
180 encode_le32(buf, v);
181}
182*/
183
184void vstr_cut_tail(vstr_t *vstr, int len) {
185 if (vstr->had_error) {
186 return;
187 }
188 if (len > vstr->len) {
189 vstr->len = 0;
190 } else {
191 vstr->len -= len;
192 }
Damien Georgef64086f2014-01-22 23:18:50 +0000193 vstr->buf[vstr->len] = 0;
Damien68f59a92013-10-20 14:39:58 +0100194}
195
Damien68f59a92013-10-20 14:39:58 +0100196void vstr_printf(vstr_t *vstr, const char *fmt, ...) {
Damien2f06c572013-11-03 18:20:56 +0000197 va_list ap;
198 va_start(ap, fmt);
199 vstr_vprintf(vstr, fmt, ap);
200 va_end(ap);
201}
202
203void vstr_vprintf(vstr_t *vstr, const char *fmt, va_list ap) {
Damien68f59a92013-10-20 14:39:58 +0100204 if (vstr->had_error || !vstr_ensure_extra(vstr, strlen(fmt))) {
205 return;
206 }
207
208 while (1) {
209 // try to print in the allocated space
Damien George66028ab2014-01-03 14:03:48 +0000210 // need to make a copy of the va_list because we may call vsnprintf multiple times
Damien68f59a92013-10-20 14:39:58 +0100211 int size = vstr->alloc - vstr->len;
Damien George66028ab2014-01-03 14:03:48 +0000212 va_list ap2;
213 va_copy(ap2, ap);
214 int n = vsnprintf(vstr->buf + vstr->len, size, fmt, ap2);
215 va_end(ap2);
Damien68f59a92013-10-20 14:39:58 +0100216
217 // if that worked, return
218 if (n > -1 && n < size) {
219 vstr->len += n;
220 return;
221 }
222
223 // else try again with more space
224 if (n > -1) { // glibc 2.1
225 // n + 1 is precisely what is needed
226 if (!vstr_ensure_extra(vstr, n + 1)) {
227 return;
228 }
229 } else { // glibc 2.0
230 // increase to twice the old size
231 if (!vstr_ensure_extra(vstr, size * 2)) {
232 return;
233 }
234 }
235 }
236}
Damien68f59a92013-10-20 14:39:58 +0100237
238/** testing *****************************************************/
239
240/*
Damien8b3a7c22013-10-23 20:20:17 +0100241int main(void) {
Damien68f59a92013-10-20 14:39:58 +0100242 vstr_t *vstr = vstr_new();
243 int i;
244 for (i = 0; i < 10; i++) {
245 vstr_printf(vstr, "%d) this is a test %d %s\n", i, 1234, "'a string'");
246 vstr_add_str(vstr, "-----");
247 vstr_printf(vstr, "this is another test %d %s\n", 1234, "'a second string'");
248 printf("%s", vstr->buf);
249 }
250}
251*/