mirror of
https://gitee.com/Vancouver2017/luban-lite-t3e-pro.git
synced 2025-12-14 18:38:55 +00:00
518 lines
10 KiB
C
518 lines
10 KiB
C
#include <stdio.h>
|
|
#include <stdarg.h>
|
|
#include <string.h>
|
|
#include <stddef.h>
|
|
#include <unistd.h>
|
|
#include <aic_common.h>
|
|
|
|
#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 SMALL 32 /* Must be 32 == 0x20 */
|
|
#define SPECIAL 64 /* 0x */
|
|
|
|
/*
|
|
* Macro to add a new character to our output string, but only if it will
|
|
* fit. The macro moves to the next character position in the output string.
|
|
*/
|
|
#define ADDCH(str, ch) do { \
|
|
if ((str) < end) \
|
|
*(str) = (ch); \
|
|
++str; \
|
|
} while (0)
|
|
|
|
#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;
|
|
}
|
|
|
|
/* Decimal conversion is by far the most typical, and is used
|
|
* for /proc and /sys data. This directly impacts e.g. top performance
|
|
* with many processes running. We optimize it for speed
|
|
* using code from
|
|
* http://www.cs.uiowa.edu/~jones/bcd/decimal.html
|
|
* (with permission from the author, Douglas W. Jones). */
|
|
|
|
/* Formats correctly any integer in [0,99999].
|
|
* Outputs from one to five digits depending on input.
|
|
* On i386 gcc 4.1.2 -O2: ~250 bytes of code. */
|
|
static char *put_dec_trunc(char *buf, unsigned q)
|
|
{
|
|
unsigned d3, d2, d1, d0;
|
|
d1 = (q>>4) & 0xf;
|
|
d2 = (q>>8) & 0xf;
|
|
d3 = (q>>12);
|
|
|
|
d0 = 6*(d3 + d2 + d1) + (q & 0xf);
|
|
q = (d0 * 0xcd) >> 11;
|
|
d0 = d0 - 10*q;
|
|
*buf++ = d0 + '0'; /* least significant digit */
|
|
d1 = q + 9*d3 + 5*d2 + d1;
|
|
if (d1 != 0) {
|
|
q = (d1 * 0xcd) >> 11;
|
|
d1 = d1 - 10*q;
|
|
*buf++ = d1 + '0'; /* next digit */
|
|
|
|
d2 = q + 2*d2;
|
|
if ((d2 != 0) || (d3 != 0)) {
|
|
q = (d2 * 0xd) >> 7;
|
|
d2 = d2 - 10*q;
|
|
*buf++ = d2 + '0'; /* next digit */
|
|
|
|
d3 = q + 4*d3;
|
|
if (d3 != 0) {
|
|
q = (d3 * 0xcd) >> 11;
|
|
d3 = d3 - 10*q;
|
|
*buf++ = d3 + '0'; /* next digit */
|
|
if (q != 0)
|
|
*buf++ = q + '0'; /* most sign. digit */
|
|
}
|
|
}
|
|
}
|
|
return buf;
|
|
}
|
|
/* Same with if's removed. Always emits five digits */
|
|
static char *put_dec_full(char *buf, unsigned q)
|
|
{
|
|
/* BTW, if q is in [0,9999], 8-bit ints will be enough, */
|
|
/* but anyway, gcc produces better code with full-sized ints */
|
|
unsigned d3, d2, d1, d0;
|
|
d1 = (q>>4) & 0xf;
|
|
d2 = (q>>8) & 0xf;
|
|
d3 = (q>>12);
|
|
|
|
/*
|
|
* Possible ways to approx. divide by 10
|
|
* gcc -O2 replaces multiply with shifts and adds
|
|
* (x * 0xcd) >> 11: 11001101 - shorter code than * 0x67 (on i386)
|
|
* (x * 0x67) >> 10: 1100111
|
|
* (x * 0x34) >> 9: 110100 - same
|
|
* (x * 0x1a) >> 8: 11010 - same
|
|
* (x * 0x0d) >> 7: 1101 - same, shortest code (on i386)
|
|
*/
|
|
|
|
d0 = 6*(d3 + d2 + d1) + (q & 0xf);
|
|
q = (d0 * 0xcd) >> 11;
|
|
d0 = d0 - 10*q;
|
|
*buf++ = d0 + '0';
|
|
d1 = q + 9*d3 + 5*d2 + d1;
|
|
q = (d1 * 0xcd) >> 11;
|
|
d1 = d1 - 10*q;
|
|
*buf++ = d1 + '0';
|
|
|
|
d2 = q + 2*d2;
|
|
q = (d2 * 0xd) >> 7;
|
|
d2 = d2 - 10*q;
|
|
*buf++ = d2 + '0';
|
|
|
|
d3 = q + 4*d3;
|
|
q = (d3 * 0xcd) >> 11; /* - shorter code */
|
|
/* q = (d3 * 0x67) >> 10; - would also work */
|
|
d3 = d3 - 10*q;
|
|
*buf++ = d3 + '0';
|
|
*buf++ = q + '0';
|
|
return buf;
|
|
}
|
|
/* No inlining helps gcc to use registers better */
|
|
__attribute__((__noinline__)) static char *put_dec(char *buf, uint64_t num)
|
|
{
|
|
while (1) {
|
|
unsigned rem;
|
|
if (num < 100000)
|
|
return put_dec_trunc(buf, num);
|
|
rem = num % 100000;
|
|
num = num / 100000;
|
|
buf = put_dec_full(buf, rem);
|
|
}
|
|
}
|
|
|
|
static char *number(char *buf, char *end, uint64_t num,
|
|
int base, int size, int precision, int type)
|
|
{
|
|
/* we are called with base 8, 10 or 16, only, thus don't need "G..." */
|
|
static const char digits[16] = "0123456789ABCDEF";
|
|
|
|
char tmp[66];
|
|
char sign;
|
|
char locase;
|
|
int need_pfx = ((type & SPECIAL) && base != 10);
|
|
int i;
|
|
|
|
/* locase = 0 or 0x20. ORing digits or letters with 'locase'
|
|
* produces same digits or (maybe lowercased) letters */
|
|
locase = (type & SMALL);
|
|
if (type & LEFT)
|
|
type &= ~ZEROPAD;
|
|
sign = 0;
|
|
if (type & SIGN) {
|
|
if ((int64_t) num < 0) {
|
|
sign = '-';
|
|
num = -(int64_t) num;
|
|
size--;
|
|
} else if (type & PLUS) {
|
|
sign = '+';
|
|
size--;
|
|
} else if (type & SPACE) {
|
|
sign = ' ';
|
|
size--;
|
|
}
|
|
}
|
|
if (need_pfx) {
|
|
size--;
|
|
if (base == 16)
|
|
size--;
|
|
}
|
|
|
|
/* generate full string in tmp[], in reverse order */
|
|
i = 0;
|
|
if (num == 0)
|
|
tmp[i++] = '0';
|
|
/* Generic code, for any base:
|
|
else do {
|
|
tmp[i++] = (digits[do_div(num,base)] | locase);
|
|
} while (num != 0);
|
|
*/
|
|
else if (base != 10) { /* 8 or 16 */
|
|
int mask = base - 1;
|
|
int shift = 3;
|
|
|
|
if (base == 16)
|
|
shift = 4;
|
|
|
|
do {
|
|
tmp[i++] = (digits[((unsigned char)num) & mask]
|
|
| locase);
|
|
num >>= shift;
|
|
} while (num);
|
|
} else { /* base 10 */
|
|
i = put_dec(tmp, num) - tmp;
|
|
}
|
|
|
|
/* printing 100 using %2d gives "100", not "00" */
|
|
if (i > precision)
|
|
precision = i;
|
|
/* leading space padding */
|
|
size -= precision;
|
|
if (!(type & (ZEROPAD + LEFT))) {
|
|
while (--size >= 0)
|
|
ADDCH(buf, ' ');
|
|
}
|
|
/* sign */
|
|
if (sign)
|
|
ADDCH(buf, sign);
|
|
/* "0x" / "0" prefix */
|
|
if (need_pfx) {
|
|
ADDCH(buf, '0');
|
|
if (base == 16)
|
|
ADDCH(buf, 'X' | locase);
|
|
}
|
|
/* zero or space padding */
|
|
if (!(type & LEFT)) {
|
|
char c = (type & ZEROPAD) ? '0' : ' ';
|
|
|
|
while (--size >= 0)
|
|
ADDCH(buf, c);
|
|
}
|
|
/* hmm even more zero padding? */
|
|
while (i <= --precision)
|
|
ADDCH(buf, '0');
|
|
/* actual digits of result */
|
|
while (--i >= 0)
|
|
ADDCH(buf, tmp[i]);
|
|
/* trailing space padding */
|
|
while (--size >= 0)
|
|
ADDCH(buf, ' ');
|
|
return buf;
|
|
}
|
|
|
|
static char *string(char *buf, char *end, char *s, int field_width,
|
|
int precision, int flags)
|
|
{
|
|
int len, i;
|
|
|
|
if (s == NULL)
|
|
s = "<NULL>";
|
|
|
|
len = strnlen(s, precision);
|
|
|
|
if (!(flags & LEFT))
|
|
while (len < field_width--)
|
|
ADDCH(buf, ' ');
|
|
for (i = 0; i < len; ++i)
|
|
ADDCH(buf, *s++);
|
|
while (len < field_width--)
|
|
ADDCH(buf, ' ');
|
|
return buf;
|
|
}
|
|
|
|
static int vsnprintf_internal(char *buf, size_t size, const char *fmt,
|
|
va_list args)
|
|
{
|
|
uint64_t num;
|
|
int base;
|
|
char *str;
|
|
|
|
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 */
|
|
int qualifier; /* 'h', 'l', or 'L' for integer fields */
|
|
/* 'z' support added 23/7/1999 S.H. */
|
|
/* 'z' changed to 'Z' --davidm 1/25/99 */
|
|
/* 't' added for ptrdiff_t */
|
|
char *end = buf + size;
|
|
|
|
if (end < buf) {
|
|
end = ((void *)-1);
|
|
size = end - buf;
|
|
}
|
|
str = buf;
|
|
|
|
for (; *fmt ; ++fmt) {
|
|
if (*fmt != '%') {
|
|
ADDCH(str, *fmt);
|
|
continue;
|
|
}
|
|
|
|
/* 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;
|
|
}
|
|
|
|
/* 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 == '.') {
|
|
++fmt;
|
|
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' ||
|
|
*fmt == 'Z' || *fmt == 'z' || *fmt == 't') {
|
|
qualifier = *fmt;
|
|
++fmt;
|
|
if (qualifier == 'l' && *fmt == 'l') {
|
|
qualifier = 'L';
|
|
++fmt;
|
|
}
|
|
}
|
|
|
|
/* default base */
|
|
base = 10;
|
|
|
|
switch (*fmt) {
|
|
case 'c':
|
|
if (!(flags & LEFT)) {
|
|
while (--field_width > 0)
|
|
ADDCH(str, ' ');
|
|
}
|
|
ADDCH(str, (unsigned char) va_arg(args, int));
|
|
while (--field_width > 0)
|
|
ADDCH(str, ' ');
|
|
continue;
|
|
|
|
case 's':
|
|
{
|
|
str = string(str, end, va_arg(args, char *),
|
|
field_width, precision, flags);
|
|
}
|
|
continue;
|
|
|
|
case 'n':
|
|
if (qualifier == 'l') {
|
|
long *ip = va_arg(args, long *);
|
|
*ip = (str - buf);
|
|
} else {
|
|
int *ip = va_arg(args, int *);
|
|
*ip = (str - buf);
|
|
}
|
|
continue;
|
|
|
|
case '%':
|
|
ADDCH(str, '%');
|
|
continue;
|
|
|
|
/* integer number formats - set up the flags and "break" */
|
|
case 'o':
|
|
base = 8;
|
|
break;
|
|
|
|
case 'x':
|
|
flags |= SMALL;
|
|
case 'X':
|
|
base = 16;
|
|
break;
|
|
|
|
case 'd':
|
|
case 'i':
|
|
flags |= SIGN;
|
|
case 'u':
|
|
break;
|
|
|
|
default:
|
|
ADDCH(str, '%');
|
|
if (*fmt)
|
|
ADDCH(str, *fmt);
|
|
else
|
|
--fmt;
|
|
continue;
|
|
}
|
|
if (qualifier == 'L') /* "quad" for 64 bit variables */
|
|
num = va_arg(args, unsigned long long);
|
|
else if (qualifier == 'l') {
|
|
num = va_arg(args, unsigned long);
|
|
if (flags & SIGN)
|
|
num = (signed long) num;
|
|
} else if (qualifier == 'Z' || qualifier == 'z') {
|
|
num = va_arg(args, size_t);
|
|
} else if (qualifier == 't') {
|
|
num = va_arg(args, ptrdiff_t);
|
|
} else if (qualifier == 'h') {
|
|
num = (unsigned short) va_arg(args, int);
|
|
if (flags & SIGN)
|
|
num = (signed short) num;
|
|
} else {
|
|
num = va_arg(args, unsigned int);
|
|
if (flags & SIGN)
|
|
num = (signed int) num;
|
|
}
|
|
str = number(str, end, num, base, field_width, precision,
|
|
flags);
|
|
}
|
|
|
|
if (size > 0) {
|
|
ADDCH(str, '\0');
|
|
if (str > end)
|
|
end[-1] = '\0';
|
|
--str;
|
|
}
|
|
/* the trailing null byte doesn't count towards the total */
|
|
return str - buf;
|
|
}
|
|
|
|
int vsnprintf(char *buf, size_t size, const char *fmt,
|
|
va_list args)
|
|
{
|
|
return vsnprintf_internal(buf, size, fmt, args);
|
|
}
|
|
|
|
int vscnprintf(char *buf, size_t size, const char *fmt, va_list args)
|
|
{
|
|
int i;
|
|
|
|
i = vsnprintf(buf, size, fmt, args);
|
|
|
|
if (i < size)
|
|
return i;
|
|
if (size != 0)
|
|
return size - 1;
|
|
return 0;
|
|
}
|
|
|
|
int sprintf(char *buf, const char *fmt, ...)
|
|
{
|
|
va_list args;
|
|
int i;
|
|
|
|
va_start(args, fmt);
|
|
i = vscnprintf(buf, U32_MAX, fmt, args);
|
|
va_end(args);
|
|
|
|
return i;
|
|
}
|
|
|
|
int snprintf(char *buf, size_t size, const char *fmt, ...)
|
|
{
|
|
va_list args;
|
|
int i;
|
|
|
|
va_start(args, fmt);
|
|
i = vscnprintf(buf, size, fmt, args);
|
|
va_end(args);
|
|
|
|
return i;
|
|
}
|
|
|
|
int vprintf(const char *fmt, va_list args)
|
|
{
|
|
unsigned int i;
|
|
char printbuffer[512];
|
|
|
|
/*
|
|
* For this to work, printbuffer must be larger than
|
|
* anything we ever want to print.
|
|
*/
|
|
i = vscnprintf(printbuffer, sizeof(printbuffer), fmt, args);
|
|
|
|
/* Handle error */
|
|
if (i <= 0)
|
|
return i;
|
|
/* Print the string */
|
|
puts(printbuffer);
|
|
return i;
|
|
}
|
|
|
|
int printf_port(const char *fmt, ...)
|
|
{
|
|
va_list args;
|
|
unsigned int i;
|
|
|
|
va_start(args, fmt);
|
|
i = vprintf(fmt, args);
|
|
va_end(args);
|
|
|
|
return i;
|
|
}
|
|
|
|
int printf(const char *format, ...) __attribute__ ((alias("printf_port")));
|