ciabatta/src/string.c

240 lines
5.0 KiB
C
Raw Normal View History

2022-06-06 01:30:01 +00:00
typedef unsigned char byte;
2022-06-02 13:08:59 +00:00
void *memcpy(void *restrict s1, const void *restrict s2, size_t n) {
2022-06-06 01:30:01 +00:00
const byte *restrict c2 = s2;
byte *restrict c1 = s1;
while (n--) {
*c1++ = *c2++;
}
return s1;
}
2022-06-07 09:26:13 +00:00
void *memmove(void *s1, const void *s2, size_t n) {
2022-06-08 02:42:08 +00:00
byte* c1 = s1;
const byte* c2 = s2;
2022-08-05 04:00:54 +00:00
// Note(bumbread): shouldn't this be backwards?
2022-06-08 02:42:08 +00:00
if (c1 != c2) {
if (c1 < c2) {
// reverse copy
for (size_t i = n; i--;) c1[i] = c2[i];
} else {
// normal copy
for (size_t i = 0; i < n; i++) c1[i] = c2[i];
}
}
2022-06-06 01:30:01 +00:00
return s1;
2022-06-02 13:08:59 +00:00
}
2022-06-07 09:26:13 +00:00
char *strcpy(char *restrict s1, const char *restrict s2) {
2022-06-06 01:30:01 +00:00
while(*s2 != 0) {
*s1++ = *s2++;
}
*s1 = 0;
return s1;
}
2022-06-07 09:26:13 +00:00
char *strncpy(char *restrict s1, const char *restrict s2, size_t n) {
size_t i = 0;
for(; i < n && *s2 != 0; ++ i) {
2022-06-06 01:30:01 +00:00
*s1++ = *s2++;
}
2022-06-07 09:26:13 +00:00
for(; i < n; ++i) {
2022-06-06 01:30:01 +00:00
*s1++ = 0;
}
return s1;
}
2022-06-07 09:26:13 +00:00
char *strcat(char *restrict s1, const char *restrict s2) {
2022-06-06 01:38:36 +00:00
size_t start = strlen(s1);
2022-06-07 09:26:13 +00:00
return strcpy(s1+start, s2);
}
char *strncat(char *restrict s1, const char *restrict s2, size_t n) {
size_t start = strlen(s1);
strncpy(s1+start, s2, n);
2022-06-06 01:30:01 +00:00
return s1;
}
2022-06-06 01:30:01 +00:00
int memcmp(const void *s1, const void *s2, size_t n) {
const byte *u1 = s1;
const byte *u2 = s2;
for (; n--; u1++, u2++) {
if (*u1 != *u2) return *u1 - *u2;
}
return 0;
}
2022-06-07 09:26:13 +00:00
void *memset(void *s, int c, size_t n) {
byte *restrict buf = s;
while (n--) {
*buf++ = c;
}
return s;
}
2022-06-06 01:30:01 +00:00
int strcmp(const char *s1, const char *s2) {
int diff;
do {
diff = *s1 - *s2;
2022-06-19 05:24:36 +00:00
} while(diff == 0 && *s1++ != 0 && *s2++ != 0);
2022-06-06 01:30:01 +00:00
return diff;
}
2022-06-07 09:26:13 +00:00
int strncmp(const char *s1, const char *s2, size_t n) {
int diff = 0;
2022-06-06 01:38:36 +00:00
size_t i = 0;
2022-06-06 01:30:01 +00:00
if(n != 0) do {
diff = *s1 - *s2;
} while(++i < n && diff != 0 && *s1 != 0 && *s2 != 0);
return diff;
}
2022-06-07 09:26:13 +00:00
int strcoll(const char *s1, const char *s2) {
2022-06-06 01:30:01 +00:00
return strcmp(s1, s2);
}
2022-06-07 09:26:13 +00:00
// TODO: I don't quite understand the intent nor use behind this function
// so I'm just going to ignore locales for now.
size_t strxfrm(char *restrict s1, const char *restrict s2, size_t n) {
2022-06-06 01:30:01 +00:00
size_t len = strlen(s2);
if(s1 != NULL && n != 0) {
2022-06-06 01:38:36 +00:00
for(size_t i = 0; i != n; ++i) {
2022-06-06 01:30:01 +00:00
*s1 = *s2;
}
}
return len;
}
2022-06-07 09:26:13 +00:00
void *memchr(const void *ptr, int c, size_t n) {
const char *s = ptr;
for(size_t i = 0; i != n; ++i) {
if(s[i] == c) {
// Casting away const because clang warnings
return (void *)(s+i);
}
2022-06-06 01:30:01 +00:00
}
2022-06-07 09:26:13 +00:00
return NULL;
}
char *strchr(const char *s, int c) {
do {
if(*s == c) return (char *)s;
} while(*s++);
return NULL;
2022-06-06 01:30:01 +00:00
}
2022-06-07 09:26:13 +00:00
size_t strspn(const char *s1, const char *s2) {
size_t i = 0;
for(; *s1; ++s1) {
if(strchr(s2, *s1) == NULL) {
break;
}
++i;
}
return i;
2022-06-06 01:30:01 +00:00
}
2022-06-07 09:26:13 +00:00
size_t strcspn(const char *s1, const char *s2) {
2022-06-06 01:30:01 +00:00
size_t i = 0;
2022-06-07 09:26:13 +00:00
for(; *s1; ++s1) {
2022-06-06 01:30:01 +00:00
if(strchr(s2, *s1) != NULL) {
break;
}
++i;
}
return i;
}
2022-06-07 09:26:13 +00:00
char *strpbrk(const char *s1, const char *s2) {
2022-06-06 01:30:01 +00:00
while(*s1) {
if(strchr(s2, *s1) == NULL) {
break;
}
++s1;
}
return (char *)s1;
}
2022-06-07 09:26:13 +00:00
char *strrchr(const char *s, int c) {
char const *last = NULL;
for(; *s != 0; ++s) {
if(*s == c) last = s;
}
return (char *)last;
}
char *strstr(const char *s1, const char *s2) {
if(*s2 == 0) return (char *)s1;
2022-06-06 01:30:01 +00:00
size_t len = strlen(s2);
2022-06-07 09:26:13 +00:00
for(; *s1 != 0; ++s1) {
if(strncmp(s1, s2, len) == 0) return (char *)s1;
2022-06-06 01:30:01 +00:00
}
return NULL;
}
2022-06-07 09:26:13 +00:00
// TODO: there may be restrict-related UB
char *strtok(char *restrict s1, const char *restrict s2) {
static char *str;
return strtok_r(s1, s2, &str);
}
char *strtok_r(char *restrict s1, const char *restrict s2, char **restrict ctx) {
if(s1 != NULL) *ctx = s1;
if(*ctx == NULL) return NULL;
2022-06-07 09:26:13 +00:00
size_t junk_len = strspn(*ctx, s2);
char *tok_start = *ctx + junk_len;
2022-06-07 09:26:13 +00:00
if(*tok_start == 0) {
*ctx = NULL;
2022-06-07 09:26:13 +00:00
return NULL;
}
size_t tok_len = strcspn(*ctx, s2);
2022-06-07 09:26:13 +00:00
char *tok_end = tok_start + tok_len;
*tok_end = 0;
*ctx = tok_end+1;
2022-06-07 09:26:13 +00:00
return tok_start;
}
char *strerror(int errnum) {
2022-06-06 01:30:01 +00:00
switch(errnum) {
case 0: return "No errors";
case EDOM: return "Value is out of domain of the function";
case EILSEQ: return "Illegal byte sequence";
case ERANGE: return "Value is out of range";
}
return "Unkown error";
}
size_t strlen(const char *s) {
size_t i = 0;
while (s[i]) {
i++;
}
return i;
}
size_t strnlen_s(const char *s, size_t maxsize) {
2022-06-06 00:16:44 +00:00
if (s == NULL) return 0;
size_t i = 0;
while (s[i] && i < maxsize) {
i++;
}
return i;
}
2022-06-24 01:45:55 +00:00
char *strdup(const char *str1) {
2022-06-24 03:54:51 +00:00
if(str1 == NULL) return NULL;
2022-06-24 01:45:55 +00:00
size_t len = strlen(str1);
char *copy = calloc(len+1, 1);
strcpy(copy, str1);
return copy;
}