]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - lib/string.c
Merge branch 'work.recursive_removal' of git://git.kernel.org/pub/scm/linux/kernel...
[mirror_ubuntu-jammy-kernel.git] / lib / string.c
CommitLineData
b2441318 1// SPDX-License-Identifier: GPL-2.0
1da177e4
LT
2/*
3 * linux/lib/string.c
4 *
5 * Copyright (C) 1991, 1992 Linus Torvalds
6 */
7
8/*
9 * stupid library routines.. The optimized versions should generally be found
10 * as inline code in <asm-xx/string.h>
11 *
12 * These are buggy as well..
13 *
14 * * Fri Jun 25 1999, Ingo Oeser <ioe@informatik.tu-chemnitz.de>
15 * - Added strsep() which will replace strtok() soon (because strsep() is
16 * reentrant and should be faster). Use only strsep() in new code, please.
17 *
18 * * Sat Feb 09 2002, Jason Thomas <jason@topic.com.au>,
19 * Matthew Hawkins <matt@mh.dropbear.id.au>
20 * - Kissed strtok() goodbye
21 */
22
23#include <linux/types.h>
24#include <linux/string.h>
25#include <linux/ctype.h>
8bc3bcc9
PG
26#include <linux/kernel.h>
27#include <linux/export.h>
50af5ead 28#include <linux/bug.h>
8bc3bcc9 29#include <linux/errno.h>
ce76d938 30#include <linux/slab.h>
1da177e4 31
30035e45
CM
32#include <asm/byteorder.h>
33#include <asm/word-at-a-time.h>
34#include <asm/page.h>
35
cd514e72 36#ifndef __HAVE_ARCH_STRNCASECMP
1da177e4 37/**
cd514e72 38 * strncasecmp - Case insensitive, length-limited string comparison
1da177e4
LT
39 * @s1: One string
40 * @s2: The other string
41 * @len: the maximum number of characters to compare
42 */
cd514e72 43int strncasecmp(const char *s1, const char *s2, size_t len)
1da177e4
LT
44{
45 /* Yes, Virginia, it had better be unsigned */
46 unsigned char c1, c2;
47
a11d2b64
AGR
48 if (!len)
49 return 0;
50
51 do {
52 c1 = *s1++;
53 c2 = *s2++;
54 if (!c1 || !c2)
55 break;
56 if (c1 == c2)
57 continue;
58 c1 = tolower(c1);
59 c2 = tolower(c2);
60 if (c1 != c2)
61 break;
62 } while (--len);
1da177e4
LT
63 return (int)c1 - (int)c2;
64}
cd514e72
RV
65EXPORT_SYMBOL(strncasecmp);
66#endif
1da177e4 67
ded220bd
DM
68#ifndef __HAVE_ARCH_STRCASECMP
69int strcasecmp(const char *s1, const char *s2)
70{
71 int c1, c2;
72
73 do {
74 c1 = tolower(*s1++);
75 c2 = tolower(*s2++);
76 } while (c1 == c2 && c1 != 0);
77 return c1 - c2;
78}
79EXPORT_SYMBOL(strcasecmp);
80#endif
81
1da177e4
LT
82#ifndef __HAVE_ARCH_STRCPY
83/**
84 * strcpy - Copy a %NUL terminated string
85 * @dest: Where to copy the string to
86 * @src: Where to copy the string from
87 */
0c28130b 88#undef strcpy
51a0f0f6 89char *strcpy(char *dest, const char *src)
1da177e4
LT
90{
91 char *tmp = dest;
92
93 while ((*dest++ = *src++) != '\0')
94 /* nothing */;
95 return tmp;
96}
97EXPORT_SYMBOL(strcpy);
98#endif
99
100#ifndef __HAVE_ARCH_STRNCPY
101/**
0046dd9f 102 * strncpy - Copy a length-limited, C-string
1da177e4
LT
103 * @dest: Where to copy the string to
104 * @src: Where to copy the string from
105 * @count: The maximum number of bytes to copy
106 *
107 * The result is not %NUL-terminated if the source exceeds
108 * @count bytes.
25279526 109 *
110 * In the case where the length of @src is less than that of
111 * count, the remainder of @dest will be padded with %NUL.
112 *
1da177e4 113 */
51a0f0f6 114char *strncpy(char *dest, const char *src, size_t count)
1da177e4
LT
115{
116 char *tmp = dest;
117
118 while (count) {
51a0f0f6
JJ
119 if ((*tmp = *src) != 0)
120 src++;
1da177e4
LT
121 tmp++;
122 count--;
123 }
124 return dest;
125}
126EXPORT_SYMBOL(strncpy);
127#endif
128
129#ifndef __HAVE_ARCH_STRLCPY
130/**
0046dd9f 131 * strlcpy - Copy a C-string into a sized buffer
1da177e4
LT
132 * @dest: Where to copy the string to
133 * @src: Where to copy the string from
134 * @size: size of destination buffer
135 *
0e056eb5 136 * Compatible with ``*BSD``: the result is always a valid
1da177e4
LT
137 * NUL-terminated string that fits in the buffer (unless,
138 * of course, the buffer size is zero). It does not pad
139 * out the result like strncpy() does.
140 */
141size_t strlcpy(char *dest, const char *src, size_t size)
142{
143 size_t ret = strlen(src);
144
145 if (size) {
51a0f0f6 146 size_t len = (ret >= size) ? size - 1 : ret;
1da177e4
LT
147 memcpy(dest, src, len);
148 dest[len] = '\0';
149 }
150 return ret;
151}
152EXPORT_SYMBOL(strlcpy);
153#endif
154
30035e45
CM
155#ifndef __HAVE_ARCH_STRSCPY
156/**
157 * strscpy - Copy a C-string into a sized buffer
158 * @dest: Where to copy the string to
159 * @src: Where to copy the string from
160 * @count: Size of destination buffer
161 *
458a3bf8
TH
162 * Copy the string, or as much of it as fits, into the dest buffer. The
163 * behavior is undefined if the string buffers overlap. The destination
164 * buffer is always NUL terminated, unless it's zero-sized.
30035e45
CM
165 *
166 * Preferred to strlcpy() since the API doesn't require reading memory
167 * from the src string beyond the specified "count" bytes, and since
168 * the return value is easier to error-check than strlcpy()'s.
169 * In addition, the implementation is robust to the string changing out
170 * from underneath it, unlike the current strlcpy() implementation.
171 *
172 * Preferred to strncpy() since it always returns a valid string, and
173 * doesn't unnecessarily force the tail of the destination buffer to be
458a3bf8
TH
174 * zeroed. If zeroing is desired please use strscpy_pad().
175 *
917cda27
JP
176 * Returns:
177 * * The number of characters copied (not including the trailing %NUL)
178 * * -E2BIG if count is 0 or @src was truncated.
30035e45
CM
179 */
180ssize_t strscpy(char *dest, const char *src, size_t count)
181{
182 const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
183 size_t max = count;
184 long res = 0;
185
9a156466 186 if (count == 0 || WARN_ON_ONCE(count > INT_MAX))
30035e45
CM
187 return -E2BIG;
188
189#ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
190 /*
191 * If src is unaligned, don't cross a page boundary,
192 * since we don't know if the next page is mapped.
193 */
194 if ((long)src & (sizeof(long) - 1)) {
195 size_t limit = PAGE_SIZE - ((long)src & (PAGE_SIZE - 1));
196 if (limit < max)
197 max = limit;
198 }
199#else
200 /* If src or dest is unaligned, don't do word-at-a-time. */
201 if (((long) dest | (long) src) & (sizeof(long) - 1))
202 max = 0;
203#endif
204
205 while (max >= sizeof(unsigned long)) {
206 unsigned long c, data;
207
1a3241ff 208 c = read_word_at_a_time(src+res);
30035e45
CM
209 if (has_zero(c, &data, &constants)) {
210 data = prep_zero_mask(c, data, &constants);
211 data = create_zero_mask(data);
990486c8 212 *(unsigned long *)(dest+res) = c & zero_bytemask(data);
30035e45
CM
213 return res + find_zero(data);
214 }
990486c8 215 *(unsigned long *)(dest+res) = c;
30035e45
CM
216 res += sizeof(unsigned long);
217 count -= sizeof(unsigned long);
218 max -= sizeof(unsigned long);
219 }
220
221 while (count) {
222 char c;
223
224 c = src[res];
225 dest[res] = c;
226 if (!c)
227 return res;
228 res++;
229 count--;
230 }
231
232 /* Hit buffer length without finding a NUL; force NUL-termination. */
233 if (res)
234 dest[res-1] = '\0';
235
236 return -E2BIG;
237}
238EXPORT_SYMBOL(strscpy);
239#endif
240
458a3bf8
TH
241/**
242 * strscpy_pad() - Copy a C-string into a sized buffer
243 * @dest: Where to copy the string to
244 * @src: Where to copy the string from
245 * @count: Size of destination buffer
246 *
247 * Copy the string, or as much of it as fits, into the dest buffer. The
248 * behavior is undefined if the string buffers overlap. The destination
249 * buffer is always %NUL terminated, unless it's zero-sized.
250 *
251 * If the source string is shorter than the destination buffer, zeros
252 * the tail of the destination buffer.
253 *
254 * For full explanation of why you may want to consider using the
255 * 'strscpy' functions please see the function docstring for strscpy().
256 *
917cda27
JP
257 * Returns:
258 * * The number of characters copied (not including the trailing %NUL)
259 * * -E2BIG if count is 0 or @src was truncated.
458a3bf8
TH
260 */
261ssize_t strscpy_pad(char *dest, const char *src, size_t count)
262{
263 ssize_t written;
264
265 written = strscpy(dest, src, count);
266 if (written < 0 || written == count - 1)
267 return written;
268
269 memset(dest + written + 1, 0, count - written - 1);
270
271 return written;
272}
273EXPORT_SYMBOL(strscpy_pad);
274
1da177e4
LT
275#ifndef __HAVE_ARCH_STRCAT
276/**
277 * strcat - Append one %NUL-terminated string to another
278 * @dest: The string to be appended to
279 * @src: The string to append to it
280 */
0c28130b 281#undef strcat
51a0f0f6 282char *strcat(char *dest, const char *src)
1da177e4
LT
283{
284 char *tmp = dest;
285
286 while (*dest)
287 dest++;
288 while ((*dest++ = *src++) != '\0')
289 ;
1da177e4
LT
290 return tmp;
291}
292EXPORT_SYMBOL(strcat);
293#endif
294
295#ifndef __HAVE_ARCH_STRNCAT
296/**
0046dd9f 297 * strncat - Append a length-limited, C-string to another
1da177e4
LT
298 * @dest: The string to be appended to
299 * @src: The string to append to it
300 * @count: The maximum numbers of bytes to copy
301 *
72fd4a35 302 * Note that in contrast to strncpy(), strncat() ensures the result is
1da177e4
LT
303 * terminated.
304 */
51a0f0f6 305char *strncat(char *dest, const char *src, size_t count)
1da177e4
LT
306{
307 char *tmp = dest;
308
309 if (count) {
310 while (*dest)
311 dest++;
312 while ((*dest++ = *src++) != 0) {
313 if (--count == 0) {
314 *dest = '\0';
315 break;
316 }
317 }
318 }
1da177e4
LT
319 return tmp;
320}
321EXPORT_SYMBOL(strncat);
322#endif
323
324#ifndef __HAVE_ARCH_STRLCAT
325/**
0046dd9f 326 * strlcat - Append a length-limited, C-string to another
1da177e4
LT
327 * @dest: The string to be appended to
328 * @src: The string to append to it
329 * @count: The size of the destination buffer.
330 */
331size_t strlcat(char *dest, const char *src, size_t count)
332{
333 size_t dsize = strlen(dest);
334 size_t len = strlen(src);
335 size_t res = dsize + len;
336
337 /* This would be a bug */
338 BUG_ON(dsize >= count);
339
340 dest += dsize;
341 count -= dsize;
342 if (len >= count)
343 len = count-1;
344 memcpy(dest, src, len);
345 dest[len] = 0;
346 return res;
347}
348EXPORT_SYMBOL(strlcat);
349#endif
350
351#ifndef __HAVE_ARCH_STRCMP
352/**
353 * strcmp - Compare two strings
354 * @cs: One string
355 * @ct: Another string
356 */
0c28130b 357#undef strcmp
51a0f0f6 358int strcmp(const char *cs, const char *ct)
1da177e4 359{
a414f01a 360 unsigned char c1, c2;
1da177e4
LT
361
362 while (1) {
a414f01a
LT
363 c1 = *cs++;
364 c2 = *ct++;
365 if (c1 != c2)
366 return c1 < c2 ? -1 : 1;
367 if (!c1)
1da177e4
LT
368 break;
369 }
a414f01a 370 return 0;
1da177e4
LT
371}
372EXPORT_SYMBOL(strcmp);
373#endif
374
375#ifndef __HAVE_ARCH_STRNCMP
376/**
377 * strncmp - Compare two length-limited strings
378 * @cs: One string
379 * @ct: Another string
380 * @count: The maximum number of bytes to compare
381 */
51a0f0f6 382int strncmp(const char *cs, const char *ct, size_t count)
1da177e4 383{
a414f01a 384 unsigned char c1, c2;
1da177e4
LT
385
386 while (count) {
a414f01a
LT
387 c1 = *cs++;
388 c2 = *ct++;
389 if (c1 != c2)
390 return c1 < c2 ? -1 : 1;
391 if (!c1)
1da177e4
LT
392 break;
393 count--;
394 }
a414f01a 395 return 0;
1da177e4
LT
396}
397EXPORT_SYMBOL(strncmp);
398#endif
399
400#ifndef __HAVE_ARCH_STRCHR
401/**
402 * strchr - Find the first occurrence of a character in a string
403 * @s: The string to be searched
404 * @c: The character to search for
b0975710
PR
405 *
406 * Note that the %NUL-terminator is considered part of the string, and can
407 * be searched for.
1da177e4 408 */
51a0f0f6 409char *strchr(const char *s, int c)
1da177e4 410{
51a0f0f6 411 for (; *s != (char)c; ++s)
1da177e4
LT
412 if (*s == '\0')
413 return NULL;
51a0f0f6 414 return (char *)s;
1da177e4
LT
415}
416EXPORT_SYMBOL(strchr);
417#endif
418
11d200e9
GL
419#ifndef __HAVE_ARCH_STRCHRNUL
420/**
421 * strchrnul - Find and return a character in a string, or end of string
422 * @s: The string to be searched
423 * @c: The character to search for
424 *
425 * Returns pointer to first occurrence of 'c' in s. If c is not found, then
426 * return a pointer to the null byte at the end of s.
427 */
428char *strchrnul(const char *s, int c)
429{
430 while (*s && *s != (char)c)
431 s++;
432 return (char *)s;
433}
434EXPORT_SYMBOL(strchrnul);
435#endif
436
0bee0cec
YN
437/**
438 * strnchrnul - Find and return a character in a length limited string,
439 * or end of string
440 * @s: The string to be searched
441 * @count: The number of characters to be searched
442 * @c: The character to search for
443 *
444 * Returns pointer to the first occurrence of 'c' in s. If c is not found,
445 * then return a pointer to the last character of the string.
446 */
447char *strnchrnul(const char *s, size_t count, int c)
448{
449 while (count-- && *s && *s != (char)c)
450 s++;
451 return (char *)s;
452}
453
1da177e4
LT
454#ifndef __HAVE_ARCH_STRRCHR
455/**
456 * strrchr - Find the last occurrence of a character in a string
457 * @s: The string to be searched
458 * @c: The character to search for
459 */
51a0f0f6 460char *strrchr(const char *s, int c)
1da177e4 461{
8da53d45
RV
462 const char *last = NULL;
463 do {
464 if (*s == (char)c)
465 last = s;
466 } while (*s++);
467 return (char *)last;
1da177e4
LT
468}
469EXPORT_SYMBOL(strrchr);
470#endif
471
472#ifndef __HAVE_ARCH_STRNCHR
473/**
474 * strnchr - Find a character in a length limited string
475 * @s: The string to be searched
476 * @count: The number of characters to be searched
477 * @c: The character to search for
b0975710
PR
478 *
479 * Note that the %NUL-terminator is considered part of the string, and can
480 * be searched for.
1da177e4
LT
481 */
482char *strnchr(const char *s, size_t count, int c)
483{
b0975710 484 while (count--) {
51a0f0f6
JJ
485 if (*s == (char)c)
486 return (char *)s;
b0975710
PR
487 if (*s++ == '\0')
488 break;
489 }
1da177e4
LT
490 return NULL;
491}
492EXPORT_SYMBOL(strnchr);
493#endif
494
f653398c 495/**
a6cd13f3
RD
496 * skip_spaces - Removes leading whitespace from @str.
497 * @str: The string to be stripped.
f653398c 498 *
a6cd13f3 499 * Returns a pointer to the first non-whitespace character in @str.
f653398c
AGR
500 */
501char *skip_spaces(const char *str)
502{
503 while (isspace(*str))
504 ++str;
505 return (char *)str;
506}
507EXPORT_SYMBOL(skip_spaces);
508
481fad48 509/**
ca54cb8c 510 * strim - Removes leading and trailing whitespace from @s.
481fad48
PE
511 * @s: The string to be stripped.
512 *
513 * Note that the first trailing whitespace is replaced with a %NUL-terminator
514 * in the given string @s. Returns a pointer to the first non-whitespace
515 * character in @s.
516 */
ca54cb8c 517char *strim(char *s)
481fad48
PE
518{
519 size_t size;
520 char *end;
521
522 size = strlen(s);
481fad48
PE
523 if (!size)
524 return s;
525
526 end = s + size - 1;
6e6d9fa6 527 while (end >= s && isspace(*end))
481fad48
PE
528 end--;
529 *(end + 1) = '\0';
530
66f6958e 531 return skip_spaces(s);
481fad48 532}
ca54cb8c 533EXPORT_SYMBOL(strim);
481fad48 534
1da177e4
LT
535#ifndef __HAVE_ARCH_STRLEN
536/**
537 * strlen - Find the length of a string
538 * @s: The string to be sized
539 */
51a0f0f6 540size_t strlen(const char *s)
1da177e4
LT
541{
542 const char *sc;
543
544 for (sc = s; *sc != '\0'; ++sc)
545 /* nothing */;
546 return sc - s;
547}
548EXPORT_SYMBOL(strlen);
549#endif
550
551#ifndef __HAVE_ARCH_STRNLEN
552/**
553 * strnlen - Find the length of a length-limited string
554 * @s: The string to be sized
555 * @count: The maximum number of bytes to search
556 */
51a0f0f6 557size_t strnlen(const char *s, size_t count)
1da177e4
LT
558{
559 const char *sc;
560
561 for (sc = s; count-- && *sc != '\0'; ++sc)
562 /* nothing */;
563 return sc - s;
564}
565EXPORT_SYMBOL(strnlen);
566#endif
567
568#ifndef __HAVE_ARCH_STRSPN
569/**
72fd4a35 570 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept
1da177e4
LT
571 * @s: The string to be searched
572 * @accept: The string to search for
573 */
574size_t strspn(const char *s, const char *accept)
575{
576 const char *p;
577 const char *a;
578 size_t count = 0;
579
580 for (p = s; *p != '\0'; ++p) {
581 for (a = accept; *a != '\0'; ++a) {
582 if (*p == *a)
583 break;
584 }
585 if (*a == '\0')
586 return count;
587 ++count;
588 }
1da177e4
LT
589 return count;
590}
591
592EXPORT_SYMBOL(strspn);
593#endif
594
8833d328 595#ifndef __HAVE_ARCH_STRCSPN
1da177e4 596/**
72fd4a35 597 * strcspn - Calculate the length of the initial substring of @s which does not contain letters in @reject
1da177e4
LT
598 * @s: The string to be searched
599 * @reject: The string to avoid
600 */
601size_t strcspn(const char *s, const char *reject)
602{
603 const char *p;
604 const char *r;
605 size_t count = 0;
606
607 for (p = s; *p != '\0'; ++p) {
608 for (r = reject; *r != '\0'; ++r) {
609 if (*p == *r)
610 return count;
611 }
612 ++count;
613 }
1da177e4 614 return count;
51a0f0f6 615}
1da177e4 616EXPORT_SYMBOL(strcspn);
8833d328 617#endif
1da177e4
LT
618
619#ifndef __HAVE_ARCH_STRPBRK
620/**
621 * strpbrk - Find the first occurrence of a set of characters
622 * @cs: The string to be searched
623 * @ct: The characters to search for
624 */
51a0f0f6 625char *strpbrk(const char *cs, const char *ct)
1da177e4 626{
51a0f0f6 627 const char *sc1, *sc2;
1da177e4 628
51a0f0f6
JJ
629 for (sc1 = cs; *sc1 != '\0'; ++sc1) {
630 for (sc2 = ct; *sc2 != '\0'; ++sc2) {
1da177e4 631 if (*sc1 == *sc2)
51a0f0f6 632 return (char *)sc1;
1da177e4
LT
633 }
634 }
635 return NULL;
636}
894b5779 637EXPORT_SYMBOL(strpbrk);
1da177e4
LT
638#endif
639
640#ifndef __HAVE_ARCH_STRSEP
641/**
642 * strsep - Split a string into tokens
643 * @s: The string to be searched
644 * @ct: The characters to search for
645 *
646 * strsep() updates @s to point after the token, ready for the next call.
647 *
648 * It returns empty tokens, too, behaving exactly like the libc function
649 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
650 * Same semantics, slimmer shape. ;)
651 */
51a0f0f6 652char *strsep(char **s, const char *ct)
1da177e4 653{
51a0f0f6
JJ
654 char *sbegin = *s;
655 char *end;
1da177e4
LT
656
657 if (sbegin == NULL)
658 return NULL;
659
660 end = strpbrk(sbegin, ct);
661 if (end)
662 *end++ = '\0';
663 *s = end;
1da177e4
LT
664 return sbegin;
665}
1da177e4
LT
666EXPORT_SYMBOL(strsep);
667#endif
668
34990cf7
DB
669/**
670 * sysfs_streq - return true if strings are equal, modulo trailing newline
671 * @s1: one string
672 * @s2: another string
673 *
674 * This routine returns true iff two strings are equal, treating both
675 * NUL and newline-then-NUL as equivalent string terminations. It's
676 * geared for use with sysfs input strings, which generally terminate
677 * with newlines but are compared against values without newlines.
678 */
679bool sysfs_streq(const char *s1, const char *s2)
680{
681 while (*s1 && *s1 == *s2) {
682 s1++;
683 s2++;
684 }
685
686 if (*s1 == *s2)
687 return true;
688 if (!*s1 && *s2 == '\n' && !s2[1])
689 return true;
690 if (*s1 == '\n' && !s1[1] && !*s2)
691 return true;
692 return false;
693}
694EXPORT_SYMBOL(sysfs_streq);
695
56b06081
AS
696/**
697 * match_string - matches given string in an array
698 * @array: array of strings
699 * @n: number of strings in the array or -1 for NULL terminated arrays
700 * @string: string to match with
701 *
702 * Return:
703 * index of a @string in the @array if matches, or %-EINVAL otherwise.
704 */
705int match_string(const char * const *array, size_t n, const char *string)
706{
707 int index;
708 const char *item;
709
710 for (index = 0; index < n; index++) {
711 item = array[index];
712 if (!item)
713 break;
714 if (!strcmp(item, string))
715 return index;
716 }
717
718 return -EINVAL;
719}
720EXPORT_SYMBOL(match_string);
721
e1fe7b6a
HK
722/**
723 * __sysfs_match_string - matches given string in an array
724 * @array: array of strings
725 * @n: number of strings in the array or -1 for NULL terminated arrays
726 * @str: string to match with
727 *
728 * Returns index of @str in the @array or -EINVAL, just like match_string().
729 * Uses sysfs_streq instead of strcmp for matching.
730 */
731int __sysfs_match_string(const char * const *array, size_t n, const char *str)
732{
733 const char *item;
734 int index;
735
736 for (index = 0; index < n; index++) {
737 item = array[index];
738 if (!item)
739 break;
740 if (sysfs_streq(item, str))
741 return index;
742 }
743
744 return -EINVAL;
745}
746EXPORT_SYMBOL(__sysfs_match_string);
747
1da177e4
LT
748#ifndef __HAVE_ARCH_MEMSET
749/**
750 * memset - Fill a region of memory with the given value
751 * @s: Pointer to the start of the area.
752 * @c: The byte to fill the area with
753 * @count: The size of the area.
754 *
755 * Do not use memset() to access IO space, use memset_io() instead.
756 */
51a0f0f6 757void *memset(void *s, int c, size_t count)
1da177e4 758{
850b9247 759 char *xs = s;
1da177e4
LT
760
761 while (count--)
762 *xs++ = c;
1da177e4
LT
763 return s;
764}
765EXPORT_SYMBOL(memset);
766#endif
767
3b3c4bab
MW
768#ifndef __HAVE_ARCH_MEMSET16
769/**
770 * memset16() - Fill a memory area with a uint16_t
771 * @s: Pointer to the start of the area.
772 * @v: The value to fill the area with
773 * @count: The number of values to store
774 *
775 * Differs from memset() in that it fills with a uint16_t instead
776 * of a byte. Remember that @count is the number of uint16_ts to
777 * store, not the number of bytes.
778 */
779void *memset16(uint16_t *s, uint16_t v, size_t count)
780{
781 uint16_t *xs = s;
782
783 while (count--)
784 *xs++ = v;
785 return s;
786}
787EXPORT_SYMBOL(memset16);
788#endif
789
790#ifndef __HAVE_ARCH_MEMSET32
791/**
792 * memset32() - Fill a memory area with a uint32_t
793 * @s: Pointer to the start of the area.
794 * @v: The value to fill the area with
795 * @count: The number of values to store
796 *
797 * Differs from memset() in that it fills with a uint32_t instead
798 * of a byte. Remember that @count is the number of uint32_ts to
799 * store, not the number of bytes.
800 */
801void *memset32(uint32_t *s, uint32_t v, size_t count)
802{
803 uint32_t *xs = s;
804
805 while (count--)
806 *xs++ = v;
807 return s;
808}
809EXPORT_SYMBOL(memset32);
810#endif
811
812#ifndef __HAVE_ARCH_MEMSET64
813/**
814 * memset64() - Fill a memory area with a uint64_t
815 * @s: Pointer to the start of the area.
816 * @v: The value to fill the area with
817 * @count: The number of values to store
818 *
819 * Differs from memset() in that it fills with a uint64_t instead
820 * of a byte. Remember that @count is the number of uint64_ts to
821 * store, not the number of bytes.
822 */
823void *memset64(uint64_t *s, uint64_t v, size_t count)
824{
825 uint64_t *xs = s;
826
827 while (count--)
828 *xs++ = v;
829 return s;
830}
831EXPORT_SYMBOL(memset64);
832#endif
833
1da177e4
LT
834#ifndef __HAVE_ARCH_MEMCPY
835/**
836 * memcpy - Copy one area of memory to another
837 * @dest: Where to copy to
838 * @src: Where to copy from
839 * @count: The size of the area.
840 *
841 * You should not use this function to access IO space, use memcpy_toio()
842 * or memcpy_fromio() instead.
843 */
51a0f0f6 844void *memcpy(void *dest, const void *src, size_t count)
1da177e4 845{
850b9247 846 char *tmp = dest;
4c416ab7 847 const char *s = src;
1da177e4
LT
848
849 while (count--)
850 *tmp++ = *s++;
1da177e4
LT
851 return dest;
852}
853EXPORT_SYMBOL(memcpy);
854#endif
855
856#ifndef __HAVE_ARCH_MEMMOVE
857/**
858 * memmove - Copy one area of memory to another
859 * @dest: Where to copy to
860 * @src: Where to copy from
861 * @count: The size of the area.
862 *
863 * Unlike memcpy(), memmove() copes with overlapping areas.
864 */
51a0f0f6 865void *memmove(void *dest, const void *src, size_t count)
1da177e4 866{
82da2c37
PJ
867 char *tmp;
868 const char *s;
1da177e4
LT
869
870 if (dest <= src) {
850b9247
JJ
871 tmp = dest;
872 s = src;
1da177e4
LT
873 while (count--)
874 *tmp++ = *s++;
51a0f0f6 875 } else {
850b9247
JJ
876 tmp = dest;
877 tmp += count;
878 s = src;
879 s += count;
1da177e4
LT
880 while (count--)
881 *--tmp = *--s;
51a0f0f6 882 }
1da177e4
LT
883 return dest;
884}
885EXPORT_SYMBOL(memmove);
886#endif
887
888#ifndef __HAVE_ARCH_MEMCMP
889/**
890 * memcmp - Compare two areas of memory
891 * @cs: One area of memory
892 * @ct: Another area of memory
893 * @count: The size of the area.
894 */
0c28130b 895#undef memcmp
a7330c99 896__visible int memcmp(const void *cs, const void *ct, size_t count)
1da177e4
LT
897{
898 const unsigned char *su1, *su2;
899 int res = 0;
900
51a0f0f6 901 for (su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
1da177e4
LT
902 if ((res = *su1 - *su2) != 0)
903 break;
904 return res;
905}
906EXPORT_SYMBOL(memcmp);
907#endif
908
5f074f3e
ND
909#ifndef __HAVE_ARCH_BCMP
910/**
911 * bcmp - returns 0 if and only if the buffers have identical contents.
912 * @a: pointer to first buffer.
913 * @b: pointer to second buffer.
914 * @len: size of buffers.
915 *
916 * The sign or magnitude of a non-zero return value has no particular
917 * meaning, and architectures may implement their own more efficient bcmp(). So
918 * while this particular implementation is a simple (tail) call to memcmp, do
919 * not rely on anything but whether the return value is zero or non-zero.
920 */
921#undef bcmp
922int bcmp(const void *a, const void *b, size_t len)
923{
924 return memcmp(a, b, len);
925}
926EXPORT_SYMBOL(bcmp);
927#endif
928
1da177e4
LT
929#ifndef __HAVE_ARCH_MEMSCAN
930/**
931 * memscan - Find a character in an area of memory.
932 * @addr: The memory area
933 * @c: The byte to search for
934 * @size: The size of the area.
935 *
936 * returns the address of the first occurrence of @c, or 1 byte past
937 * the area if @c is not found
938 */
51a0f0f6 939void *memscan(void *addr, int c, size_t size)
1da177e4 940{
850b9247 941 unsigned char *p = addr;
1da177e4
LT
942
943 while (size) {
944 if (*p == c)
51a0f0f6 945 return (void *)p;
1da177e4
LT
946 p++;
947 size--;
948 }
51a0f0f6 949 return (void *)p;
1da177e4
LT
950}
951EXPORT_SYMBOL(memscan);
952#endif
953
954#ifndef __HAVE_ARCH_STRSTR
955/**
956 * strstr - Find the first substring in a %NUL terminated string
957 * @s1: The string to be searched
958 * @s2: The string to search for
959 */
51a0f0f6 960char *strstr(const char *s1, const char *s2)
1da177e4 961{
d5f1fb53 962 size_t l1, l2;
1da177e4
LT
963
964 l2 = strlen(s2);
965 if (!l2)
51a0f0f6 966 return (char *)s1;
1da177e4
LT
967 l1 = strlen(s1);
968 while (l1 >= l2) {
969 l1--;
51a0f0f6
JJ
970 if (!memcmp(s1, s2, l2))
971 return (char *)s1;
1da177e4
LT
972 s1++;
973 }
974 return NULL;
975}
976EXPORT_SYMBOL(strstr);
977#endif
978
d5f1fb53
LZ
979#ifndef __HAVE_ARCH_STRNSTR
980/**
981 * strnstr - Find the first substring in a length-limited string
982 * @s1: The string to be searched
983 * @s2: The string to search for
984 * @len: the maximum number of characters to search
985 */
986char *strnstr(const char *s1, const char *s2, size_t len)
987{
d6a2eedf 988 size_t l2;
d5f1fb53
LZ
989
990 l2 = strlen(s2);
991 if (!l2)
992 return (char *)s1;
d6a2eedf
AGR
993 while (len >= l2) {
994 len--;
d5f1fb53
LZ
995 if (!memcmp(s1, s2, l2))
996 return (char *)s1;
997 s1++;
998 }
999 return NULL;
1000}
1001EXPORT_SYMBOL(strnstr);
1002#endif
1003
1da177e4
LT
1004#ifndef __HAVE_ARCH_MEMCHR
1005/**
1006 * memchr - Find a character in an area of memory.
1007 * @s: The memory area
1008 * @c: The byte to search for
1009 * @n: The size of the area.
1010 *
1011 * returns the address of the first occurrence of @c, or %NULL
1012 * if @c is not found
1013 */
1014void *memchr(const void *s, int c, size_t n)
1015{
1016 const unsigned char *p = s;
1017 while (n-- != 0) {
1018 if ((unsigned char)c == *p++) {
51a0f0f6 1019 return (void *)(p - 1);
1da177e4
LT
1020 }
1021 }
1022 return NULL;
1023}
1024EXPORT_SYMBOL(memchr);
1025#endif
79824820
AM
1026
1027static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes)
1028{
1029 while (bytes) {
1030 if (*start != value)
1031 return (void *)start;
1032 start++;
1033 bytes--;
1034 }
1035 return NULL;
1036}
1037
1038/**
1039 * memchr_inv - Find an unmatching character in an area of memory.
1040 * @start: The memory area
1041 * @c: Find a character other than c
1042 * @bytes: The size of the area.
1043 *
1044 * returns the address of the first character other than @c, or %NULL
1045 * if the whole buffer contains just @c.
1046 */
1047void *memchr_inv(const void *start, int c, size_t bytes)
1048{
1049 u8 value = c;
1050 u64 value64;
1051 unsigned int words, prefix;
1052
1053 if (bytes <= 16)
1054 return check_bytes8(start, value, bytes);
1055
f43804bf 1056 value64 = value;
72d93104 1057#if defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER) && BITS_PER_LONG == 64
3368e8fb 1058 value64 *= 0x0101010101010101ULL;
72d93104 1059#elif defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER)
f43804bf
AM
1060 value64 *= 0x01010101;
1061 value64 |= value64 << 32;
1062#else
1063 value64 |= value64 << 8;
1064 value64 |= value64 << 16;
1065 value64 |= value64 << 32;
1066#endif
79824820 1067
f43804bf 1068 prefix = (unsigned long)start % 8;
79824820 1069 if (prefix) {
f43804bf
AM
1070 u8 *r;
1071
1072 prefix = 8 - prefix;
1073 r = check_bytes8(start, value, prefix);
79824820
AM
1074 if (r)
1075 return r;
1076 start += prefix;
1077 bytes -= prefix;
1078 }
1079
1080 words = bytes / 8;
1081
1082 while (words) {
1083 if (*(u64 *)start != value64)
1084 return check_bytes8(start, value, 8);
1085 start += 8;
1086 words--;
1087 }
1088
1089 return check_bytes8(start, value, bytes % 8);
1090}
1091EXPORT_SYMBOL(memchr_inv);
94df2904
RV
1092
1093/**
1094 * strreplace - Replace all occurrences of character in string.
1095 * @s: The string to operate on.
1096 * @old: The character being replaced.
1097 * @new: The character @old is replaced with.
1098 *
1099 * Returns pointer to the nul byte at the end of @s.
1100 */
1101char *strreplace(char *s, char old, char new)
1102{
1103 for (; *s; ++s)
1104 if (*s == old)
1105 *s = new;
1106 return s;
1107}
1108EXPORT_SYMBOL(strreplace);
6974f0c4
DM
1109
1110void fortify_panic(const char *name)
1111{
1112 pr_emerg("detected buffer overflow in %s\n", name);
1113 BUG();
1114}
1115EXPORT_SYMBOL(fortify_panic);