195 lines
3.2 KiB
C
195 lines
3.2 KiB
C
#ifndef STRING_H
|
|
#define STRING_H
|
|
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
|
|
#if !defined(__ROMCC__)
|
|
#include <console/vtxprintf.h>
|
|
#endif
|
|
|
|
/* Stringify a token */
|
|
#ifndef STRINGIFY
|
|
#define _STRINGIFY(x) #x
|
|
#define STRINGIFY(x) _STRINGIFY(x)
|
|
#endif
|
|
|
|
void *memcpy(void *dest, const void *src, size_t n);
|
|
void *memmove(void *dest, const void *src, size_t n);
|
|
void *memset(void *s, int c, size_t n);
|
|
int memcmp(const void *s1, const void *s2, size_t n);
|
|
void *memchr(const void *s, int c, size_t n);
|
|
#if !defined(__ROMCC__)
|
|
int snprintf(char *buf, size_t size, const char *fmt, ...);
|
|
int vsnprintf(char *buf, size_t size, const char *fmt, va_list args);
|
|
#endif
|
|
|
|
// simple string functions
|
|
|
|
static inline size_t strnlen(const char *src, size_t max)
|
|
{
|
|
size_t i = 0;
|
|
while ((*src++) && (i < max))
|
|
i++;
|
|
return i;
|
|
}
|
|
|
|
static inline size_t strlen(const char *src)
|
|
{
|
|
size_t i = 0;
|
|
while (*src++)
|
|
i++;
|
|
return i;
|
|
}
|
|
|
|
static inline char *strchr(const char *s, int c)
|
|
{
|
|
for (; *s; s++) {
|
|
if (*s == c)
|
|
return (char *) s;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
#if !defined(__PRE_RAM__)
|
|
static inline char *strdup(const char *s)
|
|
{
|
|
size_t sz = strlen(s) + 1;
|
|
char *d = malloc(sz);
|
|
memcpy(d, s, sz);
|
|
return d;
|
|
}
|
|
|
|
static inline char *strconcat(const char *s1, const char *s2)
|
|
{
|
|
size_t sz_1 = strlen(s1);
|
|
size_t sz_2 = strlen(s2);
|
|
char *d = malloc(sz_1 + sz_2 + 1);
|
|
memcpy(d, s1, sz_1);
|
|
memcpy(d + sz_1, s2, sz_2 + 1);
|
|
return d;
|
|
}
|
|
#endif
|
|
|
|
/**
|
|
* Find a character in a string.
|
|
*
|
|
* @param s The string.
|
|
* @param c The character.
|
|
* @return A pointer to the last occurrence of the character in the
|
|
* string, or NULL if the character was not encountered within the string.
|
|
*/
|
|
static inline char *strrchr(const char *s, int c)
|
|
{
|
|
char *p = (char *)s + strlen(s);
|
|
|
|
for (; p >= s; p--) {
|
|
if (*p == c)
|
|
return p;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
static inline char *strncpy(char *to, const char *from, int count)
|
|
{
|
|
register char *ret = to;
|
|
register char data;
|
|
|
|
while (count > 0) {
|
|
count--;
|
|
data = *from++;
|
|
*to++ = data;
|
|
if (data == '\0')
|
|
break;
|
|
}
|
|
|
|
while (count > 0) {
|
|
count--;
|
|
*to++ = '\0';
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
static inline char *strcpy(char *dst, const char *src)
|
|
{
|
|
char *ptr = dst;
|
|
|
|
while (*src)
|
|
*dst++ = *src++;
|
|
*dst = '\0';
|
|
|
|
return ptr;
|
|
}
|
|
|
|
static inline int strcmp(const char *s1, const char *s2)
|
|
{
|
|
int r;
|
|
|
|
while ((r = (*s1 - *s2)) == 0 && *s1) {
|
|
s1++;
|
|
s2++;
|
|
}
|
|
return r;
|
|
}
|
|
|
|
static inline int strncmp(const char *s1, const char *s2, int maxlen)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < maxlen; i++) {
|
|
if ((s1[i] != s2[i]) || (s1[i] == '\0'))
|
|
return s1[i] - s2[i];
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static inline int isspace(int c)
|
|
{
|
|
switch (c) {
|
|
case ' ': case '\f': case '\n':
|
|
case '\r': case '\t': case '\v':
|
|
return 1;
|
|
default:
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static inline int isdigit(int c)
|
|
{
|
|
return (c >= '0' && c <= '9');
|
|
}
|
|
|
|
static inline int isxdigit(int c)
|
|
{
|
|
return ((c >= '0' && c <= '9') ||
|
|
(c >= 'a' && c <= 'f') ||
|
|
(c >= 'A' && c <= 'F'));
|
|
}
|
|
|
|
static inline int isupper(int c)
|
|
{
|
|
return (c >= 'A' && c <= 'Z');
|
|
}
|
|
|
|
static inline int islower(int c)
|
|
{
|
|
return (c >= 'a' && c <= 'z');
|
|
}
|
|
|
|
static inline int toupper(int c)
|
|
{
|
|
if (islower(c))
|
|
c -= 'a'-'A';
|
|
return c;
|
|
}
|
|
|
|
static inline int tolower(int c)
|
|
{
|
|
if (isupper(c))
|
|
c -= 'A'-'a';
|
|
return c;
|
|
}
|
|
#endif /* STRING_H */
|