Subversion Repositories HelenOS

Rev

Rev 2787 | Rev 3437 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2787 Rev 3425
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
#include <sys/types.h>
40
#include <sys/types.h>
41
 
-
 
-
 
41
#include <malloc.h>
42
 
42
 
43
/* Dummy implementation of mem/ functions */
43
/* Dummy implementation of mem/ functions */
44
 
44
 
45
void *memset(void *s, int c, size_t n)
45
void *memset(void *s, int c, size_t n)
46
{
46
{
47
    char *os = s;
47
    char *os = s;
48
   
48
   
49
    while (n--)
49
    while (n--)
50
        *(os++) = c;
50
        *(os++) = c;
51
   
51
   
52
    return s;
52
    return s;
53
}
53
}
54
 
54
 
55
struct along {
55
struct along {
56
    unsigned long n;
56
    unsigned long n;
57
} __attribute__ ((packed));
57
} __attribute__ ((packed));
58
 
58
 
59
static void *unaligned_memcpy(void *dst, const void *src, size_t n)
59
static void *unaligned_memcpy(void *dst, const void *src, size_t n)
60
{
60
{
61
    int i, j;
61
    int i, j;
62
    struct along *adst = dst;
62
    struct along *adst = dst;
63
    const struct along *asrc = src;
63
    const struct along *asrc = src;
64
 
64
 
65
    for (i = 0; i < n / sizeof(unsigned long); i++)
65
    for (i = 0; i < n / sizeof(unsigned long); i++)
66
        adst[i].n = asrc[i].n;
66
        adst[i].n = asrc[i].n;
67
       
67
       
68
    for (j = 0; j < n % sizeof(unsigned long); j++)
68
    for (j = 0; j < n % sizeof(unsigned long); j++)
-
 
69
        ((unsigned char *) (((unsigned long *) dst) + i))[j] =
69
        ((unsigned char *) (((unsigned long *) dst) + i))[j] = ((unsigned char *) (((unsigned long *) src) + i))[j];
70
            ((unsigned char *) (((unsigned long *) src) + i))[j];
70
       
71
       
71
    return (char *) src;
72
    return (char *) dst;
72
}
73
}
73
 
74
 
74
void *memcpy(void *dst, const void *src, size_t n)
75
void *memcpy(void *dst, const void *src, size_t n)
75
{
76
{
76
    int i, j;
77
    int i, j;
77
 
78
 
78
    if (((long) dst & (sizeof(long) - 1)) || ((long) src & (sizeof(long) - 1)))
79
    if (((long) dst & (sizeof(long) - 1)) ||
-
 
80
        ((long) src & (sizeof(long) - 1)))
79
        return unaligned_memcpy(dst, src, n);
81
        return unaligned_memcpy(dst, src, n);
80
 
82
 
81
    for (i = 0; i < n / sizeof(unsigned long); i++)
83
    for (i = 0; i < n / sizeof(unsigned long); i++)
82
        ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
84
        ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
83
       
85
       
84
    for (j = 0; j < n % sizeof(unsigned long); j++)
86
    for (j = 0; j < n % sizeof(unsigned long); j++)
-
 
87
        ((unsigned char *) (((unsigned long *) dst) + i))[j] =
85
        ((unsigned char *) (((unsigned long *) dst) + i))[j] = ((unsigned char *) (((unsigned long *) src) + i))[j];
88
            ((unsigned char *) (((unsigned long *) src) + i))[j];
86
       
89
       
87
    return (char *) src;
90
    return (char *) dst;
88
}
91
}
89
 
92
 
90
void *memmove(void *dst, const void *src, size_t n)
93
void *memmove(void *dst, const void *src, size_t n)
91
{
94
{
92
    int i, j;
95
    int i, j;
93
   
96
   
94
    if (src > dst)
97
    if (src > dst)
95
        return memcpy(dst, src, n);
98
        return memcpy(dst, src, n);
96
 
99
 
97
    for (j = (n % sizeof(unsigned long)) - 1; j >= 0; j--)
100
    for (j = (n % sizeof(unsigned long)) - 1; j >= 0; j--)
-
 
101
        ((unsigned char *) ((unsigned long *) dst))[j] =
98
        ((unsigned char *) ((unsigned long *) dst))[j] = ((unsigned char *) ((unsigned long *) src))[j];
102
            ((unsigned char *) ((unsigned long *) src))[j];
99
 
103
 
100
    for (i = n / sizeof(unsigned long) - 1; i >=0 ; i--)
104
    for (i = n / sizeof(unsigned long) - 1; i >=0 ; i--)
101
        ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
105
        ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
102
       
106
       
103
    return (char *) src;
107
    return (char *) dst;
104
}
108
}
105
 
