string.c 17.0 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
/*
 *  linux/lib/string.c
 *
 *  Copyright (C) 1991, 1992  Linus Torvalds
 */

/*
 * stupid library routines.. The optimized versions should generally be found
 * as inline code in <asm-xx/string.h>
 *
 * These are buggy as well..
 *
 * * Fri Jun 25 1999, Ingo Oeser <ioe@informatik.tu-chemnitz.de>
 * -  Added strsep() which will replace strtok() soon (because strsep() is
 *    reentrant and should be faster). Use only strsep() in new code, please.
 *
 * * Sat Feb 09 2002, Jason Thomas <jason@topic.com.au>,
 *                    Matthew Hawkins <matt@mh.dropbear.id.au>
 * -  Kissed strtok() goodbye
 */

#include <linux/types.h>
#include <linux/string.h>
#include <linux/ctype.h>
25 26
#include <linux/kernel.h>
#include <linux/export.h>
27
#include <linux/bug.h>
28
#include <linux/errno.h>
L
Linus Torvalds 已提交
29

30
#ifndef __HAVE_ARCH_STRNCASECMP
L
Linus Torvalds 已提交
31
/**
32
 * strncasecmp - Case insensitive, length-limited string comparison
L
Linus Torvalds 已提交
33 34 35 36
 * @s1: One string
 * @s2: The other string
 * @len: the maximum number of characters to compare
 */
37
int strncasecmp(const char *s1, const char *s2, size_t len)
L
Linus Torvalds 已提交
38 39 40 41
{
	/* Yes, Virginia, it had better be unsigned */
	unsigned char c1, c2;

42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
	if (!len)
		return 0;

	do {
		c1 = *s1++;
		c2 = *s2++;
		if (!c1 || !c2)
			break;
		if (c1 == c2)
			continue;
		c1 = tolower(c1);
		c2 = tolower(c2);
		if (c1 != c2)
			break;
	} while (--len);
L
Linus Torvalds 已提交
57 58
	return (int)c1 - (int)c2;
}
59 60
EXPORT_SYMBOL(strncasecmp);
#endif
L
Linus Torvalds 已提交
61

62 63 64 65 66 67 68 69 70 71 72 73 74 75
#ifndef __HAVE_ARCH_STRCASECMP
int strcasecmp(const char *s1, const char *s2)
{
	int c1, c2;

	do {
		c1 = tolower(*s1++);
		c2 = tolower(*s2++);
	} while (c1 == c2 && c1 != 0);
	return c1 - c2;
}
EXPORT_SYMBOL(strcasecmp);
#endif

L
Linus Torvalds 已提交
76 77 78 79 80 81
#ifndef __HAVE_ARCH_STRCPY
/**
 * strcpy - Copy a %NUL terminated string
 * @dest: Where to copy the string to
 * @src: Where to copy the string from
 */
82
#undef strcpy
83
char *strcpy(char *dest, const char *src)
L
Linus Torvalds 已提交
84 85 86 87 88 89 90 91 92 93 94 95
{
	char *tmp = dest;

	while ((*dest++ = *src++) != '\0')
		/* nothing */;
	return tmp;
}
EXPORT_SYMBOL(strcpy);
#endif

#ifndef __HAVE_ARCH_STRNCPY
/**
96
 * strncpy - Copy a length-limited, C-string
L
Linus Torvalds 已提交
97 98 99 100 101 102
 * @dest: Where to copy the string to
 * @src: Where to copy the string from
 * @count: The maximum number of bytes to copy
 *
 * The result is not %NUL-terminated if the source exceeds
 * @count bytes.
103 104 105 106
 *
 * In the case where the length of @src is less than  that  of
 * count, the remainder of @dest will be padded with %NUL.
 *
L
Linus Torvalds 已提交
107
 */
