| 1 |
// SPDX-License-Identifier: BSD-2-Clause-Patent |
| 2 |
/* |
| 3 |
* string.c - implementations we need for string finctions |
| 4 |
*/ |
| 5 |
#define SHIM_STRING_C_ |
| 6 |
#include "shim.h" |
| 7 |
|
| 8 |
#ifdef SHIM_UNIT_TEST |
| 9 |
#define strlen shim_strlen |
| 10 |
#ifdef strcmp |
| 11 |
#undef strcmp |
| 12 |
#endif |
| 13 |
#define strcmp shim_strcmp |
| 14 |
#ifdef strncmp |
| 15 |
#undef strncmp |
| 16 |
#endif |
| 17 |
#define strncmp shim_strncmp |
| 18 |
#define strncasecmp shim_strncasecmp |
| 19 |
#define strcasecmp shim_strcasecmp |
| 20 |
#define strrchr shim_strrchr |
| 21 |
#define strlen shim_strlen |
| 22 |
#define strnlen shim_strnlen |
| 23 |
#define strcpy shim_strcpy |
| 24 |
#ifdef strncpy |
| 25 |
#undef strncpy |
| 26 |
#endif |
| 27 |
#define strncpy shim_strncpy |
| 28 |
#ifdef strdup |
| 29 |
#undef strdup |
| 30 |
#endif |
| 31 |
#define strdup shim_strdup |
| 32 |
#ifdef strndup |
| 33 |
#undef strndup |
| 34 |
#endif |
| 35 |
#define strndup shim_strndup |
| 36 |
#ifdef stpcpy |
| 37 |
#undef stpcpy |
| 38 |
#endif |
| 39 |
#define stpcpy shim_stpcpy |
| 40 |
#define strchrnul shim_strchrnul |
| 41 |
#ifdef strchr |
| 42 |
#undef strchr |
| 43 |
#endif |
| 44 |
#define strchr shim_strchr |
| 45 |
#endif |
| 46 |
|
| 47 |
size_t |
| 48 |
strlen(const char *s1) |
| 49 |
{ |
| 50 |
size_t len; |
| 51 |
|
| 52 |
for (len = 0; *s1; s1 += 1, len += 1) |
| 53 |
; |
| 54 |
return len; |
| 55 |
} |
| 56 |
|
| 57 |
int |
| 58 |
strcmp(const char *s1p, const char *s2p) |
| 59 |
{ |
| 60 |
const uint8_t *s1 = (const uint8_t *)s1p; |
| 61 |
const uint8_t *s2 = (const uint8_t *)s2p; |
| 62 |
|
| 63 |
while (*s1) { |
| 64 |
if (*s1 != *s2) { |
| 65 |
break; |
| 66 |
} |
| 67 |
|
| 68 |
s1 += 1; |
| 69 |
s2 += 1; |
| 70 |
} |
| 71 |
|
| 72 |
return *s1 - *s2; |
| 73 |
} |
| 74 |
|
| 75 |
int |
| 76 |
strncmp(const char *s1p, const char *s2p, size_t len) |
| 77 |
{ |
| 78 |
const uint8_t *s1 = (const uint8_t *)s1p; |
| 79 |
const uint8_t *s2 = (const uint8_t *)s2p; |
| 80 |
|
| 81 |
while (*s1 && len) { |
| 82 |
if (*s1 != *s2) { |
| 83 |
break; |
| 84 |
} |
| 85 |
|
| 86 |
s1 += 1; |
| 87 |
s2 += 1; |
| 88 |
len -= 1; |
| 89 |
} |
| 90 |
|
| 91 |
return len ? *s1 - *s2 : 0; |
| 92 |
} |
| 93 |
|
| 94 |
/* Based on AsciiStriCmp() in edk2 MdePkg/Library/BaseLib/String.c */ |
| 95 |
int |
| 96 |
strncasecmp(const char *s1p, const char *s2p, size_t n) |
| 97 |
{ |
| 98 |
const uint8_t *s1 = (const uint8_t *)s1p; |
| 99 |
const uint8_t *s2 = (const uint8_t *)s2p; |
| 100 |
|
| 101 |
while (*s1 && n) { |
| 102 |
if (toupper(*s1) != toupper(*s2)) { |
| 103 |
break; |
| 104 |
} |
| 105 |
|
| 106 |
s1 += 1; |
| 107 |
s2 += 1; |
| 108 |
n -= 1; |
| 109 |
} |
| 110 |
|
| 111 |
return n ? *s1 - *s2 : 0; |
| 112 |
} |
| 113 |
|
| 114 |
/* Based on AsciiStriCmp() in edk2 MdePkg/Library/BaseLib/String.c */ |
| 115 |
int |
| 116 |
strcasecmp(const char *str1, const char *str2) |
| 117 |
{ |
| 118 |
uint8_t c1, c2; |
| 119 |
|
| 120 |
c1 = toupper(*str1); |
| 121 |
c2 = toupper(*str2); |
| 122 |
while ((*str1 != '\0') && (c1 == c2)) { |
| 123 |
str1++; |
| 124 |
str2++; |
| 125 |
c1 = toupper(*str1); |
| 126 |
c2 = toupper(*str2); |
| 127 |
} |
| 128 |
|
| 129 |
return c1 - c2; |
| 130 |
} |
| 131 |
|
| 132 |
/* Scan a string for the last occurrence of a character */ |
| 133 |
char * |
| 134 |
strrchr(const char *str, int c) |
| 135 |
{ |
| 136 |
char *save; |
| 137 |
|
| 138 |
for (save = NULL;; ++str) { |
| 139 |
if (*str == c) { |
| 140 |
save = (char *)str; |
| 141 |
} |
| 142 |
if (*str == 0) { |
| 143 |
return (save); |
| 144 |
} |
| 145 |
} |
| 146 |
} |
| 147 |
|
| 148 |
NONNULL(1) |
| 149 |
size_t |
| 150 |
strnlen(const char *s, size_t n) |
| 151 |
{ |
| 152 |
size_t i; |
| 153 |
for (i = 0; i < n; i++) |
| 154 |
if (s[i] == '\0') |
| 155 |
break; |
| 156 |
return i; |
| 157 |
} |
| 158 |
|
| 159 |
RETURNS_NONNULL NONNULL(1, 2) |
| 160 |
char * |
| 161 |
strcpy(char *dest, const char *src) |
| 162 |
{ |
| 163 |
size_t i; |
| 164 |
|
| 165 |
for (i = 0; src[i] != '\0'; i++) |
| 166 |
dest[i] = src[i]; |
| 167 |
|
| 168 |
dest[i] = '\0'; |
| 169 |
return dest; |
| 170 |
} |
| 171 |
|
| 172 |
RETURNS_NONNULL NONNULL(1, 2) |
| 173 |
char * |
| 174 |
strncpy(char *dest, const char *src, size_t n) |
| 175 |
{ |
| 176 |
size_t i; |
| 177 |
|
| 178 |
for (i = 0; i < n && src[i] != '\0'; i++) |
| 179 |
dest[i] = src[i]; |
| 180 |
if (i < n) |
| 181 |
dest[i] = '\0'; |
| 182 |
|
| 183 |
return dest; |
| 184 |
} |
| 185 |
|
| 186 |
RETURNS_NONNULL NONNULL(1, 2) |
| 187 |
char * |
| 188 |
strcat(char *dest, const char *src) |
| 189 |
{ |
| 190 |
size_t dest_len = strlen(dest); |
| 191 |
size_t i; |
| 192 |
|
| 193 |
for (i = 0; src[i] != '\0'; i++) |
| 194 |
dest[dest_len + i] = src[i]; |
| 195 |
dest[dest_len + i] = '\0'; |
| 196 |
|
| 197 |
return dest; |
| 198 |
} |
| 199 |
|
| 200 |
NONNULL(1) |
| 201 |
char * |
| 202 |
strdup(const char *const src) |
| 203 |
{ |
| 204 |
size_t len; |
| 205 |
char *news = NULL; |
| 206 |
|
| 207 |
len = strlen(src); |
| 208 |
news = AllocateZeroPool(len + 1); |
| 209 |
if (news) |
| 210 |
strncpy(news, src, len); |
| 211 |
return news; |
| 212 |
} |
| 213 |
|
| 214 |
NONNULL(1) |
| 215 |
char * |
| 216 |
strndup(const char *const src, const size_t srcmax) |
| 217 |
{ |
| 218 |
size_t len; |
| 219 |
char *news = NULL; |
| 220 |
|
| 221 |
len = strnlen(src, srcmax); |
| 222 |
news = AllocateZeroPool(len + 1); |
| 223 |
if (news) |
| 224 |
strncpy(news, src, len); |
| 225 |
return news; |
| 226 |
} |
| 227 |
|
| 228 |
RETURNS_NONNULL NONNULL(1, 2) |
| 229 |
char * |
| 230 |
stpcpy(char *dest, const char *const src) |
| 231 |
{ |
| 232 |
size_t i = 0; |
| 233 |
for (i = 0; src[i]; i++) |
| 234 |
dest[i] = src[i]; |
| 235 |
dest[i] = '\000'; |
| 236 |
return &dest[i]; |
| 237 |
} |
| 238 |
|
| 239 |
RETURNS_NONNULL NONNULL(1) |
| 240 |
char * |
| 241 |
strchrnul(const char *s, int c) |
| 242 |
{ |
| 243 |
unsigned int i; |
| 244 |
|
| 245 |
for (i = 0; s[i] != '\000' && s[i] != c; i++) |
| 246 |
; |
| 247 |
|
| 248 |
return (char *)&s[i]; |
| 249 |
} |
| 250 |
|
| 251 |
NONNULL(1) |
| 252 |
char * |
| 253 |
strchr(const char *s, int c) |
| 254 |
{ |
| 255 |
const char *s1; |
| 256 |
|
| 257 |
s1 = strchrnul(s, c); |
| 258 |
if (!s1 || s1[0] == '\000') |
| 259 |
return NULL; |
| 260 |
|
| 261 |
return (char *)s1; |
| 262 |
} |
| 263 |
|
| 264 |
char * |
| 265 |
translate_slashes(char *out, const char *str) |
| 266 |
{ |
| 267 |
int i; |
| 268 |
int j; |
| 269 |
if (str == NULL || out == NULL) |
| 270 |
return NULL; |
| 271 |
|
| 272 |
for (i = 0, j = 0; str[i] != '\0'; i++, j++) { |
| 273 |
if (str[i] == '\\') { |
| 274 |
out[j] = '/'; |
| 275 |
if (str[i + 1] == '\\') |
| 276 |
i++; |
| 277 |
} else |
| 278 |
out[j] = str[i]; |
| 279 |
} |
| 280 |
out[j] = '\0'; |
| 281 |
return out; |
| 282 |
} |
| 283 |
|
| 284 |
// vim:fenc=utf-8:tw=75:noet |