source: mainline/uspace/lib/libc/generic/string.c@ 8c20b26

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 8c20b26 was 00acd66, checked in by Jakub Jermar <jakub@…>, 18 years ago

New, better-structured, directory layout for uspace.

  • Property mode set to 100644
File size: 8.4 KB
RevLine 
[936351c1]1/*
[df4ed85]2 * Copyright (c) 2005 Martin Decky
[936351c1]3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
[a46da63]29/** @addtogroup libc
[b2951e2]30 * @{
31 */
32/** @file
33 */
34
[936351c1]35#include <string.h>
[672a24d]36#include <unistd.h>
37#include <ctype.h>
38#include <limits.h>
[7f079d9]39#include <align.h>
[672a24d]40
[936351c1]41
42/* Dummy implementation of mem/ functions */
43
[a46da63]44void *memset(void *s, int c, size_t n)
[936351c1]45{
46 char *os = s;
[a46da63]47
[936351c1]48 while (n--)
49 *(os++) = c;
[a46da63]50
[936351c1]51 return s;
52}
53
[a46da63]54struct along {
55 unsigned long n;
56} __attribute__ ((packed));
[7f079d9]57
[a46da63]58static void *unaligned_memcpy(void *dst, const void *src, size_t n)
[7f079d9]59{
60 int i, j;
61 struct along *adst = dst;
62 const struct along *asrc = src;
63
[a46da63]64 for (i = 0; i < n / sizeof(unsigned long); i++)
[7f079d9]65 adst[i].n = asrc[i].n;
66
[a46da63]67 for (j = 0; j < n % sizeof(unsigned long); j++)
68 ((unsigned char *) (((unsigned long *) dst) + i))[j] = ((unsigned char *) (((unsigned long *) src) + i))[j];
[7f079d9]69
[a46da63]70 return (char *) src;
[7f079d9]71}
72
[a46da63]73void *memcpy(void *dst, const void *src, size_t n)
[936351c1]74{
[a2ae4f4]75 int i, j;
76
[a46da63]77 if (((long) dst & (sizeof(long) - 1)) || ((long) src & (sizeof(long) - 1)))
[7f079d9]78 return unaligned_memcpy(dst, src, n);
79
[a46da63]80 for (i = 0; i < n / sizeof(unsigned long); i++)
[a2ae4f4]81 ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
82
[a46da63]83 for (j = 0; j < n % sizeof(unsigned long); j++)
84 ((unsigned char *) (((unsigned long *) dst) + i))[j] = ((unsigned char *) (((unsigned long *) src) + i))[j];
[a2ae4f4]85
[a46da63]86 return (char *) src;
[936351c1]87}
[c9857c6]88
[a46da63]89void *memmove(void *dst, const void *src, size_t n)
[a2ae4f4]90{
91 int i, j;
92
93 if (src > dst)
94 return memcpy(dst, src, n);
95
[a46da63]96 for (j = (n % sizeof(unsigned long)) - 1; j >= 0; j--)
97 ((unsigned char *) ((unsigned long *) dst))[j] = ((unsigned char *) ((unsigned long *) src))[j];
[a2ae4f4]98
[a46da63]99 for (i = n / sizeof(unsigned long) - 1; i >=0 ; i--)
[a2ae4f4]100 ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
101
[a46da63]102 return (char *) src;
[a2ae4f4]103}
104
[df24ec3]105/** Compare two memory areas.
106 *
107 * @param s1 Pointer to the first area to compare.
108 * @param s2 Pointer to the second area to compare.
109 * @param len Size of the first area in bytes. Both areas must have the same
110 * length.
111 * @return If len is 0, return zero. If the areas match, return zero.
112 * Otherwise return non-zero.
113 */
114int bcmp(const char *s1, const char *s2, size_t len)
115{
116 for (; len && *s1++ == *s2++; len--)
117 ;
118 return len;
119}
[a2ae4f4]120
[672a24d]121/** Count the number of characters in the string, not including terminating 0.
122 * @param str string
123 * @return number of characters in string.
124 */
[c9857c6]125size_t strlen(const char *str)
126{
[523fad8]127 size_t counter = 0;
[c9857c6]128
[a46da63]129 while (str[counter] != 0)
[c9857c6]130 counter++;
131
132 return counter;
133}
[672a24d]134
[a46da63]135int strcmp(const char *a, const char *b)
[c0535f80]136{
[a46da63]137 int c = 0;
[c0535f80]138
[a46da63]139 while (a[c] && b[c] && (!(a[c] - b[c])))
140 c++;
[c0535f80]141
[a46da63]142 return (a[c] - b[c]);
[c0535f80]143
144}
145
146
[672a24d]147/** Return pointer to the first occurence of character c in string
148 * @param str scanned string
149 * @param c searched character (taken as one byte)
150 * @return pointer to the matched character or NULL if it is not found in given string.
151 */
152char *strchr(const char *str, int c)
153{
154 while (*str != '\0') {
[a46da63]155 if (*str == (char) c)
156 return (char *) str;
[672a24d]157 str++;
158 }
159
160 return NULL;
161}
162
163/** Return pointer to the last occurence of character c in string
164 * @param str scanned string
165 * @param c searched character (taken as one byte)
166 * @return pointer to the matched character or NULL if it is not found in given string.
167 */
168char *strrchr(const char *str, int c)
169{
170 char *retval = NULL;
171
172 while (*str != '\0') {
[a46da63]173 if (*str == (char) c)
174 retval = (char *) str;
[672a24d]175 str++;
176 }
177
[a46da63]178 return (char *) retval;
[672a24d]179}
180
181/** Convert string to a number.
182 * Core of strtol and strtoul functions.
183 * @param nptr pointer to string
184 * @param endptr if not NULL, function stores here pointer to the first invalid character
185 * @param base zero or number between 2 and 36 inclusive
186 * @param sgn its set to 1 if minus found
187 * @return result of conversion.
188 */
189static unsigned long _strtoul(const char *nptr, char **endptr, int base, char *sgn)
190{
191 unsigned char c;
192 unsigned long result = 0;
193 unsigned long a, b;
194 const char *str = nptr;
195 const char *tmpptr;
196
197 while (isspace(*str))
198 str++;
199
200 if (*str == '-') {
201 *sgn = 1;
202 ++str;
203 } else if (*str == '+')
204 ++str;
205
206 if (base) {
207 if ((base == 1) || (base > 36)) {
208 /* FIXME: set errno to EINVAL */
209 return 0;
210 }
211 if ((base == 16) && (*str == '0') && ((str[1] == 'x') || (str[1] == 'X'))) {
212 str += 2;
213 }
214 } else {
215 base = 10;
216
217 if (*str == '0') {
218 base = 8;
219 if ((str[1] == 'X') || (str[1] == 'x')) {
220 base = 16;
221 str += 2;
222 }
223 }
224 }
225
226 tmpptr = str;
227
228 while (*str) {
229 c = *str;
[a46da63]230 c = (c >= 'a' ? c - 'a' + 10 : (c >= 'A' ? c - 'A' + 10 : (c <= '9' ? c - '0' : 0xff)));
[672a24d]231 if (c > base) {
232 break;
233 }
234
235 a = (result & 0xff) * base + c;
236 b = (result >> 8) * base + (a >> 8);
237
238 if (b > (ULONG_MAX >> 8)) {
239 /* overflow */
240 /* FIXME: errno = ERANGE*/
241 return ULONG_MAX;
242 }
243
244 result = (b << 8) + (a & 0xff);
245 ++str;
246 }
247
248 if (str == tmpptr) {
249 /* no number was found => first invalid character is the first character of the string */
250 /* FIXME: set errno to EINVAL */
251 str = nptr;
252 result = 0;
253 }
254
255 if (endptr)
[a46da63]256 *endptr = (char *) str;
[672a24d]257
258 if (nptr == str) {
259 /*FIXME: errno = EINVAL*/
260 return 0;
261 }
262
263 return result;
264}
265
266/** Convert initial part of string to long int according to given base.
267 * The number may begin with an arbitrary number of whitespaces followed by optional sign (`+' or `-').
268 * If the base is 0 or 16, the prefix `0x' may be inserted and the number will be taken as hexadecimal one.
269 * If the base is 0 and the number begin with a zero, number will be taken as octal one (as with base 8).
270 * Otherwise the base 0 is taken as decimal.
271 * @param nptr pointer to string
272 * @param endptr if not NULL, function stores here pointer to the first invalid character
273 * @param base zero or number between 2 and 36 inclusive
274 * @return result of conversion.
275 */
276long int strtol(const char *nptr, char **endptr, int base)
277{
278 char sgn = 0;
279 unsigned long number = 0;
280
281 number = _strtoul(nptr, endptr, base, &sgn);
282
283 if (number > LONG_MAX) {
[a46da63]284 if ((sgn) && (number == (unsigned long) (LONG_MAX) + 1)) {
[672a24d]285 /* FIXME: set 0 to errno */
286 return number;
287 }
288 /* FIXME: set ERANGE to errno */
[a46da63]289 return (sgn ? LONG_MIN : LONG_MAX);
[672a24d]290 }
291
[a46da63]292 return (sgn ? -number : number);
[672a24d]293}
294
295
296/** Convert initial part of string to unsigned long according to given base.
297 * The number may begin with an arbitrary number of whitespaces followed by optional sign (`+' or `-').
298 * If the base is 0 or 16, the prefix `0x' may be inserted and the number will be taken as hexadecimal one.
299 * If the base is 0 and the number begin with a zero, number will be taken as octal one (as with base 8).
300 * Otherwise the base 0 is taken as decimal.
301 * @param nptr pointer to string
302 * @param endptr if not NULL, function stores here pointer to the first invalid character
303 * @param base zero or number between 2 and 36 inclusive
304 * @return result of conversion.
305 */
306unsigned long strtoul(const char *nptr, char **endptr, int base)
307{
308 char sgn = 0;
309 unsigned long number = 0;
310
311 number = _strtoul(nptr, endptr, base, &sgn);
312
[a46da63]313 return (sgn ? -number : number);
[672a24d]314}
[c594489]315
316char *strcpy(char *dest, const char *src)
317{
[a46da63]318 char *orig = dest;
319
320 while ((*(dest++) = *(src++)));
321 return orig;
[c594489]322}
323
324char *strncpy(char *dest, const char *src, size_t n)
325{
[a46da63]326 char *orig = dest;
327
328 while ((*(dest++) = *(src++)) && --n);
329 return orig;
[c594489]330}
[b2951e2]331
[a46da63]332/** @}
[b2951e2]333 */
Note: See TracBrowser for help on using the repository browser.