108
char *strncpy(char *dest, const char *src, size_t count)
L
Linus Torvalds 已提交
109 110 111 112
{
	char *tmp = dest;

	while (count) {
113 114
		if ((*tmp = *src) != 0)
			src++;
L
Linus Torvalds 已提交
115 116 117 118 119 120 121 122 123 124
		tmp++;
		count--;
	}
	return dest;
}
EXPORT_SYMBOL(strncpy);
#endif

#ifndef __HAVE_ARCH_STRLCPY
/**
125
 * strlcpy - Copy a C-string into a sized buffer
L
Linus Torvalds 已提交
126 127 128 129 130 131 132 133 134 135 136 137 138 139
 * @dest: Where to copy the string to
 * @src: Where to copy the string from
 * @size: size of destination buffer
 *
 * Compatible with *BSD: the result is always a valid
 * NUL-terminated string that fits in the buffer (unless,
 * of course, the buffer size is zero). It does not pad
 * out the result like strncpy() does.
 */
size_t strlcpy(char *dest, const char *src, size_t size)
{
	size_t ret = strlen(src);

	if (size) {
140
		size_t len = (ret >= size) ? size - 1 : ret;
L
Linus Torvalds 已提交
141 142 143 144 145 146 147 148 149 150 151 152 153 154
		memcpy(dest, src, len);
		dest[len] = '\0';
	}
	return ret;
}
EXPORT_SYMBOL(strlcpy);
#endif

#ifndef __HAVE_ARCH_STRCAT
/**
 * strcat - Append one %NUL-terminated string to another
 * @dest: The string to be appended to
 * @src: The string to append to it
 */
155
#undef strcat
156
char *strcat(char *dest, const char *src)
L
Linus Torvalds 已提交
157 158 159 160 161 162 163 164 165 166 167 168 169 170
{
	char *tmp = dest;

	while (*dest)
		dest++;
	while ((*dest++ = *src++) != '\0')
		;
	return tmp;
}
EXPORT_SYMBOL(strcat);
#endif

#ifndef __HAVE_ARCH_STRNCAT
/**
171
 * strncat - Append a length-limited, C-string to another
L
Linus Torvalds 已提交
172 173 174 175
 * @dest: The string to be appended to
 * @src: The string to append to it
 * @count: The maximum numbers of bytes to copy
 *
176
 * Note that in contrast to strncpy(), strncat() ensures the result is
L
Linus Torvalds 已提交
177 178
 * terminated.
 */
179
char *strncat(char *dest, const char *src, size_t count)
L
Linus Torvalds 已提交
180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
{
	char *tmp = dest;

	if (count) {
		while (*dest)
			dest++;
		while ((*dest++ = *src++) != 0) {
			if (--count == 0) {
				*dest = '\0';
				break;
			}
		}
	}
	return tmp;
}
EXPORT_SYMBOL(strncat);
#endif

#ifndef __HAVE_ARCH_STRLCAT
/**
200
 * strlcat - Append a length-limited, C-string to another
L
Linus Torvalds 已提交
201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
 * @dest: The string to be appended to
 * @src: The string to append to it
 * @count: The size of the destination buffer.
 */
size_t strlcat(char *dest, const char *src, size_t count)
{
	size_t dsize = strlen(dest);
	size_t len = strlen(src);
	size_t res = dsize + len;

	/* This would be a bug */
	BUG_ON(dsize >= count);

	dest += dsize;
	count -= dsize;
	if (len >= count)
		len = count-1;
	memcpy(dest, src, len);
	dest[len] = 0;
	return res;
}
EXPORT_SYMBOL(strlcat);
#endif

#ifndef __HAVE_ARCH_STRCMP
/**
 * strcmp - Compare two strings
 * @cs: One string
 * @ct: Another string
 */
