1b2441318SGreg Kroah-Hartman // SPDX-License-Identifier: GPL-2.0
2e8f3010fSArd Biesheuvel /*
3e8f3010fSArd Biesheuvel  * Taken from:
4e8f3010fSArd Biesheuvel  *  linux/lib/string.c
5e8f3010fSArd Biesheuvel  *
6e8f3010fSArd Biesheuvel  *  Copyright (C) 1991, 1992  Linus Torvalds
7e8f3010fSArd Biesheuvel  */
8e8f3010fSArd Biesheuvel 
991d150c0SArd Biesheuvel #include <linux/ctype.h>
10aad0f3d6STian Tao #include <linux/kernel.h>
11e8f3010fSArd Biesheuvel #include <linux/types.h>
12e8f3010fSArd Biesheuvel #include <linux/string.h>
13e8f3010fSArd Biesheuvel 
142e6fa86fSArd Biesheuvel #ifndef EFI_HAVE_STRLEN
152e6fa86fSArd Biesheuvel /**
162e6fa86fSArd Biesheuvel  * strlen - Find the length of a string
172e6fa86fSArd Biesheuvel  * @s: The string to be sized
182e6fa86fSArd Biesheuvel  */
strlen(const char * s)192e6fa86fSArd Biesheuvel size_t strlen(const char *s)
202e6fa86fSArd Biesheuvel {
212e6fa86fSArd Biesheuvel 	const char *sc;
222e6fa86fSArd Biesheuvel 
232e6fa86fSArd Biesheuvel 	for (sc = s; *sc != '\0'; ++sc)
242e6fa86fSArd Biesheuvel 		/* nothing */;
252e6fa86fSArd Biesheuvel 	return sc - s;
262e6fa86fSArd Biesheuvel }
272e6fa86fSArd Biesheuvel #endif
282e6fa86fSArd Biesheuvel 
292e6fa86fSArd Biesheuvel #ifndef EFI_HAVE_STRNLEN
302e6fa86fSArd Biesheuvel /**
312e6fa86fSArd Biesheuvel  * strnlen - Find the length of a length-limited string
322e6fa86fSArd Biesheuvel  * @s: The string to be sized
332e6fa86fSArd Biesheuvel  * @count: The maximum number of bytes to search
342e6fa86fSArd Biesheuvel  */
strnlen(const char * s,size_t count)352e6fa86fSArd Biesheuvel size_t strnlen(const char *s, size_t count)
362e6fa86fSArd Biesheuvel {
372e6fa86fSArd Biesheuvel 	const char *sc;
382e6fa86fSArd Biesheuvel 
392e6fa86fSArd Biesheuvel 	for (sc = s; count-- && *sc != '\0'; ++sc)
402e6fa86fSArd Biesheuvel 		/* nothing */;
412e6fa86fSArd Biesheuvel 	return sc - s;
422e6fa86fSArd Biesheuvel }
432e6fa86fSArd Biesheuvel #endif
442e6fa86fSArd Biesheuvel 
45e8f3010fSArd Biesheuvel /**
46e8f3010fSArd Biesheuvel  * strstr - Find the first substring in a %NUL terminated string
47e8f3010fSArd Biesheuvel  * @s1: The string to be searched
48e8f3010fSArd Biesheuvel  * @s2: The string to search for
49e8f3010fSArd Biesheuvel  */
strstr(const char * s1,const char * s2)50e8f3010fSArd Biesheuvel char *strstr(const char *s1, const char *s2)
51e8f3010fSArd Biesheuvel {
52e8f3010fSArd Biesheuvel 	size_t l1, l2;
53e8f3010fSArd Biesheuvel 
54e8f3010fSArd Biesheuvel 	l2 = strlen(s2);
55e8f3010fSArd Biesheuvel 	if (!l2)
56e8f3010fSArd Biesheuvel 		return (char *)s1;
57e8f3010fSArd Biesheuvel 	l1 = strlen(s1);
58e8f3010fSArd Biesheuvel 	while (l1 >= l2) {
59e8f3010fSArd Biesheuvel 		l1--;
60e8f3010fSArd Biesheuvel 		if (!memcmp(s1, s2, l2))
61e8f3010fSArd Biesheuvel 			return (char *)s1;
62e8f3010fSArd Biesheuvel 		s1++;
63e8f3010fSArd Biesheuvel 	}
64e8f3010fSArd Biesheuvel 	return NULL;
65e8f3010fSArd Biesheuvel }
66e8f3010fSArd Biesheuvel 
67*da8dd0c7SArd Biesheuvel #ifndef EFI_HAVE_STRCMP
68*da8dd0c7SArd Biesheuvel /**
69*da8dd0c7SArd Biesheuvel  * strcmp - Compare two strings
70*da8dd0c7SArd Biesheuvel  * @cs: One string
71*da8dd0c7SArd Biesheuvel  * @ct: Another string
72*da8dd0c7SArd Biesheuvel  */
strcmp(const char * cs,const char * ct)73*da8dd0c7SArd Biesheuvel int strcmp(const char *cs, const char *ct)
74*da8dd0c7SArd Biesheuvel {
75*da8dd0c7SArd Biesheuvel 	unsigned char c1, c2;
76*da8dd0c7SArd Biesheuvel 
77*da8dd0c7SArd Biesheuvel 	while (1) {
78*da8dd0c7SArd Biesheuvel 		c1 = *cs++;
79*da8dd0c7SArd Biesheuvel 		c2 = *ct++;
80*da8dd0c7SArd Biesheuvel 		if (c1 != c2)
81*da8dd0c7SArd Biesheuvel 			return c1 < c2 ? -1 : 1;
82*da8dd0c7SArd Biesheuvel 		if (!c1)
83*da8dd0c7SArd Biesheuvel 			break;
84*da8dd0c7SArd Biesheuvel 	}
85*da8dd0c7SArd Biesheuvel 	return 0;
86*da8dd0c7SArd Biesheuvel }
87*da8dd0c7SArd Biesheuvel #endif
88*da8dd0c7SArd Biesheuvel 
89e8f3010fSArd Biesheuvel /**
90e8f3010fSArd Biesheuvel  * strncmp - Compare two length-limited strings
91e8f3010fSArd Biesheuvel  * @cs: One string
92e8f3010fSArd Biesheuvel  * @ct: Another string
93e8f3010fSArd Biesheuvel  * @count: The maximum number of bytes to compare
94e8f3010fSArd Biesheuvel  */
strncmp(const char * cs,const char * ct,size_t count)95e8f3010fSArd Biesheuvel int strncmp(const char *cs, const char *ct, size_t count)
96e8f3010fSArd Biesheuvel {
97e8f3010fSArd Biesheuvel 	unsigned char c1, c2;
98e8f3010fSArd Biesheuvel 
99e8f3010fSArd Biesheuvel 	while (count) {
100e8f3010fSArd Biesheuvel 		c1 = *cs++;
101e8f3010fSArd Biesheuvel 		c2 = *ct++;
102e8f3010fSArd Biesheuvel 		if (c1 != c2)
103e8f3010fSArd Biesheuvel 			return c1 < c2 ? -1 : 1;
104e8f3010fSArd Biesheuvel 		if (!c1)
105e8f3010fSArd Biesheuvel 			break;
106e8f3010fSArd Biesheuvel 		count--;
107e8f3010fSArd Biesheuvel 	}
108e8f3010fSArd Biesheuvel 	return 0;
109e8f3010fSArd Biesheuvel }
11091d150c0SArd Biesheuvel 
11191d150c0SArd Biesheuvel /* Works only for digits and letters, but small and fast */
11291d150c0SArd Biesheuvel #define TOLOWER(x) ((x) | 0x20)
11391d150c0SArd Biesheuvel 
simple_guess_base(const char * cp)11491d150c0SArd Biesheuvel static unsigned int simple_guess_base(const char *cp)
11591d150c0SArd Biesheuvel {
11691d150c0SArd Biesheuvel 	if (cp[0] == '0') {
11791d150c0SArd Biesheuvel 		if (TOLOWER(cp[1]) == 'x' && isxdigit(cp[2]))
11891d150c0SArd Biesheuvel 			return 16;
11991d150c0SArd Biesheuvel 		else
12091d150c0SArd Biesheuvel 			return 8;
12191d150c0SArd Biesheuvel 	} else {
12291d150c0SArd Biesheuvel 		return 10;
12391d150c0SArd Biesheuvel 	}
12491d150c0SArd Biesheuvel }
12591d150c0SArd Biesheuvel 
12691d150c0SArd Biesheuvel /**
12791d150c0SArd Biesheuvel  * simple_strtoull - convert a string to an unsigned long long
12891d150c0SArd Biesheuvel  * @cp: The start of the string
12991d150c0SArd Biesheuvel  * @endp: A pointer to the end of the parsed string will be placed here
13091d150c0SArd Biesheuvel  * @base: The number base to use
13191d150c0SArd Biesheuvel  */
13291d150c0SArd Biesheuvel 
simple_strtoull(const char * cp,char ** endp,unsigned int base)13391d150c0SArd Biesheuvel unsigned long long simple_strtoull(const char *cp, char **endp, unsigned int base)
13491d150c0SArd Biesheuvel {
13591d150c0SArd Biesheuvel 	unsigned long long result = 0;
13691d150c0SArd Biesheuvel 
13791d150c0SArd Biesheuvel 	if (!base)
13891d150c0SArd Biesheuvel 		base = simple_guess_base(cp);
13991d150c0SArd Biesheuvel 
14091d150c0SArd Biesheuvel 	if (base == 16 && cp[0] == '0' && TOLOWER(cp[1]) == 'x')
14191d150c0SArd Biesheuvel 		cp += 2;
14291d150c0SArd Biesheuvel 
14391d150c0SArd Biesheuvel 	while (isxdigit(*cp)) {
14491d150c0SArd Biesheuvel 		unsigned int value;
14591d150c0SArd Biesheuvel 
14691d150c0SArd Biesheuvel 		value = isdigit(*cp) ? *cp - '0' : TOLOWER(*cp) - 'a' + 10;
14791d150c0SArd Biesheuvel 		if (value >= base)
14891d150c0SArd Biesheuvel 			break;
14991d150c0SArd Biesheuvel 		result = result * base + value;
15091d150c0SArd Biesheuvel 		cp++;
15191d150c0SArd Biesheuvel 	}
15291d150c0SArd Biesheuvel 	if (endp)
15391d150c0SArd Biesheuvel 		*endp = (char *)cp;
15491d150c0SArd Biesheuvel 
15591d150c0SArd Biesheuvel 	return result;
15691d150c0SArd Biesheuvel }
15791d150c0SArd Biesheuvel 
simple_strtol(const char * cp,char ** endp,unsigned int base)15891d150c0SArd Biesheuvel long simple_strtol(const char *cp, char **endp, unsigned int base)
15991d150c0SArd Biesheuvel {
16091d150c0SArd Biesheuvel 	if (*cp == '-')
16191d150c0SArd Biesheuvel 		return -simple_strtoull(cp + 1, endp, base);
16291d150c0SArd Biesheuvel 
16391d150c0SArd Biesheuvel 	return simple_strtoull(cp, endp, base);
16491d150c0SArd Biesheuvel }
165*da8dd0c7SArd Biesheuvel 
166*da8dd0c7SArd Biesheuvel #ifdef CONFIG_EFI_PARAMS_FROM_FDT
167*da8dd0c7SArd Biesheuvel #ifndef EFI_HAVE_STRRCHR
168*da8dd0c7SArd Biesheuvel /**
169*da8dd0c7SArd Biesheuvel  * strrchr - Find the last occurrence of a character in a string
170*da8dd0c7SArd Biesheuvel  * @s: The string to be searched
171*da8dd0c7SArd Biesheuvel  * @c: The character to search for
172*da8dd0c7SArd Biesheuvel  */
strrchr(const char * s,int c)173*da8dd0c7SArd Biesheuvel char *strrchr(const char *s, int c)
174*da8dd0c7SArd Biesheuvel {
175*da8dd0c7SArd Biesheuvel 	const char *last = NULL;
176*da8dd0c7SArd Biesheuvel 	do {
177*da8dd0c7SArd Biesheuvel 		if (*s == (char)c)
178*da8dd0c7SArd Biesheuvel 			last = s;
179*da8dd0c7SArd Biesheuvel 	} while (*s++);
180*da8dd0c7SArd Biesheuvel 	return (char *)last;
181*da8dd0c7SArd Biesheuvel }
182*da8dd0c7SArd Biesheuvel #endif
183*da8dd0c7SArd Biesheuvel #ifndef EFI_HAVE_MEMCHR
184*da8dd0c7SArd Biesheuvel /**
185*da8dd0c7SArd Biesheuvel  * memchr - Find a character in an area of memory.
186*da8dd0c7SArd Biesheuvel  * @s: The memory area
187*da8dd0c7SArd Biesheuvel  * @c: The byte to search for
188*da8dd0c7SArd Biesheuvel  * @n: The size of the area.
189*da8dd0c7SArd Biesheuvel  *
190*da8dd0c7SArd Biesheuvel  * returns the address of the first occurrence of @c, or %NULL
191*da8dd0c7SArd Biesheuvel  * if @c is not found
192*da8dd0c7SArd Biesheuvel  */
memchr(const void * s,int c,size_t n)193*da8dd0c7SArd Biesheuvel void *memchr(const void *s, int c, size_t n)
194*da8dd0c7SArd Biesheuvel {
195*da8dd0c7SArd Biesheuvel 	const unsigned char *p = s;
196*da8dd0c7SArd Biesheuvel 	while (n-- != 0) {
197*da8dd0c7SArd Biesheuvel 		if ((unsigned char)c == *p++) {
198*da8dd0c7SArd Biesheuvel 			return (void *)(p - 1);
199*da8dd0c7SArd Biesheuvel 		}
200*da8dd0c7SArd Biesheuvel 	}
201*da8dd0c7SArd Biesheuvel 	return NULL;
202*da8dd0c7SArd Biesheuvel }
203*da8dd0c7SArd Biesheuvel #endif
204*da8dd0c7SArd Biesheuvel #endif
205