109
 
106
/** Compare two memory areas.
110
/** Compare two memory areas.
107
 *
111
 *
108
 * @param s1    Pointer to the first area to compare.
112
 * @param s1        Pointer to the first area to compare.
109
 * @param s2    Pointer to the second area to compare.
113
 * @param s2        Pointer to the second area to compare.
110
 * @param len   Size of the first area in bytes. Both areas must have the same
114
 * @param len       Size of the first area in bytes. Both areas must have
111
 *      length.
115
 *          the same length.
112
 * @return  If len is 0, return zero. If the areas match, return zero.
116
 * @return      If len is 0, return zero. If the areas match, return
113
 *      Otherwise return non-zero.
117
 *          zero. Otherwise return non-zero.
114
 */
118
 */
115
int bcmp(const char *s1, const char *s2, size_t len)
119
int bcmp(const char *s1, const char *s2, size_t len)
116
{
120
{
117
    for (; len && *s1++ == *s2++; len--)
121
    for (; len && *s1++ == *s2++; len--)
118
        ;
122
        ;
119
    return len;
123
    return len;
120
}
124
}
121
 
125
 
122
/** Count the number of characters in the string, not including terminating 0.
126
/** Count the number of characters in the string, not including terminating 0.
-
 
127
 *
123
 * @param str string
128
 * @param str       String.
124
 * @return number of characters in string.
129
 * @return      Number of characters in string.
125
 */
130
 */
126
size_t strlen(const char *str)
131
size_t strlen(const char *str)
127
{
132
{
128
    size_t counter = 0;
133
    size_t counter = 0;
129
 
134
 
130
    while (str[counter] != 0)
135
    while (str[counter] != 0)
131
        counter++;
136
        counter++;
132
 
137
 
133
    return counter;
138
    return counter;
134
}
139
}
135
 
140
 
136
int strcmp(const char *a, const char *b)
141
int strcmp(const char *a, const char *b)
137
{
142
{
138
    int c = 0;
143
    int c = 0;
139
   
144
   
140
    while (a[c] && b[c] && (!(a[c] - b[c])))
145
    while (a[c] && b[c] && (!(a[c] - b[c])))
141
        c++;
146
        c++;
142
   
147
   
143
    return (a[c] - b[c]);
148
    return (a[c] - b[c]);
144
   
-
 
145
}
149
}
146
 
150
 
147
int strncmp(const char *a, const char *b, size_t n)
151
int strncmp(const char *a, const char *b, size_t n)
148
{
152
{
149
    size_t c = 0;
153
    size_t c = 0;
150
 
154
 
151
    while (c < n && a[c] && b[c] && (!(a[c] - b[c])))
155
    while (c < n && a[c] && b[c] && (!(a[c] - b[c])))
152
        c++;
156
        c++;
153
   
157
   
154
    return ( c < n ? a[c] - b[c] : 0);
158
    return ( c < n ? a[c] - b[c] : 0);
155
   
159
   
156
}
160
}
157
 
161
 
-
 
162
int stricmp(const char *a, const char *b)
-
 
163
{
-
 
164
    int c = 0;
-
 
165
   
-
 
166
    while (a[c] && b[c] && (!(tolower(a[c]) - tolower(b[c]))))
-
 
167
        c++;
-
 
168
   
-
 
169
    return (tolower(a[c]) - tolower(b[c]));
-
 
170
}
-
 
171
 
158
/** Return pointer to the first occurence of character c in string
172
/** Return pointer to the first occurence of character c in string.
-
 
173
 *
159
 * @param str scanned string
174
 * @param str       Scanned string.
160
 * @param c searched character (taken as one byte)
175
 * @param c     Searched character (taken as one byte).
161
 * @return pointer to the matched character or NULL if it is not found in given string.
176
 * @return      Pointer to the matched character or NULL if it is not
-
 
177
 *          found in given string.
162
 */
178
 */
163
char *strchr(const char *str, int c)
179
char *strchr(const char *str, int c)
164
{
180
{
165
    while (*str != '\0') {
181
    while (*str != '\0') {
166
        if (*str == (char) c)
182
        if (*str == (char) c)
167
            return (char *) str;
183
            return (char *) str;
168
        str++;
184
        str++;
169
    }
185
    }
170
 
186
 
171
    return NULL;
187
    return NULL;
172
}
188
}
173
 
