Subversion Repositories HelenOS

Rev

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

Rev 2071 Rev 3405
1
/*
1
/*
2
 * Copyright (c) 2001-2004 Jakub Jermar
2
 * Copyright (c) 2001-2004 Jakub Jermar
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 generic
29
/** @addtogroup generic
30
 * @{
30
 * @{
31
 */
31
 */
32
 
32
 
33
#include <string.h>
33
#include <string.h>
34
 
34
 
35
/**
35
/**
36
 * @file
36
 * @file
37
 * @brief   String manipulation functions.
37
 * @brief   String manipulation functions.
38
 */
38
 */
39
 
39
 
40
/** Return number of characters in a string.
40
/** Return number of characters in a string.
41
 *
41
 *
42
 * @param str NULL terminated string.
42
 * @param str       NULL terminated string.
43
 *
43
 *
44
 * @return Number of characters in str.
44
 * @return      Number of characters in str.
45
 */
45
 */
46
size_t strlen(const char *str)
46
size_t strlen(const char *str)
47
{
47
{
48
    int i;
48
    int i;
49
   
49
   
50
    for (i = 0; str[i]; i++)
50
    for (i = 0; str[i]; i++)
51
        ;
51
        ;
52
   
52
   
53
    return i;
53
    return i;
54
}
54
}
55
 
55
 
56
/** Compare two NULL terminated strings
56
/** Compare two NULL terminated strings.
57
 *
57
 *
58
 * Do a char-by-char comparison of two NULL terminated strings.
58
 * Do a char-by-char comparison of two NULL terminated strings.
59
 * The strings are considered equal iff they consist of the same
59
 * The strings are considered equal iff they consist of the same
60
 * characters on the minimum of their lengths.
60
 * characters on the minimum of their lengths.
61
 *
61
 *
62
 * @param src First string to compare.
62
 * @param src       First string to compare.
63
 * @param dst Second string to compare.
63
 * @param dst       Second string to compare.
64
 *
64
 *
65
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
65
 * @return      0 if the strings are equal, -1 if first is smaller,
-
 
66
 *          1 if second smaller.
66
 *
67
 *
67
 */
68
 */
68
int strcmp(const char *src, const char *dst)
69
int strcmp(const char *src, const char *dst)
69
{
70
{
70
    for (; *src && *dst; src++, dst++) {
71
    for (; *src && *dst; src++, dst++) {
71
        if (*src < *dst)
72
        if (*src < *dst)
72
            return -1;
73
            return -1;
73
        if (*src > *dst)
74
        if (*src > *dst)
74
            return 1;
75
            return 1;
75
    }
76
    }
76
    if (*src == *dst)
77
    if (*src == *dst)
77
        return 0;
78
        return 0;
78
    if (!*src)
79
    if (!*src)
79
        return -1;
80
        return -1;
80
    return 1;
81
    return 1;
81
}
82
}
82
 
83
 
83
 
84
 
84
/** Compare two NULL terminated strings
85
/** Compare two NULL terminated strings.
85
 *
86
 *
86
 * Do a char-by-char comparison of two NULL terminated strings.
87
 * Do a char-by-char comparison of two NULL terminated strings.
87
 * The strings are considered equal iff they consist of the same
88
 * The strings are considered equal iff they consist of the same
88
 * characters on the minimum of their lengths and specified maximal
89
 * characters on the minimum of their lengths and specified maximal
89
 * length.
90
 * length.
90
 *
91
 *
91
 * @param src First string to compare.
92
 * @param src       First string to compare.
92
 * @param dst Second string to compare.
93
 * @param dst       Second string to compare.
93
 * @param len Maximal length for comparison.
94
 * @param len       Maximal length for comparison.
94
 *
95
 *
95
 * @return 0 if the strings are equal, -1 if first is smaller, 1 if second smaller.
96
 * @return      0 if the strings are equal, -1 if first is smaller,
-
 
97
 *          1 if second smaller.
96
 *
98
 *
97
 */
99
 */
98
int strncmp(const char *src, const char *dst, size_t len)
100
int strncmp(const char *src, const char *dst, size_t len)
99
{
101
{
100
    int i;
102
    int i;
101
   
103
   
102
    for (i = 0; *src && *dst && i < len; src++, dst++, i++) {
104
    for (i = 0; *src && *dst && i < len; src++, dst++, i++) {
103
        if (*src < *dst)
105
        if (*src < *dst)
104
            return -1;
106
            return -1;
105
        if (*src > *dst)
107
        if (*src > *dst)
106
            return 1;
108
            return 1;
107
    }
109
    }
108
    if (i == len || *src == *dst)
110
    if (i == len || *src == *dst)
109
        return 0;
111
        return 0;
110
    if (!*src)
112
    if (!*src)
111
        return -1;
113
        return -1;
112
    return 1;
114
    return 1;
113
}
115
}
114
 
