mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-01-23 17:52:26 -05:00
9a71c7759a
This took me a couple hours. :^) The ELF loading code now allocates a single region for the entire file and creates virtual memory mappings for the sections as needed. Very nice!
180 lines
4.2 KiB
C++
180 lines
4.2 KiB
C++
#include "stdio.h"
|
|
#include "stdarg.h"
|
|
#include "types.h"
|
|
#include "string.h"
|
|
#include "errno.h"
|
|
#include <Kernel/Syscall.h>
|
|
|
|
#define ALWAYS_INLINE __attribute__ ((always_inline))
|
|
|
|
static constexpr const char* h = "0123456789abcdef";
|
|
|
|
template<typename PutChFunc>
|
|
ALWAYS_INLINE int printHex(PutChFunc putch, char*& bufptr, dword number, byte fields)
|
|
{
|
|
int ret = 0;
|
|
byte shr_count = fields * 4;
|
|
while (shr_count) {
|
|
shr_count -= 4;
|
|
putch(bufptr, h[(number >> shr_count) & 0x0F]);
|
|
++ret;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
template<typename PutChFunc>
|
|
ALWAYS_INLINE int printNumber(PutChFunc putch, char*& bufptr, dword number)
|
|
{
|
|
dword divisor = 1000000000;
|
|
char ch;
|
|
char padding = 1;
|
|
int ret = 0;
|
|
|
|
for (;;) {
|
|
ch = '0' + (number / divisor);
|
|
number %= divisor;
|
|
|
|
if (ch != '0')
|
|
padding = 0;
|
|
|
|
if (!padding || divisor == 1) {
|
|
putch(bufptr, ch);
|
|
++ret;
|
|
}
|
|
|
|
if (divisor == 1)
|
|
break;
|
|
divisor /= 10;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
template<typename PutChFunc>
|
|
ALWAYS_INLINE int printSignedNumber(PutChFunc putch, char*& bufptr, int number)
|
|
{
|
|
if (number < 0) {
|
|
putch(bufptr, '-');
|
|
return printNumber(putch, bufptr, 0 - number) + 1;
|
|
}
|
|
return printNumber(putch, bufptr, number);
|
|
}
|
|
|
|
static void sys_putch(char*, char ch)
|
|
{
|
|
Syscall::invoke(Syscall::PutCharacter, ch);
|
|
}
|
|
|
|
template<typename PutChFunc>
|
|
int printfInternal(PutChFunc putch, char* buffer, const char*& fmt, char*& ap)
|
|
{
|
|
const char *p;
|
|
|
|
int ret = 0;
|
|
char* bufptr = buffer;
|
|
|
|
for (p = fmt; *p; ++p) {
|
|
if (*p == '%' && *(p + 1)) {
|
|
++p;
|
|
switch( *p )
|
|
{
|
|
case 's':
|
|
{
|
|
const char* sp = va_arg(ap, const char*);
|
|
//ASSERT(sp != nullptr);
|
|
if (!sp) {
|
|
putch(bufptr, '(');
|
|
putch(bufptr, 'n');
|
|
putch(bufptr, 'u');
|
|
putch(bufptr, 'l');
|
|
putch(bufptr, 'l');
|
|
putch(bufptr, ')');
|
|
ret += 6;
|
|
} else {
|
|
for (; *sp; ++sp) {
|
|
putch(bufptr, *sp);
|
|
++ret;
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
|
|
case 'd':
|
|
ret += printSignedNumber(putch, bufptr, va_arg(ap, int));
|
|
break;
|
|
|
|
case 'u':
|
|
ret += printNumber(putch, bufptr, va_arg(ap, dword));
|
|
break;
|
|
|
|
case 'x':
|
|
ret += printHex(putch, bufptr, va_arg(ap, dword), 8);
|
|
break;
|
|
|
|
case 'w':
|
|
ret += printHex(putch, bufptr, va_arg(ap, int), 4);
|
|
break;
|
|
|
|
case 'b':
|
|
ret += printHex(putch, bufptr, va_arg(ap, int), 2);
|
|
break;
|
|
|
|
case 'c':
|
|
putch(bufptr, (char)va_arg(ap, int));
|
|
++ret;
|
|
break;
|
|
|
|
case 'p':
|
|
putch(bufptr, '0');
|
|
putch(bufptr, 'x');
|
|
ret += 2;
|
|
ret += printHex(putch, bufptr, va_arg(ap, dword), 8);
|
|
break;
|
|
}
|
|
}
|
|
else {
|
|
putch(bufptr, *p);
|
|
++ret;
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
extern "C" {
|
|
|
|
int putchar(int ch)
|
|
{
|
|
Syscall::invoke(Syscall::PutCharacter, ch);
|
|
return (byte)ch;
|
|
}
|
|
|
|
int printf(const char* fmt, ...)
|
|
{
|
|
va_list ap;
|
|
va_start(ap, fmt);
|
|
int ret = printfInternal(sys_putch, nullptr, fmt, ap);
|
|
va_end(ap);
|
|
return ret;
|
|
}
|
|
|
|
static void buffer_putch(char*& bufptr, char ch)
|
|
{
|
|
*bufptr++ = ch;
|
|
}
|
|
|
|
int sprintf(char* buffer, const char* fmt, ...)
|
|
{
|
|
va_list ap;
|
|
va_start(ap, fmt);
|
|
int ret = printfInternal(buffer_putch, buffer, fmt, ap);
|
|
buffer[ret] = '\0';
|
|
va_end(ap);
|
|
return ret;
|
|
}
|
|
|
|
void perror(const char* s)
|
|
{
|
|
printf("%s: %s\n", s, strerror(errno));
|
|
}
|
|
|
|
}
|
|
|