189
 
174
/** Return pointer to the last occurence of character c in string
190
/** Return pointer to the last occurence of character c in string.
-
 
191
 *
175
 * @param str scanned string
192
 * @param str       Scanned string.
176
 * @param c searched character (taken as one byte)
193
 * @param c     Searched character (taken as one byte).
177
 * @return pointer to the matched character or NULL if it is not found in given string.
194
 * @return      Pointer to the matched character or NULL if it is not
-
 
195
 *          found in given string.
178
 */
196
 */
179
char *strrchr(const char *str, int c)
197
char *strrchr(const char *str, int c)
180
{
198
{
181
    char *retval = NULL;
199
    char *retval = NULL;
182
 
200
 
183
    while (*str != '\0') {
201
    while (*str != '\0') {
184
        if (*str == (char) c)
202
        if (*str == (char) c)
185
            retval = (char *) str;
203
            retval = (char *) str;
186
        str++;
204
        str++;
187
    }
205
    }
188
 
206
 
189
    return (char *) retval;
207
    return (char *) retval;
190
}
208
}
191
 
209
 
192
/** Convert string to a number.
210
/** Convert string to a number.
193
 * Core of strtol and strtoul functions.
211
 * Core of strtol and strtoul functions.
-
 
212
 *
194
 * @param nptr pointer to string
213
 * @param nptr      Pointer to string.
195
 * @param endptr if not NULL, function stores here pointer to the first invalid character
214
 * @param endptr    If not NULL, function stores here pointer to the first
-
 
215
 *          invalid character.
196
 * @param base zero or number between 2 and 36 inclusive
216
 * @param base      Zero or number between 2 and 36 inclusive.
197
 * @param sgn its set to 1 if minus found
217
 * @param sgn       It's set to 1 if minus found.
198
 * @return result of conversion.
218
 * @return      Result of conversion.
199
 */
219
 */
-
 
220
static unsigned long
200
static unsigned long _strtoul(const char *nptr, char **endptr, int base, char *sgn)
221
_strtoul(const char *nptr, char **endptr, int base, char *sgn)
201
{
222
{
202
    unsigned char c;
223
    unsigned char c;
203
    unsigned long result = 0;
224
    unsigned long result = 0;
204
    unsigned long a, b;
225
    unsigned long a, b;
205
    const char *str = nptr;
226
    const char *str = nptr;
206
    const char *tmpptr;
227
    const char *tmpptr;
207
   
228
   
208
    while (isspace(*str))
229
    while (isspace(*str))
209
        str++;
230
        str++;
210
   
231
   
211
    if (*str == '-') {
232
    if (*str == '-') {
212
        *sgn = 1;
233
        *sgn = 1;
213
        ++str;
234
        ++str;
214
    } else if (*str == '+')
235
    } else if (*str == '+')
215
        ++str;
236
        ++str;
216
   
237
   
217
    if (base) {
238
    if (base) {
218
        if ((base == 1) || (base > 36)) {
239
        if ((base == 1) || (base > 36)) {
219
            /* FIXME: set errno to EINVAL */
240
            /* FIXME: set errno to EINVAL */
220
            return 0;
241
            return 0;
221
        }
242
        }
222
        if ((base == 16) && (*str == '0') && ((str[1] == 'x') || (str[1] == 'X'))) {
243
        if ((base == 16) && (*str == '0') && ((str[1] == 'x') ||
-
 
244
            (str[1] == 'X'))) {
223
            str += 2;
245
            str += 2;
224
        }
246
        }
225
    } else {
247
    } else {
226
        base = 10;
248
        base = 10;
227
       
249
       
228
        if (*str == '0') {
250
        if (*str == '0') {
229
            base = 8;
251
            base = 8;
230
            if ((str[1] == 'X') || (str[1] == 'x'))  {
252
            if ((str[1] == 'X') || (str[1] == 'x'))  {
231
                base = 16;
253
                base = 16;
232
                str += 2;
254
                str += 2;
233
            }
255
            }
234
        }
256
        }
235
    }
257
    }
236
   
258
   
237
    tmpptr = str;
259
    tmpptr = str;
238
 
260
 
239
    while (*str) {
261
    while (*str) {
240
        c = *str;
262
        c = *str;
241
        c = (c >= 'a' ? c - 'a' + 10 : (c >= 'A' ? c - 'A' + 10 : (c <= '9' ? c - '0' : 0xff)));
263
        c = (c >= 'a' ? c - 'a' + 10 : (c >= 'A' ? c - 'A' + 10 :
-
 
264
            (c <= '9' ? c - '0' : 0xff)));
242
        if (c > base) {
265
        if (c > base) {
243
            break;
266
            break;
244
        }
267
        }
245
       
268
       
246
        a = (result & 0xff) * base + c;
269
        a = (result & 0xff) * base + c;
247
        b = (result >> 8) * base + (a >> 8);
270
        b = (result >> 8) * base + (a >> 8);
248
       
271
       
249
        if (b > (ULONG_MAX >> 8)) {
272
        if (b > (ULONG_MAX >> 8)) {
250
            /* overflow */
273
            /* overflow */
251
            /* FIXME: errno = ERANGE*/
274
            /* FIXME: errno = ERANGE*/
252
            return ULONG_MAX;
275
            return ULONG_MAX;
253
        }
276
        }
254
   
277
   
255
        result = (b << 8) + (a & 0xff);
278
        result = (b << 8) + (a & 0xff);
256
        ++str;
279
        ++str;
257
    }
280
    }
258
   
281
   
259
    if (str == tmpptr) {
282
    if (str == tmpptr) {
-
 
283
        /*
260
        /* no number was found => first invalid character is the first character of the string */
284
         * No number was found => first invalid character is the first
-
 
285
         * character of the string.
-
 
286
         */
261
        /* FIXME: set errno to EINVAL */
287
        /* FIXME: set errno to EINVAL */
262
        str = nptr;
288
        str = nptr;
263
        result = 0;
289
        result = 0;
264
    }
290
    }
265
   
291
   
266
    if (endptr)
292
    if (endptr)
267
        *endptr = (char *) str;
293
        *endptr = (char *) str;
268
 
294
 
269
    if (nptr == str) {
295
    if (nptr == str) {
270
        /*FIXME: errno = EINVAL*/
296
        /*FIXME: errno = EINVAL*/
271
        return 0;
297
        return 0;
272
    }
298
    }
273
 
299
 
274
    return result;
300
    return result;
275
}
301
}
276
 
