2 * This file is part of the libpayload project.
4 * Copyright (C) 2007 Uwe Hermann <uwe@hermann-uwe.de>
5 * Copyright (C) 2008 Advanced Micro Devices, Inc.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. The name of the author may not be used to endorse or promote products
16 * derived from this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 #include <libpayload.h>
34 * Calculate the length of a fixed-size string.
36 * @param str The input string.
37 * @param maxlen Return at most maxlen characters as length of the string.
38 * @return The length of the string, not including the final NUL character.
39 * The maximum length returned is maxlen.
41 size_t strnlen(const char *str, size_t maxlen)
45 /* NULL and empty strings have length 0. */
49 /* Loop until we find a NUL character, or maxlen is reached. */
50 while ((*str++ != '\0') && (len < maxlen))
57 * Calculate the length of a string.
59 * @param str The input string.
60 * @return The length of the string, not including the final NUL character.
62 size_t strlen(const char *str)
66 /* NULL and empty strings have length 0. */
70 /* Loop until we find a NUL character. */
71 while (*str++ != '\0')
78 * Compare two strings.
80 * @param s1 The first string.
81 * @param s2 The second string.
82 * @return Returns a value less than zero, if s1 is shorter than s2. Returns
83 * zero, if s1 equals s2. Returns a value greater than zero, if
84 * s1 is longer than s2.
86 int strcmp(const char *s1, const char *s2)
90 /* Set c1 == c2, so that we can enter the while loop. */
94 /* Compare characters until they differ, or one of the strings ends. */
96 /* Read the next character from each string. */
100 /* Return something negative (if s1 is shorter than s2), or
101 zero (if s1 equals s2). */
106 /* Return something positive (if s1 is longer than s2), or zero (if s1
107 and s2 are equal). */
112 * Compare two strings with fixed length.
114 * @param s1 The first string.
115 * @param s2 The second string.
116 * @param maxlen Return at most maxlen characters as length of the string.
117 * @return A non-zero value if s1 and s2 differ, or zero if s1 equals s2.
119 int strncmp(const char *s1, const char *s2, int maxlen)
123 for (i = 0; i < maxlen; i++) {
125 return s1[i] - s2[i];
131 char *strncpy(char *d, const char *s, int n)
133 /* Use +1 to get the NUL terminator. */
134 int max = n > strlen(s) + 1 ? strlen(s) + 1 : n;
137 for (i = 0; i < max; i++)
143 char *strcpy(char *d, const char *s)
145 return strncpy(d, s, strlen(s) + 1);
148 char *strncat(char *d, const char *s, int n)
150 char *p = d + strlen(d);
151 int max = n > strlen(s) ? strlen(s) : n;
154 for (i = 0; i < max; i++)
161 char *strchr(const char *s, int c)
165 for (; *p != 0; p++) {
173 char *strdup(const char *s)
184 char *strstr(const char *h, const char *n)
190 for (i = 0; i <= hn - nn; i++)
191 if (!strcmp(&h[i], n))
192 return (char *)&h[i];