acrn-hypervisor/hypervisor/lib/string.c

308 lines
5.7 KiB
C

/*
* Copyright (C) 2018 Intel Corporation.
* SPDX-License-Identifier: BSD-3-Clause
*/
#include <hypervisor.h>
static inline char hex_digit_value(char ch)
{
char c;
if (('0' <= ch) && (ch <= '9')) {
c = ch - '0';
} else if (('a' <= ch) && (ch <= 'f')) {
c = ch - 'a' + 10;
} else if (('A' <= ch) && (ch <= 'F')) {
c = ch - 'A' + 10;
} else {
c = -1;
}
return c;
}
/*
* Convert a string to an uint64_t integer - hexadecimal support only.
*/
uint64_t strtoul_hex(const char *nptr)
{
const char *s = nptr;
char c, digit;
uint64_t acc, cutoff, cutlim;
uint64_t base = 16UL;
int32_t any;
/*
* See strtol for comments as to the logic used.
*/
do {
c = *s;
s++;
} while (is_space(c));
if ((c == '0') && ((*s == 'x') || (*s == 'X'))) {
c = s[1];
s += 2;
}
cutoff = ULONG_MAX / base;
cutlim = ULONG_MAX % base;
acc = 0UL;
any = 0;
digit = hex_digit_value(c);
while (digit >= 0) {
if ((acc > cutoff) || ((acc == cutoff) && ((uint64_t)digit > cutlim))) {
any = -1;
break;
} else {
acc *= base;
acc += (uint64_t)digit;
}
c = *s;
s++;
digit = hex_digit_value(c);
}
if (any < 0) {
acc = ULONG_MAX;
}
return acc;
}
char *strchr(char *s_arg, char ch)
{
char *s = s_arg;
while ((*s != '\0') && (*s != ch)) {
++s;
}
return ((*s) != '\0') ? s : NULL;
}
/*
* strncpy_s
*
* description:
* This function copies maximum 'slen'characters from string pointed
* by s to a buffer pointed by d.
*
* input:
* d pointer to dest buffer.
*
* dmax maximum length of dest buffer.
*
* s pointer to the source string.
*
* slen the maximum number of characters to copy from source
* string.
*
* return value:
* dest pointer to dest string if source string is copied
* successfully, or else return null.
*
* notes:
* 1) both dmax and slen should not be 0.
* 2) both d and s should not be null pointers.
* 3) will assert() if overlap happens or dest buffer has no
* enough space.
*/
char *strncpy_s(char *d_arg, size_t dmax, const char *s_arg, size_t slen_arg)
{
const char *s = s_arg;
char *d = d_arg;
char *pret;
size_t dest_avail;
uint64_t overlap_guard;
size_t slen = slen_arg;
if ((d == NULL) || (s == NULL)) {
pr_err("%s: invlaid src or dest buffer", __func__);
pret = NULL;
} else {
pret = d_arg;
}
if (pret != NULL) {
if ((dmax == 0U) || (slen == 0U)) {
pr_err("%s: invlaid length of src or dest buffer", __func__);
pret = NULL;
}
}
/* if d equal to s, just return d; else execute the below code */
if ((pret != NULL) && (d != s)) {
overlap_guard = (uint64_t)((d > s) ? (d - s - 1) : (s - d - 1));
dest_avail = dmax;
while (dest_avail > 0U) {
bool complete = false;
if (overlap_guard == 0U) {
pr_err("%s: overlap happened.", __func__);
d--;
*d = '\0';
pret = NULL;
/* copy complete */
complete = true;
} else {
if (slen == 0U) {
*d = '\0';
/* copy complete */
complete = true;
} else {
*d = *s;
if (*d == '\0') {
/* copy complete */
complete = true;
} else {
d++;
s++;
slen--;
dest_avail--;
overlap_guard--;
}
}
}
if (complete) {
break;
}
}
if (dest_avail == 0U) {
pr_err("%s: dest buffer has no enough space.", __func__);
/* to avoid a string that is not null-terminated in dest buffer */
pret[dmax - 1] = '\0';
}
}
return pret;
}
/**
*
* strnlen_s
*
* description:
* The function calculates the length of the string pointed
* to by str.
*
*
* input:
* str pointer to the null-terminated string to be examined.
*
* dmax maximum number of characer to examine.
*
* return value:
* string length, excluding the null character.
* will return 0 if str is null.
*/
size_t strnlen_s(const char *str_arg, size_t maxlen_arg)
{
const char *str = str_arg;
size_t count = 0U;
if (str != NULL) {
size_t maxlen = maxlen_arg;
while ((*str) != '\0') {
if (maxlen == 0U) {
break;
}
count++;
maxlen--;
str++;
}
}
return count;
}
int32_t strcmp(const char *s1_arg, const char *s2_arg)
{
const char *s1 = s1_arg;
const char *s2 = s2_arg;
while (((*s1) != '\0') && ((*s2) != '\0') && ((*s1) == (*s2))) {
s1++;
s2++;
}
return *s1 - *s2;
}
int32_t strncmp(const char *s1_arg, const char *s2_arg, size_t n_arg)
{
const char *s1 = s1_arg;
const char *s2 = s2_arg;
size_t n = n_arg;
while (((n - 1) != 0U) && ((*s1) != '\0') && ((*s2) != '\0')
&& ((*s1) == (*s2))) {
s1++;
s2++;
n--;
}
return *s1 - *s2;
}
/*
* strstr_s
*
* description:
* Search str2 in str1
*
* input:
* str1 pointer to string to be searched for the substring.
*
* maxlen1 maximum length of str1.
*
* str2 pointer to the sub-string.
*
* maxlen2 maximum length of str2.
*
* return value:
* Pointer to the first occurrence of str2 in str1,
* or return null if not found.
*/
char *strstr_s(const char *str1, size_t maxlen1, const char *str2, size_t maxlen2)
{
size_t len1, len2;
size_t i;
const char *pstr, *pret;
if ((str1 == NULL) || (str2 == NULL)) {
pret = NULL;
} else if ((maxlen1 == 0U) || (maxlen2 == 0U)) {
pret = NULL;
} else {
len1 = strnlen_s(str1, maxlen1);
len2 = strnlen_s(str2, maxlen2);
if (len1 < len2) {
pret = NULL;
} else if ((str1 == str2) || (len2 == 0U)) {
/* return str1 if str2 equals to str1 or str2 points to a string with zero length*/
pret = str1;
} else {
pret = NULL;
pstr = str1;
while (len1 >= len2) {
for (i = 0U; i < len2; i++) {
if (pstr[i] != str2[i]) {
break;
}
}
if (i == len2) {
pret = pstr;
break;
}
pstr++;
len1--;
}
}
}
return (char *)pret;
}