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