231
#undef strcmp
232
int strcmp(const char *cs, const char *ct)
L
Linus Torvalds 已提交
233
{
234
	unsigned char c1, c2;
L
Linus Torvalds 已提交
235 236

	while (1) {
237 238 239 240 241
		c1 = *cs++;
		c2 = *ct++;
		if (c1 != c2)
			return c1 < c2 ? -1 : 1;
		if (!c1)
L
Linus Torvalds 已提交
242 243
			break;
	}
244
	return 0;
L
Linus Torvalds 已提交
245 246 247 248 249 250 251 252 253 254 255
}
EXPORT_SYMBOL(strcmp);
#endif

#ifndef __HAVE_ARCH_STRNCMP
/**
 * strncmp - Compare two length-limited strings
 * @cs: One string
 * @ct: Another string
 * @count: The maximum number of bytes to compare
 */
256
int strncmp(const char *cs, const char *ct, size_t count)
L
Linus Torvalds 已提交
257
{
258
	unsigned char c1, c2;
L
Linus Torvalds 已提交
259 260

	while (count) {
261 262 263 264 265
		c1 = *cs++;
		c2 = *ct++;
		if (c1 != c2)
			return c1 < c2 ? -1 : 1;
		if (!c1)
L
Linus Torvalds 已提交
266 267 268
			break;
		count--;
	}
269
	return 0;
L
Linus Torvalds 已提交
270 271 272 273 274 275 276 277 278 279
}
EXPORT_SYMBOL(strncmp);
#endif

#ifndef __HAVE_ARCH_STRCHR
/**
 * strchr - Find the first occurrence of a character in a string
 * @s: The string to be searched
 * @c: The character to search for
 */
280
char *strchr(const char *s, int c)
L
Linus Torvalds 已提交
281
{
282
	for (; *s != (char)c; ++s)
L
Linus Torvalds 已提交
283 284
		if (*s == '\0')
			return NULL;
285
	return (char *)s;
L
Linus Torvalds 已提交
286 287 288 289
}
EXPORT_SYMBOL(strchr);
#endif

290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
#ifndef __HAVE_ARCH_STRCHRNUL
/**
 * strchrnul - Find and return a character in a string, or end of string
 * @s: The string to be searched
 * @c: The character to search for
 *
 * Returns pointer to first occurrence of 'c' in s. If c is not found, then
 * return a pointer to the null byte at the end of s.
 */
char *strchrnul(const char *s, int c)
{
	while (*s && *s != (char)c)
		s++;
	return (char *)s;
}
EXPORT_SYMBOL(strchrnul);
#endif

L
Linus Torvalds 已提交
308 309 310 311 312 313
#ifndef __HAVE_ARCH_STRRCHR
/**
 * strrchr - Find the last occurrence of a character in a string
 * @s: The string to be searched
 * @c: The character to search for
 */
314
char *strrchr(const char *s, int c)
L
Linus Torvalds 已提交
315
{
316 317 318 319 320 321
	const char *last = NULL;
	do {
		if (*s == (char)c)
			last = s;
	} while (*s++);
	return (char *)last;
L
Linus Torvalds 已提交
322 323 324 325 326 327 328 329 330 331 332 333 334 335
}
EXPORT_SYMBOL(strrchr);
#endif

#ifndef __HAVE_ARCH_STRNCHR
/**
 * strnchr - Find a character in a length limited string
 * @s: The string to be searched
 * @count: The number of characters to be searched
 * @c: The character to search for
 */
char *strnchr(const char *s, size_t count, int c)
{
	for (; count-- && *s != '\0'; ++s)
336 337
		if (*s == (char)c)
			return (char *)s;
L
Linus Torvalds 已提交
338 339 340 341 342
	return NULL;
}
EXPORT_SYMBOL(strnchr);
#endif

343
/**
344 345
 * skip_spaces - Removes leading whitespace from @str.
 * @str: The string to be stripped.
346
 *
347
 * Returns a pointer to the first non-whitespace character in @str.
348 349 350 351 352 353 354 355 356
 */
char *skip_spaces(const char *str)
{
	while (isspace(*str))
		++str;
	return (char *)str;
}
EXPORT_SYMBOL(skip_spaces);