302
 
277
/** Convert initial part of string to long int according to given base.
303
/** Convert initial part of string to long int according to given base.
278
 * The number may begin with an arbitrary number of whitespaces followed by optional sign (`+' or `-').
304
 * The number may begin with an arbitrary number of whitespaces followed by
-
 
305
 * optional sign (`+' or `-'). If the base is 0 or 16, the prefix `0x' may be
279
 * If the base is 0 or 16, the prefix `0x' may be inserted and the number will be taken as hexadecimal one.
306
 * inserted and the number will be taken as hexadecimal one. If the base is 0
280
 * If the base is 0 and the number begin with a zero, number will be taken as octal one (as with base 8).
307
 * and the number begin with a zero, number will be taken as octal one (as with
281
 * Otherwise the base 0 is taken as decimal.
308
 * base 8). Otherwise the base 0 is taken as decimal.
-
 
309
 *
282
 * @param nptr pointer to string
310
 * @param nptr      Pointer to string.
283
 * @param endptr if not NULL, function stores here pointer to the first invalid character
311
 * @param endptr    If not NULL, function stores here pointer to the first
-
 
312
 *          invalid character.
284
 * @param base zero or number between 2 and 36 inclusive
313
 * @param base      Zero or number between 2 and 36 inclusive.
285
 * @return result of conversion.
314
 * @return      Result of conversion.
286
 */
315
 */
287
long int strtol(const char *nptr, char **endptr, int base)
316
long int strtol(const char *nptr, char **endptr, int base)
288
{
317
{
289
    char sgn = 0;
318
    char sgn = 0;
290
    unsigned long number = 0;
319
    unsigned long number = 0;
291
   
320
   
292
    number = _strtoul(nptr, endptr, base, &sgn);
321
    number = _strtoul(nptr, endptr, base, &sgn);
293
 
322
 
294
    if (number > LONG_MAX) {
323
    if (number > LONG_MAX) {
295
        if ((sgn) && (number == (unsigned long) (LONG_MAX) + 1)) {
324
        if ((sgn) && (number == (unsigned long) (LONG_MAX) + 1)) {
296
            /* FIXME: set 0 to errno */
325
            /* FIXME: set 0 to errno */
297
            return number;     
326
            return number;     
298
        }
327
        }
299
        /* FIXME: set ERANGE to errno */
328
        /* FIXME: set ERANGE to errno */
300
        return (sgn ? LONG_MIN : LONG_MAX);
329
        return (sgn ? LONG_MIN : LONG_MAX);
301
    }
330
    }
302
   
331
   
303
    return (sgn ? -number : number);
332
    return (sgn ? -number : number);
304
}
333
}
305
 
