blob: 485777c9da832002946611271e99672983481cd3 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001// SPDX-License-Identifier: GPL-2.0
Linus Torvalds1da177e2005-04-16 15:20:36 -07002/*
3 * linux/lib/string.c
4 *
5 * Copyright (C) 1991, 1992 Linus Torvalds
6 */
7
8/*
Kees Cookcfecea62021-06-18 10:57:38 -07009 * This file should be used only for "library" routines that may have
10 * alternative implementations on specific architectures (generally
11 * found in <asm-xx/string.h>), or get overloaded by FORTIFY_SOURCE.
12 * (Specifically, this file is built with __NO_FORTIFY.)
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
Kees Cookcfecea62021-06-18 10:57:38 -070014 * Other helper functions should live in string_helpers.c.
Linus Torvalds1da177e2005-04-16 15:20:36 -070015 */
16
Kees Cookcfecea62021-06-18 10:57:38 -070017#define __NO_FORTIFY
Linus Torvalds1da177e2005-04-16 15:20:36 -070018#include <linux/types.h>
19#include <linux/string.h>
20#include <linux/ctype.h>
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -050021#include <linux/kernel.h>
22#include <linux/export.h>
Paul Gortmaker50af5ea2012-01-20 18:35:53 -050023#include <linux/bug.h>
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -050024#include <linux/errno.h>
Alexander Shishkince76d932018-10-05 15:43:05 +030025#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
Linus Torvalds291d47c2021-07-21 12:01:28 -070027#include <asm/unaligned.h>
Chris Metcalf30035e42015-04-29 12:52:04 -040028#include <asm/byteorder.h>
29#include <asm/word-at-a-time.h>
30#include <asm/page.h>
31
Rasmus Villemoescd514e72014-10-13 15:54:25 -070032#ifndef __HAVE_ARCH_STRNCASECMP
Linus Torvalds1da177e2005-04-16 15:20:36 -070033/**
Rasmus Villemoescd514e72014-10-13 15:54:25 -070034 * strncasecmp - Case insensitive, length-limited string comparison
Linus Torvalds1da177e2005-04-16 15:20:36 -070035 * @s1: One string
36 * @s2: The other string
37 * @len: the maximum number of characters to compare
38 */
Rasmus Villemoescd514e72014-10-13 15:54:25 -070039int strncasecmp(const char *s1, const char *s2, size_t len)
Linus Torvalds1da177e2005-04-16 15:20:36 -070040{
41 /* Yes, Virginia, it had better be unsigned */
42 unsigned char c1, c2;
43
André Goddard Rosaa11d2b62010-03-05 13:43:11 -080044 if (!len)
45 return 0;
46
47 do {
48 c1 = *s1++;
49 c2 = *s2++;
50 if (!c1 || !c2)
51 break;
52 if (c1 == c2)
53 continue;
54 c1 = tolower(c1);
55 c2 = tolower(c2);
56 if (c1 != c2)
57 break;
58 } while (--len);
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 return (int)c1 - (int)c2;
60}
Rasmus Villemoescd514e72014-10-13 15:54:25 -070061EXPORT_SYMBOL(strncasecmp);
62#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070063
David S. Millerded220b2007-03-29 01:18:42 -070064#ifndef __HAVE_ARCH_STRCASECMP
65int strcasecmp(const char *s1, const char *s2)
66{
67 int c1, c2;
68
69 do {
70 c1 = tolower(*s1++);
71 c2 = tolower(*s2++);
72 } while (c1 == c2 && c1 != 0);
73 return c1 - c2;
74}
75EXPORT_SYMBOL(strcasecmp);
76#endif
77
Linus Torvalds1da177e2005-04-16 15:20:36 -070078#ifndef __HAVE_ARCH_STRCPY
79/**
80 * strcpy - Copy a %NUL terminated string
81 * @dest: Where to copy the string to
82 * @src: Where to copy the string from
83 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -080084char *strcpy(char *dest, const char *src)
Linus Torvalds1da177e2005-04-16 15:20:36 -070085{
86 char *tmp = dest;
87
88 while ((*dest++ = *src++) != '\0')
89 /* nothing */;
90 return tmp;
91}
92EXPORT_SYMBOL(strcpy);
93#endif
94
95#ifndef __HAVE_ARCH_STRNCPY
96/**
Dan Carpenter0046dd92014-06-04 16:11:47 -070097 * strncpy - Copy a length-limited, C-string
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 * @dest: Where to copy the string to
99 * @src: Where to copy the string from
100 * @count: The maximum number of bytes to copy
101 *
102 * The result is not %NUL-terminated if the source exceeds
103 * @count bytes.
walter harms25279522005-05-05 16:16:20 -0700104 *
105 * In the case where the length of @src is less than that of
106 * count, the remainder of @dest will be padded with %NUL.
107 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800109char *strncpy(char *dest, const char *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110{
111 char *tmp = dest;
112
113 while (count) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800114 if ((*tmp = *src) != 0)
115 src++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116 tmp++;
117 count--;
118 }
119 return dest;
120}
121EXPORT_SYMBOL(strncpy);
122#endif
123
124#ifndef __HAVE_ARCH_STRLCPY
125/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700126 * strlcpy - Copy a C-string into a sized buffer
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 * @dest: Where to copy the string to
128 * @src: Where to copy the string from
129 * @size: size of destination buffer
130 *
mchehab@s-opensource.com0e056eb2017-03-30 17:11:36 -0300131 * Compatible with ``*BSD``: the result is always a valid
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 * NUL-terminated string that fits in the buffer (unless,
133 * of course, the buffer size is zero). It does not pad
134 * out the result like strncpy() does.
135 */
136size_t strlcpy(char *dest, const char *src, size_t size)
137{
138 size_t ret = strlen(src);
139
140 if (size) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800141 size_t len = (ret >= size) ? size - 1 : ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 memcpy(dest, src, len);
143 dest[len] = '\0';
144 }
145 return ret;
146}
147EXPORT_SYMBOL(strlcpy);
148#endif
149
Chris Metcalf30035e42015-04-29 12:52:04 -0400150#ifndef __HAVE_ARCH_STRSCPY
151/**
152 * strscpy - Copy a C-string into a sized buffer
153 * @dest: Where to copy the string to
154 * @src: Where to copy the string from
155 * @count: Size of destination buffer
156 *
Tobin C. Harding458a3bf2019-04-05 12:58:58 +1100157 * Copy the string, or as much of it as fits, into the dest buffer. The
158 * behavior is undefined if the string buffers overlap. The destination
159 * buffer is always NUL terminated, unless it's zero-sized.
Chris Metcalf30035e42015-04-29 12:52:04 -0400160 *
161 * Preferred to strlcpy() since the API doesn't require reading memory
162 * from the src string beyond the specified "count" bytes, and since
163 * the return value is easier to error-check than strlcpy()'s.
164 * In addition, the implementation is robust to the string changing out
165 * from underneath it, unlike the current strlcpy() implementation.
166 *
167 * Preferred to strncpy() since it always returns a valid string, and
168 * doesn't unnecessarily force the tail of the destination buffer to be
Tobin C. Harding458a3bf2019-04-05 12:58:58 +1100169 * zeroed. If zeroing is desired please use strscpy_pad().
170 *
Joe Perches917cda22019-09-25 16:46:13 -0700171 * Returns:
172 * * The number of characters copied (not including the trailing %NUL)
173 * * -E2BIG if count is 0 or @src was truncated.
Chris Metcalf30035e42015-04-29 12:52:04 -0400174 */
175ssize_t strscpy(char *dest, const char *src, size_t count)
176{
177 const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
178 size_t max = count;
179 long res = 0;
180
Kees Cook9a156462019-09-25 16:46:20 -0700181 if (count == 0 || WARN_ON_ONCE(count > INT_MAX))
Chris Metcalf30035e42015-04-29 12:52:04 -0400182 return -E2BIG;
183
184#ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
185 /*
186 * If src is unaligned, don't cross a page boundary,
187 * since we don't know if the next page is mapped.
188 */
189 if ((long)src & (sizeof(long) - 1)) {
190 size_t limit = PAGE_SIZE - ((long)src & (PAGE_SIZE - 1));
191 if (limit < max)
192 max = limit;
193 }
194#else
195 /* If src or dest is unaligned, don't do word-at-a-time. */
196 if (((long) dest | (long) src) & (sizeof(long) - 1))
197 max = 0;
198#endif
199
200 while (max >= sizeof(unsigned long)) {
201 unsigned long c, data;
202
Andrey Ryabinin1a3241f2018-02-01 21:00:50 +0300203 c = read_word_at_a_time(src+res);
Chris Metcalf30035e42015-04-29 12:52:04 -0400204 if (has_zero(c, &data, &constants)) {
205 data = prep_zero_mask(c, data, &constants);
206 data = create_zero_mask(data);
Chris Metcalf990486c2015-10-06 12:37:41 -0400207 *(unsigned long *)(dest+res) = c & zero_bytemask(data);
Chris Metcalf30035e42015-04-29 12:52:04 -0400208 return res + find_zero(data);
209 }
Chris Metcalf990486c2015-10-06 12:37:41 -0400210 *(unsigned long *)(dest+res) = c;
Chris Metcalf30035e42015-04-29 12:52:04 -0400211 res += sizeof(unsigned long);
212 count -= sizeof(unsigned long);
213 max -= sizeof(unsigned long);
214 }
215
216 while (count) {
217 char c;
218
219 c = src[res];
220 dest[res] = c;
221 if (!c)
222 return res;
223 res++;
224 count--;
225 }
226
227 /* Hit buffer length without finding a NUL; force NUL-termination. */
228 if (res)
229 dest[res-1] = '\0';
230
231 return -E2BIG;
232}
233EXPORT_SYMBOL(strscpy);
234#endif
235
Tobin C. Harding458a3bf2019-04-05 12:58:58 +1100236/**
Nick Desaulniers1e1b6d62020-09-25 21:19:18 -0700237 * stpcpy - copy a string from src to dest returning a pointer to the new end
238 * of dest, including src's %NUL-terminator. May overrun dest.
239 * @dest: pointer to end of string being copied into. Must be large enough
240 * to receive copy.
241 * @src: pointer to the beginning of string being copied from. Must not overlap
242 * dest.
243 *
244 * stpcpy differs from strcpy in a key way: the return value is a pointer
245 * to the new %NUL-terminating character in @dest. (For strcpy, the return
246 * value is a pointer to the start of @dest). This interface is considered
247 * unsafe as it doesn't perform bounds checking of the inputs. As such it's
248 * not recommended for usage. Instead, its definition is provided in case
249 * the compiler lowers other libcalls to stpcpy.
250 */
251char *stpcpy(char *__restrict__ dest, const char *__restrict__ src);
252char *stpcpy(char *__restrict__ dest, const char *__restrict__ src)
253{
254 while ((*dest++ = *src++) != '\0')
255 /* nothing */;
256 return --dest;
257}
258EXPORT_SYMBOL(stpcpy);
259
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260#ifndef __HAVE_ARCH_STRCAT
261/**
262 * strcat - Append one %NUL-terminated string to another
263 * @dest: The string to be appended to
264 * @src: The string to append to it
265 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800266char *strcat(char *dest, const char *src)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267{
268 char *tmp = dest;
269
270 while (*dest)
271 dest++;
272 while ((*dest++ = *src++) != '\0')
273 ;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 return tmp;
275}
276EXPORT_SYMBOL(strcat);
277#endif
278
279#ifndef __HAVE_ARCH_STRNCAT
280/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700281 * strncat - Append a length-limited, C-string to another
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 * @dest: The string to be appended to
283 * @src: The string to append to it
284 * @count: The maximum numbers of bytes to copy
285 *
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800286 * Note that in contrast to strncpy(), strncat() ensures the result is
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287 * terminated.
288 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800289char *strncat(char *dest, const char *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290{
291 char *tmp = dest;
292
293 if (count) {
294 while (*dest)
295 dest++;
296 while ((*dest++ = *src++) != 0) {
297 if (--count == 0) {
298 *dest = '\0';
299 break;
300 }
301 }
302 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 return tmp;
304}
305EXPORT_SYMBOL(strncat);
306#endif
307
308#ifndef __HAVE_ARCH_STRLCAT
309/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700310 * strlcat - Append a length-limited, C-string to another
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311 * @dest: The string to be appended to
312 * @src: The string to append to it
313 * @count: The size of the destination buffer.
314 */
315size_t strlcat(char *dest, const char *src, size_t count)
316{
317 size_t dsize = strlen(dest);
318 size_t len = strlen(src);
319 size_t res = dsize + len;
320
321 /* This would be a bug */
322 BUG_ON(dsize >= count);
323
324 dest += dsize;
325 count -= dsize;
326 if (len >= count)
327 len = count-1;
328 memcpy(dest, src, len);
329 dest[len] = 0;
330 return res;
331}
332EXPORT_SYMBOL(strlcat);
333#endif
334
335#ifndef __HAVE_ARCH_STRCMP
336/**
337 * strcmp - Compare two strings
338 * @cs: One string
339 * @ct: Another string
340 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800341int strcmp(const char *cs, const char *ct)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342{
Linus Torvaldsa414f012009-11-18 22:31:52 +0100343 unsigned char c1, c2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344
345 while (1) {
Linus Torvaldsa414f012009-11-18 22:31:52 +0100346 c1 = *cs++;
347 c2 = *ct++;
348 if (c1 != c2)
349 return c1 < c2 ? -1 : 1;
350 if (!c1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 break;
352 }
Linus Torvaldsa414f012009-11-18 22:31:52 +0100353 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354}
355EXPORT_SYMBOL(strcmp);
356#endif
357
358#ifndef __HAVE_ARCH_STRNCMP
359/**
360 * strncmp - Compare two length-limited strings
361 * @cs: One string
362 * @ct: Another string
363 * @count: The maximum number of bytes to compare
364 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800365int strncmp(const char *cs, const char *ct, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366{
Linus Torvaldsa414f012009-11-18 22:31:52 +0100367 unsigned char c1, c2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368
369 while (count) {
Linus Torvaldsa414f012009-11-18 22:31:52 +0100370 c1 = *cs++;
371 c2 = *ct++;
372 if (c1 != c2)
373 return c1 < c2 ? -1 : 1;
374 if (!c1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375 break;
376 count--;
377 }
Linus Torvaldsa414f012009-11-18 22:31:52 +0100378 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379}
380EXPORT_SYMBOL(strncmp);
381#endif
382
383#ifndef __HAVE_ARCH_STRCHR
384/**
385 * strchr - Find the first occurrence of a character in a string
386 * @s: The string to be searched
387 * @c: The character to search for
Peter Rosinb0975712019-07-16 16:27:15 -0700388 *
389 * Note that the %NUL-terminator is considered part of the string, and can
390 * be searched for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800392char *strchr(const char *s, int c)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393{
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800394 for (; *s != (char)c; ++s)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395 if (*s == '\0')
396 return NULL;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800397 return (char *)s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398}
399EXPORT_SYMBOL(strchr);
400#endif
401
Grant Likely11d200e2014-03-14 17:00:14 +0000402#ifndef __HAVE_ARCH_STRCHRNUL
403/**
404 * strchrnul - Find and return a character in a string, or end of string
405 * @s: The string to be searched
406 * @c: The character to search for
407 *
408 * Returns pointer to first occurrence of 'c' in s. If c is not found, then
409 * return a pointer to the null byte at the end of s.
410 */
411char *strchrnul(const char *s, int c)
412{
413 while (*s && *s != (char)c)
414 s++;
415 return (char *)s;
416}
417EXPORT_SYMBOL(strchrnul);
418#endif
419
Yury Norov0bee0ce2020-02-03 17:37:20 -0800420/**
421 * strnchrnul - Find and return a character in a length limited string,
422 * or end of string
423 * @s: The string to be searched
424 * @count: The number of characters to be searched
425 * @c: The character to search for
426 *
427 * Returns pointer to the first occurrence of 'c' in s. If c is not found,
428 * then return a pointer to the last character of the string.
429 */
430char *strnchrnul(const char *s, size_t count, int c)
431{
432 while (count-- && *s && *s != (char)c)
433 s++;
434 return (char *)s;
435}
436
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437#ifndef __HAVE_ARCH_STRRCHR
438/**
439 * strrchr - Find the last occurrence of a character in a string
440 * @s: The string to be searched
441 * @c: The character to search for
442 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800443char *strrchr(const char *s, int c)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444{
Rasmus Villemoes8da53d42015-02-13 14:36:44 -0800445 const char *last = NULL;
446 do {
447 if (*s == (char)c)
448 last = s;
449 } while (*s++);
450 return (char *)last;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451}
452EXPORT_SYMBOL(strrchr);
453#endif
454
455#ifndef __HAVE_ARCH_STRNCHR
456/**
457 * strnchr - Find a character in a length limited string
458 * @s: The string to be searched
459 * @count: The number of characters to be searched
460 * @c: The character to search for
Peter Rosinb0975712019-07-16 16:27:15 -0700461 *
462 * Note that the %NUL-terminator is considered part of the string, and can
463 * be searched for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 */
465char *strnchr(const char *s, size_t count, int c)
466{
Peter Rosinb0975712019-07-16 16:27:15 -0700467 while (count--) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800468 if (*s == (char)c)
469 return (char *)s;
Peter Rosinb0975712019-07-16 16:27:15 -0700470 if (*s++ == '\0')
471 break;
472 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473 return NULL;
474}
475EXPORT_SYMBOL(strnchr);
476#endif
477
478#ifndef __HAVE_ARCH_STRLEN
479/**
480 * strlen - Find the length of a string
481 * @s: The string to be sized
482 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800483size_t strlen(const char *s)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484{
485 const char *sc;
486
487 for (sc = s; *sc != '\0'; ++sc)
488 /* nothing */;
489 return sc - s;
490}
491EXPORT_SYMBOL(strlen);
492#endif
493
494#ifndef __HAVE_ARCH_STRNLEN
495/**
496 * strnlen - Find the length of a length-limited string
497 * @s: The string to be sized
498 * @count: The maximum number of bytes to search
499 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800500size_t strnlen(const char *s, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501{
502 const char *sc;
503
504 for (sc = s; count-- && *sc != '\0'; ++sc)
505 /* nothing */;
506 return sc - s;
507}
508EXPORT_SYMBOL(strnlen);
509#endif
510
511#ifndef __HAVE_ARCH_STRSPN
512/**
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800513 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514 * @s: The string to be searched
515 * @accept: The string to search for
516 */
517size_t strspn(const char *s, const char *accept)
518{
519 const char *p;
520 const char *a;
521 size_t count = 0;
522
523 for (p = s; *p != '\0'; ++p) {
524 for (a = accept; *a != '\0'; ++a) {
525 if (*p == *a)
526 break;
527 }
528 if (*a == '\0')
529 return count;
530 ++count;
531 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 return count;
533}
534
535EXPORT_SYMBOL(strspn);
536#endif
537
Kyle McMartin8833d322006-04-10 22:53:57 -0700538#ifndef __HAVE_ARCH_STRCSPN
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539/**
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800540 * strcspn - Calculate the length of the initial substring of @s which does not contain letters in @reject
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541 * @s: The string to be searched
542 * @reject: The string to avoid
543 */
544size_t strcspn(const char *s, const char *reject)
545{
546 const char *p;
547 const char *r;
548 size_t count = 0;
549
550 for (p = s; *p != '\0'; ++p) {
551 for (r = reject; *r != '\0'; ++r) {
552 if (*p == *r)
553 return count;
554 }
555 ++count;
556 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700557 return count;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800558}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559EXPORT_SYMBOL(strcspn);
Kyle McMartin8833d322006-04-10 22:53:57 -0700560#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561
562#ifndef __HAVE_ARCH_STRPBRK
563/**
564 * strpbrk - Find the first occurrence of a set of characters
565 * @cs: The string to be searched
566 * @ct: The characters to search for
567 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800568char *strpbrk(const char *cs, const char *ct)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569{
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800570 const char *sc1, *sc2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700571
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800572 for (sc1 = cs; *sc1 != '\0'; ++sc1) {
573 for (sc2 = ct; *sc2 != '\0'; ++sc2) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574 if (*sc1 == *sc2)
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800575 return (char *)sc1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700576 }
577 }
578 return NULL;
579}
Kyle McMartin894b5772006-04-10 22:53:56 -0700580EXPORT_SYMBOL(strpbrk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700581#endif
582
583#ifndef __HAVE_ARCH_STRSEP
584/**
585 * strsep - Split a string into tokens
586 * @s: The string to be searched
587 * @ct: The characters to search for
588 *
589 * strsep() updates @s to point after the token, ready for the next call.
590 *
591 * It returns empty tokens, too, behaving exactly like the libc function
592 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
593 * Same semantics, slimmer shape. ;)
594 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800595char *strsep(char **s, const char *ct)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596{
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800597 char *sbegin = *s;
598 char *end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599
600 if (sbegin == NULL)
601 return NULL;
602
603 end = strpbrk(sbegin, ct);
604 if (end)
605 *end++ = '\0';
606 *s = end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607 return sbegin;
608}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609EXPORT_SYMBOL(strsep);
610#endif
611
612#ifndef __HAVE_ARCH_MEMSET
613/**
614 * memset - Fill a region of memory with the given value
615 * @s: Pointer to the start of the area.
616 * @c: The byte to fill the area with
617 * @count: The size of the area.
618 *
619 * Do not use memset() to access IO space, use memset_io() instead.
620 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800621void *memset(void *s, int c, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700622{
Jesper Juhl850b9242005-10-30 15:02:13 -0800623 char *xs = s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624
625 while (count--)
626 *xs++ = c;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627 return s;
628}
629EXPORT_SYMBOL(memset);
630#endif
631
Matthew Wilcox3b3c4ba2017-09-08 16:13:48 -0700632#ifndef __HAVE_ARCH_MEMSET16
633/**
634 * memset16() - Fill a memory area with a uint16_t
635 * @s: Pointer to the start of the area.
636 * @v: The value to fill the area with
637 * @count: The number of values to store
638 *
639 * Differs from memset() in that it fills with a uint16_t instead
640 * of a byte. Remember that @count is the number of uint16_ts to
641 * store, not the number of bytes.
642 */
643void *memset16(uint16_t *s, uint16_t v, size_t count)
644{
645 uint16_t *xs = s;
646
647 while (count--)
648 *xs++ = v;
649 return s;
650}
651EXPORT_SYMBOL(memset16);
652#endif
653
654#ifndef __HAVE_ARCH_MEMSET32
655/**
656 * memset32() - Fill a memory area with a uint32_t
657 * @s: Pointer to the start of the area.
658 * @v: The value to fill the area with
659 * @count: The number of values to store
660 *
661 * Differs from memset() in that it fills with a uint32_t instead
662 * of a byte. Remember that @count is the number of uint32_ts to
663 * store, not the number of bytes.
664 */
665void *memset32(uint32_t *s, uint32_t v, size_t count)
666{
667 uint32_t *xs = s;
668
669 while (count--)
670 *xs++ = v;
671 return s;
672}
673EXPORT_SYMBOL(memset32);
674#endif
675
676#ifndef __HAVE_ARCH_MEMSET64
677/**
678 * memset64() - Fill a memory area with a uint64_t
679 * @s: Pointer to the start of the area.
680 * @v: The value to fill the area with
681 * @count: The number of values to store
682 *
683 * Differs from memset() in that it fills with a uint64_t instead
684 * of a byte. Remember that @count is the number of uint64_ts to
685 * store, not the number of bytes.
686 */
687void *memset64(uint64_t *s, uint64_t v, size_t count)
688{
689 uint64_t *xs = s;
690
691 while (count--)
692 *xs++ = v;
693 return s;
694}
695EXPORT_SYMBOL(memset64);
696#endif
697
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698#ifndef __HAVE_ARCH_MEMCPY
699/**
700 * memcpy - Copy one area of memory to another
701 * @dest: Where to copy to
702 * @src: Where to copy from
703 * @count: The size of the area.
704 *
705 * You should not use this function to access IO space, use memcpy_toio()
706 * or memcpy_fromio() instead.
707 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800708void *memcpy(void *dest, const void *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700709{
Jesper Juhl850b9242005-10-30 15:02:13 -0800710 char *tmp = dest;
Jan-Benedict Glaw4c416ab2006-04-10 22:54:09 -0700711 const char *s = src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712
713 while (count--)
714 *tmp++ = *s++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715 return dest;
716}
717EXPORT_SYMBOL(memcpy);
718#endif
719
720#ifndef __HAVE_ARCH_MEMMOVE
721/**
722 * memmove - Copy one area of memory to another
723 * @dest: Where to copy to
724 * @src: Where to copy from
725 * @count: The size of the area.
726 *
727 * Unlike memcpy(), memmove() copes with overlapping areas.
728 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800729void *memmove(void *dest, const void *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730{
Paul Jackson82da2c32005-10-30 15:03:19 -0800731 char *tmp;
732 const char *s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733
734 if (dest <= src) {
Jesper Juhl850b9242005-10-30 15:02:13 -0800735 tmp = dest;
736 s = src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700737 while (count--)
738 *tmp++ = *s++;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800739 } else {
Jesper Juhl850b9242005-10-30 15:02:13 -0800740 tmp = dest;
741 tmp += count;
742 s = src;
743 s += count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744 while (count--)
745 *--tmp = *--s;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800746 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747 return dest;
748}
749EXPORT_SYMBOL(memmove);
750#endif
751
752#ifndef __HAVE_ARCH_MEMCMP
753/**
754 * memcmp - Compare two areas of memory
755 * @cs: One area of memory
756 * @ct: Another area of memory
757 * @count: The size of the area.
758 */
Paolo 'Blaisorblade' Giarrusso0c281302005-05-05 16:15:17 -0700759#undef memcmp
Andi Kleena7330c92014-02-08 08:52:06 +0100760__visible int memcmp(const void *cs, const void *ct, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700761{
762 const unsigned char *su1, *su2;
763 int res = 0;
764
Linus Torvalds291d47c2021-07-21 12:01:28 -0700765#ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
766 if (count >= sizeof(unsigned long)) {
767 const unsigned long *u1 = cs;
768 const unsigned long *u2 = ct;
769 do {
770 if (get_unaligned(u1) != get_unaligned(u2))
771 break;
772 u1++;
773 u2++;
774 count -= sizeof(unsigned long);
775 } while (count >= sizeof(unsigned long));
776 cs = u1;
777 ct = u2;
778 }
779#endif
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800780 for (su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781 if ((res = *su1 - *su2) != 0)
782 break;
783 return res;
784}
785EXPORT_SYMBOL(memcmp);
786#endif
787
Nick Desaulniers5f074f32019-04-05 18:38:45 -0700788#ifndef __HAVE_ARCH_BCMP
789/**
790 * bcmp - returns 0 if and only if the buffers have identical contents.
791 * @a: pointer to first buffer.
792 * @b: pointer to second buffer.
793 * @len: size of buffers.
794 *
795 * The sign or magnitude of a non-zero return value has no particular
796 * meaning, and architectures may implement their own more efficient bcmp(). So
797 * while this particular implementation is a simple (tail) call to memcmp, do
798 * not rely on anything but whether the return value is zero or non-zero.
799 */
Nick Desaulniers5f074f32019-04-05 18:38:45 -0700800int bcmp(const void *a, const void *b, size_t len)
801{
802 return memcmp(a, b, len);
803}
804EXPORT_SYMBOL(bcmp);
805#endif
806
Linus Torvalds1da177e2005-04-16 15:20:36 -0700807#ifndef __HAVE_ARCH_MEMSCAN
808/**
809 * memscan - Find a character in an area of memory.
810 * @addr: The memory area
811 * @c: The byte to search for
812 * @size: The size of the area.
813 *
814 * returns the address of the first occurrence of @c, or 1 byte past
815 * the area if @c is not found
816 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800817void *memscan(void *addr, int c, size_t size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700818{
Jesper Juhl850b9242005-10-30 15:02:13 -0800819 unsigned char *p = addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820
821 while (size) {
Alexey Dobriyan1a58be62021-06-30 18:56:01 -0700822 if (*p == (unsigned char)c)
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800823 return (void *)p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700824 p++;
825 size--;
826 }
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800827 return (void *)p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700828}
829EXPORT_SYMBOL(memscan);
830#endif
831
832#ifndef __HAVE_ARCH_STRSTR
833/**
834 * strstr - Find the first substring in a %NUL terminated string
835 * @s1: The string to be searched
836 * @s2: The string to search for
837 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800838char *strstr(const char *s1, const char *s2)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700839{
Li Zefand5f1fb52010-01-14 10:53:55 +0800840 size_t l1, l2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700841
842 l2 = strlen(s2);
843 if (!l2)
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800844 return (char *)s1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700845 l1 = strlen(s1);
846 while (l1 >= l2) {
847 l1--;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800848 if (!memcmp(s1, s2, l2))
849 return (char *)s1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700850 s1++;
851 }
852 return NULL;
853}
854EXPORT_SYMBOL(strstr);
855#endif
856
Li Zefand5f1fb52010-01-14 10:53:55 +0800857#ifndef __HAVE_ARCH_STRNSTR
858/**
859 * strnstr - Find the first substring in a length-limited string
860 * @s1: The string to be searched
861 * @s2: The string to search for
862 * @len: the maximum number of characters to search
863 */
864char *strnstr(const char *s1, const char *s2, size_t len)
865{
André Goddard Rosad6a2eed2010-03-05 13:43:12 -0800866 size_t l2;
Li Zefand5f1fb52010-01-14 10:53:55 +0800867
868 l2 = strlen(s2);
869 if (!l2)
870 return (char *)s1;
André Goddard Rosad6a2eed2010-03-05 13:43:12 -0800871 while (len >= l2) {
872 len--;
Li Zefand5f1fb52010-01-14 10:53:55 +0800873 if (!memcmp(s1, s2, l2))
874 return (char *)s1;
875 s1++;
876 }
877 return NULL;
878}
879EXPORT_SYMBOL(strnstr);
880#endif
881
Linus Torvalds1da177e2005-04-16 15:20:36 -0700882#ifndef __HAVE_ARCH_MEMCHR
883/**
884 * memchr - Find a character in an area of memory.
885 * @s: The memory area
886 * @c: The byte to search for
887 * @n: The size of the area.
888 *
889 * returns the address of the first occurrence of @c, or %NULL
890 * if @c is not found
891 */
892void *memchr(const void *s, int c, size_t n)
893{
894 const unsigned char *p = s;
895 while (n-- != 0) {
896 if ((unsigned char)c == *p++) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800897 return (void *)(p - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700898 }
899 }
900 return NULL;
901}
902EXPORT_SYMBOL(memchr);
903#endif
Akinobu Mita798248202011-10-31 17:08:07 -0700904
905static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes)
906{
907 while (bytes) {
908 if (*start != value)
909 return (void *)start;
910 start++;
911 bytes--;
912 }
913 return NULL;
914}
915
916/**
917 * memchr_inv - Find an unmatching character in an area of memory.
918 * @start: The memory area
919 * @c: Find a character other than c
920 * @bytes: The size of the area.
921 *
922 * returns the address of the first character other than @c, or %NULL
923 * if the whole buffer contains just @c.
924 */
925void *memchr_inv(const void *start, int c, size_t bytes)
926{
927 u8 value = c;
928 u64 value64;
929 unsigned int words, prefix;
930
931 if (bytes <= 16)
932 return check_bytes8(start, value, bytes);
933
Akinobu Mitaf43804b2012-03-23 15:02:14 -0700934 value64 = value;
Linus Torvalds72d93102014-09-13 11:14:53 -0700935#if defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER) && BITS_PER_LONG == 64
Andy Shevchenko3368e8f2015-11-10 14:45:14 -0800936 value64 *= 0x0101010101010101ULL;
Linus Torvalds72d93102014-09-13 11:14:53 -0700937#elif defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER)
Akinobu Mitaf43804b2012-03-23 15:02:14 -0700938 value64 *= 0x01010101;
939 value64 |= value64 << 32;
940#else
941 value64 |= value64 << 8;
942 value64 |= value64 << 16;
943 value64 |= value64 << 32;
944#endif
Akinobu Mita798248202011-10-31 17:08:07 -0700945
Akinobu Mitaf43804b2012-03-23 15:02:14 -0700946 prefix = (unsigned long)start % 8;
Akinobu Mita798248202011-10-31 17:08:07 -0700947 if (prefix) {
Akinobu Mitaf43804b2012-03-23 15:02:14 -0700948 u8 *r;
949
950 prefix = 8 - prefix;
951 r = check_bytes8(start, value, prefix);
Akinobu Mita798248202011-10-31 17:08:07 -0700952 if (r)
953 return r;
954 start += prefix;
955 bytes -= prefix;
956 }
957
958 words = bytes / 8;
959
960 while (words) {
961 if (*(u64 *)start != value64)
962 return check_bytes8(start, value, 8);
963 start += 8;
964 words--;
965 }
966
967 return check_bytes8(start, value, bytes % 8);
968}
969EXPORT_SYMBOL(memchr_inv);