P
Pekka Enberg 已提交
357
/**
358
 * strim - Removes leading and trailing whitespace from @s.
P
Pekka Enberg 已提交
359 360 361 362 363 364
 * @s: The string to be stripped.
 *
 * Note that the first trailing whitespace is replaced with a %NUL-terminator
 * in the given string @s. Returns a pointer to the first non-whitespace
 * character in @s.
 */
365
char *strim(char *s)
P
Pekka Enberg 已提交
366 367 368 369 370 371 372 373 374
{
	size_t size;
	char *end;

	size = strlen(s);
	if (!size)
		return s;

	end = s + size - 1;
375
	while (end >= s && isspace(*end))
P
Pekka Enberg 已提交
376 377 378
		end--;
	*(end + 1) = '\0';

379
	return skip_spaces(s);
P
Pekka Enberg 已提交
380
}
381
EXPORT_SYMBOL(strim);
P
Pekka Enberg 已提交
382

L
Linus Torvalds 已提交
383 384 385 386 387
#ifndef __HAVE_ARCH_STRLEN
/**
 * strlen - Find the length of a string
 * @s: The string to be sized
 */
388
size_t strlen(const char *s)
L
Linus Torvalds 已提交
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404
{
	const char *sc;

	for (sc = s; *sc != '\0'; ++sc)
		/* nothing */;
	return sc - s;
}
EXPORT_SYMBOL(strlen);
#endif

#ifndef __HAVE_ARCH_STRNLEN
/**
 * strnlen - Find the length of a length-limited string
 * @s: The string to be sized
 * @count: The maximum number of bytes to search
 */
405
size_t strnlen(const char *s, size_t count)
L
Linus Torvalds 已提交
406 407 408 409 410 411 412 413 414 415 416 417
{
	const char *sc;

	for (sc = s; count-- && *sc != '\0'; ++sc)
		/* nothing */;
	return sc - s;
}
EXPORT_SYMBOL(strnlen);
#endif

#ifndef __HAVE_ARCH_STRSPN
/**
418
 * strspn - Calculate the length of the initial substring of @s which only contain letters in @accept
L
Linus Torvalds 已提交
419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442
 * @s: The string to be searched
 * @accept: The string to search for
 */
size_t strspn(const char *s, const char *accept)
{
	const char *p;
	const char *a;
	size_t count = 0;

	for (p = s; *p != '\0'; ++p) {
		for (a = accept; *a != '\0'; ++a) {
			if (*p == *a)
				break;
		}
		if (*a == '\0')
			return count;
		++count;
	}
	return count;
}

EXPORT_SYMBOL(strspn);
#endif

443
#ifndef __HAVE_ARCH_STRCSPN
L
Linus Torvalds 已提交
444
/**
445
 * strcspn - Calculate the length of the initial substring of @s which does not contain letters in @reject
L
Linus Torvalds 已提交
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
 * @s: The string to be searched
 * @reject: The string to avoid
 */
size_t strcspn(const char *s, const char *reject)
{
	const char *p;
	const char *r;
	size_t count = 0;

	for (p = s; *p != '\0'; ++p) {
		for (r = reject; *r != '\0'; ++r) {
			if (*p == *r)
				return count;
		}
		++count;
	}
	return count;
463
}
L
Linus Torvalds 已提交
464
EXPORT_SYMBOL(strcspn);
465
#endif
L
Linus Torvalds 已提交
466 467 468 469 470 471 472

#ifndef __HAVE_ARCH_STRPBRK
/**
 * strpbrk - Find the first occurrence of a set of characters
 * @cs: The string to be searched
 * @ct: The characters to search for
 */
