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>
|
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
|
|
|
void* memset(void* dest, int c, size_t n)
|
|
|
|
{
|
2018-11-05 18:40:48 +03:00
|
|
|
uint8_t* bdest = (uint8_t*)dest;
|
2018-10-31 19:50:43 +03:00
|
|
|
for (; n; --n)
|
|
|
|
*(bdest++) = c;
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2018-10-26 14:32:13 +03:00
|
|
|
void memcpy(void* dest, const void* src, size_t n)
|
|
|
|
{
|
|
|
|
auto* bdest = (unsigned char*)dest;
|
|
|
|
auto* bsrc = (const unsigned char*)src;
|
|
|
|
for (; n; --n)
|
|
|
|
*(bdest++) = *(bsrc++);
|
|
|
|
}
|
|
|
|
|
2018-11-11 17:36:40 +03:00
|
|
|
void memmove(void* dest, const void* src, size_t n)
|
|
|
|
{
|
|
|
|
if (dest < src)
|
|
|
|
return memcpy(dest, src, n);
|
|
|
|
// FIXME: Implement backwards copy.
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
|
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
|
|
|
}
|
|
|
|
|
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)
|
|
|
|
{
|
|
|
|
size_t destLength = strlen(dest);
|
|
|
|
size_t i;
|
|
|
|
for (i = 0 ; src[i] != '\0' ; i++)
|
|
|
|
dest[destLength + i] = src[i];
|
|
|
|
dest[destLength + i] = '\0';
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* strncat(char *dest, const char *src, size_t n)
|
|
|
|
{
|
|
|
|
size_t destLength = strlen(dest);
|
|
|
|
size_t i;
|
|
|
|
for (i = 0 ; i < n && src[i] != '\0' ; i++)
|
|
|
|
dest[destLength + i] = src[i];
|
|
|
|
dest[destLength + i] = '\0';
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
2018-11-06 16:13:16 +03:00
|
|
|
const char* sys_errlist[] = {
|
|
|
|
#undef __ERROR
|
2018-11-06 17:45:16 +03:00
|
|
|
#define __ERROR(a, b) b,
|
2018-11-06 16:13:16 +03:00
|
|
|
__ENUMERATE_ALL_ERRORS
|
|
|
|
#undef __ERROR
|
|
|
|
};
|
|
|
|
int sys_nerr = __errno_count;
|
|
|
|
|
2018-11-05 16:50:41 +03:00
|
|
|
char* strerror(int errnum)
|
2018-10-25 13:06:00 +03:00
|
|
|
{
|
2018-11-06 16:13:16 +03:00
|
|
|
if (errnum >= __errno_count) {
|
|
|
|
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)
|
|
|
|
{
|
|
|
|
if (signum >= __signal_count) {
|
|
|
|
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
|
|
|
|
|
|
|
}
|
|
|
|
|