uboot-strtoul.patch
[u-boot-openmoko/mini2440.git] / lib_generic / string.c
blobe0b793abbee5106e5614f51f7876fd1e6be1d5e5
1 /*
2 * linux/lib/string.c
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
7 /*
8 * stupid library routines.. The optimized versions should generally be found
9 * as inline code in <asm-xx/string.h>
11 * These are buggy as well..
13 * * Fri Jun 25 1999, Ingo Oeser <ioe@informatik.tu-chemnitz.de>
14 * - Added strsep() which will replace strtok() soon (because strsep() is
15 * reentrant and should be faster). Use only strsep() in new code, please.
18 #include <linux/types.h>
19 #include <linux/string.h>
20 #include <linux/ctype.h>
21 #include <malloc.h>
24 #if 0 /* not used - was: #ifndef __HAVE_ARCH_STRNICMP */
25 /**
26 * strnicmp - Case insensitive, length-limited string comparison
27 * @s1: One string
28 * @s2: The other string
29 * @len: the maximum number of characters to compare
31 int strnicmp(const char *s1, const char *s2, size_t len)
33 /* Yes, Virginia, it had better be unsigned */
34 unsigned char c1, c2;
36 c1 = 0; c2 = 0;
37 if (len) {
38 do {
39 c1 = *s1; c2 = *s2;
40 s1++; s2++;
41 if (!c1)
42 break;
43 if (!c2)
44 break;
45 if (c1 == c2)
46 continue;
47 c1 = tolower(c1);
48 c2 = tolower(c2);
49 if (c1 != c2)
50 break;
51 } while (--len);
53 return (int)c1 - (int)c2;
55 #endif
57 char * ___strtok;
59 #ifndef __HAVE_ARCH_STRCPY
60 /**
61 * strcpy - Copy a %NUL terminated string
62 * @dest: Where to copy the string to
63 * @src: Where to copy the string from
65 char * strcpy(char * dest,const char *src)
67 char *tmp = dest;
69 while ((*dest++ = *src++) != '\0')
70 /* nothing */;
71 return tmp;
73 #endif
75 #ifndef __HAVE_ARCH_STRNCPY
76 /**
77 * strncpy - Copy a length-limited, %NUL-terminated string
78 * @dest: Where to copy the string to
79 * @src: Where to copy the string from
80 * @count: The maximum number of bytes to copy
82 * Note that unlike userspace strncpy, this does not %NUL-pad the buffer.
83 * However, the result is not %NUL-terminated if the source exceeds
84 * @count bytes.
86 char * strncpy(char * dest,const char *src,size_t count)
88 char *tmp = dest;
90 while (count-- && (*dest++ = *src++) != '\0')
91 /* nothing */;
93 return tmp;
95 #endif
97 #ifndef __HAVE_ARCH_STRCAT
98 /**
99 * strcat - Append one %NUL-terminated string to another
100 * @dest: The string to be appended to
101 * @src: The string to append to it
103 char * strcat(char * dest, const char * src)
105 char *tmp = dest;
107 while (*dest)
108 dest++;
109 while ((*dest++ = *src++) != '\0')
112 return tmp;
114 #endif
116 #ifndef __HAVE_ARCH_STRNCAT
118 * strncat - Append a length-limited, %NUL-terminated string to another
119 * @dest: The string to be appended to
120 * @src: The string to append to it
121 * @count: The maximum numbers of bytes to copy
123 * Note that in contrast to strncpy, strncat ensures the result is
124 * terminated.
126 char * strncat(char *dest, const char *src, size_t count)
128 char *tmp = dest;
130 if (count) {
131 while (*dest)
132 dest++;
133 while ((*dest++ = *src++)) {
134 if (--count == 0) {
135 *dest = '\0';
136 break;
141 return tmp;
143 #endif
145 #ifndef __HAVE_ARCH_STRCMP
147 * strcmp - Compare two strings
148 * @cs: One string
149 * @ct: Another string
151 int strcmp(const char * cs,const char * ct)
153 register signed char __res;
155 while (1) {
156 if ((__res = *cs - *ct++) != 0 || !*cs++)
157 break;
160 return __res;
162 #endif
164 #ifndef __HAVE_ARCH_STRNCMP
166 * strncmp - Compare two length-limited strings
167 * @cs: One string
168 * @ct: Another string
169 * @count: The maximum number of bytes to compare
171 int strncmp(const char * cs,const char * ct,size_t count)
173 register signed char __res = 0;
175 while (count) {
176 if ((__res = *cs - *ct++) != 0 || !*cs++)
177 break;
178 count--;
181 return __res;
183 #endif
185 #ifndef __HAVE_ARCH_STRCHR
187 * strchr - Find the first occurrence of a character in a string
188 * @s: The string to be searched
189 * @c: The character to search for
191 char * strchr(const char * s, int c)
193 for(; *s != (char) c; ++s)
194 if (*s == '\0')
195 return NULL;
196 return (char *) s;
198 #endif
200 #ifndef __HAVE_ARCH_STRRCHR
202 * strrchr - Find the last occurrence of a character in a string
203 * @s: The string to be searched
204 * @c: The character to search for
206 char * strrchr(const char * s, int c)
208 const char *p = s + strlen(s);
209 do {
210 if (*p == (char)c)
211 return (char *)p;
212 } while (--p >= s);
213 return NULL;
215 #endif
217 #ifndef __HAVE_ARCH_STRLEN
219 * strlen - Find the length of a string
220 * @s: The string to be sized
222 size_t strlen(const char * s)
224 const char *sc;
226 for (sc = s; *sc != '\0'; ++sc)
227 /* nothing */;
228 return sc - s;
230 #endif
232 #ifndef __HAVE_ARCH_STRNLEN
234 * strnlen - Find the length of a length-limited string
235 * @s: The string to be sized
236 * @count: The maximum number of bytes to search
238 size_t strnlen(const char * s, size_t count)
240 const char *sc;
242 for (sc = s; count-- && *sc != '\0'; ++sc)
243 /* nothing */;
244 return sc - s;
246 #endif
248 #ifndef __HAVE_ARCH_STRDUP
249 char * strdup(const char *s)
251 char *new;
253 if ((s == NULL) ||
254 ((new = malloc (strlen(s) + 1)) == NULL) ) {
255 return NULL;
258 strcpy (new, s);
259 return new;
261 #endif
263 #ifndef __HAVE_ARCH_STRSPN
265 * strspn - Calculate the length of the initial substring of @s which only
266 * contain letters in @accept
267 * @s: The string to be searched
268 * @accept: The string to search for
270 size_t strspn(const char *s, const char *accept)
272 const char *p;
273 const char *a;
274 size_t count = 0;
276 for (p = s; *p != '\0'; ++p) {
277 for (a = accept; *a != '\0'; ++a) {
278 if (*p == *a)
279 break;
281 if (*a == '\0')
282 return count;
283 ++count;
286 return count;
288 #endif
290 #ifndef __HAVE_ARCH_STRPBRK
292 * strpbrk - Find the first occurrence of a set of characters
293 * @cs: The string to be searched
294 * @ct: The characters to search for
296 char * strpbrk(const char * cs,const char * ct)
298 const char *sc1,*sc2;
300 for( sc1 = cs; *sc1 != '\0'; ++sc1) {
301 for( sc2 = ct; *sc2 != '\0'; ++sc2) {
302 if (*sc1 == *sc2)
303 return (char *) sc1;
306 return NULL;
308 #endif
310 #ifndef __HAVE_ARCH_STRTOK
312 * strtok - Split a string into tokens
313 * @s: The string to be searched
314 * @ct: The characters to search for
316 * WARNING: strtok is deprecated, use strsep instead.
318 char * strtok(char * s,const char * ct)
320 char *sbegin, *send;
322 sbegin = s ? s : ___strtok;
323 if (!sbegin) {
324 return NULL;
326 sbegin += strspn(sbegin,ct);
327 if (*sbegin == '\0') {
328 ___strtok = NULL;
329 return( NULL );
331 send = strpbrk( sbegin, ct);
332 if (send && *send != '\0')
333 *send++ = '\0';
334 ___strtok = send;
335 return (sbegin);
337 #endif
339 #ifndef __HAVE_ARCH_STRSEP
341 * strsep - Split a string into tokens
342 * @s: The string to be searched
343 * @ct: The characters to search for
345 * strsep() updates @s to point after the token, ready for the next call.
347 * It returns empty tokens, too, behaving exactly like the libc function
348 * of that name. In fact, it was stolen from glibc2 and de-fancy-fied.
349 * Same semantics, slimmer shape. ;)
351 char * strsep(char **s, const char *ct)
353 char *sbegin = *s, *end;
355 if (sbegin == NULL)
356 return NULL;
358 end = strpbrk(sbegin, ct);
359 if (end)
360 *end++ = '\0';
361 *s = end;
363 return sbegin;
365 #endif
367 #ifndef __HAVE_ARCH_STRSWAB
369 * strswab - swap adjacent even and odd bytes in %NUL-terminated string
370 * s: address of the string
372 * returns the address of the swapped string or NULL on error. If
373 * string length is odd, last byte is untouched.
375 char *strswab(const char *s)
377 char *p, *q;
379 if ((NULL == s) || ('\0' == *s)) {
380 return (NULL);
383 for (p=(char *)s, q=p+1; (*p != '\0') && (*q != '\0'); p+=2, q+=2) {
384 char tmp;
386 tmp = *p;
387 *p = *q;
388 *q = tmp;
391 return (char *) s;
393 #endif
395 #ifndef __HAVE_ARCH_MEMSET
397 * memset - Fill a region of memory with the given value
398 * @s: Pointer to the start of the area.
399 * @c: The byte to fill the area with
400 * @count: The size of the area.
402 * Do not use memset() to access IO space, use memset_io() instead.
404 void * memset(void * s,int c,size_t count)
406 char *xs = (char *) s;
408 while (count--)
409 *xs++ = c;
411 return s;
413 #endif
415 #ifndef __HAVE_ARCH_BCOPY
417 * bcopy - Copy one area of memory to another
418 * @src: Where to copy from
419 * @dest: Where to copy to
420 * @count: The size of the area.
422 * Note that this is the same as memcpy(), with the arguments reversed.
423 * memcpy() is the standard, bcopy() is a legacy BSD function.
425 * You should not use this function to access IO space, use memcpy_toio()
426 * or memcpy_fromio() instead.
428 char * bcopy(const char * src, char * dest, int count)
430 char *tmp = dest;
432 while (count--)
433 *tmp++ = *src++;
435 return dest;
437 #endif
439 #ifndef __HAVE_ARCH_MEMCPY
441 * memcpy - Copy one area of memory to another
442 * @dest: Where to copy to
443 * @src: Where to copy from
444 * @count: The size of the area.
446 * You should not use this function to access IO space, use memcpy_toio()
447 * or memcpy_fromio() instead.
449 void * memcpy(void * dest,const void *src,size_t count)
451 char *tmp = (char *) dest, *s = (char *) src;
453 while (count--)
454 *tmp++ = *s++;
456 return dest;
458 #endif
460 #ifndef __HAVE_ARCH_MEMMOVE
462 * memmove - Copy one area of memory to another
463 * @dest: Where to copy to
464 * @src: Where to copy from
465 * @count: The size of the area.
467 * Unlike memcpy(), memmove() copes with overlapping areas.
469 void * memmove(void * dest,const void *src,size_t count)
471 char *tmp, *s;
473 if (dest <= src) {
474 tmp = (char *) dest;
475 s = (char *) src;
476 while (count--)
477 *tmp++ = *s++;
479 else {
480 tmp = (char *) dest + count;
481 s = (char *) src + count;
482 while (count--)
483 *--tmp = *--s;
486 return dest;
488 #endif
490 #ifndef __HAVE_ARCH_MEMCMP
492 * memcmp - Compare two areas of memory
493 * @cs: One area of memory
494 * @ct: Another area of memory
495 * @count: The size of the area.
497 int memcmp(const void * cs,const void * ct,size_t count)
499 const unsigned char *su1, *su2;
500 int res = 0;
502 for( su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--)
503 if ((res = *su1 - *su2) != 0)
504 break;
505 return res;
507 #endif
509 #ifndef __HAVE_ARCH_MEMSCAN
511 * memscan - Find a character in an area of memory.
512 * @addr: The memory area
513 * @c: The byte to search for
514 * @size: The size of the area.
516 * returns the address of the first occurrence of @c, or 1 byte past
517 * the area if @c is not found
519 void * memscan(void * addr, int c, size_t size)
521 unsigned char * p = (unsigned char *) addr;
523 while (size) {
524 if (*p == c)
525 return (void *) p;
526 p++;
527 size--;
529 return (void *) p;
531 #endif
533 #ifndef __HAVE_ARCH_STRSTR
535 * strstr - Find the first substring in a %NUL terminated string
536 * @s1: The string to be searched
537 * @s2: The string to search for
539 char * strstr(const char * s1,const char * s2)
541 int l1, l2;
543 l2 = strlen(s2);
544 if (!l2)
545 return (char *) s1;
546 l1 = strlen(s1);
547 while (l1 >= l2) {
548 l1--;
549 if (!memcmp(s1,s2,l2))
550 return (char *) s1;
551 s1++;
553 return NULL;
555 #endif
557 #ifndef __HAVE_ARCH_MEMCHR
559 * memchr - Find a character in an area of memory.
560 * @s: The memory area
561 * @c: The byte to search for
562 * @n: The size of the area.
564 * returns the address of the first occurrence of @c, or %NULL
565 * if @c is not found
567 void *memchr(const void *s, int c, size_t n)
569 const unsigned char *p = s;
570 while (n-- != 0) {
571 if ((unsigned char)c == *p++) {
572 return (void *)(p-1);
575 return NULL;
578 #endif