473
char *strpbrk(const char *cs, const char *ct)
L
Linus Torvalds 已提交
474
{
475
	const char *sc1, *sc2;
L
Linus Torvalds 已提交
476

477 478
	for (sc1 = cs; *sc1 != '\0'; ++sc1) {
		for (sc2 = ct; *sc2 != '\0'; ++sc2) {
L
Linus Torvalds 已提交
479
			if (*sc1 == *sc2)
480
				return (char *)sc1;
L
Linus Torvalds 已提交
481 482 483 484
		}
	}
	return NULL;
}
485
EXPORT_SYMBOL(strpbrk);
L
Linus Torvalds 已提交
486 487 488 489 490 491 492 493 494 495 496 497 498 499
#endif

#ifndef __HAVE_ARCH_STRSEP
/**
 * strsep - Split a string into tokens
 * @s: The string to be searched
 * @ct: The characters to search for
 *
 * strsep() updates @s to point after the token, ready for the next call.
 *
 * It returns empty tokens, too, behaving exactly like the libc function
 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
 * Same semantics, slimmer shape. ;)
 */
500
char *strsep(char **s, const char *ct)
L
Linus Torvalds 已提交
501
{
502 503
	char *sbegin = *s;
	char *end;
L
Linus Torvalds 已提交
504 505 506 507 508 509 510 511 512 513 514 515 516

	if (sbegin == NULL)
		return NULL;

	end = strpbrk(sbegin, ct);
	if (end)
		*end++ = '\0';
	*s = end;
	return sbegin;
}
EXPORT_SYMBOL(strsep);
#endif

517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543
/**
 * sysfs_streq - return true if strings are equal, modulo trailing newline
 * @s1: one string
 * @s2: another string
 *
 * This routine returns true iff two strings are equal, treating both
 * NUL and newline-then-NUL as equivalent string terminations.  It's
 * geared for use with sysfs input strings, which generally terminate
 * with newlines but are compared against values without newlines.
 */
bool sysfs_streq(const char *s1, const char *s2)
{
	while (*s1 && *s1 == *s2) {
		s1++;
		s2++;
	}

	if (*s1 == *s2)
		return true;
	if (!*s1 && *s2 == '\n' && !s2[1])
		return true;
	if (*s1 == '\n' && !s1[1] && !*s2)
		return true;
	return false;
}
EXPORT_SYMBOL(sysfs_streq);

544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572
/**
 * strtobool - convert common user inputs into boolean values
 * @s: input string
 * @res: result
 *
 * This routine returns 0 iff the first character is one of 'Yy1Nn0'.
 * Otherwise it will return -EINVAL.  Value pointed to by res is
 * updated upon finding a match.
 */
int strtobool(const char *s, bool *res)
{
	switch (s[0]) {
	case 'y':
	case 'Y':
	case '1':
		*res = true;
		break;
	case 'n':
	case 'N':
	case '0':
		*res = false;
		break;
	default:
		return -EINVAL;
	}
	return 0;
}
EXPORT_SYMBOL(strtobool);

L
Linus Torvalds 已提交
573 574 575 576 577 578 579 580 581
#ifndef __HAVE_ARCH_MEMSET
/**
 * memset - Fill a region of memory with the given value
 * @s: Pointer to the start of the area.
 * @c: The byte to fill the area with
 * @count: The size of the area.
 *
 * Do not use memset() to access IO space, use memset_io() instead.
 */
582
void *memset(void *s, int c, size_t count)
L
Linus Torvalds 已提交
583
{
584
	char *xs = s;
L
Linus Torvalds 已提交
585 586 587 588 589 590 591 592

	while (count--)
		*xs++ = c;
	return s;
}
EXPORT_SYMBOL(memset);
#endif

593 594 595 596 597 598
/**
 * memzero_explicit - Fill a region of memory (e.g. sensitive
 *		      keying data) with 0s.
 * @s: Pointer to the start of the area.
 * @count: The size of the area.
 *
599 600 601 602 603
 * Note: usually using memset() is just fine (!), but in cases
 * where clearing out _local_ data at the end of a scope is
 * necessary, memzero_explicit() should be used instead in
 * order to prevent the compiler from optimising away zeroing.
 *
604 605 606 607 608 609
 * memzero_explicit() doesn't need an arch-specific version as
 * it just invokes the one of memset() implicitly.
 */
