2018-11-06 17:45:16 +03:00
|
|
|
#include <string.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <signal.h>
|
2018-11-11 17:36:40 +03:00
|
|
|
#include <assert.h>
|
2019-02-01 18:03:21 +03:00
|
|
|
#include <stdlib.h>
|
2019-01-15 10:14:08 +03:00
|
|
|
#include <AK/Types.h>
|
2019-02-03 18:11:28 +03:00
|
|
|
#include <AK/StdLibExtras.h>
|
2018-10-23 11:12:50 +03:00
|
|
|
|
|
|
|
extern "C" {
|
|
|
|
|
2018-11-05 20:16:00 +03:00
|
|
|
void bzero(void* dest, size_t n)
|
|
|
|
{
|
|
|
|
memset(dest, 0, n);
|
|
|
|
}
|
|
|
|
|
|
|
|
void bcopy(const void* src, void* dest, size_t n)
|
|
|
|
{
|
|
|
|
memmove(dest, src, n);
|
|
|
|
}
|
|
|
|
|
2018-10-31 19:50:43 +03:00
|
|
|
size_t strspn(const char* s, const char* accept)
|
|
|
|
{
|
|
|
|
const char* p = s;
|
|
|
|
cont:
|
|
|
|
char ch = *p++;
|
|
|
|
char ac;
|
|
|
|
for (const char* ap = accept; (ac = *ap++) != '\0';) {
|
|
|
|
if (ac == ch)
|
|
|
|
goto cont;
|
|
|
|
}
|
|
|
|
return p - 1 - s;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t strcspn(const char* s, const char* reject)
|
|
|
|
{
|
|
|
|
for (auto* p = s;;) {
|
|
|
|
char c = *p++;
|
|
|
|
auto* rp = reject;
|
|
|
|
char rc;
|
|
|
|
do {
|
|
|
|
if ((rc = *rp++) == c)
|
|
|
|
return p - 1 - s;
|
|
|
|
} while(rc);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-23 11:12:50 +03:00
|
|
|
size_t strlen(const char* str)
|
|
|
|
{
|
|
|
|
size_t len = 0;
|
|
|
|
while (*(str++))
|
|
|
|
++len;
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
2019-02-01 18:03:21 +03:00
|
|
|
char* strdup(const char* str)
|
|
|
|
{
|
|
|
|
size_t len = strlen(str);
|
2019-02-03 13:48:41 +03:00
|
|
|
char* new_str = (char*)malloc(len + 1);
|
2019-02-01 18:03:21 +03:00
|
|
|
strcpy(new_str, str);
|
|
|
|
return new_str;
|
|
|
|
}
|
|
|
|
|
2019-02-03 18:11:28 +03:00
|
|
|
char* strndup(const char* str, size_t maxlen)
|
|
|
|
{
|
|
|
|
size_t len = min(strlen(str), maxlen);
|
|
|
|
char* new_str = (char*)malloc(len + 1);
|
|
|
|
memcpy(new_str, str, len);
|
|
|
|
new_str[len] = 0;
|
|
|
|
return new_str;
|
|
|
|
}
|
|
|
|
|
2018-10-26 14:32:13 +03:00
|
|
|
int strcmp(const char* s1, const char* s2)
|
|
|
|
{
|
2018-11-05 20:16:00 +03:00
|
|
|
while (*s1 == *s2++)
|
|
|
|
if (*s1++ == 0)
|
2018-10-26 14:32:13 +03:00
|
|
|
return 0;
|
2018-11-05 20:16:00 +03:00
|
|
|
return *(const unsigned char*)s1 - *(const unsigned char*)--s2;
|
|
|
|
}
|
|
|
|
|
|
|
|
int strncmp(const char* s1, const char* s2, size_t n)
|
|
|
|
{
|
|
|
|
if (!n)
|
|
|
|
return 0;
|
|
|
|
do {
|
|
|
|
if (*s1 != *s2++)
|
|
|
|
return *(const unsigned char*)s1 - *(const unsigned char*)--s2;
|
|
|
|
if (*s1++ == 0)
|
|
|
|
break;
|
|
|
|
} while (--n);
|
|
|
|
return 0;
|
2018-10-26 14:32:13 +03:00
|
|
|
}
|
|
|
|
|
2018-10-28 11:36:21 +03:00
|
|
|
int memcmp(const void* v1, const void* v2, size_t n)
|
|
|
|
{
|
2018-11-05 18:40:48 +03:00
|
|
|
auto* s1 = (const uint8_t*)v1;
|
|
|
|
auto* s2 = (const uint8_t*)v2;
|
2018-10-28 11:36:21 +03:00
|
|
|
while (n-- > 0) {
|
|
|
|
if (*s1++ != *s2++)
|
|
|
|
return s1[-1] < s2[-1] ? -1 : 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-02-22 12:45:32 +03:00
|
|
|
void* memcpy(void* dest_ptr, const void* src_ptr, size_t n)
|
2018-10-26 14:32:13 +03:00
|
|
|
{
|
2019-02-07 10:46:52 +03:00
|
|
|
if (n >= 1024)
|
|
|
|
return mmx_memcpy(dest_ptr, src_ptr, n);
|
|
|
|
|
2019-01-15 10:14:08 +03:00
|
|
|
dword dest = (dword)dest_ptr;
|
|
|
|
dword src = (dword)src_ptr;
|
|
|
|
// FIXME: Support starting at an unaligned address.
|
|
|
|
if (!(dest & 0x3) && !(src & 0x3) && n >= 12) {
|
|
|
|
size_t dwords = n / sizeof(dword);
|
|
|
|
asm volatile(
|
|
|
|
"rep movsl\n"
|
|
|
|
: "=S"(src), "=D"(dest)
|
|
|
|
: "S"(src), "D"(dest), "c"(dwords)
|
|
|
|
: "memory"
|
|
|
|
);
|
|
|
|
n -= dwords * sizeof(dword);
|
|
|
|
if (n == 0)
|
|
|
|
return dest_ptr;
|
|
|
|
}
|
|
|
|
asm volatile(
|
|
|
|
"rep movsb\n"
|
|
|
|
:: "S"(src), "D"(dest), "c"(n)
|
|
|
|
: "memory"
|
|
|
|
);
|
|
|
|
return dest_ptr;
|
2018-10-26 14:32:13 +03:00
|
|
|
}
|
|
|
|
|
2019-02-22 12:45:32 +03:00
|
|
|
void* memset(void* dest_ptr, int c, size_t n)
|
2019-01-15 10:14:08 +03:00
|
|
|
{
|
|
|
|
dword dest = (dword)dest_ptr;
|
|
|
|
// FIXME: Support starting at an unaligned address.
|
|
|
|
if (!(dest & 0x3) && n >= 12) {
|
|
|
|
size_t dwords = n / sizeof(dword);
|
|
|
|
dword expanded_c = (byte)c;
|
|
|
|
expanded_c |= expanded_c << 8;
|
|
|
|
expanded_c |= expanded_c << 16;
|
|
|
|
asm volatile(
|
|
|
|
"rep stosl\n"
|
|
|
|
: "=D"(dest)
|
|
|
|
: "D"(dest), "c"(dwords), "a"(expanded_c)
|
|
|
|
: "memory"
|
|
|
|
);
|
|
|
|
n -= dwords * sizeof(dword);
|
|
|
|
if (n == 0)
|
|
|
|
return dest_ptr;
|
|
|
|
}
|
|
|
|
asm volatile(
|
|
|
|
"rep stosb\n"
|
|
|
|
: "=D" (dest), "=c" (n)
|
|
|
|
: "0" (dest), "1" (n), "a" (c)
|
|
|
|
: "memory"
|
|
|
|
);
|
|
|
|
return dest_ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-11-17 17:56:09 +03:00
|
|
|
void* memmove(void* dest, const void* src, size_t n)
|
2018-11-11 17:36:40 +03:00
|
|
|
{
|
|
|
|
if (dest < src)
|
|
|
|
return memcpy(dest, src, n);
|
2019-01-23 10:31:23 +03:00
|
|
|
|
|
|
|
byte *pd = (byte*)dest;
|
|
|
|
const byte *ps = (const byte*)src;
|
|
|
|
for (pd += n, ps += n; n--;)
|
|
|
|
*--pd = *--ps;
|
|
|
|
return dest;
|
2018-11-11 17:36:40 +03:00
|
|
|
}
|
|
|
|
|
2018-10-31 12:14:56 +03:00
|
|
|
char* strcpy(char* dest, const char *src)
|
|
|
|
{
|
|
|
|
char* originalDest = dest;
|
|
|
|
while ((*dest++ = *src++) != '\0');
|
|
|
|
return originalDest;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* strncpy(char* dest, const char* src, size_t n)
|
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
for (i = 0; i < n && src[i] != '\0'; ++i)
|
|
|
|
dest[i] = src[i];
|
|
|
|
for ( ; i < n; ++i)
|
|
|
|
dest[i] = '\0';
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* strchr(const char* str, int c)
|
|
|
|
{
|
2018-11-06 16:13:16 +03:00
|
|
|
char ch = c;
|
|
|
|
for (;; ++str) {
|
|
|
|
if (*str == ch)
|
2018-11-09 12:09:46 +03:00
|
|
|
return const_cast<char*>(str);
|
2018-11-06 16:13:16 +03:00
|
|
|
if (!*str)
|
|
|
|
return nullptr;
|
|
|
|
}
|
2018-10-31 12:14:56 +03:00
|
|
|
}
|
|
|
|
|
2019-02-03 06:32:31 +03:00
|
|
|
void* memchr(const void* ptr, int c, size_t size)
|
|
|
|
{
|
|
|
|
char ch = c;
|
2019-04-23 14:00:53 +03:00
|
|
|
auto* cptr = (const char*)ptr;
|
2019-02-03 06:32:31 +03:00
|
|
|
for (size_t i = 0; i < size; ++i) {
|
|
|
|
if (cptr[i] == ch)
|
2019-04-23 14:00:53 +03:00
|
|
|
return const_cast<char*>(cptr + i);
|
2019-02-03 06:32:31 +03:00
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2018-10-31 19:50:43 +03:00
|
|
|
char* strrchr(const char* str, int ch)
|
|
|
|
{
|
|
|
|
char *last = nullptr;
|
|
|
|
char c;
|
|
|
|
for (; (c = *str); ++str) {
|
|
|
|
if (c == ch)
|
2018-11-09 12:09:46 +03:00
|
|
|
last = const_cast<char*>(str);
|
2018-10-31 19:50:43 +03:00
|
|
|
}
|
|
|
|
return last;
|
|
|
|
}
|
|
|
|
|
2018-10-31 12:14:56 +03:00
|
|
|
char* strcat(char *dest, const char *src)
|
|
|
|
{
|
2019-01-31 19:31:23 +03:00
|
|
|
size_t dest_length = strlen(dest);
|
2018-10-31 12:14:56 +03:00
|
|
|
size_t i;
|
|
|
|
for (i = 0 ; src[i] != '\0' ; i++)
|
2019-01-31 19:31:23 +03:00
|
|
|
dest[dest_length + i] = src[i];
|
|
|
|
dest[dest_length + i] = '\0';
|
2018-10-31 12:14:56 +03:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* strncat(char *dest, const char *src, size_t n)
|
|
|
|
{
|
2019-01-31 19:31:23 +03:00
|
|
|
size_t dest_length = strlen(dest);
|
2018-10-31 12:14:56 +03:00
|
|
|
size_t i;
|
|
|
|
for (i = 0 ; i < n && src[i] != '\0' ; i++)
|
2019-01-31 19:31:23 +03:00
|
|
|
dest[dest_length + i] = src[i];
|
|
|
|
dest[dest_length + i] = '\0';
|
2018-10-31 12:14:56 +03:00
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
2018-11-06 16:13:16 +03:00
|
|
|
const char* sys_errlist[] = {
|
2019-02-27 00:40:35 +03:00
|
|
|
"Success (not an error)",
|
|
|
|
"Operation not permitted",
|
|
|
|
"No such file or directory",
|
|
|
|
"No such process",
|
|
|
|
"Interrupted syscall",
|
|
|
|
"I/O error",
|
|
|
|
"No such device or address",
|
|
|
|
"Argument list too long",
|
|
|
|
"Exec format error",
|
|
|
|
"Bad fd number",
|
|
|
|
"No child processes",
|
|
|
|
"Try again",
|
|
|
|
"Out of memory",
|
|
|
|
"Permission denied",
|
|
|
|
"Bad address",
|
|
|
|
"Block device required",
|
|
|
|
"Device or resource busy",
|
|
|
|
"File already exists",
|
|
|
|
"Cross-device link",
|
|
|
|
"No such device",
|
|
|
|
"Not a directory",
|
|
|
|
"Is a directory",
|
|
|
|
"Invalid argument",
|
|
|
|
"File table overflow",
|
|
|
|
"Too many open files",
|
|
|
|
"Not a TTY",
|
|
|
|
"Text file busy",
|
|
|
|
"File too large",
|
|
|
|
"No space left on device",
|
|
|
|
"Illegal seek",
|
|
|
|
"Read-only filesystem",
|
|
|
|
"Too many links",
|
|
|
|
"Broken pipe",
|
|
|
|
"Range error",
|
|
|
|
"Name too long",
|
|
|
|
"Too many symlinks",
|
|
|
|
"Overflow",
|
|
|
|
"Operation not supported",
|
|
|
|
"No such syscall",
|
|
|
|
"Not implemented",
|
|
|
|
"Address family not supported",
|
|
|
|
"Not a socket",
|
|
|
|
"Address in use",
|
|
|
|
"Failed without setting an error code (bug!)",
|
|
|
|
"Directory not empty",
|
|
|
|
"Math argument out of domain",
|
|
|
|
"Connection refused",
|
|
|
|
"Address not available",
|
|
|
|
"Already connected",
|
|
|
|
"Connection aborted",
|
|
|
|
"Connection already in progress",
|
|
|
|
"Connection reset",
|
|
|
|
"Desination address required",
|
|
|
|
"Host unreachable",
|
|
|
|
"Illegal byte sequence",
|
|
|
|
"Message size",
|
|
|
|
"Network down",
|
|
|
|
"Network unreachable",
|
|
|
|
"Network reset",
|
|
|
|
"No buffer space",
|
|
|
|
"No lock available",
|
|
|
|
"No message",
|
|
|
|
"No protocol option",
|
|
|
|
"Not connected",
|
|
|
|
"Operation would block",
|
|
|
|
"Protocol not supported",
|
|
|
|
"Resource deadlock would occur",
|
|
|
|
"Timed out",
|
|
|
|
"Wrong protocol type",
|
|
|
|
"Operation in progress",
|
2019-03-25 15:03:49 +03:00
|
|
|
"No such thread",
|
2019-02-27 00:40:35 +03:00
|
|
|
"The highest errno +1 :^)",
|
2018-11-06 16:13:16 +03:00
|
|
|
};
|
2019-02-27 00:40:35 +03:00
|
|
|
|
2019-02-24 17:19:32 +03:00
|
|
|
int sys_nerr = EMAXERRNO;
|
2018-11-06 16:13:16 +03:00
|
|
|
|
2018-11-05 16:50:41 +03:00
|
|
|
char* strerror(int errnum)
|
2018-10-25 13:06:00 +03:00
|
|
|
{
|
2019-02-24 17:19:32 +03:00
|
|
|
if (errnum >= EMAXERRNO) {
|
2018-11-06 16:13:16 +03:00
|
|
|
printf("strerror() missing string for errnum=%d\n", errnum);
|
2018-11-09 12:09:46 +03:00
|
|
|
return const_cast<char*>("Unknown error");
|
2018-10-25 13:06:00 +03:00
|
|
|
}
|
2018-11-09 12:09:46 +03:00
|
|
|
return const_cast<char*>(sys_errlist[errnum]);
|
2018-10-25 13:06:00 +03:00
|
|
|
}
|
|
|
|
|
2018-11-06 17:45:16 +03:00
|
|
|
char* strsignal(int signum)
|
|
|
|
{
|
2019-02-26 17:57:59 +03:00
|
|
|
if (signum >= NSIG) {
|
2018-11-06 17:45:16 +03:00
|
|
|
printf("strsignal() missing string for signum=%d\n", signum);
|
2018-11-09 12:09:46 +03:00
|
|
|
return const_cast<char*>("Unknown signal");
|
2018-11-06 17:45:16 +03:00
|
|
|
}
|
2018-11-09 12:09:46 +03:00
|
|
|
return const_cast<char*>(sys_siglist[signum]);
|
2018-10-23 11:12:50 +03:00
|
|
|
}
|
|
|
|
|
2018-11-11 22:42:41 +03:00
|
|
|
char* strstr(const char* haystack, const char* needle)
|
|
|
|
{
|
|
|
|
char nch;
|
|
|
|
char hch;
|
|
|
|
|
|
|
|
if ((nch = *needle++) != 0) {
|
|
|
|
size_t len = strlen(needle);
|
|
|
|
do {
|
|
|
|
do {
|
|
|
|
if ((hch = *haystack++) == 0)
|
|
|
|
return nullptr;
|
|
|
|
} while (hch != nch);
|
|
|
|
} while (strncmp(haystack, needle, len) != 0);
|
|
|
|
--haystack;
|
|
|
|
}
|
|
|
|
return const_cast<char*>(haystack);
|
2018-11-06 17:45:16 +03:00
|
|
|
}
|
2018-11-11 22:42:41 +03:00
|
|
|
|
2019-02-08 04:38:21 +03:00
|
|
|
char* strpbrk(const char* s, const char* accept)
|
|
|
|
{
|
|
|
|
while (*s)
|
|
|
|
if(strchr(accept, *s++))
|
2019-04-23 14:00:53 +03:00
|
|
|
return const_cast<char*>(--s);
|
2019-02-08 04:38:21 +03:00
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2019-02-26 14:57:02 +03:00
|
|
|
char *strtok(char* str, const char* delim)
|
|
|
|
{
|
|
|
|
(void)str;
|
|
|
|
(void)delim;
|
2019-04-23 22:52:02 +03:00
|
|
|
ASSERT_NOT_REACHED();
|
2019-02-26 14:57:02 +03:00
|
|
|
}
|
|
|
|
|
2018-11-11 22:42:41 +03:00
|
|
|
}
|
|
|
|
|