1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
|
/*
* This file is part of libplacebo.
*
* libplacebo is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* libplacebo is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with libplacebo. If not, see <http://www.gnu.org/licenses/>.
*/
#include "common.h"
#include "hash.h"
static void grow_str(void *alloc, pl_str *str, size_t len)
{
// Like pl_grow, but with some extra headroom
if (len > pl_get_size(str->buf))
str->buf = pl_realloc(alloc, str->buf, len * 1.5);
}
void pl_str_append(void *alloc, pl_str *str, pl_str append)
{
// Also append an extra \0 for convenience, since a lot of the time
// this function will be used to generate a string buffer
grow_str(alloc, str, str->len + append.len + 1);
if (append.len) {
memcpy(str->buf + str->len, append.buf, append.len);
str->len += append.len;
}
str->buf[str->len] = '\0';
}
void pl_str_append_raw(void *alloc, pl_str *str, const void *ptr, size_t size)
{
if (!size)
return;
grow_str(alloc, str, str->len + size);
memcpy(str->buf + str->len, ptr, size);
str->len += size;
}
void pl_str_append_asprintf(void *alloc, pl_str *str, const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
pl_str_append_vasprintf(alloc, str, fmt, ap);
va_end(ap);
}
void pl_str_append_vasprintf(void *alloc, pl_str *str, const char *fmt, va_list ap)
{
// First, we need to determine the size that will be required for
// printing the entire string. Do this by making a copy of the va_list
// and printing it to a null buffer.
va_list copy;
va_copy(copy, ap);
int size = vsnprintf(NULL, 0, fmt, copy);
va_end(copy);
if (size < 0)
return;
// Make room in `str` and format to there directly
grow_str(alloc, str, str->len + size + 1);
str->len += vsnprintf((char *) (str->buf + str->len), size + 1, fmt, ap);
}
int pl_str_sscanf(pl_str str, const char *fmt, ...)
{
char *tmp = pl_strdup0(NULL, str);
va_list va;
va_start(va, fmt);
int ret = vsscanf(tmp, fmt, va);
va_end(va);
pl_free(tmp);
return ret;
}
int pl_strchr(pl_str str, int c)
{
if (!str.len)
return -1;
void *pos = memchr(str.buf, c, str.len);
if (pos)
return (intptr_t) pos - (intptr_t) str.buf;
return -1;
}
size_t pl_strspn(pl_str str, const char *accept)
{
for (size_t i = 0; i < str.len; i++) {
if (!strchr(accept, str.buf[i]))
return i;
}
return str.len;
}
size_t pl_strcspn(pl_str str, const char *reject)
{
for (size_t i = 0; i < str.len; i++) {
if (strchr(reject, str.buf[i]))
return i;
}
return str.len;
}
static inline bool pl_isspace(char c)
{
switch (c) {
case ' ':
case '\n':
case '\r':
case '\t':
case '\v':
case '\f':
return true;
default:
return false;
}
}
pl_str pl_str_strip(pl_str str)
{
while (str.len && pl_isspace(str.buf[0])) {
str.buf++;
str.len--;
}
while (str.len && pl_isspace(str.buf[str.len - 1]))
str.len--;
return str;
}
int pl_str_find(pl_str haystack, pl_str needle)
{
if (!needle.len)
return 0;
for (size_t i = 0; i + needle.len <= haystack.len; i++) {
if (memcmp(&haystack.buf[i], needle.buf, needle.len) == 0)
return i;
}
return -1;
}
pl_str pl_str_split_char(pl_str str, char sep, pl_str *out_rest)
{
int pos = pl_strchr(str, sep);
if (pos < 0) {
if (out_rest)
*out_rest = (pl_str) {0};
return str;
} else {
if (out_rest)
*out_rest = pl_str_drop(str, pos + 1);
return pl_str_take(str, pos);
}
}
pl_str pl_str_split_chars(pl_str str, const char *seps, pl_str *out_rest)
{
int pos = pl_strcspn(str, seps);
if (pos < 0) {
if (out_rest)
*out_rest = (pl_str) {0};
return str;
} else {
if (out_rest)
*out_rest = pl_str_drop(str, pos + 1);
return pl_str_take(str, pos);
}
}
pl_str pl_str_split_str(pl_str str, pl_str sep, pl_str *out_rest)
{
int pos = pl_str_find(str, sep);
if (pos < 0) {
if (out_rest)
*out_rest = (pl_str) {0};
return str;
} else {
if (out_rest)
*out_rest = pl_str_drop(str, pos + sep.len);
return pl_str_take(str, pos);
}
}
static bool get_hexdigit(pl_str *str, int *digit)
{
while (str->len && pl_isspace(str->buf[0])) {
str->buf++;
str->len--;
}
if (!str->len) {
*digit = -1; // EOF
return true;
}
char c = str->buf[0];
str->buf++;
str->len--;
if (c >= '0' && c <= '9') {
*digit = c - '0';
} else if (c >= 'a' && c <= 'f') {
*digit = c - 'a' + 10;
} else if (c >= 'A' && c <= 'F') {
*digit = c - 'A' + 10;
} else {
return false; // invalid char
}
return true;
}
bool pl_str_decode_hex(void *alloc, pl_str hex, pl_str *out)
{
if (!out)
return false;
uint8_t *buf = pl_alloc(alloc, hex.len / 2);
int len = 0;
while (hex.len) {
int a, b;
if (!get_hexdigit(&hex, &a) || !get_hexdigit(&hex, &b))
goto error; // invalid char
if (a < 0) // EOF
break;
if (b < 0) // only one digit
goto error;
buf[len++] = (a << 4) | b;
}
*out = (pl_str) { buf, len };
return true;
error:
pl_free(buf);
return false;
}
struct pl_str_builder_t {
PL_ARRAY(pl_str_template) templates;
pl_str args;
pl_str output;
};
pl_str_builder pl_str_builder_alloc(void *alloc)
{
pl_str_builder b = pl_zalloc_ptr(alloc, b);
return b;
}
void pl_str_builder_free(pl_str_builder *b)
{
if (*b)
pl_free_ptr(b);
}
void pl_str_builder_reset(pl_str_builder b)
{
*b = (struct pl_str_builder_t) {
.templates.elem = b->templates.elem,
.args.buf = b->args.buf,
.output.buf = b->output.buf,
};
}
uint64_t pl_str_builder_hash(const pl_str_builder b)
{
size_t size = b->templates.num * sizeof(b->templates.elem[0]);
uint64_t hash = pl_mem_hash(b->templates.elem, size);
pl_hash_merge(&hash, pl_str_hash(b->args));
return hash;
}
pl_str pl_str_builder_exec(pl_str_builder b)
{
pl_str args = b->args;
b->output.len = 0;
for (int i = 0; i < b->templates.num; i++) {
size_t consumed = b->templates.elem[i](b, &b->output, args.buf);
pl_assert(consumed <= args.len);
args = pl_str_drop(args, consumed);
}
// Terminate with an extra \0 byte for convenience
grow_str(b, &b->output, b->output.len + 1);
b->output.buf[b->output.len] = '\0';
return b->output;
}
void pl_str_builder_append(pl_str_builder b, pl_str_template tmpl,
const void *args, size_t size)
{
PL_ARRAY_APPEND(b, b->templates, tmpl);
pl_str_append_raw(b, &b->args, args, size);
}
void pl_str_builder_concat(pl_str_builder b, const pl_str_builder append)
{
PL_ARRAY_CONCAT(b, b->templates, append->templates);
pl_str_append_raw(b, &b->args, append->args.buf, append->args.len);
}
static size_t template_str_ptr(void *alloc, pl_str *buf, const uint8_t *args)
{
const char *str;
memcpy(&str, args, sizeof(str));
pl_str_append_raw(alloc, buf, str, strlen(str));
return sizeof(str);
}
void pl_str_builder_const_str(pl_str_builder b, const char *str)
{
pl_str_builder_append(b, template_str_ptr, &str, sizeof(str));
}
static size_t template_str(void *alloc, pl_str *buf, const uint8_t *args)
{
pl_str str;
memcpy(&str.len, args, sizeof(str.len));
pl_str_append_raw(alloc, buf, args + sizeof(str.len), str.len);
return sizeof(str.len) + str.len;
}
void pl_str_builder_str(pl_str_builder b, const pl_str str)
{
pl_str_builder_append(b, template_str, &str.len, sizeof(str.len));
pl_str_append_raw(b, &b->args, str.buf, str.len);
}
void pl_str_builder_printf_c(pl_str_builder b, const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
pl_str_builder_vprintf_c(b, fmt, ap);
va_end(ap);
}
static size_t template_printf(void *alloc, pl_str *str, const uint8_t *args)
{
const char *fmt;
memcpy(&fmt, args, sizeof(fmt));
args += sizeof(fmt);
return sizeof(fmt) + pl_str_append_memprintf_c(alloc, str, fmt, args);
}
void pl_str_builder_vprintf_c(pl_str_builder b, const char *fmt, va_list ap)
{
pl_str_builder_append(b, template_printf, &fmt, sizeof(fmt));
// Push all of the variadic arguments directly onto `b->args`
for (const char *c; (c = strchr(fmt, '%')) != NULL; fmt = c + 1) {
c++;
switch (c[0]) {
#define WRITE(T, x) pl_str_append_raw(b, &b->args, &(T) {x}, sizeof(T))
case '%': continue;
case 'c': WRITE(char, va_arg(ap, int)); break;
case 'd': WRITE(int, va_arg(ap, int)); break;
case 'u': WRITE(unsigned, va_arg(ap, unsigned)); break;
case 'f': WRITE(double, va_arg(ap, double)); break;
case 'h':
assert(c[1] == 'x');
WRITE(unsigned short, va_arg(ap, unsigned));
c++;
break;
case 'l':
assert(c[1] == 'l');
switch (c[2]) {
case 'u': WRITE(long long unsigned, va_arg(ap, long long unsigned)); break;
case 'd': WRITE(long long int, va_arg(ap, long long int)); break;
default: abort();
}
c += 2;
break;
case 'z':
assert(c[1] == 'u');
WRITE(size_t, va_arg(ap, size_t));
c++;
break;
case 's': {
pl_str str = pl_str0(va_arg(ap, const char *));
pl_str_append(b, &b->args, str);
b->args.len++; // expand to include \0 byte (from pl_str_append)
break;
}
case '.': {
assert(c[1] == '*');
assert(c[2] == 's');
int len = va_arg(ap, int);
const char *str = va_arg(ap, const char *);
WRITE(int, len);
pl_str_append_raw(b, &b->args, str, len);
c += 2;
break;
}
default:
fprintf(stderr, "Invalid conversion character: '%c'!\n", c[0]);
abort();
}
#undef WRITE
}
}
|