void memzero_explicit(void *s, size_t count)
{
	memset(s, 0, count);
610
	barrier_data(s);
611 612 613
}
EXPORT_SYMBOL(memzero_explicit);

L
Linus Torvalds 已提交
614 615 616 617 618 619 620 621 622 623
#ifndef __HAVE_ARCH_MEMCPY
/**
 * memcpy - Copy one area of memory to another
 * @dest: Where to copy to
 * @src: Where to copy from
 * @count: The size of the area.
 *
 * You should not use this function to access IO space, use memcpy_toio()
 * or memcpy_fromio() instead.
 */
624
void *memcpy(void *dest, const void *src, size_t count)
L
Linus Torvalds 已提交
625
{
626
	char *tmp = dest;
627
	const char *s = src;
L
Linus Torvalds 已提交
628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644

	while (count--)
		*tmp++ = *s++;
	return dest;
}
EXPORT_SYMBOL(memcpy);
#endif

#ifndef __HAVE_ARCH_MEMMOVE
/**
 * memmove - Copy one area of memory to another
 * @dest: Where to copy to
 * @src: Where to copy from
 * @count: The size of the area.
 *
 * Unlike memcpy(), memmove() copes with overlapping areas.
 */
645
void *memmove(void *dest, const void *src, size_t count)
L
Linus Torvalds 已提交
646
{
647 648
	char *tmp;
	const char *s;
L
Linus Torvalds 已提交
649 650

	if (dest <= src) {
651 652
		tmp = dest;
		s = src;
L
Linus Torvalds 已提交
653 654
		while (count--)
			*tmp++ = *s++;
655
	} else {
656 657 658 659
		tmp = dest;
		tmp += count;
		s = src;
		s += count;
L
Linus Torvalds 已提交
660 661
		while (count--)
			*--tmp = *--s;
662
	}
L
Linus Torvalds 已提交
663 664 665 666 667 668 669 670 671 672 673 674
	return dest;
}
EXPORT_SYMBOL(memmove);
#endif

#ifndef __HAVE_ARCH_MEMCMP
/**
 * memcmp - Compare two areas of memory
 * @cs: One area of memory
 * @ct: Another area of memory
 * @count: The size of the area.
 */
