1998-06-17 14:31:36 +00:00
|
|
|
/*
|
|
|
|
* BIRD Library -- Formatted Output
|
|
|
|
*
|
|
|
|
* (c) 1991, 1992 Lars Wirzenius & Linus Torvalds
|
|
|
|
*
|
|
|
|
* Hacked up for BIRD by Martin Mares <mj@ucw.cz>
|
1998-11-16 21:40:35 +00:00
|
|
|
* Buffer size limitation implemented by Martin Mares.
|
1998-06-17 14:31:36 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "nest/bird.h"
|
|
|
|
#include "string.h"
|
|
|
|
|
1998-06-17 14:34:13 +00:00
|
|
|
#include <errno.h>
|
|
|
|
|
2012-01-08 14:28:27 +00:00
|
|
|
#include "nest/iface.h"
|
|
|
|
|
1998-06-17 14:31:36 +00:00
|
|
|
/* we use this so that we can do without the ctype library */
|
|
|
|
#define is_digit(c) ((c) >= '0' && (c) <= '9')
|
|
|
|
|
|
|
|
static int skip_atoi(const char **s)
|
|
|
|
{
|
|
|
|
int i=0;
|
|
|
|
|
|
|
|
while (is_digit(**s))
|
|
|
|
i = i*10 + *((*s)++) - '0';
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define ZEROPAD 1 /* pad with zero */
|
|
|
|
#define SIGN 2 /* unsigned/signed long */
|
|
|
|
#define PLUS 4 /* show plus */
|
|
|
|
#define SPACE 8 /* space if plus */
|
|
|
|
#define LEFT 16 /* left justified */
|
|
|
|
#define SPECIAL 32 /* 0x */
|
|
|
|
#define LARGE 64 /* use 'ABCDEF' instead of 'abcdef' */
|
|
|
|
|
2019-10-01 15:01:29 +00:00
|
|
|
static char * number(char * str, u64 num, uint base, int size, int precision,
|
1998-11-16 21:40:35 +00:00
|
|
|
int type, int remains)
|
1998-06-17 14:31:36 +00:00
|
|
|
{
|
|
|
|
char c,sign,tmp[66];
|
|
|
|
const char *digits="0123456789abcdefghijklmnopqrstuvwxyz";
|
|
|
|
int i;
|
|
|
|
|
1998-11-16 21:40:35 +00:00
|
|
|
if (size >= 0 && (remains -= size) < 0)
|
|
|
|
return NULL;
|
1998-06-17 14:31:36 +00:00
|
|
|
if (type & LARGE)
|
|
|
|
digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
|
|
|
|
if (type & LEFT)
|
|
|
|
type &= ~ZEROPAD;
|
|
|
|
if (base < 2 || base > 36)
|
|
|
|
return 0;
|
|
|
|
c = (type & ZEROPAD) ? '0' : ' ';
|
|
|
|
sign = 0;
|
|
|
|
if (type & SIGN) {
|
2019-10-01 15:01:29 +00:00
|
|
|
if (num > (u64) INT64_MAX) {
|
1998-06-17 14:31:36 +00:00
|
|
|
sign = '-';
|
|
|
|
num = -num;
|
|
|
|
size--;
|
|
|
|
} else if (type & PLUS) {
|
|
|
|
sign = '+';
|
|
|
|
size--;
|
|
|
|
} else if (type & SPACE) {
|
|
|
|
sign = ' ';
|
|
|
|
size--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (type & SPECIAL) {
|
|
|
|
if (base == 16)
|
|
|
|
size -= 2;
|
|
|
|
else if (base == 8)
|
|
|
|
size--;
|
|
|
|
}
|
|
|
|
i = 0;
|
|
|
|
if (num == 0)
|
|
|
|
tmp[i++]='0';
|
2019-10-01 15:01:29 +00:00
|
|
|
else while (num != 0) {
|
|
|
|
uint res = num % base;
|
|
|
|
num = num / base;
|
|
|
|
tmp[i++] = digits[res];
|
|
|
|
}
|
1998-06-17 14:31:36 +00:00
|
|
|
if (i > precision)
|
|
|
|
precision = i;
|
|
|
|
size -= precision;
|
1998-11-16 21:40:35 +00:00
|
|
|
if (size < 0 && -size > remains)
|
|
|
|
return NULL;
|
1998-06-17 14:31:36 +00:00
|
|
|
if (!(type&(ZEROPAD+LEFT)))
|
|
|
|
while(size-->0)
|
|
|
|
*str++ = ' ';
|
|
|
|
if (sign)
|
|
|
|
*str++ = sign;
|
|
|
|
if (type & SPECIAL) {
|
|
|
|
if (base==8)
|
|
|
|
*str++ = '0';
|
|
|
|
else if (base==16) {
|
|
|
|
*str++ = '0';
|
|
|
|
*str++ = digits[33];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!(type & LEFT))
|
|
|
|
while (size-- > 0)
|
|
|
|
*str++ = c;
|
|
|
|
while (i < precision--)
|
|
|
|
*str++ = '0';
|
|
|
|
while (i-- > 0)
|
|
|
|
*str++ = tmp[i];
|
|
|
|
while (size-- > 0)
|
|
|
|
*str++ = ' ';
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
2000-06-04 18:34:39 +00:00
|
|
|
/**
|
|
|
|
* bvsnprintf - BIRD's vsnprintf()
|
|
|
|
* @buf: destination buffer
|
|
|
|
* @size: size of the buffer
|
|
|
|
* @fmt: format string
|
|
|
|
* @args: a list of arguments to be formatted
|
|
|
|
*
|
2015-12-29 16:12:47 +00:00
|
|
|
* This functions acts like ordinary sprintf() except that it checks available
|
|
|
|
* space to avoid buffer overflows and it allows some more format specifiers:
|
|
|
|
* |%I| for formatting of IP addresses (width of 1 is automatically replaced by
|
|
|
|
* standard IP address width which depends on whether we use IPv4 or IPv6; |%I4|
|
|
|
|
* or |%I6| can be used for explicit ip4_addr / ip6_addr arguments, |%N| for
|
|
|
|
* generic network addresses (net_addr *), |%R| for Router / Network ID (u32
|
2016-05-12 15:49:12 +00:00
|
|
|
* value printed as IPv4 address), |%lR| for 64bit Router / Network ID (u64
|
2017-06-13 13:41:49 +00:00
|
|
|
* value printed as eight :-separated octets), |%t| for time values (btime) with
|
|
|
|
* specified subsecond precision, and |%m| resp. |%M| for error messages (uses
|
|
|
|
* strerror() to translate @errno code to message text). On the other hand, it
|
2019-10-01 15:01:29 +00:00
|
|
|
* doesn't support floating point numbers. The bvsnprintf() supports |%h| and
|
|
|
|
* |%l| qualifiers, but |%l| is used for s64/u64 instead of long/ulong.
|
2000-06-04 18:34:39 +00:00
|
|
|
*
|
|
|
|
* Result: number of characters of the output string or -1 if
|
|
|
|
* the buffer space was insufficient.
|
|
|
|
*/
|
1998-11-16 21:40:35 +00:00
|
|
|
int bvsnprintf(char *buf, int size, const char *fmt, va_list args)
|
1998-06-17 14:31:36 +00:00
|
|
|
{
|
2019-10-01 15:01:29 +00:00
|
|
|
int len, i;
|
|
|
|
u64 num;
|
|
|
|
uint base;
|
2009-07-23 14:06:25 +00:00
|
|
|
u32 x;
|
2016-04-28 16:01:40 +00:00
|
|
|
u64 X;
|
2017-06-13 13:41:49 +00:00
|
|
|
btime t;
|
|
|
|
s64 t1, t2;
|
1998-11-16 21:40:35 +00:00
|
|
|
char *str, *start;
|
1998-06-17 14:31:36 +00:00
|
|
|
const char *s;
|
2015-12-18 10:57:38 +00:00
|
|
|
char ipbuf[NET_MAX_TEXT_LENGTH+1];
|
2012-01-08 14:28:27 +00:00
|
|
|
struct iface *iface;
|
1998-06-17 14:31:36 +00:00
|
|
|
|
|
|
|
int flags; /* flags to number() */
|
|
|
|
|
|
|
|
int field_width; /* width of output field */
|
|
|
|
int precision; /* min. # of digits for integers; max
|
|
|
|
number of chars for from string */
|
2019-10-01 15:01:29 +00:00
|
|
|
int qualifier; /* 'h' or 'l' for integer fields */
|
1998-06-17 14:31:36 +00:00
|
|
|
|
1998-11-16 21:40:35 +00:00
|
|
|
for (start=str=buf ; *fmt ; ++fmt, size-=(str-start), start=str) {
|
1998-06-17 14:31:36 +00:00
|
|
|
if (*fmt != '%') {
|
1998-11-16 21:40:35 +00:00
|
|
|
if (!size)
|
|
|
|
return -1;
|
1998-06-17 14:31:36 +00:00
|
|
|
*str++ = *fmt;
|
|
|
|
continue;
|
|
|
|
}
|
2015-12-18 10:57:38 +00:00
|
|
|
|
1998-06-17 14:31:36 +00:00
|
|
|
/* process flags */
|
|
|
|
flags = 0;
|
|
|
|
repeat:
|
|
|
|
++fmt; /* this also skips first '%' */
|
|
|
|
switch (*fmt) {
|
|
|
|
case '-': flags |= LEFT; goto repeat;
|
|
|
|
case '+': flags |= PLUS; goto repeat;
|
|
|
|
case ' ': flags |= SPACE; goto repeat;
|
|
|
|
case '#': flags |= SPECIAL; goto repeat;
|
|
|
|
case '0': flags |= ZEROPAD; goto repeat;
|
2016-08-16 11:02:32 +00:00
|
|
|
}
|
2015-12-29 16:12:47 +00:00
|
|
|
|
1998-06-17 14:31:36 +00:00
|
|
|
/* get field width */
|
|
|
|
field_width = -1;
|
|
|
|
if (is_digit(*fmt))
|
|
|
|
field_width = skip_atoi(&fmt);
|
|
|
|
else if (*fmt == '*') {
|
|
|
|
++fmt;
|
|
|
|
/* it's the next argument */
|
|
|
|
field_width = va_arg(args, int);
|
|
|
|
if (field_width < 0) {
|
|
|
|
field_width = -field_width;
|
|
|
|
flags |= LEFT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get the precision */
|
|
|
|
precision = -1;
|
|
|
|
if (*fmt == '.') {
|
2015-12-29 16:12:47 +00:00
|
|
|
++fmt;
|
1998-06-17 14:31:36 +00:00
|
|
|
if (is_digit(*fmt))
|
|
|
|
precision = skip_atoi(&fmt);
|
|
|
|
else if (*fmt == '*') {
|
|
|
|
++fmt;
|
|
|
|
/* it's the next argument */
|
|
|
|
precision = va_arg(args, int);
|
|
|
|
}
|
|
|
|
if (precision < 0)
|
|
|
|
precision = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get the conversion qualifier */
|
|
|
|
qualifier = -1;
|
|
|
|
if (*fmt == 'h' || *fmt == 'l' || *fmt == 'L') {
|
|
|
|
qualifier = *fmt;
|
|
|
|
++fmt;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* default base */
|
|
|
|
base = 10;
|
|
|
|
|
1998-11-16 21:40:35 +00:00
|
|
|
if (field_width > size)
|
|
|
|
return -1;
|
1998-06-17 14:31:36 +00:00
|
|
|
switch (*fmt) {
|
2023-05-29 03:25:40 +00:00
|
|
|
case 'b': {
|
|
|
|
const char *digits="0123456789abcdef";
|
|
|
|
const byte *bs = va_arg(args, const byte *);
|
|
|
|
len = field_width;
|
|
|
|
|
|
|
|
if (3*len > size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
const byte b = *bs++;
|
|
|
|
*str++ = digits[b >> 4];
|
|
|
|
*str++ = digits[b & 0xf];
|
|
|
|
*str++ = ':';
|
|
|
|
}
|
|
|
|
|
|
|
|
str -= !!i;
|
|
|
|
continue;
|
|
|
|
}
|
1998-06-17 14:31:36 +00:00
|
|
|
case 'c':
|
|
|
|
if (!(flags & LEFT))
|
|
|
|
while (--field_width > 0)
|
|
|
|
*str++ = ' ';
|
2015-05-19 06:14:04 +00:00
|
|
|
*str++ = (byte) va_arg(args, int);
|
1998-06-17 14:31:36 +00:00
|
|
|
while (--field_width > 0)
|
|
|
|
*str++ = ' ';
|
|
|
|
continue;
|
|
|
|
|
1998-06-17 14:34:13 +00:00
|
|
|
case 'm':
|
2014-05-18 09:42:26 +00:00
|
|
|
if (flags & SPECIAL) {
|
|
|
|
if (!errno)
|
|
|
|
continue;
|
|
|
|
if (size < 2)
|
|
|
|
return -1;
|
|
|
|
*str++ = ':';
|
|
|
|
*str++ = ' ';
|
|
|
|
start += 2;
|
|
|
|
size -= 2;
|
|
|
|
}
|
1998-06-17 14:34:13 +00:00
|
|
|
s = strerror(errno);
|
|
|
|
goto str;
|
2000-05-02 16:10:04 +00:00
|
|
|
case 'M':
|
|
|
|
s = strerror(va_arg(args, int));
|
|
|
|
goto str;
|
2015-12-18 10:57:38 +00:00
|
|
|
case 'N': {
|
|
|
|
net_addr *n = va_arg(args, net_addr *);
|
2015-11-05 11:48:52 +00:00
|
|
|
if (field_width == 1)
|
2015-12-18 10:57:38 +00:00
|
|
|
field_width = net_max_text_length[n->type];
|
|
|
|
net_format(n, ipbuf, sizeof(ipbuf));
|
2015-11-05 11:48:52 +00:00
|
|
|
s = ipbuf;
|
|
|
|
goto str;
|
2015-12-18 10:57:38 +00:00
|
|
|
}
|
1998-06-17 14:31:36 +00:00
|
|
|
case 's':
|
|
|
|
s = va_arg(args, char *);
|
|
|
|
if (!s)
|
|
|
|
s = "<NULL>";
|
|
|
|
|
1998-06-17 14:34:13 +00:00
|
|
|
str:
|
1998-06-17 14:31:36 +00:00
|
|
|
len = strlen(s);
|
|
|
|
if (precision >= 0 && len > precision)
|
|
|
|
len = precision;
|
1998-11-16 21:40:35 +00:00
|
|
|
if (len > size)
|
|
|
|
return -1;
|
1998-06-17 14:31:36 +00:00
|
|
|
|
|
|
|
if (!(flags & LEFT))
|
|
|
|
while (len < field_width--)
|
|
|
|
*str++ = ' ';
|
|
|
|
for (i = 0; i < len; ++i)
|
|
|
|
*str++ = *s++;
|
|
|
|
while (len < field_width--)
|
|
|
|
*str++ = ' ';
|
|
|
|
continue;
|
|
|
|
|
Lib: recursive printf
Use like this:
void func(const char *msg, va_list args) {
...
bvsnprintf(buf, len, "file %s, line %d: %V (foo %d, bar %d)", file, line, msg, &args, foo, bar);
...
}
2018-08-22 12:58:53 +00:00
|
|
|
case 'V': {
|
|
|
|
const char *vfmt = va_arg(args, const char *);
|
|
|
|
va_list *vargs = va_arg(args, va_list *);
|
|
|
|
int res = bvsnprintf(str, size, vfmt, *vargs);
|
|
|
|
if (res < 0)
|
|
|
|
return -1;
|
|
|
|
str += res;
|
|
|
|
size -= res;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
1998-06-17 14:31:36 +00:00
|
|
|
case 'p':
|
|
|
|
if (field_width == -1) {
|
|
|
|
field_width = 2*sizeof(void *);
|
|
|
|
flags |= ZEROPAD;
|
|
|
|
}
|
2019-10-01 15:01:29 +00:00
|
|
|
str = number(str, (uintptr_t) va_arg(args, void *), 16,
|
|
|
|
field_width, precision, flags, size);
|
1998-11-16 21:40:35 +00:00
|
|
|
if (!str)
|
|
|
|
return -1;
|
1998-06-17 14:31:36 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
case 'n':
|
|
|
|
if (qualifier == 'l') {
|
2019-10-01 15:01:29 +00:00
|
|
|
s64 * ip = va_arg(args, s64 *);
|
1998-06-17 14:31:36 +00:00
|
|
|
*ip = (str - buf);
|
|
|
|
} else {
|
|
|
|
int * ip = va_arg(args, int *);
|
|
|
|
*ip = (str - buf);
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* IP address */
|
2015-12-29 16:12:47 +00:00
|
|
|
case 'I':
|
|
|
|
if (fmt[1] == '4') {
|
|
|
|
/* Explicit IPv4 address */
|
|
|
|
ip4_addr a = va_arg(args, ip4_addr);
|
|
|
|
ip4_ntop(a, ipbuf);
|
|
|
|
i = IP4_MAX_TEXT_LENGTH;
|
2016-01-11 10:03:11 +00:00
|
|
|
fmt++;
|
2015-12-29 16:12:47 +00:00
|
|
|
} else if (fmt[1] == '6') {
|
|
|
|
/* Explicit IPv6 address */
|
|
|
|
ip6_addr a = va_arg(args, ip6_addr);
|
|
|
|
ip6_ntop(a, ipbuf);
|
|
|
|
i = IP6_MAX_TEXT_LENGTH;
|
2016-01-11 10:03:11 +00:00
|
|
|
fmt++;
|
2015-12-29 16:12:47 +00:00
|
|
|
} else {
|
|
|
|
/* Just IP address */
|
|
|
|
ip_addr a = va_arg(args, ip_addr);
|
|
|
|
|
|
|
|
if (ipa_is_ip4(a)) {
|
2015-12-21 02:27:41 +00:00
|
|
|
ip4_ntop(ipa_to_ip4(a), ipbuf);
|
2015-12-29 16:12:47 +00:00
|
|
|
i = IP4_MAX_TEXT_LENGTH;
|
|
|
|
} else {
|
2015-12-21 02:27:41 +00:00
|
|
|
ip6_ntop(ipa_to_ip6(a), ipbuf);
|
2015-12-29 16:12:47 +00:00
|
|
|
i = IP6_MAX_TEXT_LENGTH;
|
|
|
|
}
|
1998-06-17 14:31:36 +00:00
|
|
|
}
|
2015-12-29 16:12:47 +00:00
|
|
|
|
2001-08-19 11:11:44 +00:00
|
|
|
s = ipbuf;
|
2015-12-29 16:12:47 +00:00
|
|
|
if (field_width == 1)
|
|
|
|
field_width = i;
|
|
|
|
|
2001-08-19 11:11:44 +00:00
|
|
|
goto str;
|
2015-12-29 16:12:47 +00:00
|
|
|
|
2012-01-08 14:28:27 +00:00
|
|
|
/* Interface scope after link-local IP address */
|
|
|
|
case 'J':
|
|
|
|
iface = va_arg(args, struct iface *);
|
|
|
|
if (!iface)
|
|
|
|
continue;
|
|
|
|
if (!size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*str++ = '%';
|
|
|
|
start++;
|
|
|
|
size--;
|
|
|
|
|
|
|
|
s = iface->name;
|
|
|
|
goto str;
|
|
|
|
|
2009-07-23 14:06:25 +00:00
|
|
|
/* Router/Network ID - essentially IPv4 address in u32 value */
|
|
|
|
case 'R':
|
2016-05-12 15:49:12 +00:00
|
|
|
if (qualifier == 'l') {
|
2016-04-28 16:01:40 +00:00
|
|
|
X = va_arg(args, u64);
|
|
|
|
bsprintf(ipbuf, "%02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x",
|
2019-07-17 23:57:26 +00:00
|
|
|
(uint) ((X >> 56) & 0xff),
|
|
|
|
(uint) ((X >> 48) & 0xff),
|
|
|
|
(uint) ((X >> 40) & 0xff),
|
|
|
|
(uint) ((X >> 32) & 0xff),
|
|
|
|
(uint) ((X >> 24) & 0xff),
|
|
|
|
(uint) ((X >> 16) & 0xff),
|
|
|
|
(uint) ((X >> 8) & 0xff),
|
|
|
|
(uint) (X & 0xff));
|
2016-04-28 16:01:40 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
x = va_arg(args, u32);
|
2016-05-12 15:49:12 +00:00
|
|
|
ip4_ntop(ip4_from_u32(x), ipbuf);
|
2016-04-28 16:01:40 +00:00
|
|
|
}
|
2009-07-23 14:06:25 +00:00
|
|
|
s = ipbuf;
|
|
|
|
goto str;
|
|
|
|
|
2017-06-13 13:41:49 +00:00
|
|
|
case 't':
|
|
|
|
t = va_arg(args, btime);
|
|
|
|
t1 = t TO_S;
|
|
|
|
t2 = t - t1 S;
|
|
|
|
|
|
|
|
if (precision < 0)
|
|
|
|
precision = 3;
|
|
|
|
|
|
|
|
if (precision > 6)
|
|
|
|
precision = 6;
|
|
|
|
|
|
|
|
/* Compute field_width for second part */
|
|
|
|
if ((precision > 0) && (field_width > 0))
|
|
|
|
field_width -= (1 + precision);
|
|
|
|
|
|
|
|
if (field_width < 0)
|
|
|
|
field_width = 0;
|
|
|
|
|
|
|
|
/* Print seconds */
|
|
|
|
flags |= SIGN;
|
2019-10-01 15:01:29 +00:00
|
|
|
str = number(str, (u64) t1, 10, field_width, 0, flags, size);
|
2017-06-13 13:41:49 +00:00
|
|
|
if (!str)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
if (precision > 0)
|
|
|
|
{
|
|
|
|
size -= (str-start);
|
|
|
|
start = str;
|
|
|
|
|
|
|
|
if ((1 + precision) > size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* Convert microseconds to requested precision */
|
|
|
|
for (i = precision; i < 6; i++)
|
|
|
|
t2 /= 10;
|
|
|
|
|
|
|
|
/* Print sub-seconds */
|
|
|
|
*str++ = '.';
|
2019-10-01 15:01:29 +00:00
|
|
|
str = number(str, (u64) t2, 10, precision, 0, ZEROPAD, size - 1);
|
2017-06-13 13:41:49 +00:00
|
|
|
if (!str)
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
goto done;
|
|
|
|
|
1998-06-17 14:31:36 +00:00
|
|
|
/* integer number formats - set up the flags and "break" */
|
|
|
|
case 'o':
|
|
|
|
base = 8;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'X':
|
|
|
|
flags |= LARGE;
|
2018-09-18 12:21:11 +00:00
|
|
|
/* fallthrough */
|
1998-06-17 14:31:36 +00:00
|
|
|
case 'x':
|
|
|
|
base = 16;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'd':
|
|
|
|
case 'i':
|
|
|
|
flags |= SIGN;
|
|
|
|
case 'u':
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
1998-11-16 21:40:35 +00:00
|
|
|
if (size < 2)
|
|
|
|
return -1;
|
1998-06-17 14:31:36 +00:00
|
|
|
if (*fmt != '%')
|
|
|
|
*str++ = '%';
|
|
|
|
if (*fmt)
|
|
|
|
*str++ = *fmt;
|
|
|
|
else
|
|
|
|
--fmt;
|
|
|
|
continue;
|
|
|
|
}
|
2019-10-01 15:01:29 +00:00
|
|
|
if (flags & SIGN) {
|
|
|
|
/* Conversions valid per ISO C99 6.3.1.3 (2) */
|
|
|
|
if (qualifier == 'l')
|
|
|
|
num = (u64) va_arg(args, s64);
|
|
|
|
else if (qualifier == 'h')
|
|
|
|
num = (u64) (short) va_arg(args, int);
|
|
|
|
else
|
|
|
|
num = (u64) va_arg(args, int);
|
|
|
|
} else {
|
|
|
|
if (qualifier == 'l')
|
|
|
|
num = va_arg(args, u64);
|
|
|
|
else if (qualifier == 'h')
|
|
|
|
num = (unsigned short) va_arg(args, int);
|
|
|
|
else
|
|
|
|
num = va_arg(args, uint);
|
|
|
|
}
|
1998-11-16 21:40:35 +00:00
|
|
|
str = number(str, num, base, field_width, precision, flags, size);
|
|
|
|
if (!str)
|
|
|
|
return -1;
|
2017-06-13 13:41:49 +00:00
|
|
|
done: ;
|
1998-06-17 14:31:36 +00:00
|
|
|
}
|
1998-11-16 21:40:35 +00:00
|
|
|
if (!size)
|
|
|
|
return -1;
|
1998-06-17 14:31:36 +00:00
|
|
|
*str = '\0';
|
|
|
|
return str-buf;
|
|
|
|
}
|
|
|
|
|
2000-06-04 18:34:39 +00:00
|
|
|
/**
|
|
|
|
* bvsprintf - BIRD's vsprintf()
|
|
|
|
* @buf: buffer
|
|
|
|
* @fmt: format string
|
|
|
|
* @args: a list of arguments to be formatted
|
|
|
|
*
|
|
|
|
* This function is equivalent to bvsnprintf() with an infinite
|
|
|
|
* buffer size. Please use carefully only when you are absolutely
|
|
|
|
* sure the buffer won't overflow.
|
|
|
|
*/
|
1998-11-16 21:40:35 +00:00
|
|
|
int bvsprintf(char *buf, const char *fmt, va_list args)
|
|
|
|
{
|
|
|
|
return bvsnprintf(buf, 1000000000, fmt, args);
|
|
|
|
}
|
|
|
|
|
2000-06-04 18:34:39 +00:00
|
|
|
/**
|
|
|
|
* bsprintf - BIRD's sprintf()
|
|
|
|
* @buf: buffer
|
|
|
|
* @fmt: format string
|
|
|
|
*
|
|
|
|
* This function is equivalent to bvsnprintf() with an infinite
|
|
|
|
* buffer size and variable arguments instead of a &va_list.
|
|
|
|
* Please use carefully only when you are absolutely
|
|
|
|
* sure the buffer won't overflow.
|
|
|
|
*/
|
1998-06-17 14:31:36 +00:00
|
|
|
int bsprintf(char * buf, const char *fmt, ...)
|
|
|
|
{
|
1998-11-16 21:40:35 +00:00
|
|
|
va_list args;
|
|
|
|
int i;
|
1998-06-17 14:31:36 +00:00
|
|
|
|
1998-11-16 21:40:35 +00:00
|
|
|
va_start(args, fmt);
|
|
|
|
i=bvsnprintf(buf, 1000000000, fmt, args);
|
|
|
|
va_end(args);
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2000-06-04 18:34:39 +00:00
|
|
|
/**
|
|
|
|
* bsnprintf - BIRD's snprintf()
|
|
|
|
* @buf: buffer
|
|
|
|
* @size: buffer size
|
|
|
|
* @fmt: format string
|
|
|
|
*
|
|
|
|
* This function is equivalent to bsnprintf() with variable arguments instead of a &va_list.
|
|
|
|
*/
|
1998-11-16 21:40:35 +00:00
|
|
|
int bsnprintf(char * buf, int size, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
|
|
|
i=bvsnprintf(buf, size, fmt, args);
|
|
|
|
va_end(args);
|
|
|
|
return i;
|
1998-06-17 14:31:36 +00:00
|
|
|
}
|
2013-10-05 18:12:28 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
buffer_vprint(buffer *buf, const char *fmt, va_list args)
|
|
|
|
{
|
|
|
|
int i = bvsnprintf((char *) buf->pos, buf->end - buf->pos, fmt, args);
|
2016-12-07 14:36:15 +00:00
|
|
|
|
|
|
|
if ((i < 0) && (buf->pos < buf->end))
|
|
|
|
*buf->pos = 0;
|
|
|
|
|
2013-10-05 18:12:28 +00:00
|
|
|
buf->pos = (i >= 0) ? (buf->pos + i) : buf->end;
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
buffer_print(buffer *buf, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
2016-12-07 14:36:15 +00:00
|
|
|
i = bvsnprintf((char *) buf->pos, buf->end - buf->pos, fmt, args);
|
2013-10-05 18:12:28 +00:00
|
|
|
va_end(args);
|
|
|
|
|
2016-12-07 14:36:15 +00:00
|
|
|
if ((i < 0) && (buf->pos < buf->end))
|
|
|
|
*buf->pos = 0;
|
|
|
|
|
2013-10-05 18:12:28 +00:00
|
|
|
buf->pos = (i >= 0) ? (buf->pos + i) : buf->end;
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
buffer_puts(buffer *buf, const char *str)
|
|
|
|
{
|
|
|
|
byte *bp = buf->pos;
|
2016-12-07 14:36:15 +00:00
|
|
|
byte *be = buf->end - 1;
|
2013-10-05 18:12:28 +00:00
|
|
|
|
|
|
|
while (bp < be && *str)
|
|
|
|
*bp++ = *str++;
|
|
|
|
|
2016-12-07 14:36:15 +00:00
|
|
|
if (bp <= be)
|
2013-10-05 18:12:28 +00:00
|
|
|
*bp = 0;
|
|
|
|
|
2016-12-07 14:36:15 +00:00
|
|
|
buf->pos = (bp < be) ? bp : buf->end;
|
2013-10-05 18:12:28 +00:00
|
|
|
}
|
2022-03-15 10:21:46 +00:00
|
|
|
|
|
|
|
#define POOL_PRINTF_MAXBUF 1024
|
|
|
|
|
|
|
|
char *mb_vsprintf(pool *p, const char *fmt, va_list args)
|
|
|
|
{
|
|
|
|
char buf[POOL_PRINTF_MAXBUF];
|
|
|
|
int count = bvsnprintf(buf, POOL_PRINTF_MAXBUF, fmt, args);
|
|
|
|
|
|
|
|
if (count < 0)
|
|
|
|
bug("Attempted to mb_vsprintf() a too long string");
|
|
|
|
|
|
|
|
char *out = mb_alloc(p, count + 1);
|
|
|
|
memcpy(out, buf, count + 1);
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *mb_sprintf(pool *p, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
char *out;
|
|
|
|
va_start(args, fmt);
|
|
|
|
out = mb_vsprintf(p, fmt, args);
|
|
|
|
va_end(args);
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *lp_vsprintf(linpool *p, const char *fmt, va_list args)
|
|
|
|
{
|
|
|
|
char buf[POOL_PRINTF_MAXBUF];
|
|
|
|
int count = bvsnprintf(buf, POOL_PRINTF_MAXBUF, fmt, args);
|
|
|
|
|
|
|
|
if (count < 0)
|
|
|
|
bug("Attempted to mb_vsprintf() a too long string");
|
|
|
|
|
|
|
|
char *out = lp_alloc(p, count + 1);
|
|
|
|
memcpy(out, buf, count + 1);
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *lp_sprintf(linpool *p, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
char *out;
|
|
|
|
va_start(args, fmt);
|
|
|
|
out = lp_vsprintf(p, fmt, args);
|
|
|
|
va_end(args);
|
|
|
|
return out;
|
|
|
|
}
|