2022-07-28 10:18:17 +01:00
|
|
|
#include "fmt.h"
|
2022-06-28 00:45:52 +01:00
|
|
|
#include "iobuf.h"
|
|
|
|
|
2022-08-13 20:34:20 +01:00
|
|
|
static void mg_pfn_iobuf_private(char ch, void *param, bool expand) {
|
|
|
|
struct mg_iobuf *io = (struct mg_iobuf *) param;
|
|
|
|
if (expand && io->len + 2 > io->size) mg_iobuf_resize(io, io->len + 2);
|
|
|
|
if (io->len + 2 <= io->size) {
|
|
|
|
io->buf[io->len++] = (uint8_t) ch;
|
|
|
|
io->buf[io->len] = 0;
|
|
|
|
} else if (io->len < io->size) {
|
|
|
|
io->buf[io->len++] = 0; // Guarantee to 0-terminate
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mg_putchar_iobuf_static(char ch, void *param) {
|
|
|
|
mg_pfn_iobuf_private(ch, param, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mg_pfn_iobuf(char ch, void *param) {
|
|
|
|
mg_pfn_iobuf_private(ch, param, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t mg_vsnprintf(char *buf, size_t len, const char *fmt, va_list *ap) {
|
|
|
|
struct mg_iobuf io = {(uint8_t *) buf, len, 0, 0};
|
|
|
|
size_t n = mg_vxprintf(mg_putchar_iobuf_static, &io, fmt, ap);
|
|
|
|
if (n < len) buf[n] = '\0';
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2022-07-28 10:18:17 +01:00
|
|
|
size_t mg_snprintf(char *buf, size_t len, const char *fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
size_t n;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
n = mg_vsnprintf(buf, len, fmt, &ap);
|
|
|
|
va_end(ap);
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2022-08-13 15:37:55 +01:00
|
|
|
char *mg_vmprintf(const char *fmt, va_list *ap) {
|
|
|
|
struct mg_iobuf io = {0, 0, 0, 256};
|
2022-08-13 20:34:20 +01:00
|
|
|
mg_vxprintf(mg_pfn_iobuf, &io, fmt, ap);
|
2022-08-13 15:37:55 +01:00
|
|
|
return (char *) io.buf;
|
2022-06-29 00:00:16 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
char *mg_mprintf(const char *fmt, ...) {
|
2022-08-13 15:37:55 +01:00
|
|
|
char *s;
|
2022-06-29 00:00:16 +01:00
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
2022-08-13 15:37:55 +01:00
|
|
|
s = mg_vmprintf(fmt, &ap);
|
2022-06-29 00:00:16 +01:00
|
|
|
va_end(ap);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2022-08-13 20:34:20 +01:00
|
|
|
size_t mg_xprintf(void (*out)(char, void *), void *ptr, const char *fmt, ...) {
|
2022-06-28 00:45:52 +01:00
|
|
|
size_t len = 0;
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
2022-08-13 20:34:20 +01:00
|
|
|
len = mg_vxprintf(out, ptr, fmt, &ap);
|
2022-06-28 00:45:52 +01:00
|
|
|
va_end(ap);
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool is_digit(int c) {
|
|
|
|
return c >= '0' && c <= '9';
|
|
|
|
}
|
|
|
|
|
2022-07-28 10:18:17 +01:00
|
|
|
double mg_atod(const char *p, int len, int *numlen) {
|
|
|
|
double d = 0.0;
|
|
|
|
int i = 0, sign = 1;
|
|
|
|
|
|
|
|
// Sign
|
|
|
|
if (i < len && *p == '-') {
|
|
|
|
sign = -1, i++;
|
|
|
|
} else if (i < len && *p == '+') {
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decimal
|
|
|
|
for (; i < len && p[i] >= '0' && p[i] <= '9'; i++) {
|
|
|
|
d *= 10.0;
|
|
|
|
d += p[i] - '0';
|
|
|
|
}
|
|
|
|
d *= sign;
|
|
|
|
|
|
|
|
// Fractional
|
|
|
|
if (i < len && p[i] == '.') {
|
|
|
|
double frac = 0.0, base = 0.1;
|
|
|
|
i++;
|
|
|
|
for (; i < len && p[i] >= '0' && p[i] <= '9'; i++) {
|
|
|
|
frac += base * (p[i] - '0');
|
|
|
|
base /= 10.0;
|
|
|
|
}
|
|
|
|
d += frac * sign;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Exponential
|
|
|
|
if (i < len && (p[i] == 'e' || p[i] == 'E')) {
|
|
|
|
int j, exp = 0, minus = 0;
|
|
|
|
i++;
|
|
|
|
if (i < len && p[i] == '-') minus = 1, i++;
|
|
|
|
if (i < len && p[i] == '+') i++;
|
|
|
|
while (i < len && p[i] >= '0' && p[i] <= '9' && exp < 308)
|
|
|
|
exp = exp * 10 + (p[i++] - '0');
|
|
|
|
if (minus) exp = -exp;
|
|
|
|
for (j = 0; j < exp; j++) d *= 10.0;
|
|
|
|
for (j = 0; j < -exp; j++) d /= 10.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (numlen != NULL) *numlen = i;
|
|
|
|
return d;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int addexp(char *buf, int e, int sign) {
|
|
|
|
int n = 0;
|
|
|
|
buf[n++] = 'e';
|
|
|
|
buf[n++] = (char) sign;
|
|
|
|
if (e > 400) return 0;
|
|
|
|
if (e < 10) buf[n++] = '0';
|
|
|
|
if (e >= 100) buf[n++] = (char) (e / 100 + '0'), e -= 100 * (e / 100);
|
|
|
|
if (e >= 10) buf[n++] = (char) (e / 10 + '0'), e -= 10 * (e / 10);
|
|
|
|
buf[n++] = (char) (e + '0');
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int xisinf(double x) {
|
|
|
|
union {
|
|
|
|
double f;
|
|
|
|
uint64_t u;
|
|
|
|
} ieee754 = {x};
|
|
|
|
return ((unsigned) (ieee754.u >> 32) & 0x7fffffff) == 0x7ff00000 &&
|
|
|
|
((unsigned) ieee754.u == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int xisnan(double x) {
|
|
|
|
union {
|
|
|
|
double f;
|
|
|
|
uint64_t u;
|
|
|
|
} ieee754 = {x};
|
|
|
|
return ((unsigned) (ieee754.u >> 32) & 0x7fffffff) +
|
|
|
|
((unsigned) ieee754.u != 0) >
|
|
|
|
0x7ff00000;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t mg_dtoa(char *dst, size_t dstlen, double d, int width) {
|
|
|
|
char buf[40];
|
|
|
|
int i, s = 0, n = 0, e = 0;
|
|
|
|
double t, mul, saved;
|
|
|
|
if (d == 0.0) return mg_snprintf(dst, dstlen, "%s", "0");
|
|
|
|
if (xisinf(d)) return mg_snprintf(dst, dstlen, "%s", d > 0 ? "inf" : "-inf");
|
|
|
|
if (xisnan(d)) return mg_snprintf(dst, dstlen, "%s", "nan");
|
|
|
|
if (d < 0.0) d = -d, buf[s++] = '-';
|
|
|
|
|
|
|
|
// Round
|
|
|
|
saved = d;
|
|
|
|
mul = 1.0;
|
|
|
|
while (d >= 10.0 && d / mul >= 10.0) mul *= 10.0;
|
|
|
|
while (d <= 1.0 && d / mul <= 1.0) mul /= 10.0;
|
|
|
|
for (i = 0, t = mul * 5; i < width; i++) t /= 10.0;
|
|
|
|
d += t;
|
|
|
|
// Calculate exponent, and 'mul' for scientific representation
|
|
|
|
mul = 1.0;
|
|
|
|
while (d >= 10.0 && d / mul >= 10.0) mul *= 10.0, e++;
|
|
|
|
while (d < 1.0 && d / mul < 1.0) mul /= 10.0, e--;
|
|
|
|
// printf(" --> %g %d %g %g\n", saved, e, t, mul);
|
|
|
|
|
|
|
|
if (e >= width) {
|
|
|
|
n = (int) mg_dtoa(buf, sizeof(buf), saved / mul, width);
|
|
|
|
// printf(" --> %.*g %d [%.*s]\n", 10, d / t, e, n, buf);
|
|
|
|
n += addexp(buf + s + n, e, '+');
|
|
|
|
return mg_snprintf(dst, dstlen, "%.*s", n, buf);
|
|
|
|
} else if (e <= -width) {
|
|
|
|
n = (int) mg_dtoa(buf, sizeof(buf), saved / mul, width);
|
|
|
|
// printf(" --> %.*g %d [%.*s]\n", 10, d / mul, e, n, buf);
|
|
|
|
n += addexp(buf + s + n, -e, '-');
|
|
|
|
return mg_snprintf(dst, dstlen, "%.*s", n, buf);
|
|
|
|
} else {
|
|
|
|
for (i = 0, t = mul; t >= 1.0 && s + n < (int) sizeof(buf); i++) {
|
|
|
|
int ch = (int) (d / t);
|
|
|
|
if (n > 0 || ch > 0) buf[s + n++] = (char) (ch + '0');
|
|
|
|
d -= ch * t;
|
|
|
|
t /= 10.0;
|
|
|
|
}
|
|
|
|
// printf(" --> [%g] -> %g %g (%d) [%.*s]\n", saved, d, t, n, s + n, buf);
|
|
|
|
if (n == 0) buf[s++] = '0';
|
|
|
|
while (t >= 1.0 && n + s < (int) sizeof(buf)) buf[n++] = '0', t /= 10.0;
|
|
|
|
if (s + n < (int) sizeof(buf)) buf[n + s++] = '.';
|
|
|
|
// printf(" 1--> [%g] -> [%.*s]\n", saved, s + n, buf);
|
|
|
|
for (i = 0, t = 0.1; s + n < (int) sizeof(buf) && n < width; i++) {
|
|
|
|
int ch = (int) (d / t);
|
|
|
|
buf[s + n++] = (char) (ch + '0');
|
|
|
|
d -= ch * t;
|
|
|
|
t /= 10.0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (n > 0 && buf[s + n - 1] == '0') n--; // Trim trailing zeros
|
|
|
|
if (n > 0 && buf[s + n - 1] == '.') n--; // Trim trailing dot
|
|
|
|
buf[s + n] = '\0';
|
|
|
|
return mg_snprintf(dst, dstlen, "%s", buf);
|
|
|
|
}
|
|
|
|
|
2022-06-28 00:45:52 +01:00
|
|
|
size_t mg_lld(char *buf, int64_t val, bool is_signed, bool is_hex) {
|
|
|
|
const char *letters = "0123456789abcdef";
|
|
|
|
uint64_t v = (uint64_t) val;
|
|
|
|
size_t s = 0, n, i;
|
|
|
|
if (is_signed && val < 0) buf[s++] = '-', v = (uint64_t) (-val);
|
|
|
|
// This loop prints a number in reverse order. I guess this is because we
|
|
|
|
// write numbers from right to left: least significant digit comes last.
|
|
|
|
// Maybe because we use Arabic numbers, and Arabs write RTL?
|
|
|
|
if (is_hex) {
|
|
|
|
for (n = 0; v; v >>= 4) buf[s + n++] = letters[v & 15];
|
|
|
|
} else {
|
|
|
|
for (n = 0; v; v /= 10) buf[s + n++] = letters[v % 10];
|
|
|
|
}
|
|
|
|
// Reverse a string
|
|
|
|
for (i = 0; i < n / 2; i++) {
|
|
|
|
char t = buf[s + i];
|
|
|
|
buf[s + i] = buf[s + n - i - 1], buf[s + n - i - 1] = t;
|
|
|
|
}
|
|
|
|
if (val == 0) buf[n++] = '0'; // Handle special case
|
|
|
|
return n + s;
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t scpy(void (*out)(char, void *), void *ptr, char *buf,
|
|
|
|
size_t len) {
|
|
|
|
size_t i = 0;
|
|
|
|
while (i < len && buf[i] != '\0') out(buf[i++], ptr);
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
static char mg_esc(int c, bool esc) {
|
|
|
|
const char *p, *esc1 = "\b\f\n\r\t\\\"", *esc2 = "bfnrt\\\"";
|
|
|
|
for (p = esc ? esc1 : esc2; *p != '\0'; p++) {
|
|
|
|
if (*p == c) return esc ? esc2[p - esc1] : esc1[p - esc2];
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static char mg_escape(int c) {
|
|
|
|
return mg_esc(c, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t qcpy(void (*out)(char, void *), void *ptr, char *buf,
|
|
|
|
size_t len) {
|
2022-08-10 18:27:58 +01:00
|
|
|
size_t i = 0, extra = 0;
|
2022-06-28 00:45:52 +01:00
|
|
|
for (i = 0; i < len && buf[i] != '\0'; i++) {
|
|
|
|
char c = mg_escape(buf[i]);
|
|
|
|
if (c) {
|
|
|
|
out('\\', ptr), out(c, ptr), extra++;
|
|
|
|
} else {
|
|
|
|
out(buf[i], ptr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return i + extra;
|
|
|
|
}
|
|
|
|
|
2022-08-10 18:27:58 +01:00
|
|
|
static size_t Qcpy(void (*out)(char, void *), void *ptr, char *buf,
|
|
|
|
size_t len) {
|
|
|
|
size_t n = 2;
|
|
|
|
out('"', ptr);
|
|
|
|
n += qcpy(out, ptr, buf, len);
|
|
|
|
out('"', ptr);
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2022-06-28 00:45:52 +01:00
|
|
|
static size_t bcpy(void (*out)(char, void *), void *ptr, uint8_t *buf,
|
|
|
|
size_t len) {
|
|
|
|
size_t i, n = 0;
|
|
|
|
const char *t =
|
|
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
out('"', ptr), n++;
|
|
|
|
for (i = 0; i < len; i += 3) {
|
|
|
|
uint8_t c1 = buf[i], c2 = i + 1 < len ? buf[i + 1] : 0,
|
|
|
|
c3 = i + 2 < len ? buf[i + 2] : 0;
|
|
|
|
char tmp[4] = {t[c1 >> 2], t[(c1 & 3) << 4 | (c2 >> 4)], '=', '='};
|
|
|
|
if (i + 1 < len) tmp[2] = t[(c2 & 15) << 2 | (c3 >> 6)];
|
|
|
|
if (i + 2 < len) tmp[3] = t[c3 & 63];
|
|
|
|
n += scpy(out, ptr, tmp, sizeof(tmp));
|
|
|
|
}
|
|
|
|
out('"', ptr), n++;
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2022-08-13 20:34:20 +01:00
|
|
|
size_t mg_vxprintf(void (*out)(char, void *), void *param, const char *fmt,
|
2022-06-28 00:45:52 +01:00
|
|
|
va_list *ap) {
|
|
|
|
size_t i = 0, n = 0;
|
|
|
|
while (fmt[i] != '\0') {
|
|
|
|
if (fmt[i] == '%') {
|
|
|
|
size_t j, k, x = 0, is_long = 0, w = 0 /* width */, pr = ~0U /* prec */;
|
|
|
|
char pad = ' ', minus = 0, c = fmt[++i];
|
|
|
|
if (c == '#') x++, c = fmt[++i];
|
|
|
|
if (c == '-') minus++, c = fmt[++i];
|
|
|
|
if (c == '0') pad = '0', c = fmt[++i];
|
|
|
|
while (is_digit(c)) w *= 10, w += (size_t) (c - '0'), c = fmt[++i];
|
|
|
|
if (c == '.') {
|
|
|
|
c = fmt[++i];
|
|
|
|
if (c == '*') {
|
|
|
|
pr = (size_t) va_arg(*ap, int);
|
|
|
|
c = fmt[++i];
|
|
|
|
} else {
|
|
|
|
pr = 0;
|
|
|
|
while (is_digit(c)) pr *= 10, pr += (size_t) (c - '0'), c = fmt[++i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (c == 'h') c = fmt[++i]; // Treat h and hh as int
|
|
|
|
if (c == 'l') {
|
|
|
|
is_long++, c = fmt[++i];
|
|
|
|
if (c == 'l') is_long++, c = fmt[++i];
|
|
|
|
}
|
|
|
|
if (c == 'p') x = 1, is_long = 1;
|
|
|
|
if (c == 'd' || c == 'u' || c == 'x' || c == 'X' || c == 'p' ||
|
|
|
|
c == 'g') {
|
|
|
|
bool s = (c == 'd'), h = (c == 'x' || c == 'X' || c == 'p');
|
|
|
|
char tmp[40];
|
|
|
|
size_t xl = x ? 2 : 0;
|
|
|
|
if (c == 'g' || c == 'f') {
|
|
|
|
double v = va_arg(*ap, double);
|
|
|
|
if (pr == ~0U) pr = 6;
|
|
|
|
k = mg_dtoa(tmp, sizeof(tmp), v, (int) pr);
|
|
|
|
} else if (is_long == 2) {
|
|
|
|
int64_t v = va_arg(*ap, int64_t);
|
|
|
|
k = mg_lld(tmp, v, s, h);
|
|
|
|
} else if (is_long == 1) {
|
|
|
|
long v = va_arg(*ap, long);
|
|
|
|
k = mg_lld(tmp, s ? (int64_t) v : (int64_t) (unsigned long) v, s, h);
|
|
|
|
} else {
|
|
|
|
int v = va_arg(*ap, int);
|
|
|
|
k = mg_lld(tmp, s ? (int64_t) v : (int64_t) (unsigned) v, s, h);
|
|
|
|
}
|
|
|
|
for (j = 0; j < xl && w > 0; j++) w--;
|
|
|
|
for (j = 0; pad == ' ' && !minus && k < w && j + k < w; j++)
|
|
|
|
n += scpy(out, param, &pad, 1);
|
|
|
|
n += scpy(out, param, (char *) "0x", xl);
|
|
|
|
for (j = 0; pad == '0' && k < w && j + k < w; j++)
|
|
|
|
n += scpy(out, param, &pad, 1);
|
|
|
|
n += scpy(out, param, tmp, k);
|
|
|
|
for (j = 0; pad == ' ' && minus && k < w && j + k < w; j++)
|
|
|
|
n += scpy(out, param, &pad, 1);
|
|
|
|
} else if (c == 'M') {
|
|
|
|
mg_pm_t f = va_arg(*ap, mg_pm_t);
|
|
|
|
n += f(out, param, ap);
|
|
|
|
} else if (c == 'c') {
|
|
|
|
int ch = va_arg(*ap, int);
|
|
|
|
out((char) ch, param);
|
|
|
|
n++;
|
|
|
|
} else if (c == 'H') {
|
|
|
|
// Print hex-encoded double-quoted string
|
|
|
|
size_t bl = (size_t) va_arg(*ap, int);
|
|
|
|
uint8_t *p = va_arg(*ap, uint8_t *), dquote = '"';
|
|
|
|
const char *hex = "0123456789abcdef";
|
|
|
|
n += scpy(out, param, (char *) &dquote, 1);
|
|
|
|
for (j = 0; j < bl; j++) {
|
|
|
|
n += scpy(out, param, (char *) &hex[(p[j] >> 4) & 15], 1);
|
|
|
|
n += scpy(out, param, (char *) &hex[p[j] & 15], 1);
|
|
|
|
}
|
|
|
|
n += scpy(out, param, (char *) &dquote, 1);
|
|
|
|
} else if (c == 'V') {
|
|
|
|
// Print base64-encoded double-quoted string
|
|
|
|
size_t len = (size_t) va_arg(*ap, int);
|
|
|
|
uint8_t *buf = va_arg(*ap, uint8_t *);
|
|
|
|
n += bcpy(out, param, buf, len);
|
2022-08-10 18:27:58 +01:00
|
|
|
} else if (c == 's' || c == 'Q' || c == 'q') {
|
2022-06-28 00:45:52 +01:00
|
|
|
char *p = va_arg(*ap, char *);
|
2022-08-10 18:27:58 +01:00
|
|
|
size_t (*f)(void (*)(char, void *), void *, char *, size_t) = scpy;
|
|
|
|
if (c == 'Q') f = Qcpy;
|
|
|
|
if (c == 'q') f = qcpy;
|
2022-06-28 00:45:52 +01:00
|
|
|
if (pr == ~0U) pr = p == NULL ? 0 : strlen(p);
|
|
|
|
for (j = 0; !minus && pr < w && j + pr < w; j++)
|
|
|
|
n += f(out, param, &pad, 1);
|
|
|
|
n += f(out, param, p, pr);
|
|
|
|
for (j = 0; minus && pr < w && j + pr < w; j++)
|
|
|
|
n += f(out, param, &pad, 1);
|
|
|
|
} else if (c == '%') {
|
|
|
|
out('%', param);
|
|
|
|
n++;
|
|
|
|
} else {
|
|
|
|
out('%', param);
|
|
|
|
out(c, param);
|
|
|
|
n += 2;
|
|
|
|
}
|
|
|
|
i++;
|
|
|
|
} else {
|
|
|
|
out(fmt[i], param), n++, i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|