116
 
115
/** Copy NULL terminated string.
117
/** Copy NULL terminated string.
116
 *
118
 *
117
 * Copy at most 'len' characters from string 'src' to 'dest'.
119
 * Copy at most 'len' characters from string 'src' to 'dest'.
118
 * If 'src' is shorter than 'len', '\0' is inserted behind the
120
 * If 'src' is shorter than 'len', '\0' is inserted behind the
119
 * last copied character.
121
 * last copied character.
120
 *
122
 *
121
 * @param src Source string.
123
 * @param src       Source string.
122
 * @param dest Destination buffer.
124
 * @param dest      Destination buffer.
123
 * @param len Size of destination buffer.
125
 * @param len       Size of destination buffer.
124
 */
126
 */
125
void strncpy(char *dest, const char *src, size_t len)
127
void strncpy(char *dest, const char *src, size_t len)
126
{
128
{
127
    int i;
129
    int i;
128
    for (i = 0; i < len; i++) {
130
    for (i = 0; i < len; i++) {
129
        if (!(dest[i] = src[i]))
131
        if (!(dest[i] = src[i]))
130
            return;
132
            return;
131
    }
133
    }
132
    dest[i-1] = '\0';
134
    dest[i-1] = '\0';
133
}
135
}
134
 
136
 
135
/** Convert ascii representation to unative_t
137
/** Convert ascii representation to unative_t.
136
 *
138
 *
137
 * Supports 0x for hexa & 0 for octal notation.
139
 * Supports 0x for hexa & 0 for octal notation.
138
 * Does not check for overflows, does not support negative numbers
140
 * Does not check for overflows, does not support negative numbers
139
 *
141
 *
140
 * @param text Textual representation of number
142
 * @param text      Textual representation of number.
141
 * @return Converted number or 0 if no valid number ofund
143
 * @return      Converted number or 0 if no valid number found.
142
 */
144
 */
143
unative_t atoi(const char *text)
145
unative_t atoi(const char *text)
144
{
146
{
145
    int base = 10;
147
    int base = 10;
146
    unative_t result = 0;
148
    unative_t result = 0;
147
 
149
 
148
    if (text[0] == '0' && text[1] == 'x') {
150
    if (text[0] == '0' && text[1] == 'x') {
149
        base = 16;
151
        base = 16;
150
        text += 2;
152
        text += 2;
151
    } else if (text[0] == '0')
153
    } else if (text[0] == '0')
152
        base = 8;
154
        base = 8;
153
 
155
 
154
    while (*text) {
156
    while (*text) {
155
        if (base != 16 && \
157
        if (base != 16 &&
156
            ((*text >= 'A' && *text <= 'F' )
158
            ((*text >= 'A' && *text <= 'F') ||
157
             || (*text >='a' && *text <='f')))
159
            (*text >='a' && *text <='f')))
158
            break;
160
            break;
159
        if (base == 8 && *text >='8')
161
        if (base == 8 && *text >='8')
160
            break;
162
            break;
161
 
163
 
162
        if (*text >= '0' && *text <= '9') {
164
        if (*text >= '0' && *text <= '9') {
163
            result *= base;
165
            result *= base;
164
            result += *text - '0';
166
            result += *text - '0';
165
        } else if (*text >= 'A' && *text <= 'F') {
167
        } else if (*text >= 'A' && *text <= 'F') {
166
            result *= base;
168
            result *= base;
167
            result += *text - 'A' + 10;
169
            result += *text - 'A' + 10;
168
        } else if (*text >= 'a' && *text <= 'f') {
170
        } else if (*text >= 'a' && *text <= 'f') {
169
            result *= base;
171
            result *= base;
170
            result += *text - 'a' + 10;
172
            result += *text - 'a' + 10;
171
        } else
173
        } else
172
            break;
174
            break;
173
        text++;
175
        text++;
174
    }
176
    }
175
 
177
 
176
    return result;
178
    return result;
177
}
179
}
-
 
180
 
-
 
181
/** Move piece of memory to another, possibly overlapping, location.
-
 
182
 *
-
 
183
 * @param dst       Destination address.
-
 
184
 * @param src       Source address.
-
 
185
 * @param len       Number of bytes to move.
-
 
186
 *
-
 
187
 * @return      Destination address.
-
 
188
 */
-
 
189
void *memmove(void *dst, const void *src, size_t len)
-
 
190
{
-
 
191
    char *d = dst;
-
 
192
    const char *s = src;
-
 
193
    if (s < d) {
-
 
194
        while (len--)
-
 
195
            *(d + len) = *(s + len);
-
 
196
    } else {
-
 
197
        while (len--)
-
 
198
            *d++ = *s++;
-
 
199
    }
-
 
200
   
-
 
201
    return dst;
-
 
202
}
178
 
203
 
179
/** @}
204
/** @}
180
 */
205
 */
181
 
206