2020-06-15 14:18:57 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ 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. │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ 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. │
|
2020-06-15 14:18:57 +00:00
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
|
|
#include "libc/assert.h"
|
|
|
|
#include "libc/fmt/fmt.h"
|
|
|
|
#include "libc/mem/mem.h"
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Formats string w/ dynamic memory allocation.
|
|
|
|
*
|
|
|
|
* @param *strp is output-only and must be free'd, even on error; since
|
|
|
|
* that's the behavior that'll make your code most portable
|
|
|
|
* @return complete bytes written (excluding NUL) or -1 w/ errno
|
|
|
|
* @see xasprintf() for a better API
|
|
|
|
*/
|
|
|
|
int(vasprintf)(char **strp, const char *fmt, va_list va) {
|
2020-12-26 10:09:07 +00:00
|
|
|
/*
|
2020-06-15 14:18:57 +00:00
|
|
|
* This implementation guarantees the smallest possible allocation,
|
|
|
|
* using an optimistic approach w/o changing asymptotic complexity.
|
|
|
|
*/
|
|
|
|
size_t size = 32;
|
|
|
|
if ((*strp = malloc(size))) {
|
|
|
|
va_list va2;
|
|
|
|
va_copy(va2, va);
|
|
|
|
int wrote = (vsnprintf)(*strp, size, fmt, va);
|
|
|
|
if (wrote == -1) return -1;
|
|
|
|
if (wrote <= size - 1) {
|
|
|
|
return wrote;
|
|
|
|
} else {
|
|
|
|
size = wrote + 1;
|
|
|
|
char *buf2 = realloc(*strp, size);
|
|
|
|
if (buf2) {
|
|
|
|
*strp = buf2;
|
|
|
|
wrote = (vsnprintf)(*strp, size, fmt, va2);
|
|
|
|
assert(wrote == size - 1);
|
|
|
|
return wrote;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|