string.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2021-2022, Brian Gianforcaro <bgianf@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/Format.h>
  8. #include <AK/MemMem.h>
  9. #include <AK/Memory.h>
  10. #include <AK/Platform.h>
  11. #include <AK/StdLibExtras.h>
  12. #include <AK/Types.h>
  13. #include <assert.h>
  14. #include <ctype.h>
  15. #include <errno.h>
  16. #include <signal.h>
  17. #include <stdio.h>
  18. #include <stdlib.h>
  19. #include <string.h>
  20. extern "C" {
  21. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strspn.html
  22. size_t strspn(char const* s, char const* accept)
  23. {
  24. char const* p = s;
  25. cont:
  26. char ch = *p++;
  27. char ac;
  28. for (char const* ap = accept; (ac = *ap++) != '\0';) {
  29. if (ac == ch)
  30. goto cont;
  31. }
  32. return p - 1 - s;
  33. }
  34. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strcspn.html
  35. size_t strcspn(char const* s, char const* reject)
  36. {
  37. for (auto* p = s;;) {
  38. char c = *p++;
  39. auto* rp = reject;
  40. char rc;
  41. do {
  42. if ((rc = *rp++) == c)
  43. return p - 1 - s;
  44. } while (rc);
  45. }
  46. }
  47. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strlen.html
  48. size_t strlen(char const* str)
  49. {
  50. size_t len = 0;
  51. while (*(str++))
  52. ++len;
  53. return len;
  54. }
  55. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strnlen.html
  56. size_t strnlen(char const* str, size_t maxlen)
  57. {
  58. size_t len = 0;
  59. for (; len < maxlen && *str; str++)
  60. len++;
  61. return len;
  62. }
  63. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strdup.html
  64. char* strdup(char const* str)
  65. {
  66. size_t len = strlen(str);
  67. char* new_str = (char*)malloc(len + 1);
  68. memcpy(new_str, str, len);
  69. new_str[len] = '\0';
  70. return new_str;
  71. }
  72. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strndup.html
  73. char* strndup(char const* str, size_t maxlen)
  74. {
  75. size_t len = strnlen(str, maxlen);
  76. char* new_str = (char*)malloc(len + 1);
  77. memcpy(new_str, str, len);
  78. new_str[len] = 0;
  79. return new_str;
  80. }
  81. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strcmp.html
  82. int strcmp(char const* s1, char const* s2)
  83. {
  84. while (*s1 == *s2++)
  85. if (*s1++ == 0)
  86. return 0;
  87. return *(unsigned char const*)s1 - *(unsigned char const*)--s2;
  88. }
  89. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strncmp.html
  90. int strncmp(char const* s1, char const* s2, size_t n)
  91. {
  92. if (!n)
  93. return 0;
  94. do {
  95. if (*s1 != *s2++)
  96. return *(unsigned char const*)s1 - *(unsigned char const*)--s2;
  97. if (*s1++ == 0)
  98. break;
  99. } while (--n);
  100. return 0;
  101. }
  102. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/memcmp.html
  103. int memcmp(void const* v1, void const* v2, size_t n)
  104. {
  105. auto* s1 = (uint8_t const*)v1;
  106. auto* s2 = (uint8_t const*)v2;
  107. while (n-- > 0) {
  108. if (*s1++ != *s2++)
  109. return s1[-1] < s2[-1] ? -1 : 1;
  110. }
  111. return 0;
  112. }
  113. int timingsafe_memcmp(void const* b1, void const* b2, size_t len)
  114. {
  115. return AK::timing_safe_compare(b1, b2, len) ? 1 : 0;
  116. }
  117. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/memcpy.html
  118. void* memcpy(void* dest_ptr, void const* src_ptr, size_t n)
  119. {
  120. #if ARCH(X86_64)
  121. void* original_dest = dest_ptr;
  122. asm volatile(
  123. "rep movsb"
  124. : "+D"(dest_ptr), "+S"(src_ptr), "+c"(n)::"memory");
  125. return original_dest;
  126. #else
  127. u8* pd = (u8*)dest_ptr;
  128. u8 const* ps = (u8 const*)src_ptr;
  129. for (; n--;)
  130. *pd++ = *ps++;
  131. return dest_ptr;
  132. #endif
  133. }
  134. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/memset.html
  135. // For x86-64, an optimized ASM implementation is found in ./arch/x86_64/memset.S
  136. #if ARCH(X86_64)
  137. #else
  138. void* memset(void* dest_ptr, int c, size_t n)
  139. {
  140. u8* pd = (u8*)dest_ptr;
  141. for (; n--;)
  142. *pd++ = c;
  143. return dest_ptr;
  144. }
  145. #endif
  146. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/memmove.html
  147. void* memmove(void* dest, void const* src, size_t n)
  148. {
  149. if (((FlatPtr)dest - (FlatPtr)src) >= n)
  150. return memcpy(dest, src, n);
  151. u8* pd = (u8*)dest;
  152. u8 const* ps = (u8 const*)src;
  153. for (pd += n, ps += n; n--;)
  154. *--pd = *--ps;
  155. return dest;
  156. }
  157. void const* memmem(void const* haystack, size_t haystack_length, void const* needle, size_t needle_length)
  158. {
  159. return AK::memmem(haystack, haystack_length, needle, needle_length);
  160. }
  161. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strcpy.html
  162. char* strcpy(char* dest, char const* src)
  163. {
  164. char* original_dest = dest;
  165. while ((*dest++ = *src++) != '\0')
  166. ;
  167. return original_dest;
  168. }
  169. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strncpy.html
  170. char* strncpy(char* dest, char const* src, size_t n)
  171. {
  172. size_t i;
  173. for (i = 0; i < n && src[i] != '\0'; ++i)
  174. dest[i] = src[i];
  175. for (; i < n; ++i)
  176. dest[i] = '\0';
  177. return dest;
  178. }
  179. size_t strlcpy(char* dest, char const* src, size_t n)
  180. {
  181. size_t i;
  182. // Would like to test i < n - 1 here, but n might be 0.
  183. for (i = 0; i + 1 < n && src[i] != '\0'; ++i)
  184. dest[i] = src[i];
  185. if (n)
  186. dest[i] = '\0';
  187. for (; src[i] != '\0'; ++i)
  188. ; // Determine the length of src, don't copy.
  189. return i;
  190. }
  191. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strchr.html
  192. char* strchr(char const* str, int c)
  193. {
  194. char ch = c;
  195. for (;; ++str) {
  196. if (*str == ch)
  197. return const_cast<char*>(str);
  198. if (!*str)
  199. return nullptr;
  200. }
  201. }
  202. // https://pubs.opengroup.org/onlinepubs/9699959399/functions/index.html
  203. char* index(char const* str, int c)
  204. {
  205. return strchr(str, c);
  206. }
  207. char* strchrnul(char const* str, int c)
  208. {
  209. char ch = c;
  210. for (;; ++str) {
  211. if (*str == ch || !*str)
  212. return const_cast<char*>(str);
  213. }
  214. }
  215. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/memchr.html
  216. void* memchr(void const* ptr, int c, size_t size)
  217. {
  218. char ch = c;
  219. auto* cptr = (char const*)ptr;
  220. for (size_t i = 0; i < size; ++i) {
  221. if (cptr[i] == ch)
  222. return const_cast<char*>(cptr + i);
  223. }
  224. return nullptr;
  225. }
  226. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strrchr.html
  227. char* strrchr(char const* str, int ch)
  228. {
  229. char* last = nullptr;
  230. char c;
  231. for (; (c = *str); ++str) {
  232. if (c == ch)
  233. last = const_cast<char*>(str);
  234. }
  235. return last;
  236. }
  237. // https://pubs.opengroup.org/onlinepubs/9699959399/functions/rindex.html
  238. char* rindex(char const* str, int ch)
  239. {
  240. return strrchr(str, ch);
  241. }
  242. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strcat.html
  243. char* strcat(char* dest, char const* src)
  244. {
  245. size_t dest_length = strlen(dest);
  246. size_t i;
  247. for (i = 0; src[i] != '\0'; i++)
  248. dest[dest_length + i] = src[i];
  249. dest[dest_length + i] = '\0';
  250. return dest;
  251. }
  252. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strncat.html
  253. char* strncat(char* dest, char const* src, size_t n)
  254. {
  255. size_t dest_length = strlen(dest);
  256. size_t i;
  257. for (i = 0; i < n && src[i] != '\0'; i++)
  258. dest[dest_length + i] = src[i];
  259. dest[dest_length + i] = '\0';
  260. return dest;
  261. }
  262. char const* const sys_errlist[] = {
  263. #define __ENUMERATE_ERRNO_CODE(c, s) s,
  264. ENUMERATE_ERRNO_CODES(__ENUMERATE_ERRNO_CODE)
  265. #undef __ENUMERATE_ERRNO_CODE
  266. };
  267. static_assert(array_size(sys_errlist) == (EMAXERRNO + 1));
  268. int sys_nerr = EMAXERRNO;
  269. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strerror_r.html
  270. int strerror_r(int errnum, char* buf, size_t buflen)
  271. {
  272. auto saved_errno = errno;
  273. if (errnum < 0 || errnum >= EMAXERRNO) {
  274. auto rc = strlcpy(buf, "unknown error", buflen);
  275. if (rc >= buflen)
  276. dbgln("strerror_r(): Invalid error number '{}' specified and the output buffer is too small.", errnum);
  277. errno = saved_errno;
  278. return EINVAL;
  279. }
  280. auto text = strerror(errnum);
  281. auto rc = strlcpy(buf, text, buflen);
  282. if (rc >= buflen) {
  283. errno = saved_errno;
  284. return ERANGE;
  285. }
  286. errno = saved_errno;
  287. return 0;
  288. }
  289. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strerror.html
  290. char* strerror(int errnum)
  291. {
  292. if (errnum < 0 || errnum >= EMAXERRNO) {
  293. return const_cast<char*>("Unknown error");
  294. }
  295. return const_cast<char*>(sys_errlist[errnum]);
  296. }
  297. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strsignal.html
  298. char* strsignal(int signum)
  299. {
  300. if (signum >= NSIG) {
  301. dbgln("strsignal() missing string for signum={}", signum);
  302. return const_cast<char*>("Unknown signal");
  303. }
  304. return const_cast<char*>(sys_siglist[signum]);
  305. }
  306. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strstr.html
  307. char* strstr(char const* haystack, char const* needle)
  308. {
  309. char nch;
  310. char hch;
  311. if ((nch = *needle++) != 0) {
  312. size_t len = strlen(needle);
  313. do {
  314. do {
  315. if ((hch = *haystack++) == 0)
  316. return nullptr;
  317. } while (hch != nch);
  318. } while (strncmp(haystack, needle, len) != 0);
  319. --haystack;
  320. }
  321. return const_cast<char*>(haystack);
  322. }
  323. // https://linux.die.net/man/3/strcasestr
  324. char* strcasestr(char const* haystack, char const* needle)
  325. {
  326. char nch;
  327. char hch;
  328. if ((nch = *needle++) != 0) {
  329. size_t len = strlen(needle);
  330. do {
  331. do {
  332. if ((hch = *haystack++) == 0)
  333. return nullptr;
  334. } while (toupper(hch) != toupper(nch));
  335. } while (strncasecmp(haystack, needle, len) != 0);
  336. --haystack;
  337. }
  338. return const_cast<char*>(haystack);
  339. }
  340. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html
  341. char* strpbrk(char const* s, char const* accept)
  342. {
  343. while (*s)
  344. if (strchr(accept, *s++))
  345. return const_cast<char*>(--s);
  346. return nullptr;
  347. }
  348. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html
  349. char* strtok_r(char* str, char const* delim, char** saved_str)
  350. {
  351. if (!str) {
  352. if (!saved_str || *saved_str == nullptr)
  353. return nullptr;
  354. str = *saved_str;
  355. }
  356. size_t token_start = 0;
  357. size_t token_end = 0;
  358. size_t str_len = strlen(str);
  359. size_t delim_len = strlen(delim);
  360. for (size_t i = 0; i < str_len; ++i) {
  361. bool is_proper_delim = false;
  362. for (size_t j = 0; j < delim_len; ++j) {
  363. if (str[i] == delim[j]) {
  364. // Skip beginning delimiters
  365. if (token_end - token_start == 0) {
  366. ++token_start;
  367. break;
  368. }
  369. is_proper_delim = true;
  370. }
  371. }
  372. ++token_end;
  373. if (is_proper_delim && token_end > 0) {
  374. --token_end;
  375. break;
  376. }
  377. }
  378. if (str[token_start] == '\0') {
  379. *saved_str = nullptr;
  380. return nullptr;
  381. }
  382. if (token_end == 0) {
  383. *saved_str = nullptr;
  384. return &str[token_start];
  385. }
  386. if (str[token_end] == '\0')
  387. *saved_str = &str[token_end];
  388. else
  389. *saved_str = &str[token_end + 1];
  390. str[token_end] = '\0';
  391. return &str[token_start];
  392. }
  393. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strtok.html
  394. char* strtok(char* str, char const* delim)
  395. {
  396. static char* saved_str;
  397. return strtok_r(str, delim, &saved_str);
  398. }
  399. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strcoll.html
  400. int strcoll(char const* s1, char const* s2)
  401. {
  402. return strcmp(s1, s2);
  403. }
  404. // https://pubs.opengroup.org/onlinepubs/9699919799/functions/strxfrm.html
  405. size_t strxfrm(char* dest, char const* src, size_t n)
  406. {
  407. size_t i;
  408. for (i = 0; i < n && src[i] != '\0'; ++i)
  409. dest[i] = src[i];
  410. for (; i < n; ++i)
  411. dest[i] = '\0';
  412. return i;
  413. }
  414. // Not in POSIX, originated in BSD but also supported on Linux.
  415. // https://man.openbsd.org/strsep.3
  416. char* strsep(char** str, char const* delim)
  417. {
  418. if (*str == nullptr)
  419. return nullptr;
  420. auto* begin = *str;
  421. auto* end = begin + strcspn(begin, delim);
  422. if (*end) {
  423. *end = '\0';
  424. *str = ++end;
  425. } else {
  426. *str = nullptr;
  427. }
  428. return begin;
  429. }
  430. void explicit_bzero(void* ptr, size_t size)
  431. {
  432. secure_zero(ptr, size);
  433. }
  434. }