334
 
306
 
335
 
307
/** Convert initial part of string to unsigned long according to given base.
336
/** Convert initial part of string to unsigned long according to given base.
308
 * The number may begin with an arbitrary number of whitespaces followed by optional sign (`+' or `-').
337
 * The number may begin with an arbitrary number of whitespaces followed by
-
 
338
 * optional sign (`+' or `-'). If the base is 0 or 16, the prefix `0x' may be
309
 * If the base is 0 or 16, the prefix `0x' may be inserted and the number will be taken as hexadecimal one.
339
 * inserted and the number will be taken as hexadecimal one. If the base is 0
310
 * If the base is 0 and the number begin with a zero, number will be taken as octal one (as with base 8).
340
 * and the number begin with a zero, number will be taken as octal one (as with
311
 * Otherwise the base 0 is taken as decimal.
341
 * base 8). Otherwise the base 0 is taken as decimal.
-
 
342
 *
312
 * @param nptr pointer to string
343
 * @param nptr      Pointer to string.
313
 * @param endptr if not NULL, function stores here pointer to the first invalid character
344
 * @param endptr    If not NULL, function stores here pointer to the first
-
 
345
 *          invalid character
314
 * @param base zero or number between 2 and 36 inclusive
346
 * @param base      Zero or number between 2 and 36 inclusive.
315
 * @return result of conversion.
347
 * @return      Result of conversion.
316
 */
348
 */
317
unsigned long strtoul(const char *nptr, char **endptr, int base)
349
unsigned long strtoul(const char *nptr, char **endptr, int base)
318
{
350
{
319
    char sgn = 0;
351
    char sgn = 0;
320
    unsigned long number = 0;
352
    unsigned long number = 0;
321
   
353
   
322
    number = _strtoul(nptr, endptr, base, &sgn);
354
    number = _strtoul(nptr, endptr, base, &sgn);
323
 
355
 
324
    return (sgn ? -number : number);
356
    return (sgn ? -number : number);
325
}
357
}
326
 
358
 
327
char *strcpy(char *dest, const char *src)
359
char *strcpy(char *dest, const char *src)
328
{
360
{
329
    char *orig = dest;
361
    char *orig = dest;
330
   
362
   
331
    while ((*(dest++) = *(src++)))
363
    while ((*(dest++) = *(src++)))
332
        ;
364
        ;
333
    return orig;
365
    return orig;
334
}
366
}
335
 
367
 
336
char *strncpy(char *dest, const char *src, size_t n)
368
char *strncpy(char *dest, const char *src, size_t n)
337
{
369
{
338
    char *orig = dest;
370
    char *orig = dest;
339
   
371
   
340
    while ((*(dest++) = *(src++)) && --n)
372
    while ((*(dest++) = *(src++)) && --n)
341
        ;
373
        ;
342
    return orig;
374
    return orig;
343
}
375
}
344
 
376
 
345
char *strcat(char *dest, const char *src)
377
char *strcat(char *dest, const char *src)
346
{
378
{
347
    char *orig = dest;
379
    char *orig = dest;
348
    while (*dest++)
380
    while (*dest++)
349
        ;
381
        ;
350
    --dest;
382
    --dest;
351
    while ((*dest++ = *src++))
383
    while ((*dest++ = *src++))
352
        ;
384
        ;
353
    return orig;
385
    return orig;
354
}
386
}
-
 
387
 
-
 
388
char * strdup(const char *s1)
-
 
389
{
-
 
390
    size_t len = strlen(s1) + 1;
-
 
391
    void *ret = malloc(len);
-
 
392
 
-
 
393
    if (ret == NULL)
-
 
394
        return (char *) NULL;
-
 
395
 
-
 
396
    return (char *) memcpy(ret, s1, len);
-
 
397
}
355
 
398
 
356
/** @}
399
/** @}
357
 */
400
 */
358
 
401