Loading...
1/*
2 * linux/lib/string.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
6
7/*
8 * stupid library routines.. The optimized versions should generally be found
9 * as inline code in <asm-xx/string.h>
10 *
11 * These are buggy as well..
12 *
13 * * Fri Jun 25 1999, Ingo Oeser <ioe@informatik.tu-chemnitz.de>
14 * - Added strsep() which will replace strtok() soon (because strsep() is
15 * reentrant and should be faster). Use only strsep() in new code, please.
16 *
17 * * Sat Feb 09 2002, Jason Thomas <jason@topic.com.au>,
18 * Matthew Hawkins <matt@mh.dropbear.id.au>
19 * - Kissed strtok() goodbye
20 */
21
22#include <linux/types.h>
23#include <linux/string.h>
24#include <linux/ctype.h>
25#include <linux/kernel.h>
26#include <linux/export.h>
27#include <linux/bug.h>
28#include <linux/errno.h>
29
30#ifndef __HAVE_ARCH_STRNICMP
31/**
32 * strnicmp - Case insensitive, length-limited string comparison
33 * @s1: One string
34 * @s2: The other string
35 * @len: the maximum number of characters to compare
36 */
37int strnicmp(const char *s1, const char *s2, size_t len)
38{
39 /* Yes, Virginia, it had better be unsigned */
40 unsigned char c1, c2;
41
42 if (!len)
43 return 0;
44
45 do {
46 c1 = *s1++;
47 c2 = *s2++;
48 if (!c1 || !c2)
49 break;
50 if (c1 == c2)
51 continue;
52 c1 = tolower(c1);
53 c2 = tolower(c2);
54 if (c1 != c2)
55 break;
56 } while (--len);
57 return (int)c1 - (int)c2;
58}
59EXPORT_SYMBOL(strnicmp);
60#endif
61
62#ifndef __HAVE_ARCH_STRCASECMP
63int strcasecmp(const char *s1, const char *s2)
64{
65 int c1, c2;
66
67 do {
68 c1 = tolower(*s1++);
69 c2 = tolower(*s2++);
70 } while (c1 == c2 && c1 != 0);
71 return c1 - c2;
72}
73EXPORT_SYMBOL(strcasecmp);
74#endif
75
76#ifndef __HAVE_ARCH_STRNCASECMP
77int strncasecmp(const char *s1, const char *s2, size_t n)
78{
79 int c1, c2;
80
81 do {
82 c1 = tolower(*s1++);
83 c2 = tolower(*s2++);
84 } while ((--n > 0) && c1 == c2 && c1 != 0);
85 return c1 - c2;
86}
87EXPORT_SYMBOL(strncasecmp);
88#endif
89
90#ifndef __HAVE_ARCH_STRCPY
91/**
92 * strcpy - Copy a %NUL terminated string
93 * @dest: Where to copy the string to
94 * @src: Where to copy the string from
95 */
96#undef strcpy
97char *strcpy(char *dest, const char *src)
98{
99 char *tmp = dest;
100
101 while ((*dest++ = *src++) != '\0')
102 /* nothing */;
103 return tmp;
104}
105EXPORT_SYMBOL(strcpy);
106#endif
107
108#ifndef __HAVE_ARCH_STRNCPY
109/**
110 * strncpy - Copy a length-limited, %NUL-terminated string
111 * @dest: Where to copy the string to
112 * @src: Where to copy the string from
113 * @count: The maximum number of bytes to copy
114 *
115 * The result is not %NUL-terminated if the source exceeds
116 * @count bytes.
117 *
118 * In the case where the length of @src is less than that of
119 * count, the remainder of @dest will be padded with %NUL.
120 *
121 */
122char *strncpy(char *dest, const char *src, size_t count)
123{
124 char *tmp = dest;
125
126 while (count) {
127 if ((*tmp = *src) != 0)
128 src++;
129 tmp++;
130 count--;
131 }
132 return dest;
133}
134EXPORT_SYMBOL(strncpy);
135#endif
136
137#ifndef __HAVE_ARCH_STRLCPY
138/**
139 * strlcpy - Copy a %NUL terminated string into a sized buffer
140 * @dest: Where to copy the string to
141 * @src: Where to copy the string from
142 * @size: size of destination buffer
143 *
144 * Compatible with *BSD: the result is always a valid
145 * NUL-terminated string that fits in the buffer (unless,
146 * of course, the buffer size is zero). It does not pad
147 * out the result like strncpy() does.
148 */
149size_t strlcpy(char *dest, const char *src, size_t size)
150{
151 size_t ret = strlen(src);
152
153 if (size) {
154 size_t len = (ret >= size) ? size - 1 : ret;
155 memcpy(dest, src, len);
156 dest[len] = '\0';
157 }
158 return ret;
159}
160EXPORT_SYMBOL(strlcpy);
161#endif
162
163#ifndef __HAVE_ARCH_STRCAT
164/**
165 * strcat - Append one %NUL-terminated string to another
166 * @dest: The string to be appended to
167 * @src: The string to append to it
168 */
169#undef strcat
170char *strcat(char *dest, const char *src)
171{
172 char *tmp = dest;
173
174 while (*dest)
175 dest++;
176 while ((*dest++ = *src++) != '\0')
177 ;
178 return tmp;
179}
180EXPORT_SYMBOL(strcat);
181#endif
182
183#ifndef __HAVE_ARCH_STRNCAT
184/**
185 * strncat - Append a length-limited, %NUL-terminated string to another
186 * @dest: The string to be appended to
187 * @src: The string to append to it
188 * @count: The maximum numbers of bytes to copy
189 *
190 * Note that in contrast to strncpy(), strncat() ensures the result is
191 * terminated.
192 */
193char *strncat(char *dest, const char *src, size_t count)
194{
195 char *tmp = dest;
196
197 if (count) {
198 while (*dest)
199 dest++;
200 while ((*dest++ = *src++) != 0) {
201 if (--count == 0) {
202 *dest = '\0';
203 break;
204 }
205 }
206 }
207 return tmp;
208}
209EXPORT_SYMBOL(strncat);
210#endif
211
212#ifndef __HAVE_ARCH_STRLCAT
213/**
214 * strlcat - Append a length-limited, %NUL-terminated string to another
215 * @dest: The string to be appended to
216 * @src: The string to append to it
217 * @count: The size of the destination buffer.
218 */
219size_t strlcat(char *dest, const char *src, size_t count)
220{
221 size_t dsize = strlen(dest);
222 size_t len = strlen(src);
223 size_t res = dsize + len;
224
225 /* This would be a bug */
226 BUG_ON(dsize >= count);
227
228 dest += dsize;
229 count -= dsize;
230 if (len >= count)
231 len = count-1;
232 memcpy(dest, src, len);
233 dest[len] = 0;
234 return res;
235}
236EXPORT_SYMBOL(strlcat);
237#endif
238
239#ifndef __HAVE_ARCH_STRCMP
240/**
241 * strcmp - Compare two strings
242 * @cs: One string
243 * @ct: Another string
244 */
245#undef strcmp
246int strcmp(const char *cs, const char *ct)
247{
248 unsigned char c1, c2;
249
250 while (1) {
251 c1 = *cs++;
252 c2 = *ct++;
253 if (c1 != c2)
254 return c1 < c2 ? -1 : 1;
255 if (!c1)
256 break;
257 }
258 return 0;
259}
260EXPORT_SYMBOL(strcmp);
261#endif
262
263#ifndef __HAVE_ARCH_STRNCMP
264/**
265 * strncmp - Compare two length-limited strings
266 * @cs: One string
267 * @ct: Another string
268 * @count: The maximum number of bytes to compare
269 */
270int strncmp(const char *cs, const char *ct, size_t count)
271{
272 unsigned char c1, c2;
273
274 while (count) {
275 c1 = *cs++;
276 c2 = *ct++;
277 if (c1 != c2)
278 return c1 < c2 ? -1 : 1;
279 if (!c1)
280 break;
281 count--;
282 }
283 return 0;
284}
285EXPORT_SYMBOL(strncmp);
286#endif
287
288#ifndef __HAVE_ARCH_STRCHR
289/**
290 * strchr - Find the first occurrence of a character in a string
291 * @s: The string to be searched
292 * @c: The character to search for
293 */
294char *strchr(const char *s, int c)
295{
296 for (; *s != (char)c; ++s)
297 if (*s == '\0')
298 return NULL;
299 return (char *)s;
300}
301EXPORT_SYMBOL(strchr);
302#endif
303
304#ifndef __HAVE_ARCH_STRRCHR
305/**
306 * strrchr - Find the last occurrence of a character in a string
307 * @s: The string to be searched
308 * @c: The character to search for
309 */
310char *strrchr(const char *s, int c)
311{
312 const char *p = s + strlen(s);
313 do {
314 if (*p == (char)c)
315 return (char *)p;
316 } while (--p >= s);
317 return NULL;
318}
319EXPORT_SYMBOL(strrchr);
320#endif
321
322#ifndef __HAVE_ARCH_STRNCHR
323/**
324 * strnchr - Find a character in a length limited string
325 * @s: The string to be searched
326 * @count: The number of characters to be searched
327 * @c: The character to search for
328 */
329char *strnchr(const char *s, size_t count, int c)
330{
331 for (; count-- && *s != '\0'; ++s)
332 if (*s == (char)c)
333 return (char *)s;
334 return NULL;
335}
336EXPORT_SYMBOL(strnchr);
337#endif
338
339/**
340 * skip_spaces - Removes leading whitespace from @str.
341 * @str: The string to be stripped.
342 *
343 * Returns a pointer to the first non-whitespace character in @str.
344 */
345char *skip_spaces(const char *str)
346{
347 while (isspace(*str))
348 ++str;
349 return (char *)str;
350}
351EXPORT_SYMBOL(skip_spaces);
352
353/**
354 * strim - Removes leading and trailing whitespace from @s.
355 * @s: The string to be stripped.
356 *
357 * Note that the first trailing whitespace is replaced with a %NUL-terminator
358 * in the given string @s. Returns a pointer to the first non-whitespace
359 * character in @s.
360 */
361char *strim(char *s)
362{
363 size_t size;
364 char *end;
365
366 size = strlen(s);
367 if (!size)
368 return s;
369
370 end = s + size - 1;
371 while (end >= s && isspace(*end))
372 end--;
373 *(end + 1) = '\0';
374
375 return skip_spaces(s);
376}
377EXPORT_SYMBOL(strim);
378
379#ifndef __HAVE_ARCH_STRLEN
380/**
381 * strlen - Find the length of a string
382 * @s: The string to be sized
383 */
384size_t strlen(const char *s)
385{
386 const char *sc;
387
388 for (sc = s; *sc != '\0'; ++sc)
389 /* nothing */;
390 return sc - s;
391}
392EXPORT_SYMBOL(strlen);
393#endif
394
395#ifndef __HAVE_ARCH_STRNLEN
396/**
397 * strnlen - Find the length of a length-limited string
398 * @s: The string to be sized
399 * @count: The maximum number of bytes to search
400 */
401size_t strnlen(const char *s, size_t count)
402{
403 const char *sc;
404
405 for (sc = s; count-- && *sc != '\0'; ++sc)
406 /* nothing */;
407 return sc - s;
408}
409EXPORT_SYMBOL(strnlen);
410#endif
411
412#ifndef __HAVE_ARCH_STRSPN
413/**
414 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept
415 * @s: The string to be searched
416 * @accept: The string to search for
417 */
418size_t strspn(const char *s, const char *accept)
419{
420 const char *p;
421 const char *a;
422 size_t count = 0;
423
424 for (p = s; *p != '\0'; ++p) {
425 for (a = accept; *a != '\0'; ++a) {
426 if (*p == *a)
427 break;
428 }
429 if (*a == '\0')
430 return count;
431 ++count;
432 }
433 return count;
434}
435
436EXPORT_SYMBOL(strspn);
437#endif
438
439#ifndef __HAVE_ARCH_STRCSPN
440/**
441 * strcspn - Calculate the length of the initial substring of @s which does not contain letters in @reject
442 * @s: The string to be searched
443 * @reject: The string to avoid
444 */
445size_t strcspn(const char *s, const char *reject)
446{
447 const char *p;
448 const char *r;
449 size_t count = 0;
450
451 for (p = s; *p != '\0'; ++p) {
452 for (r = reject; *r != '\0'; ++r) {
453 if (*p == *r)
454 return count;
455 }
456 ++count;
457 }
458 return count;
459}
460EXPORT_SYMBOL(strcspn);
461#endif
462
463#ifndef __HAVE_ARCH_STRPBRK
464/**
465 * strpbrk - Find the first occurrence of a set of characters
466 * @cs: The string to be searched
467 * @ct: The characters to search for
468 */
469char *strpbrk(const char *cs, const char *ct)
470{
471 const char *sc1, *sc2;
472
473 for (sc1 = cs; *sc1 != '\0'; ++sc1) {
474 for (sc2 = ct; *sc2 != '\0'; ++sc2) {
475 if (*sc1 == *sc2)
476 return (char *)sc1;
477 }
478 }
479 return NULL;
480}
481EXPORT_SYMBOL(strpbrk);
482#endif
483
484#ifndef __HAVE_ARCH_STRSEP
485/**
486 * strsep - Split a string into tokens
487 * @s: The string to be searched
488 * @ct: The characters to search for
489 *
490 * strsep() updates @s to point after the token, ready for the next call.
491 *
492 * It returns empty tokens, too, behaving exactly like the libc function
493 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
494 * Same semantics, slimmer shape. ;)
495 */
496char *strsep(char **s, const char *ct)
497{
498 char *sbegin = *s;
499 char *end;
500
501 if (sbegin == NULL)
502 return NULL;
503
504 end = strpbrk(sbegin, ct);
505 if (end)
506 *end++ = '\0';
507 *s = end;
508 return sbegin;
509}
510EXPORT_SYMBOL(strsep);
511#endif
512
513/**
514 * sysfs_streq - return true if strings are equal, modulo trailing newline
515 * @s1: one string
516 * @s2: another string
517 *
518 * This routine returns true iff two strings are equal, treating both
519 * NUL and newline-then-NUL as equivalent string terminations. It's
520 * geared for use with sysfs input strings, which generally terminate
521 * with newlines but are compared against values without newlines.
522 */
523bool sysfs_streq(const char *s1, const char *s2)
524{
525 while (*s1 && *s1 == *s2) {
526 s1++;
527 s2++;
528 }
529
530 if (*s1 == *s2)
531 return true;
532 if (!*s1 && *s2 == '\n' && !s2[1])
533 return true;
534 if (*s1 == '\n' && !s1[1] && !*s2)
535 return true;
536 return false;
537}
538EXPORT_SYMBOL(sysfs_streq);
539
540/**
541 * strtobool - convert common user inputs into boolean values
542 * @s: input string
543 * @res: result
544 *
545 * This routine returns 0 iff the first character is one of 'Yy1Nn0'.
546 * Otherwise it will return -EINVAL. Value pointed to by res is
547 * updated upon finding a match.
548 */
549int strtobool(const char *s, bool *res)
550{
551 switch (s[0]) {
552 case 'y':
553 case 'Y':
554 case '1':
555 *res = true;
556 break;
557 case 'n':
558 case 'N':
559 case '0':
560 *res = false;
561 break;
562 default:
563 return -EINVAL;
564 }
565 return 0;
566}
567EXPORT_SYMBOL(strtobool);
568
569#ifndef __HAVE_ARCH_MEMSET
570/**
571 * memset - Fill a region of memory with the given value
572 * @s: Pointer to the start of the area.
573 * @c: The byte to fill the area with
574 * @count: The size of the area.
575 *
576 * Do not use memset() to access IO space, use memset_io() instead.
577 */
578void *memset(void *s, int c, size_t count)
579{
580 char *xs = s;
581
582 while (count--)
583 *xs++ = c;
584 return s;
585}
586EXPORT_SYMBOL(memset);
587#endif
588
589#ifndef __HAVE_ARCH_MEMCPY
590/**
591 * memcpy - Copy one area of memory to another
592 * @dest: Where to copy to
593 * @src: Where to copy from
594 * @count: The size of the area.
595 *
596 * You should not use this function to access IO space, use memcpy_toio()
597 * or memcpy_fromio() instead.
598 */
599void *memcpy(void *dest, const void *src, size_t count)
600{
601 char *tmp = dest;
602 const char *s = src;
603
604 while (count--)
605 *tmp++ = *s++;
606 return dest;
607}
608EXPORT_SYMBOL(memcpy);
609#endif
610
611#ifndef __HAVE_ARCH_MEMMOVE
612/**
613 * memmove - Copy one area of memory to another
614 * @dest: Where to copy to
615 * @src: Where to copy from
616 * @count: The size of the area.
617 *
618 * Unlike memcpy(), memmove() copes with overlapping areas.
619 */
620void *memmove(void *dest, const void *src, size_t count)
621{
622 char *tmp;
623 const char *s;
624
625 if (dest <= src) {
626 tmp = dest;
627 s = src;
628 while (count--)
629 *tmp++ = *s++;
630 } else {
631 tmp = dest;
632 tmp += count;
633 s = src;
634 s += count;
635 while (count--)
636 *--tmp = *--s;
637 }
638 return dest;
639}
640EXPORT_SYMBOL(memmove);
641#endif
642
643#ifndef __HAVE_ARCH_MEMCMP
644/**
645 * memcmp - Compare two areas of memory
646 * @cs: One area of memory
647 * @ct: Another area of memory
648 * @count: The size of the area.
649 */
650#undef memcmp
651__visible int memcmp(const void *cs, const void *ct, size_t count)
652{
653 const unsigned char *su1, *su2;
654 int res = 0;
655
656 for (su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
657 if ((res = *su1 - *su2) != 0)
658 break;
659 return res;
660}
661EXPORT_SYMBOL(memcmp);
662#endif
663
664#ifndef __HAVE_ARCH_MEMSCAN
665/**
666 * memscan - Find a character in an area of memory.
667 * @addr: The memory area
668 * @c: The byte to search for
669 * @size: The size of the area.
670 *
671 * returns the address of the first occurrence of @c, or 1 byte past
672 * the area if @c is not found
673 */
674void *memscan(void *addr, int c, size_t size)
675{
676 unsigned char *p = addr;
677
678 while (size) {
679 if (*p == c)
680 return (void *)p;
681 p++;
682 size--;
683 }
684 return (void *)p;
685}
686EXPORT_SYMBOL(memscan);
687#endif
688
689#ifndef __HAVE_ARCH_STRSTR
690/**
691 * strstr - Find the first substring in a %NUL terminated string
692 * @s1: The string to be searched
693 * @s2: The string to search for
694 */
695char *strstr(const char *s1, const char *s2)
696{
697 size_t l1, l2;
698
699 l2 = strlen(s2);
700 if (!l2)
701 return (char *)s1;
702 l1 = strlen(s1);
703 while (l1 >= l2) {
704 l1--;
705 if (!memcmp(s1, s2, l2))
706 return (char *)s1;
707 s1++;
708 }
709 return NULL;
710}
711EXPORT_SYMBOL(strstr);
712#endif
713
714#ifndef __HAVE_ARCH_STRNSTR
715/**
716 * strnstr - Find the first substring in a length-limited string
717 * @s1: The string to be searched
718 * @s2: The string to search for
719 * @len: the maximum number of characters to search
720 */
721char *strnstr(const char *s1, const char *s2, size_t len)
722{
723 size_t l2;
724
725 l2 = strlen(s2);
726 if (!l2)
727 return (char *)s1;
728 while (len >= l2) {
729 len--;
730 if (!memcmp(s1, s2, l2))
731 return (char *)s1;
732 s1++;
733 }
734 return NULL;
735}
736EXPORT_SYMBOL(strnstr);
737#endif
738
739#ifndef __HAVE_ARCH_MEMCHR
740/**
741 * memchr - Find a character in an area of memory.
742 * @s: The memory area
743 * @c: The byte to search for
744 * @n: The size of the area.
745 *
746 * returns the address of the first occurrence of @c, or %NULL
747 * if @c is not found
748 */
749void *memchr(const void *s, int c, size_t n)
750{
751 const unsigned char *p = s;
752 while (n-- != 0) {
753 if ((unsigned char)c == *p++) {
754 return (void *)(p - 1);
755 }
756 }
757 return NULL;
758}
759EXPORT_SYMBOL(memchr);
760#endif
761
762static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes)
763{
764 while (bytes) {
765 if (*start != value)
766 return (void *)start;
767 start++;
768 bytes--;
769 }
770 return NULL;
771}
772
773/**
774 * memchr_inv - Find an unmatching character in an area of memory.
775 * @start: The memory area
776 * @c: Find a character other than c
777 * @bytes: The size of the area.
778 *
779 * returns the address of the first character other than @c, or %NULL
780 * if the whole buffer contains just @c.
781 */
782void *memchr_inv(const void *start, int c, size_t bytes)
783{
784 u8 value = c;
785 u64 value64;
786 unsigned int words, prefix;
787
788 if (bytes <= 16)
789 return check_bytes8(start, value, bytes);
790
791 value64 = value;
792#if defined(ARCH_HAS_FAST_MULTIPLIER) && BITS_PER_LONG == 64
793 value64 *= 0x0101010101010101;
794#elif defined(ARCH_HAS_FAST_MULTIPLIER)
795 value64 *= 0x01010101;
796 value64 |= value64 << 32;
797#else
798 value64 |= value64 << 8;
799 value64 |= value64 << 16;
800 value64 |= value64 << 32;
801#endif
802
803 prefix = (unsigned long)start % 8;
804 if (prefix) {
805 u8 *r;
806
807 prefix = 8 - prefix;
808 r = check_bytes8(start, value, prefix);
809 if (r)
810 return r;
811 start += prefix;
812 bytes -= prefix;
813 }
814
815 words = bytes / 8;
816
817 while (words) {
818 if (*(u64 *)start != value64)
819 return check_bytes8(start, value, 8);
820 start += 8;
821 words--;
822 }
823
824 return check_bytes8(start, value, bytes % 8);
825}
826EXPORT_SYMBOL(memchr_inv);
1/*
2 * linux/lib/string.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
6
7/*
8 * stupid library routines.. The optimized versions should generally be found
9 * as inline code in <asm-xx/string.h>
10 *
11 * These are buggy as well..
12 *
13 * * Fri Jun 25 1999, Ingo Oeser <ioe@informatik.tu-chemnitz.de>
14 * - Added strsep() which will replace strtok() soon (because strsep() is
15 * reentrant and should be faster). Use only strsep() in new code, please.
16 *
17 * * Sat Feb 09 2002, Jason Thomas <jason@topic.com.au>,
18 * Matthew Hawkins <matt@mh.dropbear.id.au>
19 * - Kissed strtok() goodbye
20 */
21
22#include <linux/types.h>
23#include <linux/string.h>
24#include <linux/ctype.h>
25#include <linux/kernel.h>
26#include <linux/export.h>
27#include <linux/bug.h>
28#include <linux/errno.h>
29
30#include <asm/byteorder.h>
31#include <asm/word-at-a-time.h>
32#include <asm/page.h>
33
34#ifndef __HAVE_ARCH_STRNCASECMP
35/**
36 * strncasecmp - Case insensitive, length-limited string comparison
37 * @s1: One string
38 * @s2: The other string
39 * @len: the maximum number of characters to compare
40 */
41int strncasecmp(const char *s1, const char *s2, size_t len)
42{
43 /* Yes, Virginia, it had better be unsigned */
44 unsigned char c1, c2;
45
46 if (!len)
47 return 0;
48
49 do {
50 c1 = *s1++;
51 c2 = *s2++;
52 if (!c1 || !c2)
53 break;
54 if (c1 == c2)
55 continue;
56 c1 = tolower(c1);
57 c2 = tolower(c2);
58 if (c1 != c2)
59 break;
60 } while (--len);
61 return (int)c1 - (int)c2;
62}
63EXPORT_SYMBOL(strncasecmp);
64#endif
65
66#ifndef __HAVE_ARCH_STRCASECMP
67int strcasecmp(const char *s1, const char *s2)
68{
69 int c1, c2;
70
71 do {
72 c1 = tolower(*s1++);
73 c2 = tolower(*s2++);
74 } while (c1 == c2 && c1 != 0);
75 return c1 - c2;
76}
77EXPORT_SYMBOL(strcasecmp);
78#endif
79
80#ifndef __HAVE_ARCH_STRCPY
81/**
82 * strcpy - Copy a %NUL terminated string
83 * @dest: Where to copy the string to
84 * @src: Where to copy the string from
85 */
86#undef strcpy
87char *strcpy(char *dest, const char *src)
88{
89 char *tmp = dest;
90
91 while ((*dest++ = *src++) != '\0')
92 /* nothing */;
93 return tmp;
94}
95EXPORT_SYMBOL(strcpy);
96#endif
97
98#ifndef __HAVE_ARCH_STRNCPY
99/**
100 * strncpy - Copy a length-limited, C-string
101 * @dest: Where to copy the string to
102 * @src: Where to copy the string from
103 * @count: The maximum number of bytes to copy
104 *
105 * The result is not %NUL-terminated if the source exceeds
106 * @count bytes.
107 *
108 * In the case where the length of @src is less than that of
109 * count, the remainder of @dest will be padded with %NUL.
110 *
111 */
112char *strncpy(char *dest, const char *src, size_t count)
113{
114 char *tmp = dest;
115
116 while (count) {
117 if ((*tmp = *src) != 0)
118 src++;
119 tmp++;
120 count--;
121 }
122 return dest;
123}
124EXPORT_SYMBOL(strncpy);
125#endif
126
127#ifndef __HAVE_ARCH_STRLCPY
128/**
129 * strlcpy - Copy a C-string into a sized buffer
130 * @dest: Where to copy the string to
131 * @src: Where to copy the string from
132 * @size: size of destination buffer
133 *
134 * Compatible with *BSD: the result is always a valid
135 * NUL-terminated string that fits in the buffer (unless,
136 * of course, the buffer size is zero). It does not pad
137 * out the result like strncpy() does.
138 */
139size_t strlcpy(char *dest, const char *src, size_t size)
140{
141 size_t ret = strlen(src);
142
143 if (size) {
144 size_t len = (ret >= size) ? size - 1 : ret;
145 memcpy(dest, src, len);
146 dest[len] = '\0';
147 }
148 return ret;
149}
150EXPORT_SYMBOL(strlcpy);
151#endif
152
153#ifndef __HAVE_ARCH_STRSCPY
154/**
155 * strscpy - Copy a C-string into a sized buffer
156 * @dest: Where to copy the string to
157 * @src: Where to copy the string from
158 * @count: Size of destination buffer
159 *
160 * Copy the string, or as much of it as fits, into the dest buffer.
161 * The routine returns the number of characters copied (not including
162 * the trailing NUL) or -E2BIG if the destination buffer wasn't big enough.
163 * The behavior is undefined if the string buffers overlap.
164 * The destination buffer is always NUL terminated, unless it's zero-sized.
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
174 * zeroed. If the zeroing is desired, it's likely cleaner to use strscpy()
175 * with an overflow test, then just memset() the tail of the dest buffer.
176 */
177ssize_t strscpy(char *dest, const char *src, size_t count)
178{
179 const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
180 size_t max = count;
181 long res = 0;
182
183 if (count == 0)
184 return -E2BIG;
185
186#ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
187 /*
188 * If src is unaligned, don't cross a page boundary,
189 * since we don't know if the next page is mapped.
190 */
191 if ((long)src & (sizeof(long) - 1)) {
192 size_t limit = PAGE_SIZE - ((long)src & (PAGE_SIZE - 1));
193 if (limit < max)
194 max = limit;
195 }
196#else
197 /* If src or dest is unaligned, don't do word-at-a-time. */
198 if (((long) dest | (long) src) & (sizeof(long) - 1))
199 max = 0;
200#endif
201
202 while (max >= sizeof(unsigned long)) {
203 unsigned long c, data;
204
205 c = *(unsigned long *)(src+res);
206 if (has_zero(c, &data, &constants)) {
207 data = prep_zero_mask(c, data, &constants);
208 data = create_zero_mask(data);
209 *(unsigned long *)(dest+res) = c & zero_bytemask(data);
210 return res + find_zero(data);
211 }
212 *(unsigned long *)(dest+res) = c;
213 res += sizeof(unsigned long);
214 count -= sizeof(unsigned long);
215 max -= sizeof(unsigned long);
216 }
217
218 while (count) {
219 char c;
220
221 c = src[res];
222 dest[res] = c;
223 if (!c)
224 return res;
225 res++;
226 count--;
227 }
228
229 /* Hit buffer length without finding a NUL; force NUL-termination. */
230 if (res)
231 dest[res-1] = '\0';
232
233 return -E2BIG;
234}
235EXPORT_SYMBOL(strscpy);
236#endif
237
238#ifndef __HAVE_ARCH_STRCAT
239/**
240 * strcat - Append one %NUL-terminated string to another
241 * @dest: The string to be appended to
242 * @src: The string to append to it
243 */
244#undef strcat
245char *strcat(char *dest, const char *src)
246{
247 char *tmp = dest;
248
249 while (*dest)
250 dest++;
251 while ((*dest++ = *src++) != '\0')
252 ;
253 return tmp;
254}
255EXPORT_SYMBOL(strcat);
256#endif
257
258#ifndef __HAVE_ARCH_STRNCAT
259/**
260 * strncat - Append a length-limited, C-string to another
261 * @dest: The string to be appended to
262 * @src: The string to append to it
263 * @count: The maximum numbers of bytes to copy
264 *
265 * Note that in contrast to strncpy(), strncat() ensures the result is
266 * terminated.
267 */
268char *strncat(char *dest, const char *src, size_t count)
269{
270 char *tmp = dest;
271
272 if (count) {
273 while (*dest)
274 dest++;
275 while ((*dest++ = *src++) != 0) {
276 if (--count == 0) {
277 *dest = '\0';
278 break;
279 }
280 }
281 }
282 return tmp;
283}
284EXPORT_SYMBOL(strncat);
285#endif
286
287#ifndef __HAVE_ARCH_STRLCAT
288/**
289 * strlcat - Append a length-limited, C-string to another
290 * @dest: The string to be appended to
291 * @src: The string to append to it
292 * @count: The size of the destination buffer.
293 */
294size_t strlcat(char *dest, const char *src, size_t count)
295{
296 size_t dsize = strlen(dest);
297 size_t len = strlen(src);
298 size_t res = dsize + len;
299
300 /* This would be a bug */
301 BUG_ON(dsize >= count);
302
303 dest += dsize;
304 count -= dsize;
305 if (len >= count)
306 len = count-1;
307 memcpy(dest, src, len);
308 dest[len] = 0;
309 return res;
310}
311EXPORT_SYMBOL(strlcat);
312#endif
313
314#ifndef __HAVE_ARCH_STRCMP
315/**
316 * strcmp - Compare two strings
317 * @cs: One string
318 * @ct: Another string
319 */
320#undef strcmp
321int strcmp(const char *cs, const char *ct)
322{
323 unsigned char c1, c2;
324
325 while (1) {
326 c1 = *cs++;
327 c2 = *ct++;
328 if (c1 != c2)
329 return c1 < c2 ? -1 : 1;
330 if (!c1)
331 break;
332 }
333 return 0;
334}
335EXPORT_SYMBOL(strcmp);
336#endif
337
338#ifndef __HAVE_ARCH_STRNCMP
339/**
340 * strncmp - Compare two length-limited strings
341 * @cs: One string
342 * @ct: Another string
343 * @count: The maximum number of bytes to compare
344 */
345int strncmp(const char *cs, const char *ct, size_t count)
346{
347 unsigned char c1, c2;
348
349 while (count) {
350 c1 = *cs++;
351 c2 = *ct++;
352 if (c1 != c2)
353 return c1 < c2 ? -1 : 1;
354 if (!c1)
355 break;
356 count--;
357 }
358 return 0;
359}
360EXPORT_SYMBOL(strncmp);
361#endif
362
363#ifndef __HAVE_ARCH_STRCHR
364/**
365 * strchr - Find the first occurrence of a character in a string
366 * @s: The string to be searched
367 * @c: The character to search for
368 */
369char *strchr(const char *s, int c)
370{
371 for (; *s != (char)c; ++s)
372 if (*s == '\0')
373 return NULL;
374 return (char *)s;
375}
376EXPORT_SYMBOL(strchr);
377#endif
378
379#ifndef __HAVE_ARCH_STRCHRNUL
380/**
381 * strchrnul - Find and return a character in a string, or end of string
382 * @s: The string to be searched
383 * @c: The character to search for
384 *
385 * Returns pointer to first occurrence of 'c' in s. If c is not found, then
386 * return a pointer to the null byte at the end of s.
387 */
388char *strchrnul(const char *s, int c)
389{
390 while (*s && *s != (char)c)
391 s++;
392 return (char *)s;
393}
394EXPORT_SYMBOL(strchrnul);
395#endif
396
397#ifndef __HAVE_ARCH_STRRCHR
398/**
399 * strrchr - Find the last occurrence of a character in a string
400 * @s: The string to be searched
401 * @c: The character to search for
402 */
403char *strrchr(const char *s, int c)
404{
405 const char *last = NULL;
406 do {
407 if (*s == (char)c)
408 last = s;
409 } while (*s++);
410 return (char *)last;
411}
412EXPORT_SYMBOL(strrchr);
413#endif
414
415#ifndef __HAVE_ARCH_STRNCHR
416/**
417 * strnchr - Find a character in a length limited string
418 * @s: The string to be searched
419 * @count: The number of characters to be searched
420 * @c: The character to search for
421 */
422char *strnchr(const char *s, size_t count, int c)
423{
424 for (; count-- && *s != '\0'; ++s)
425 if (*s == (char)c)
426 return (char *)s;
427 return NULL;
428}
429EXPORT_SYMBOL(strnchr);
430#endif
431
432/**
433 * skip_spaces - Removes leading whitespace from @str.
434 * @str: The string to be stripped.
435 *
436 * Returns a pointer to the first non-whitespace character in @str.
437 */
438char *skip_spaces(const char *str)
439{
440 while (isspace(*str))
441 ++str;
442 return (char *)str;
443}
444EXPORT_SYMBOL(skip_spaces);
445
446/**
447 * strim - Removes leading and trailing whitespace from @s.
448 * @s: The string to be stripped.
449 *
450 * Note that the first trailing whitespace is replaced with a %NUL-terminator
451 * in the given string @s. Returns a pointer to the first non-whitespace
452 * character in @s.
453 */
454char *strim(char *s)
455{
456 size_t size;
457 char *end;
458
459 size = strlen(s);
460 if (!size)
461 return s;
462
463 end = s + size - 1;
464 while (end >= s && isspace(*end))
465 end--;
466 *(end + 1) = '\0';
467
468 return skip_spaces(s);
469}
470EXPORT_SYMBOL(strim);
471
472#ifndef __HAVE_ARCH_STRLEN
473/**
474 * strlen - Find the length of a string
475 * @s: The string to be sized
476 */
477size_t strlen(const char *s)
478{
479 const char *sc;
480
481 for (sc = s; *sc != '\0'; ++sc)
482 /* nothing */;
483 return sc - s;
484}
485EXPORT_SYMBOL(strlen);
486#endif
487
488#ifndef __HAVE_ARCH_STRNLEN
489/**
490 * strnlen - Find the length of a length-limited string
491 * @s: The string to be sized
492 * @count: The maximum number of bytes to search
493 */
494size_t strnlen(const char *s, size_t count)
495{
496 const char *sc;
497
498 for (sc = s; count-- && *sc != '\0'; ++sc)
499 /* nothing */;
500 return sc - s;
501}
502EXPORT_SYMBOL(strnlen);
503#endif
504
505#ifndef __HAVE_ARCH_STRSPN
506/**
507 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept
508 * @s: The string to be searched
509 * @accept: The string to search for
510 */
511size_t strspn(const char *s, const char *accept)
512{
513 const char *p;
514 const char *a;
515 size_t count = 0;
516
517 for (p = s; *p != '\0'; ++p) {
518 for (a = accept; *a != '\0'; ++a) {
519 if (*p == *a)
520 break;
521 }
522 if (*a == '\0')
523 return count;
524 ++count;
525 }
526 return count;
527}
528
529EXPORT_SYMBOL(strspn);
530#endif
531
532#ifndef __HAVE_ARCH_STRCSPN
533/**
534 * strcspn - Calculate the length of the initial substring of @s which does not contain letters in @reject
535 * @s: The string to be searched
536 * @reject: The string to avoid
537 */
538size_t strcspn(const char *s, const char *reject)
539{
540 const char *p;
541 const char *r;
542 size_t count = 0;
543
544 for (p = s; *p != '\0'; ++p) {
545 for (r = reject; *r != '\0'; ++r) {
546 if (*p == *r)
547 return count;
548 }
549 ++count;
550 }
551 return count;
552}
553EXPORT_SYMBOL(strcspn);
554#endif
555
556#ifndef __HAVE_ARCH_STRPBRK
557/**
558 * strpbrk - Find the first occurrence of a set of characters
559 * @cs: The string to be searched
560 * @ct: The characters to search for
561 */
562char *strpbrk(const char *cs, const char *ct)
563{
564 const char *sc1, *sc2;
565
566 for (sc1 = cs; *sc1 != '\0'; ++sc1) {
567 for (sc2 = ct; *sc2 != '\0'; ++sc2) {
568 if (*sc1 == *sc2)
569 return (char *)sc1;
570 }
571 }
572 return NULL;
573}
574EXPORT_SYMBOL(strpbrk);
575#endif
576
577#ifndef __HAVE_ARCH_STRSEP
578/**
579 * strsep - Split a string into tokens
580 * @s: The string to be searched
581 * @ct: The characters to search for
582 *
583 * strsep() updates @s to point after the token, ready for the next call.
584 *
585 * It returns empty tokens, too, behaving exactly like the libc function
586 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
587 * Same semantics, slimmer shape. ;)
588 */
589char *strsep(char **s, const char *ct)
590{
591 char *sbegin = *s;
592 char *end;
593
594 if (sbegin == NULL)
595 return NULL;
596
597 end = strpbrk(sbegin, ct);
598 if (end)
599 *end++ = '\0';
600 *s = end;
601 return sbegin;
602}
603EXPORT_SYMBOL(strsep);
604#endif
605
606/**
607 * sysfs_streq - return true if strings are equal, modulo trailing newline
608 * @s1: one string
609 * @s2: another string
610 *
611 * This routine returns true iff two strings are equal, treating both
612 * NUL and newline-then-NUL as equivalent string terminations. It's
613 * geared for use with sysfs input strings, which generally terminate
614 * with newlines but are compared against values without newlines.
615 */
616bool sysfs_streq(const char *s1, const char *s2)
617{
618 while (*s1 && *s1 == *s2) {
619 s1++;
620 s2++;
621 }
622
623 if (*s1 == *s2)
624 return true;
625 if (!*s1 && *s2 == '\n' && !s2[1])
626 return true;
627 if (*s1 == '\n' && !s1[1] && !*s2)
628 return true;
629 return false;
630}
631EXPORT_SYMBOL(sysfs_streq);
632
633/**
634 * match_string - matches given string in an array
635 * @array: array of strings
636 * @n: number of strings in the array or -1 for NULL terminated arrays
637 * @string: string to match with
638 *
639 * Return:
640 * index of a @string in the @array if matches, or %-EINVAL otherwise.
641 */
642int match_string(const char * const *array, size_t n, const char *string)
643{
644 int index;
645 const char *item;
646
647 for (index = 0; index < n; index++) {
648 item = array[index];
649 if (!item)
650 break;
651 if (!strcmp(item, string))
652 return index;
653 }
654
655 return -EINVAL;
656}
657EXPORT_SYMBOL(match_string);
658
659#ifndef __HAVE_ARCH_MEMSET
660/**
661 * memset - Fill a region of memory with the given value
662 * @s: Pointer to the start of the area.
663 * @c: The byte to fill the area with
664 * @count: The size of the area.
665 *
666 * Do not use memset() to access IO space, use memset_io() instead.
667 */
668void *memset(void *s, int c, size_t count)
669{
670 char *xs = s;
671
672 while (count--)
673 *xs++ = c;
674 return s;
675}
676EXPORT_SYMBOL(memset);
677#endif
678
679/**
680 * memzero_explicit - Fill a region of memory (e.g. sensitive
681 * keying data) with 0s.
682 * @s: Pointer to the start of the area.
683 * @count: The size of the area.
684 *
685 * Note: usually using memset() is just fine (!), but in cases
686 * where clearing out _local_ data at the end of a scope is
687 * necessary, memzero_explicit() should be used instead in
688 * order to prevent the compiler from optimising away zeroing.
689 *
690 * memzero_explicit() doesn't need an arch-specific version as
691 * it just invokes the one of memset() implicitly.
692 */
693void memzero_explicit(void *s, size_t count)
694{
695 memset(s, 0, count);
696 barrier_data(s);
697}
698EXPORT_SYMBOL(memzero_explicit);
699
700#ifndef __HAVE_ARCH_MEMCPY
701/**
702 * memcpy - Copy one area of memory to another
703 * @dest: Where to copy to
704 * @src: Where to copy from
705 * @count: The size of the area.
706 *
707 * You should not use this function to access IO space, use memcpy_toio()
708 * or memcpy_fromio() instead.
709 */
710void *memcpy(void *dest, const void *src, size_t count)
711{
712 char *tmp = dest;
713 const char *s = src;
714
715 while (count--)
716 *tmp++ = *s++;
717 return dest;
718}
719EXPORT_SYMBOL(memcpy);
720#endif
721
722#ifndef __HAVE_ARCH_MEMMOVE
723/**
724 * memmove - Copy one area of memory to another
725 * @dest: Where to copy to
726 * @src: Where to copy from
727 * @count: The size of the area.
728 *
729 * Unlike memcpy(), memmove() copes with overlapping areas.
730 */
731void *memmove(void *dest, const void *src, size_t count)
732{
733 char *tmp;
734 const char *s;
735
736 if (dest <= src) {
737 tmp = dest;
738 s = src;
739 while (count--)
740 *tmp++ = *s++;
741 } else {
742 tmp = dest;
743 tmp += count;
744 s = src;
745 s += count;
746 while (count--)
747 *--tmp = *--s;
748 }
749 return dest;
750}
751EXPORT_SYMBOL(memmove);
752#endif
753
754#ifndef __HAVE_ARCH_MEMCMP
755/**
756 * memcmp - Compare two areas of memory
757 * @cs: One area of memory
758 * @ct: Another area of memory
759 * @count: The size of the area.
760 */
761#undef memcmp
762__visible int memcmp(const void *cs, const void *ct, size_t count)
763{
764 const unsigned char *su1, *su2;
765 int res = 0;
766
767 for (su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
768 if ((res = *su1 - *su2) != 0)
769 break;
770 return res;
771}
772EXPORT_SYMBOL(memcmp);
773#endif
774
775#ifndef __HAVE_ARCH_MEMSCAN
776/**
777 * memscan - Find a character in an area of memory.
778 * @addr: The memory area
779 * @c: The byte to search for
780 * @size: The size of the area.
781 *
782 * returns the address of the first occurrence of @c, or 1 byte past
783 * the area if @c is not found
784 */
785void *memscan(void *addr, int c, size_t size)
786{
787 unsigned char *p = addr;
788
789 while (size) {
790 if (*p == c)
791 return (void *)p;
792 p++;
793 size--;
794 }
795 return (void *)p;
796}
797EXPORT_SYMBOL(memscan);
798#endif
799
800#ifndef __HAVE_ARCH_STRSTR
801/**
802 * strstr - Find the first substring in a %NUL terminated string
803 * @s1: The string to be searched
804 * @s2: The string to search for
805 */
806char *strstr(const char *s1, const char *s2)
807{
808 size_t l1, l2;
809
810 l2 = strlen(s2);
811 if (!l2)
812 return (char *)s1;
813 l1 = strlen(s1);
814 while (l1 >= l2) {
815 l1--;
816 if (!memcmp(s1, s2, l2))
817 return (char *)s1;
818 s1++;
819 }
820 return NULL;
821}
822EXPORT_SYMBOL(strstr);
823#endif
824
825#ifndef __HAVE_ARCH_STRNSTR
826/**
827 * strnstr - Find the first substring in a length-limited string
828 * @s1: The string to be searched
829 * @s2: The string to search for
830 * @len: the maximum number of characters to search
831 */
832char *strnstr(const char *s1, const char *s2, size_t len)
833{
834 size_t l2;
835
836 l2 = strlen(s2);
837 if (!l2)
838 return (char *)s1;
839 while (len >= l2) {
840 len--;
841 if (!memcmp(s1, s2, l2))
842 return (char *)s1;
843 s1++;
844 }
845 return NULL;
846}
847EXPORT_SYMBOL(strnstr);
848#endif
849
850#ifndef __HAVE_ARCH_MEMCHR
851/**
852 * memchr - Find a character in an area of memory.
853 * @s: The memory area
854 * @c: The byte to search for
855 * @n: The size of the area.
856 *
857 * returns the address of the first occurrence of @c, or %NULL
858 * if @c is not found
859 */
860void *memchr(const void *s, int c, size_t n)
861{
862 const unsigned char *p = s;
863 while (n-- != 0) {
864 if ((unsigned char)c == *p++) {
865 return (void *)(p - 1);
866 }
867 }
868 return NULL;
869}
870EXPORT_SYMBOL(memchr);
871#endif
872
873static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes)
874{
875 while (bytes) {
876 if (*start != value)
877 return (void *)start;
878 start++;
879 bytes--;
880 }
881 return NULL;
882}
883
884/**
885 * memchr_inv - Find an unmatching character in an area of memory.
886 * @start: The memory area
887 * @c: Find a character other than c
888 * @bytes: The size of the area.
889 *
890 * returns the address of the first character other than @c, or %NULL
891 * if the whole buffer contains just @c.
892 */
893void *memchr_inv(const void *start, int c, size_t bytes)
894{
895 u8 value = c;
896 u64 value64;
897 unsigned int words, prefix;
898
899 if (bytes <= 16)
900 return check_bytes8(start, value, bytes);
901
902 value64 = value;
903#if defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER) && BITS_PER_LONG == 64
904 value64 *= 0x0101010101010101ULL;
905#elif defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER)
906 value64 *= 0x01010101;
907 value64 |= value64 << 32;
908#else
909 value64 |= value64 << 8;
910 value64 |= value64 << 16;
911 value64 |= value64 << 32;
912#endif
913
914 prefix = (unsigned long)start % 8;
915 if (prefix) {
916 u8 *r;
917
918 prefix = 8 - prefix;
919 r = check_bytes8(start, value, prefix);
920 if (r)
921 return r;
922 start += prefix;
923 bytes -= prefix;
924 }
925
926 words = bytes / 8;
927
928 while (words) {
929 if (*(u64 *)start != value64)
930 return check_bytes8(start, value, 8);
931 start += 8;
932 words--;
933 }
934
935 return check_bytes8(start, value, bytes % 8);
936}
937EXPORT_SYMBOL(memchr_inv);
938
939/**
940 * strreplace - Replace all occurrences of character in string.
941 * @s: The string to operate on.
942 * @old: The character being replaced.
943 * @new: The character @old is replaced with.
944 *
945 * Returns pointer to the nul byte at the end of @s.
946 */
947char *strreplace(char *s, char old, char new)
948{
949 for (; *s; ++s)
950 if (*s == old)
951 *s = new;
952 return s;
953}
954EXPORT_SYMBOL(strreplace);