2021-08-06 21:12:11 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
2023-12-08 03:11:56 +00:00
|
|
|
│ vi: set et ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi │
|
2021-08-06 21:12:11 +00:00
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
|
|
│ Copyright 2021 Justine Alexandra Roberts Tunney │
|
|
|
|
│ │
|
|
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
|
|
|
│ │
|
|
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
|
|
#include "libc/assert.h"
|
|
|
|
#include "libc/dce.h"
|
2022-09-13 06:10:38 +00:00
|
|
|
#include "libc/intrin/bsr.h"
|
2021-08-06 21:12:11 +00:00
|
|
|
#include "libc/macros.internal.h"
|
|
|
|
#include "libc/mem/mem.h"
|
2022-09-13 06:10:38 +00:00
|
|
|
#include "libc/stdio/append.h"
|
2021-08-06 21:12:11 +00:00
|
|
|
#include "libc/str/str.h"
|
|
|
|
|
|
|
|
#define W sizeof(size_t)
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Resets length of append buffer, e.g.
|
|
|
|
*
|
|
|
|
* char *b = 0;
|
|
|
|
* appends(&b, "hello");
|
|
|
|
* appendr(&b, 1);
|
|
|
|
* assert(!strcmp(b, "h"));
|
|
|
|
* appendr(&b, 0);
|
|
|
|
* assert(!strcmp(b, ""));
|
|
|
|
* free(b);
|
|
|
|
*
|
|
|
|
* If `i` is greater than the current length then the extra bytes are
|
2021-08-07 14:05:19 +00:00
|
|
|
* filled with NUL characters. If `i` is less than the current length
|
|
|
|
* then memory is released to the system.
|
2021-08-06 21:12:11 +00:00
|
|
|
*
|
2022-07-22 03:53:30 +00:00
|
|
|
* The resulting buffer is guaranteed to be NUL-terminated, i.e.
|
2021-08-07 14:05:19 +00:00
|
|
|
* `!b[appendz(b).i]` will be the case even if both params are 0.
|
2021-08-06 21:12:11 +00:00
|
|
|
*
|
|
|
|
* @return `i` or -1 if `ENOMEM`
|
|
|
|
* @see appendz(b).i to get buffer length
|
|
|
|
*/
|
|
|
|
ssize_t appendr(char **b, size_t i) {
|
|
|
|
char *p;
|
2021-08-07 14:05:19 +00:00
|
|
|
size_t n;
|
2021-08-06 21:12:11 +00:00
|
|
|
struct appendz z;
|
2023-07-26 20:54:49 +00:00
|
|
|
unassert(b);
|
2021-08-06 21:12:11 +00:00
|
|
|
z = appendz((p = *b));
|
2021-08-07 14:05:19 +00:00
|
|
|
if (i != z.i || !p) {
|
|
|
|
n = ROUNDUP(i + 1, 8) + W;
|
2022-09-13 06:10:38 +00:00
|
|
|
if (n > z.n || _bsrl(n) < _bsrl(z.n)) {
|
2021-08-07 14:05:19 +00:00
|
|
|
if ((p = realloc(p, n))) {
|
2022-04-15 06:39:48 +00:00
|
|
|
z.n = malloc_usable_size(p);
|
2023-07-26 20:54:49 +00:00
|
|
|
unassert(!(z.n & (W - 1)));
|
2021-08-07 14:05:19 +00:00
|
|
|
*b = p;
|
|
|
|
} else {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (i > z.i) {
|
2021-09-28 05:58:51 +00:00
|
|
|
bzero(p + z.i, i - z.i + 1);
|
2021-08-07 14:05:19 +00:00
|
|
|
} else {
|
|
|
|
p[i] = 0;
|
|
|
|
}
|
2022-04-15 06:39:48 +00:00
|
|
|
*(size_t *)(p + z.n - W) =
|
2021-08-07 14:05:19 +00:00
|
|
|
i | (!IsTiny() && W == 8 ? (size_t)APPEND_COOKIE << 48 : 0);
|
2021-08-06 21:12:11 +00:00
|
|
|
}
|
|
|
|
return i;
|
|
|
|
}
|