blob: 461fb620f85f315afcc2ad9577d510ddf039fb68 [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/*
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>
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -050026#include <linux/kernel.h>
27#include <linux/export.h>
Paul Gortmaker50af5ea2012-01-20 18:35:53 -050028#include <linux/bug.h>
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -050029#include <linux/errno.h>
Alexander Shishkince76d932018-10-05 15:43:05 +030030#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070031
Chris Metcalf30035e42015-04-29 12:52:04 -040032#include <asm/byteorder.h>
33#include <asm/word-at-a-time.h>
34#include <asm/page.h>
35
Rasmus Villemoescd514e72014-10-13 15:54:25 -070036#ifndef __HAVE_ARCH_STRNCASECMP
Linus Torvalds1da177e2005-04-16 15:20:36 -070037/**
Rasmus Villemoescd514e72014-10-13 15:54:25 -070038 * strncasecmp - Case insensitive, length-limited string comparison
Linus Torvalds1da177e2005-04-16 15:20:36 -070039 * @s1: One string
40 * @s2: The other string
41 * @len: the maximum number of characters to compare
42 */
Rasmus Villemoescd514e72014-10-13 15:54:25 -070043int strncasecmp(const char *s1, const char *s2, size_t len)
Linus Torvalds1da177e2005-04-16 15:20:36 -070044{
45 /* Yes, Virginia, it had better be unsigned */
46 unsigned char c1, c2;
47
André Goddard Rosaa11d2b62010-03-05 13:43:11 -080048 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);
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 return (int)c1 - (int)c2;
64}
Rasmus Villemoescd514e72014-10-13 15:54:25 -070065EXPORT_SYMBOL(strncasecmp);
66#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070067
David S. Millerded220b2007-03-29 01:18:42 -070068#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
Linus Torvalds1da177e2005-04-16 15:20:36 -070082#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 */
Paolo 'Blaisorblade' Giarrusso0c281302005-05-05 16:15:17 -070088#undef strcpy
Jesper Juhl51a0f0f2005-10-30 15:02:11 -080089char *strcpy(char *dest, const char *src)
Linus Torvalds1da177e2005-04-16 15:20:36 -070090{
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/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700102 * strncpy - Copy a length-limited, C-string
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 * @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.
walter harms25279522005-05-05 16:16:20 -0700109 *
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 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800114char *strncpy(char *dest, const char *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115{
116 char *tmp = dest;
117
118 while (count) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800119 if ((*tmp = *src) != 0)
120 src++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 tmp++;
122 count--;
123 }
124 return dest;
125}
126EXPORT_SYMBOL(strncpy);
127#endif
128
129#ifndef __HAVE_ARCH_STRLCPY
130/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700131 * strlcpy - Copy a C-string into a sized buffer
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 * @dest: Where to copy the string to
133 * @src: Where to copy the string from
134 * @size: size of destination buffer
135 *
mchehab@s-opensource.com0e056eb2017-03-30 17:11:36 -0300136 * Compatible with ``*BSD``: the result is always a valid
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137 * 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) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800146 size_t len = (ret >= size) ? size - 1 : ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147 memcpy(dest, src, len);
148 dest[len] = '\0';
149 }
150 return ret;
151}
152EXPORT_SYMBOL(strlcpy);
153#endif
154
Chris Metcalf30035e42015-04-29 12:52:04 -0400155#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 *
Tobin C. Harding458a3bf2019-04-05 12:58:58 +1100162 * 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.
Chris Metcalf30035e42015-04-29 12:52:04 -0400165 *
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
Tobin C. Harding458a3bf2019-04-05 12:58:58 +1100174 * zeroed. If zeroing is desired please use strscpy_pad().
175 *
176 * Return: The number of characters copied (not including the trailing
177 * %NUL) or -E2BIG if the destination buffer wasn't big enough.
Chris Metcalf30035e42015-04-29 12:52:04 -0400178 */
179ssize_t strscpy(char *dest, const char *src, size_t count)
180{
181 const struct word_at_a_time constants = WORD_AT_A_TIME_CONSTANTS;
182 size_t max = count;
183 long res = 0;
184
185 if (count == 0)
186 return -E2BIG;
187
188#ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
189 /*
190 * If src is unaligned, don't cross a page boundary,
191 * since we don't know if the next page is mapped.
192 */
193 if ((long)src & (sizeof(long) - 1)) {
194 size_t limit = PAGE_SIZE - ((long)src & (PAGE_SIZE - 1));
195 if (limit < max)
196 max = limit;
197 }
198#else
199 /* If src or dest is unaligned, don't do word-at-a-time. */
200 if (((long) dest | (long) src) & (sizeof(long) - 1))
201 max = 0;
202#endif
203
204 while (max >= sizeof(unsigned long)) {
205 unsigned long c, data;
206
Andrey Ryabinin1a3241f2018-02-01 21:00:50 +0300207 c = read_word_at_a_time(src+res);
Chris Metcalf30035e42015-04-29 12:52:04 -0400208 if (has_zero(c, &data, &constants)) {
209 data = prep_zero_mask(c, data, &constants);
210 data = create_zero_mask(data);
Chris Metcalf990486c2015-10-06 12:37:41 -0400211 *(unsigned long *)(dest+res) = c & zero_bytemask(data);
Chris Metcalf30035e42015-04-29 12:52:04 -0400212 return res + find_zero(data);
213 }
Chris Metcalf990486c2015-10-06 12:37:41 -0400214 *(unsigned long *)(dest+res) = c;
Chris Metcalf30035e42015-04-29 12:52:04 -0400215 res += sizeof(unsigned long);
216 count -= sizeof(unsigned long);
217 max -= sizeof(unsigned long);
218 }
219
220 while (count) {
221 char c;
222
223 c = src[res];
224 dest[res] = c;
225 if (!c)
226 return res;
227 res++;
228 count--;
229 }
230
231 /* Hit buffer length without finding a NUL; force NUL-termination. */
232 if (res)
233 dest[res-1] = '\0';
234
235 return -E2BIG;
236}
237EXPORT_SYMBOL(strscpy);
238#endif
239
Tobin C. Harding458a3bf2019-04-05 12:58:58 +1100240/**
241 * strscpy_pad() - Copy a C-string into a sized buffer
242 * @dest: Where to copy the string to
243 * @src: Where to copy the string from
244 * @count: Size of destination buffer
245 *
246 * Copy the string, or as much of it as fits, into the dest buffer. The
247 * behavior is undefined if the string buffers overlap. The destination
248 * buffer is always %NUL terminated, unless it's zero-sized.
249 *
250 * If the source string is shorter than the destination buffer, zeros
251 * the tail of the destination buffer.
252 *
253 * For full explanation of why you may want to consider using the
254 * 'strscpy' functions please see the function docstring for strscpy().
255 *
256 * Return: The number of characters copied (not including the trailing
257 * %NUL) or -E2BIG if the destination buffer wasn't big enough.
258 */
259ssize_t strscpy_pad(char *dest, const char *src, size_t count)
260{
261 ssize_t written;
262
263 written = strscpy(dest, src, count);
264 if (written < 0 || written == count - 1)
265 return written;
266
267 memset(dest + written + 1, 0, count - written - 1);
268
269 return written;
270}
271EXPORT_SYMBOL(strscpy_pad);
272
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273#ifndef __HAVE_ARCH_STRCAT
274/**
275 * strcat - Append one %NUL-terminated string to another
276 * @dest: The string to be appended to
277 * @src: The string to append to it
278 */
Paolo 'Blaisorblade' Giarrusso0c281302005-05-05 16:15:17 -0700279#undef strcat
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800280char *strcat(char *dest, const char *src)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281{
282 char *tmp = dest;
283
284 while (*dest)
285 dest++;
286 while ((*dest++ = *src++) != '\0')
287 ;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288 return tmp;
289}
290EXPORT_SYMBOL(strcat);
291#endif
292
293#ifndef __HAVE_ARCH_STRNCAT
294/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700295 * strncat - Append a length-limited, C-string to another
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296 * @dest: The string to be appended to
297 * @src: The string to append to it
298 * @count: The maximum numbers of bytes to copy
299 *
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800300 * Note that in contrast to strncpy(), strncat() ensures the result is
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301 * terminated.
302 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800303char *strncat(char *dest, const char *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304{
305 char *tmp = dest;
306
307 if (count) {
308 while (*dest)
309 dest++;
310 while ((*dest++ = *src++) != 0) {
311 if (--count == 0) {
312 *dest = '\0';
313 break;
314 }
315 }
316 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 return tmp;
318}
319EXPORT_SYMBOL(strncat);
320#endif
321
322#ifndef __HAVE_ARCH_STRLCAT
323/**
Dan Carpenter0046dd92014-06-04 16:11:47 -0700324 * strlcat - Append a length-limited, C-string to another
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325 * @dest: The string to be appended to
326 * @src: The string to append to it
327 * @count: The size of the destination buffer.
328 */
329size_t strlcat(char *dest, const char *src, size_t count)
330{
331 size_t dsize = strlen(dest);
332 size_t len = strlen(src);
333 size_t res = dsize + len;
334
335 /* This would be a bug */
336 BUG_ON(dsize >= count);
337
338 dest += dsize;
339 count -= dsize;
340 if (len >= count)
341 len = count-1;
342 memcpy(dest, src, len);
343 dest[len] = 0;
344 return res;
345}
346EXPORT_SYMBOL(strlcat);
347#endif
348
349#ifndef __HAVE_ARCH_STRCMP
350/**
351 * strcmp - Compare two strings
352 * @cs: One string
353 * @ct: Another string
354 */
Paolo 'Blaisorblade' Giarrusso0c281302005-05-05 16:15:17 -0700355#undef strcmp
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800356int strcmp(const char *cs, const char *ct)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357{
Linus Torvaldsa414f012009-11-18 22:31:52 +0100358 unsigned char c1, c2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359
360 while (1) {
Linus Torvaldsa414f012009-11-18 22:31:52 +0100361 c1 = *cs++;
362 c2 = *ct++;
363 if (c1 != c2)
364 return c1 < c2 ? -1 : 1;
365 if (!c1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366 break;
367 }
Linus Torvaldsa414f012009-11-18 22:31:52 +0100368 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369}
370EXPORT_SYMBOL(strcmp);
371#endif
372
373#ifndef __HAVE_ARCH_STRNCMP
374/**
375 * strncmp - Compare two length-limited strings
376 * @cs: One string
377 * @ct: Another string
378 * @count: The maximum number of bytes to compare
379 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800380int strncmp(const char *cs, const char *ct, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381{
Linus Torvaldsa414f012009-11-18 22:31:52 +0100382 unsigned char c1, c2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383
384 while (count) {
Linus Torvaldsa414f012009-11-18 22:31:52 +0100385 c1 = *cs++;
386 c2 = *ct++;
387 if (c1 != c2)
388 return c1 < c2 ? -1 : 1;
389 if (!c1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 break;
391 count--;
392 }
Linus Torvaldsa414f012009-11-18 22:31:52 +0100393 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394}
395EXPORT_SYMBOL(strncmp);
396#endif
397
398#ifndef __HAVE_ARCH_STRCHR
399/**
400 * strchr - Find the first occurrence of a character in a string
401 * @s: The string to be searched
402 * @c: The character to search for
Peter Rosinb0975712019-07-16 16:27:15 -0700403 *
404 * Note that the %NUL-terminator is considered part of the string, and can
405 * be searched for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800407char *strchr(const char *s, int c)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408{
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800409 for (; *s != (char)c; ++s)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 if (*s == '\0')
411 return NULL;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800412 return (char *)s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413}
414EXPORT_SYMBOL(strchr);
415#endif
416
Grant Likely11d200e2014-03-14 17:00:14 +0000417#ifndef __HAVE_ARCH_STRCHRNUL
418/**
419 * strchrnul - Find and return a character in a string, or end of string
420 * @s: The string to be searched
421 * @c: The character to search for
422 *
423 * Returns pointer to first occurrence of 'c' in s. If c is not found, then
424 * return a pointer to the null byte at the end of s.
425 */
426char *strchrnul(const char *s, int c)
427{
428 while (*s && *s != (char)c)
429 s++;
430 return (char *)s;
431}
432EXPORT_SYMBOL(strchrnul);
433#endif
434
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435#ifndef __HAVE_ARCH_STRRCHR
436/**
437 * strrchr - Find the last occurrence of a character in a string
438 * @s: The string to be searched
439 * @c: The character to search for
440 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800441char *strrchr(const char *s, int c)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442{
Rasmus Villemoes8da53d42015-02-13 14:36:44 -0800443 const char *last = NULL;
444 do {
445 if (*s == (char)c)
446 last = s;
447 } while (*s++);
448 return (char *)last;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449}
450EXPORT_SYMBOL(strrchr);
451#endif
452
453#ifndef __HAVE_ARCH_STRNCHR
454/**
455 * strnchr - Find a character in a length limited string
456 * @s: The string to be searched
457 * @count: The number of characters to be searched
458 * @c: The character to search for
Peter Rosinb0975712019-07-16 16:27:15 -0700459 *
460 * Note that the %NUL-terminator is considered part of the string, and can
461 * be searched for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 */
463char *strnchr(const char *s, size_t count, int c)
464{
Peter Rosinb0975712019-07-16 16:27:15 -0700465 while (count--) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800466 if (*s == (char)c)
467 return (char *)s;
Peter Rosinb0975712019-07-16 16:27:15 -0700468 if (*s++ == '\0')
469 break;
470 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471 return NULL;
472}
473EXPORT_SYMBOL(strnchr);
474#endif
475
Pekka Enberg481fad42006-06-23 02:05:44 -0700476/**
Randy Dunlapa6cd13f2009-12-21 14:37:22 -0800477 * skip_spaces - Removes leading whitespace from @str.
478 * @str: The string to be stripped.
André Goddard Rosaf6533982009-12-14 18:01:04 -0800479 *
Randy Dunlapa6cd13f2009-12-21 14:37:22 -0800480 * Returns a pointer to the first non-whitespace character in @str.
André Goddard Rosaf6533982009-12-14 18:01:04 -0800481 */
482char *skip_spaces(const char *str)
483{
484 while (isspace(*str))
485 ++str;
486 return (char *)str;
487}
488EXPORT_SYMBOL(skip_spaces);
489
490/**
KOSAKI Motohiroca54cb82009-12-14 18:01:15 -0800491 * strim - Removes leading and trailing whitespace from @s.
Pekka Enberg481fad42006-06-23 02:05:44 -0700492 * @s: The string to be stripped.
493 *
494 * Note that the first trailing whitespace is replaced with a %NUL-terminator
495 * in the given string @s. Returns a pointer to the first non-whitespace
496 * character in @s.
497 */
KOSAKI Motohiroca54cb82009-12-14 18:01:15 -0800498char *strim(char *s)
Pekka Enberg481fad42006-06-23 02:05:44 -0700499{
500 size_t size;
501 char *end;
502
503 size = strlen(s);
Pekka Enberg481fad42006-06-23 02:05:44 -0700504 if (!size)
505 return s;
506
507 end = s + size - 1;
Michael Holzheu6e6d9fa2006-10-28 10:38:47 -0700508 while (end >= s && isspace(*end))
Pekka Enberg481fad42006-06-23 02:05:44 -0700509 end--;
510 *(end + 1) = '\0';
511
Michael Holzheu66f69582011-10-31 17:12:37 -0700512 return skip_spaces(s);
Pekka Enberg481fad42006-06-23 02:05:44 -0700513}
KOSAKI Motohiroca54cb82009-12-14 18:01:15 -0800514EXPORT_SYMBOL(strim);
Pekka Enberg481fad42006-06-23 02:05:44 -0700515
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516#ifndef __HAVE_ARCH_STRLEN
517/**
518 * strlen - Find the length of a string
519 * @s: The string to be sized
520 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800521size_t strlen(const char *s)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522{
523 const char *sc;
524
525 for (sc = s; *sc != '\0'; ++sc)
526 /* nothing */;
527 return sc - s;
528}
529EXPORT_SYMBOL(strlen);
530#endif
531
532#ifndef __HAVE_ARCH_STRNLEN
533/**
534 * strnlen - Find the length of a length-limited string
535 * @s: The string to be sized
536 * @count: The maximum number of bytes to search
537 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800538size_t strnlen(const char *s, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539{
540 const char *sc;
541
542 for (sc = s; count-- && *sc != '\0'; ++sc)
543 /* nothing */;
544 return sc - s;
545}
546EXPORT_SYMBOL(strnlen);
547#endif
548
549#ifndef __HAVE_ARCH_STRSPN
550/**
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800551 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552 * @s: The string to be searched
553 * @accept: The string to search for
554 */
555size_t strspn(const char *s, const char *accept)
556{
557 const char *p;
558 const char *a;
559 size_t count = 0;
560
561 for (p = s; *p != '\0'; ++p) {
562 for (a = accept; *a != '\0'; ++a) {
563 if (*p == *a)
564 break;
565 }
566 if (*a == '\0')
567 return count;
568 ++count;
569 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570 return count;
571}
572
573EXPORT_SYMBOL(strspn);
574#endif
575
Kyle McMartin8833d322006-04-10 22:53:57 -0700576#ifndef __HAVE_ARCH_STRCSPN
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577/**
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800578 * strcspn - Calculate the length of the initial substring of @s which does not contain letters in @reject
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579 * @s: The string to be searched
580 * @reject: The string to avoid
581 */
582size_t strcspn(const char *s, const char *reject)
583{
584 const char *p;
585 const char *r;
586 size_t count = 0;
587
588 for (p = s; *p != '\0'; ++p) {
589 for (r = reject; *r != '\0'; ++r) {
590 if (*p == *r)
591 return count;
592 }
593 ++count;
594 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595 return count;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800596}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597EXPORT_SYMBOL(strcspn);
Kyle McMartin8833d322006-04-10 22:53:57 -0700598#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599
600#ifndef __HAVE_ARCH_STRPBRK
601/**
602 * strpbrk - Find the first occurrence of a set of characters
603 * @cs: The string to be searched
604 * @ct: The characters to search for
605 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800606char *strpbrk(const char *cs, const char *ct)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607{
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800608 const char *sc1, *sc2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800610 for (sc1 = cs; *sc1 != '\0'; ++sc1) {
611 for (sc2 = ct; *sc2 != '\0'; ++sc2) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 if (*sc1 == *sc2)
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800613 return (char *)sc1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700614 }
615 }
616 return NULL;
617}
Kyle McMartin894b5772006-04-10 22:53:56 -0700618EXPORT_SYMBOL(strpbrk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619#endif
620
621#ifndef __HAVE_ARCH_STRSEP
622/**
623 * strsep - Split a string into tokens
624 * @s: The string to be searched
625 * @ct: The characters to search for
626 *
627 * strsep() updates @s to point after the token, ready for the next call.
628 *
629 * It returns empty tokens, too, behaving exactly like the libc function
630 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
631 * Same semantics, slimmer shape. ;)
632 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800633char *strsep(char **s, const char *ct)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634{
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800635 char *sbegin = *s;
636 char *end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637
638 if (sbegin == NULL)
639 return NULL;
640
641 end = strpbrk(sbegin, ct);
642 if (end)
643 *end++ = '\0';
644 *s = end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 return sbegin;
646}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700647EXPORT_SYMBOL(strsep);
648#endif
649
David Brownell34990cf2008-05-01 04:34:42 -0700650/**
651 * sysfs_streq - return true if strings are equal, modulo trailing newline
652 * @s1: one string
653 * @s2: another string
654 *
655 * This routine returns true iff two strings are equal, treating both
656 * NUL and newline-then-NUL as equivalent string terminations. It's
657 * geared for use with sysfs input strings, which generally terminate
658 * with newlines but are compared against values without newlines.
659 */
660bool sysfs_streq(const char *s1, const char *s2)
661{
662 while (*s1 && *s1 == *s2) {
663 s1++;
664 s2++;
665 }
666
667 if (*s1 == *s2)
668 return true;
669 if (!*s1 && *s2 == '\n' && !s2[1])
670 return true;
671 if (*s1 == '\n' && !s1[1] && !*s2)
672 return true;
673 return false;
674}
675EXPORT_SYMBOL(sysfs_streq);
676
Jonathan Camerond0f1fed2011-04-19 12:43:45 +0100677/**
Andy Shevchenko56b06082016-03-17 14:22:14 -0700678 * match_string - matches given string in an array
679 * @array: array of strings
680 * @n: number of strings in the array or -1 for NULL terminated arrays
681 * @string: string to match with
682 *
683 * Return:
684 * index of a @string in the @array if matches, or %-EINVAL otherwise.
685 */
686int match_string(const char * const *array, size_t n, const char *string)
687{
688 int index;
689 const char *item;
690
691 for (index = 0; index < n; index++) {
692 item = array[index];
693 if (!item)
694 break;
695 if (!strcmp(item, string))
696 return index;
697 }
698
699 return -EINVAL;
700}
701EXPORT_SYMBOL(match_string);
702
Heikki Krogeruse1fe7b62017-03-21 13:56:46 +0200703/**
704 * __sysfs_match_string - matches given string in an array
705 * @array: array of strings
706 * @n: number of strings in the array or -1 for NULL terminated arrays
707 * @str: string to match with
708 *
709 * Returns index of @str in the @array or -EINVAL, just like match_string().
710 * Uses sysfs_streq instead of strcmp for matching.
711 */
712int __sysfs_match_string(const char * const *array, size_t n, const char *str)
713{
714 const char *item;
715 int index;
716
717 for (index = 0; index < n; index++) {
718 item = array[index];
719 if (!item)
720 break;
721 if (sysfs_streq(item, str))
722 return index;
723 }
724
725 return -EINVAL;
726}
727EXPORT_SYMBOL(__sysfs_match_string);
728
Linus Torvalds1da177e2005-04-16 15:20:36 -0700729#ifndef __HAVE_ARCH_MEMSET
730/**
731 * memset - Fill a region of memory with the given value
732 * @s: Pointer to the start of the area.
733 * @c: The byte to fill the area with
734 * @count: The size of the area.
735 *
736 * Do not use memset() to access IO space, use memset_io() instead.
737 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800738void *memset(void *s, int c, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700739{
Jesper Juhl850b9242005-10-30 15:02:13 -0800740 char *xs = s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700741
742 while (count--)
743 *xs++ = c;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744 return s;
745}
746EXPORT_SYMBOL(memset);
747#endif
748
Daniel Borkmannd4c5efd2014-08-26 23:16:35 -0400749/**
750 * memzero_explicit - Fill a region of memory (e.g. sensitive
751 * keying data) with 0s.
752 * @s: Pointer to the start of the area.
753 * @count: The size of the area.
754 *
Daniel Borkmann81553302015-01-06 00:27:45 +0100755 * Note: usually using memset() is just fine (!), but in cases
756 * where clearing out _local_ data at the end of a scope is
757 * necessary, memzero_explicit() should be used instead in
758 * order to prevent the compiler from optimising away zeroing.
759 *
Daniel Borkmannd4c5efd2014-08-26 23:16:35 -0400760 * memzero_explicit() doesn't need an arch-specific version as
761 * it just invokes the one of memset() implicitly.
762 */
763void memzero_explicit(void *s, size_t count)
764{
765 memset(s, 0, count);
Daniel Borkmann7829fb02015-04-30 04:13:52 +0200766 barrier_data(s);
Daniel Borkmannd4c5efd2014-08-26 23:16:35 -0400767}
768EXPORT_SYMBOL(memzero_explicit);
769
Matthew Wilcox3b3c4ba2017-09-08 16:13:48 -0700770#ifndef __HAVE_ARCH_MEMSET16
771/**
772 * memset16() - Fill a memory area with a uint16_t
773 * @s: Pointer to the start of the area.
774 * @v: The value to fill the area with
775 * @count: The number of values to store
776 *
777 * Differs from memset() in that it fills with a uint16_t instead
778 * of a byte. Remember that @count is the number of uint16_ts to
779 * store, not the number of bytes.
780 */
781void *memset16(uint16_t *s, uint16_t v, size_t count)
782{
783 uint16_t *xs = s;
784
785 while (count--)
786 *xs++ = v;
787 return s;
788}
789EXPORT_SYMBOL(memset16);
790#endif
791
792#ifndef __HAVE_ARCH_MEMSET32
793/**
794 * memset32() - Fill a memory area with a uint32_t
795 * @s: Pointer to the start of the area.
796 * @v: The value to fill the area with
797 * @count: The number of values to store
798 *
799 * Differs from memset() in that it fills with a uint32_t instead
800 * of a byte. Remember that @count is the number of uint32_ts to
801 * store, not the number of bytes.
802 */
803void *memset32(uint32_t *s, uint32_t v, size_t count)
804{
805 uint32_t *xs = s;
806
807 while (count--)
808 *xs++ = v;
809 return s;
810}
811EXPORT_SYMBOL(memset32);
812#endif
813
814#ifndef __HAVE_ARCH_MEMSET64
815/**
816 * memset64() - Fill a memory area with a uint64_t
817 * @s: Pointer to the start of the area.
818 * @v: The value to fill the area with
819 * @count: The number of values to store
820 *
821 * Differs from memset() in that it fills with a uint64_t instead
822 * of a byte. Remember that @count is the number of uint64_ts to
823 * store, not the number of bytes.
824 */
825void *memset64(uint64_t *s, uint64_t v, size_t count)
826{
827 uint64_t *xs = s;
828
829 while (count--)
830 *xs++ = v;
831 return s;
832}
833EXPORT_SYMBOL(memset64);
834#endif
835
Linus Torvalds1da177e2005-04-16 15:20:36 -0700836#ifndef __HAVE_ARCH_MEMCPY
837/**
838 * memcpy - Copy one area of memory to another
839 * @dest: Where to copy to
840 * @src: Where to copy from
841 * @count: The size of the area.
842 *
843 * You should not use this function to access IO space, use memcpy_toio()
844 * or memcpy_fromio() instead.
845 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800846void *memcpy(void *dest, const void *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700847{
Jesper Juhl850b9242005-10-30 15:02:13 -0800848 char *tmp = dest;
Jan-Benedict Glaw4c416ab2006-04-10 22:54:09 -0700849 const char *s = src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700850
851 while (count--)
852 *tmp++ = *s++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700853 return dest;
854}
855EXPORT_SYMBOL(memcpy);
856#endif
857
858#ifndef __HAVE_ARCH_MEMMOVE
859/**
860 * memmove - Copy one area of memory to another
861 * @dest: Where to copy to
862 * @src: Where to copy from
863 * @count: The size of the area.
864 *
865 * Unlike memcpy(), memmove() copes with overlapping areas.
866 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800867void *memmove(void *dest, const void *src, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700868{
Paul Jackson82da2c32005-10-30 15:03:19 -0800869 char *tmp;
870 const char *s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700871
872 if (dest <= src) {
Jesper Juhl850b9242005-10-30 15:02:13 -0800873 tmp = dest;
874 s = src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700875 while (count--)
876 *tmp++ = *s++;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800877 } else {
Jesper Juhl850b9242005-10-30 15:02:13 -0800878 tmp = dest;
879 tmp += count;
880 s = src;
881 s += count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700882 while (count--)
883 *--tmp = *--s;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800884 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700885 return dest;
886}
887EXPORT_SYMBOL(memmove);
888#endif
889
890#ifndef __HAVE_ARCH_MEMCMP
891/**
892 * memcmp - Compare two areas of memory
893 * @cs: One area of memory
894 * @ct: Another area of memory
895 * @count: The size of the area.
896 */
Paolo 'Blaisorblade' Giarrusso0c281302005-05-05 16:15:17 -0700897#undef memcmp
Andi Kleena7330c92014-02-08 08:52:06 +0100898__visible int memcmp(const void *cs, const void *ct, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700899{
900 const unsigned char *su1, *su2;
901 int res = 0;
902
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800903 for (su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700904 if ((res = *su1 - *su2) != 0)
905 break;
906 return res;
907}
908EXPORT_SYMBOL(memcmp);
909#endif
910
Nick Desaulniers5f074f32019-04-05 18:38:45 -0700911#ifndef __HAVE_ARCH_BCMP
912/**
913 * bcmp - returns 0 if and only if the buffers have identical contents.
914 * @a: pointer to first buffer.
915 * @b: pointer to second buffer.
916 * @len: size of buffers.
917 *
918 * The sign or magnitude of a non-zero return value has no particular
919 * meaning, and architectures may implement their own more efficient bcmp(). So
920 * while this particular implementation is a simple (tail) call to memcmp, do
921 * not rely on anything but whether the return value is zero or non-zero.
922 */
923#undef bcmp
924int bcmp(const void *a, const void *b, size_t len)
925{
926 return memcmp(a, b, len);
927}
928EXPORT_SYMBOL(bcmp);
929#endif
930
Linus Torvalds1da177e2005-04-16 15:20:36 -0700931#ifndef __HAVE_ARCH_MEMSCAN
932/**
933 * memscan - Find a character in an area of memory.
934 * @addr: The memory area
935 * @c: The byte to search for
936 * @size: The size of the area.
937 *
938 * returns the address of the first occurrence of @c, or 1 byte past
939 * the area if @c is not found
940 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800941void *memscan(void *addr, int c, size_t size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700942{
Jesper Juhl850b9242005-10-30 15:02:13 -0800943 unsigned char *p = addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700944
945 while (size) {
946 if (*p == c)
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800947 return (void *)p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700948 p++;
949 size--;
950 }
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800951 return (void *)p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700952}
953EXPORT_SYMBOL(memscan);
954#endif
955
956#ifndef __HAVE_ARCH_STRSTR
957/**
958 * strstr - Find the first substring in a %NUL terminated string
959 * @s1: The string to be searched
960 * @s2: The string to search for
961 */
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800962char *strstr(const char *s1, const char *s2)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700963{
Li Zefand5f1fb52010-01-14 10:53:55 +0800964 size_t l1, l2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700965
966 l2 = strlen(s2);
967 if (!l2)
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800968 return (char *)s1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700969 l1 = strlen(s1);
970 while (l1 >= l2) {
971 l1--;
Jesper Juhl51a0f0f2005-10-30 15:02:11 -0800972 if (!memcmp(s1, s2, l2))
973 return (char *)s1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700974 s1++;
975 }
976 return NULL;
977}
978EXPORT_SYMBOL(strstr);
979#endif
980
Li Zefand5f1fb52010-01-14 10:53:55 +0800981#ifndef __HAVE_ARCH_STRNSTR
982/**
983 * strnstr - Find the first substring in a length-limited string
984 * @s1: The string to be searched
985 * @s2: The string to search for
986 * @len: the maximum number of characters to search
987 */
988char *strnstr(const char *s1, const char *s2, size_t len)
989{
André Goddard Rosad6a2eed2010-03-05 13:43:12 -0800990 size_t l2;
Li Zefand5f1fb52010-01-14 10:53:55 +0800991
992 l2 = strlen(s2);
993 if (!l2)
994 return (char *)s1;
André Goddard Rosad6a2eed2010-03-05 13:43:12 -0800995 while (len >= l2) {
996 len--;
Li Zefand5f1fb52010-01-14 10:53:55 +0800997 if (!memcmp(s1, s2, l2))
998 return (char *)s1;
999 s1++;
1000 }
1001 return NULL;
1002}
1003EXPORT_SYMBOL(strnstr);
1004#endif
1005
Linus Torvalds1da177e2005-04-16 15:20:36 -07001006#ifndef __HAVE_ARCH_MEMCHR
1007/**
1008 * memchr - Find a character in an area of memory.
1009 * @s: The memory area
1010 * @c: The byte to search for
1011 * @n: The size of the area.
1012 *
1013 * returns the address of the first occurrence of @c, or %NULL
1014 * if @c is not found
1015 */
1016void *memchr(const void *s, int c, size_t n)
1017{
1018 const unsigned char *p = s;
1019 while (n-- != 0) {
1020 if ((unsigned char)c == *p++) {
Jesper Juhl51a0f0f2005-10-30 15:02:11 -08001021 return (void *)(p - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001022 }
1023 }
1024 return NULL;
1025}
1026EXPORT_SYMBOL(memchr);
1027#endif
Akinobu Mita798248202011-10-31 17:08:07 -07001028
1029static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes)
1030{
1031 while (bytes) {
1032 if (*start != value)
1033 return (void *)start;
1034 start++;
1035 bytes--;
1036 }
1037 return NULL;
1038}
1039
1040/**
1041 * memchr_inv - Find an unmatching character in an area of memory.
1042 * @start: The memory area
1043 * @c: Find a character other than c
1044 * @bytes: The size of the area.
1045 *
1046 * returns the address of the first character other than @c, or %NULL
1047 * if the whole buffer contains just @c.
1048 */
1049void *memchr_inv(const void *start, int c, size_t bytes)
1050{
1051 u8 value = c;
1052 u64 value64;
1053 unsigned int words, prefix;
1054
1055 if (bytes <= 16)
1056 return check_bytes8(start, value, bytes);
1057
Akinobu Mitaf43804b2012-03-23 15:02:14 -07001058 value64 = value;
Linus Torvalds72d93102014-09-13 11:14:53 -07001059#if defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER) && BITS_PER_LONG == 64
Andy Shevchenko3368e8f2015-11-10 14:45:14 -08001060 value64 *= 0x0101010101010101ULL;
Linus Torvalds72d93102014-09-13 11:14:53 -07001061#elif defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER)
Akinobu Mitaf43804b2012-03-23 15:02:14 -07001062 value64 *= 0x01010101;
1063 value64 |= value64 << 32;
1064#else
1065 value64 |= value64 << 8;
1066 value64 |= value64 << 16;
1067 value64 |= value64 << 32;
1068#endif
Akinobu Mita798248202011-10-31 17:08:07 -07001069
Akinobu Mitaf43804b2012-03-23 15:02:14 -07001070 prefix = (unsigned long)start % 8;
Akinobu Mita798248202011-10-31 17:08:07 -07001071 if (prefix) {
Akinobu Mitaf43804b2012-03-23 15:02:14 -07001072 u8 *r;
1073
1074 prefix = 8 - prefix;
1075 r = check_bytes8(start, value, prefix);
Akinobu Mita798248202011-10-31 17:08:07 -07001076 if (r)
1077 return r;
1078 start += prefix;
1079 bytes -= prefix;
1080 }
1081
1082 words = bytes / 8;
1083
1084 while (words) {
1085 if (*(u64 *)start != value64)
1086 return check_bytes8(start, value, 8);
1087 start += 8;
1088 words--;
1089 }
1090
1091 return check_bytes8(start, value, bytes % 8);
1092}
1093EXPORT_SYMBOL(memchr_inv);
Rasmus Villemoes94df2902015-06-25 15:02:22 -07001094
1095/**
1096 * strreplace - Replace all occurrences of character in string.
1097 * @s: The string to operate on.
1098 * @old: The character being replaced.
1099 * @new: The character @old is replaced with.
1100 *
1101 * Returns pointer to the nul byte at the end of @s.
1102 */
1103char *strreplace(char *s, char old, char new)
1104{
1105 for (; *s; ++s)
1106 if (*s == old)
1107 *s = new;
1108 return s;
1109}
1110EXPORT_SYMBOL(strreplace);
Daniel Micay6974f0c2017-07-12 14:36:10 -07001111
1112void fortify_panic(const char *name)
1113{
1114 pr_emerg("detected buffer overflow in %s\n", name);
1115 BUG();
1116}
1117EXPORT_SYMBOL(fortify_panic);