675
#undef memcmp
676
__visible int memcmp(const void *cs, const void *ct, size_t count)
L
Linus Torvalds 已提交
677 678 679 680
{
	const unsigned char *su1, *su2;
	int res = 0;

681
	for (su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
L
Linus Torvalds 已提交
682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
		if ((res = *su1 - *su2) != 0)
			break;
	return res;
}
EXPORT_SYMBOL(memcmp);
#endif

#ifndef __HAVE_ARCH_MEMSCAN
/**
 * memscan - Find a character in an area of memory.
 * @addr: The memory area
 * @c: The byte to search for
 * @size: The size of the area.
 *
 * returns the address of the first occurrence of @c, or 1 byte past
 * the area if @c is not found
 */
699
void *memscan(void *addr, int c, size_t size)
L
Linus Torvalds 已提交
700
{
701
	unsigned char *p = addr;
L
Linus Torvalds 已提交
702 703 704

	while (size) {
		if (*p == c)
705
			return (void *)p;
L
Linus Torvalds 已提交
706 707 708
		p++;
		size--;
	}
709
  	return (void *)p;
L
Linus Torvalds 已提交
710 711 712 713 714 715 716 717 718 719
}
EXPORT_SYMBOL(memscan);
#endif

#ifndef __HAVE_ARCH_STRSTR
/**
 * strstr - Find the first substring in a %NUL terminated string
 * @s1: The string to be searched
 * @s2: The string to search for
 */
720
char *strstr(const char *s1, const char *s2)
L
Linus Torvalds 已提交
721
{
L
Li Zefan 已提交
722
	size_t l1, l2;
L
Linus Torvalds 已提交
723 724 725

	l2 = strlen(s2);
	if (!l2)
726
		return (char *)s1;
L
Linus Torvalds 已提交
727 728 729
	l1 = strlen(s1);
	while (l1 >= l2) {
		l1--;
730 731
		if (!memcmp(s1, s2, l2))
			return (char *)s1;
L
Linus Torvalds 已提交
732 733 734 735 736 737 738
		s1++;
	}
	return NULL;
}
EXPORT_SYMBOL(strstr);
#endif

L
Li Zefan 已提交
739 740 741 742 743 744 745 746 747
#ifndef __HAVE_ARCH_STRNSTR
/**
 * strnstr - Find the first substring in a length-limited string
 * @s1: The string to be searched
 * @s2: The string to search for
 * @len: the maximum number of characters to search
 */
char *strnstr(const char *s1, const char *s2, size_t len)
{
748
	size_t l2;
L
Li Zefan 已提交
749 750 751 752

	l2 = strlen(s2);
	if (!l2)
		return (char *)s1;
753 754
	while (len >= l2) {
		len--;
L
Li Zefan 已提交
755 756 757 758 759 760 761 762 763
		if (!memcmp(s1, s2, l2))
			return (char *)s1;
		s1++;
	}
	return NULL;
}
EXPORT_SYMBOL(strnstr);
#endif

L
Linus Torvalds 已提交
764 765 766 767 768 769 770 771 772 773 774 775 776 777 778
#ifndef __HAVE_ARCH_MEMCHR
/**
 * memchr - Find a character in an area of memory.
 * @s: The memory area
 * @c: The byte to search for
 * @n: The size of the area.
 *
 * returns the address of the first occurrence of @c, or %NULL
 * if @c is not found
 */
void *memchr(const void *s, int c, size_t n)
{
	const unsigned char *p = s;
	while (n-- != 0) {
        	if ((unsigned char)c == *p++) {
779
			return (void *)(p - 1);
L
Linus Torvalds 已提交
780 781 782 783 784 785
		}
	}
	return NULL;
}
EXPORT_SYMBOL(memchr);
#endif
786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815

static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes)
{
	while (bytes) {
		if (*start != value)
			return (void *)start;
		start++;
		bytes--;
	}
	return NULL;
}

/**
 * memchr_inv - Find an unmatching character in an area of memory.
 * @start: The memory area
 * @c: Find a character other than c
 * @bytes: The size of the area.
 *
 * returns the address of the first character other than @c, or %NULL
 * if the whole buffer contains just @c.
 */
void *memchr_inv(const void *start, int c, size_t bytes)
{
	u8 value = c;
	u64 value64;
	unsigned int words, prefix;

	if (bytes <= 16)
		return check_bytes8(start, value, bytes);

816
	value64 = value;
817
#if defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER) && BITS_PER_LONG == 64
818
	value64 *= 0x0101010101010101;
819
#elif defined(CONFIG_ARCH_HAS_FAST_MULTIPLIER)
820 821 822 823 824 825 826
	value64 *= 0x01010101;
	value64 |= value64 << 32;
#else
	value64 |= value64 << 8;
	value64 |= value64 << 16;
	value64 |= value64 << 32;
#endif
827

828
	prefix = (unsigned long)start % 8;
829
	if (prefix) {
830 831 832 833
		u8 *r;

		prefix = 8 - prefix;
		r = check_bytes8(start, value, prefix);
834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851
		if (r)
			return r;
		start += prefix;
		bytes -= prefix;
	}

	words = bytes / 8;

	while (words) {
		if (*(u64 *)start != value64)
			return check_bytes8(start, value, 8);
		start += 8;
		words--;
	}

	return check_bytes8(start, value, bytes % 8);
}
EXPORT_SYMBOL(memchr_inv);