mirror of
https://github.com/suchmememanyskill/TegraExplorer.git
synced 2024-11-29 23:32:06 +00:00
201 lines
3.1 KiB
C
201 lines
3.1 KiB
C
/*
|
|
* Copyright (c) 2018 naehrwert
|
|
* Copyright (c) 2019-2022 CTCaer
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
* under the terms and conditions of the GNU General Public License,
|
|
* version 2, as published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
|
* more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <stdarg.h>
|
|
#include <string.h>
|
|
|
|
#include <utils/types.h>
|
|
|
|
char **sout_buf;
|
|
|
|
static void _s_putc(char c)
|
|
{
|
|
**sout_buf = c;
|
|
*sout_buf += 1;
|
|
}
|
|
|
|
static void _s_puts(char *s)
|
|
{
|
|
for (; *s; s++)
|
|
_s_putc(*s);
|
|
}
|
|
|
|
static void _s_putn(u32 v, int base, char fill, int fcnt)
|
|
{
|
|
char buf[65];
|
|
static const char digits[] = "0123456789ABCDEFghijklmnopqrstuvwxyz";
|
|
char *p;
|
|
int c = fcnt;
|
|
|
|
if (base > 36)
|
|
return;
|
|
|
|
p = buf + 64;
|
|
*p = 0;
|
|
do
|
|
{
|
|
c--;
|
|
*--p = digits[v % base];
|
|
v /= base;
|
|
} while (v);
|
|
|
|
if (fill != 0)
|
|
{
|
|
while (c > 0)
|
|
{
|
|
*--p = fill;
|
|
c--;
|
|
}
|
|
}
|
|
|
|
_s_puts(p);
|
|
}
|
|
|
|
void s_printf(char *out_buf, const char *fmt, ...)
|
|
{
|
|
va_list ap;
|
|
int fill, fcnt;
|
|
|
|
sout_buf = &out_buf;
|
|
|
|
va_start(ap, fmt);
|
|
while(*fmt)
|
|
{
|
|
if(*fmt == '%')
|
|
{
|
|
fmt++;
|
|
fill = 0;
|
|
fcnt = 0;
|
|
if ((*fmt >= '0' && *fmt <= '9') || *fmt == ' ')
|
|
{
|
|
fcnt = *fmt;
|
|
fmt++;
|
|
if (*fmt >= '0' && *fmt <= '9')
|
|
{
|
|
fill = fcnt;
|
|
fcnt = *fmt - '0';
|
|
fmt++;
|
|
}
|
|
else
|
|
{
|
|
fill = ' ';
|
|
fcnt -= '0';
|
|
}
|
|
}
|
|
switch(*fmt)
|
|
{
|
|
case 'c':
|
|
_s_putc(va_arg(ap, u32));
|
|
break;
|
|
case 's':
|
|
_s_puts(va_arg(ap, char *));
|
|
break;
|
|
case 'd':
|
|
_s_putn(va_arg(ap, u32), 10, fill, fcnt);
|
|
break;
|
|
case 'p':
|
|
case 'P':
|
|
case 'x':
|
|
case 'X':
|
|
_s_putn(va_arg(ap, u32), 16, fill, fcnt);
|
|
break;
|
|
case '%':
|
|
_s_putc('%');
|
|
break;
|
|
case '\0':
|
|
goto out;
|
|
default:
|
|
_s_putc('%');
|
|
_s_putc(*fmt);
|
|
break;
|
|
}
|
|
}
|
|
else
|
|
_s_putc(*fmt);
|
|
fmt++;
|
|
}
|
|
|
|
out:
|
|
**sout_buf = '\0';
|
|
va_end(ap);
|
|
}
|
|
|
|
void s_vprintf(char *out_buf, const char *fmt, va_list ap)
|
|
{
|
|
int fill, fcnt;
|
|
|
|
sout_buf = &out_buf;
|
|
|
|
while(*fmt)
|
|
{
|
|
if(*fmt == '%')
|
|
{
|
|
fmt++;
|
|
fill = 0;
|
|
fcnt = 0;
|
|
if ((*fmt >= '0' && *fmt <= '9') || *fmt == ' ')
|
|
{
|
|
fcnt = *fmt;
|
|
fmt++;
|
|
if (*fmt >= '0' && *fmt <= '9')
|
|
{
|
|
fill = fcnt;
|
|
fcnt = *fmt - '0';
|
|
fmt++;
|
|
}
|
|
else
|
|
{
|
|
fill = ' ';
|
|
fcnt -= '0';
|
|
}
|
|
}
|
|
switch(*fmt)
|
|
{
|
|
case 'c':
|
|
_s_putc(va_arg(ap, u32));
|
|
break;
|
|
case 's':
|
|
_s_puts(va_arg(ap, char *));
|
|
break;
|
|
case 'd':
|
|
_s_putn(va_arg(ap, u32), 10, fill, fcnt);
|
|
break;
|
|
case 'p':
|
|
case 'P':
|
|
case 'x':
|
|
case 'X':
|
|
_s_putn(va_arg(ap, u32), 16, fill, fcnt);
|
|
break;
|
|
case '%':
|
|
_s_putc('%');
|
|
break;
|
|
case '\0':
|
|
goto out;
|
|
default:
|
|
_s_putc('%');
|
|
_s_putc(*fmt);
|
|
break;
|
|
}
|
|
}
|
|
else
|
|
_s_putc(*fmt);
|
|
fmt++;
|
|
}
|
|
|
|
out:
|
|
**sout_buf = '\0';
|
|
}
|