Subversion Repositories HelenOS

Rev

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

Rev 3409 Rev 4338
1
/*
1
/*
2
 * Copyright (c) 2001-2004 Jakub Jermar
2
 * Copyright (c) 2001-2004 Jakub Jermar
-
 
3
 * Copyright (c) 2008 Jiri Svoboda
3
 * All rights reserved.
4
 * All rights reserved.
4
 *
5
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 * are met:
8
 *
9
 *
9
 * - Redistributions of source code must retain the above copyright
10
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 *   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
 * - 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
 *   derived from this software without specific prior written permission.
16
 *
17
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * 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
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * 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
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * 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
 * (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
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 */
28
 
29
 
29
/** @addtogroup generic
30
/** @addtogroup generic
30
 * @{
31
 * @{
31
 */
32
 */
32
 
33
 
33
/**
34
/**
34
 * @file
35
 * @file
35
 * @brief   Memory string operations.
36
 * @brief   Memory string operations.
36
 *
37
 *
37
 * This file provides architecture independent functions to manipulate blocks of
38
 * This file provides architecture independent functions to manipulate blocks of
38
 * memory. These functions are optimized as much as generic functions of this
39
 * memory. These functions are optimized as much as generic functions of this
39
 * type can be. However, architectures are free to provide even more optimized
40
 * type can be. However, architectures are free to provide even more optimized
40
 * versions of these functions.
41
 * versions of these functions.
41
 */
42
 */
42
 
43
 
43
#include <memstr.h>
44
#include <memstr.h>
44
#include <arch/types.h>
45
#include <arch/types.h>
45
#include <align.h>
46
#include <align.h>
46
 
47
 
47
/** Copy block of memory.
48
/** Copy block of memory.
48
 *
49
 *
49
 * Copy cnt bytes from src address to dst address.  The copying is done
50
 * Copy cnt bytes from src address to dst address.  The copying is done
50
 * word-by-word and then byte-by-byte.  The source and destination memory areas
51
 * word-by-word and then byte-by-byte.  The source and destination memory areas
51
 * cannot overlap.
52
 * cannot overlap.
52
 *
53
 *
53
 * @param src       Source address to copy from.
54
 * @param src       Source address to copy from.
54
 * @param dst       Destination address to copy to.
55
 * @param dst       Destination address to copy to.
55
 * @param cnt       Number of bytes to copy.
56
 * @param cnt       Number of bytes to copy.
56
 *
57
 *
57
 * @return      Destination address.
58
 * @return      Destination address.
58
 */
59
 */
59
void *_memcpy(void *dst, const void *src, size_t cnt)
60
void *_memcpy(void *dst, const void *src, size_t cnt)
60
{
61
{
61
    unsigned int i, j;
62
    unsigned int i, j;
62
   
63
   
63
    if (ALIGN_UP((uintptr_t) src, sizeof(unative_t)) != (uintptr_t) src ||
64
    if (ALIGN_UP((uintptr_t) src, sizeof(unative_t)) != (uintptr_t) src ||
64
        ALIGN_UP((uintptr_t) dst, sizeof(unative_t)) != (uintptr_t) dst) {
65
        ALIGN_UP((uintptr_t) dst, sizeof(unative_t)) != (uintptr_t) dst) {
65
        for (i = 0; i < cnt; i++)
66
        for (i = 0; i < cnt; i++)
66
            ((uint8_t *) dst)[i] = ((uint8_t *) src)[i];
67
            ((uint8_t *) dst)[i] = ((uint8_t *) src)[i];
67
    } else {
68
    } else {
68
        for (i = 0; i < cnt / sizeof(unative_t); i++)
69
        for (i = 0; i < cnt / sizeof(unative_t); i++)
69
            ((unative_t *) dst)[i] = ((unative_t *) src)[i];
70
            ((unative_t *) dst)[i] = ((unative_t *) src)[i];
70
       
71
       
71
        for (j = 0; j < cnt % sizeof(unative_t); j++)
72
        for (j = 0; j < cnt % sizeof(unative_t); j++)
72
            ((uint8_t *)(((unative_t *) dst) + i))[j] =
73
            ((uint8_t *)(((unative_t *) dst) + i))[j] =
73
                ((uint8_t *)(((unative_t *) src) + i))[j];
74
                ((uint8_t *)(((unative_t *) src) + i))[j];
74
    }
75
    }
75
       
76
       
76
    return (char *) dst;
77
    return (char *) dst;
77
}
78
}
-
 
79
 
-
 
80
/** Move memory block with possible overlapping.
-
 
81
 *
-
 
82
 * Copy cnt bytes from src address to dst address. The source and destination
-
 
83
 * memory areas may overlap.
-
 
84
 *
-
 
85
 * @param src       Source address to copy from.
-
 
86
 * @param dst       Destination address to copy to.
-
 
87
 * @param cnt       Number of bytes to copy.
-
 
88
 *
-
 
89
 * @return      Destination address.
-
 
90
 */
-
 
91
void *memmove(void *dst, const void *src, size_t n)
-
 
92
{
-
 
93
    const uint8_t *sp;
-
 
94
    uint8_t *dp;
-
 
95
 
-
 
96
    /* Nothing to do? */
-
 
97
    if (src == dst)
-
 
98
        return dst;
-
 
99
 
-
 
100
    /* Non-overlapping? */
-
 
101
    if (dst >= src + n || src >= dst + n) {
-
 
102
        return memcpy(dst, src, n);
-
 
103
    }
-
 
104
 
-
 
105
    /* Which direction? */
-
 
106
    if (src > dst) {
-
 
107
        /* Forwards. */
-
 
108
        sp = src;
-
 
109
        dp = dst;
-
 
110
 
-
 
111
        while (n-- != 0)
-
 
112
            *dp++ = *sp++;
-
 
113
    } else {
-
 
114
        /* Backwards. */
-
 
115
        sp = src + (n - 1);
-
 
116
        dp = dst + (n - 1);
-
 
117
 
-
 
118
        while (n-- != 0)
-
 
119
            *dp-- = *sp--;
-
 
120
    }
-
 
121
 
-
 
122
    return dst;
-
 
123
}
78
 
124
 
79
/** Fill block of memory
125
/** Fill block of memory
80
 *
126
 *
81
 * Fill cnt bytes at dst address with the value x.  The filling is done
127
 * Fill cnt bytes at dst address with the value x.  The filling is done
82
 * byte-by-byte.
128
 * byte-by-byte.
83
 *
129
 *
84
 * @param dst       Destination address to fill.
130
 * @param dst       Destination address to fill.
85
 * @param cnt       Number of bytes to fill.
131
 * @param cnt       Number of bytes to fill.
86
 * @param x     Value to fill.
132
 * @param x     Value to fill.
87
 *
133
 *
88
 */
134
 */
89
void _memsetb(void *dst, size_t cnt, uint8_t x)
135
void _memsetb(void *dst, size_t cnt, uint8_t x)
90
{
136
{
91
    unsigned int i;
137
    unsigned int i;
92
    uint8_t *p = (uint8_t *) dst;
138
    uint8_t *p = (uint8_t *) dst;
93
   
139
   
94
    for (i = 0; i < cnt; i++)
140
    for (i = 0; i < cnt; i++)
95
        p[i] = x;
141
        p[i] = x;
96
}
142
}
97
 
143
 
98
/** Fill block of memory.
144
/** Fill block of memory.
99
 *
145
 *
100
 * Fill cnt words at dst address with the value x.  The filling is done
146
 * Fill cnt words at dst address with the value x.  The filling is done
101
 * word-by-word.
147
 * word-by-word.
102
 *
148
 *
103
 * @param dst       Destination address to fill.
149
 * @param dst       Destination address to fill.
104
 * @param cnt       Number of words to fill.
150
 * @param cnt       Number of words to fill.
105
 * @param x     Value to fill.
151
 * @param x     Value to fill.
106
 *
152
 *
107
 */
153
 */
108
void _memsetw(void *dst, size_t cnt, uint16_t x)
154
void _memsetw(void *dst, size_t cnt, uint16_t x)
109
{
155
{
110
    unsigned int i;
156
    unsigned int i;
111
    uint16_t *p = (uint16_t *) dst;
157
    uint16_t *p = (uint16_t *) dst;
112
   
158
   
113
    for (i = 0; i < cnt; i++)
159
    for (i = 0; i < cnt; i++)
114
        p[i] = x;  
160
        p[i] = x;  
115
}
161
}
116
 
162
 
117
/** Copy string.
163
/** Copy string.
118
 *
164
 *
119
 * Copy string from src address to dst address.  The copying is done
165
 * Copy string from src address to dst address.  The copying is done
120
 * char-by-char until the null character. The source and destination memory
166
 * char-by-char until the null character. The source and destination memory
121
 * areas cannot overlap.
167
 * areas cannot overlap.
122
 *
168
 *
123
 * @param src       Source string to copy from.
169
 * @param src       Source string to copy from.
124
 * @param dst       Destination string to copy to.
170
 * @param dst       Destination string to copy to.
125
 *
171
 *
126
 * @return      Address of the destination string.
172
 * @return      Address of the destination string.
127
 */
173
 */
128
char *strcpy(char *dest, const char *src)
174
char *strcpy(char *dest, const char *src)
129
{
175
{
130
    char *orig = dest;
176
    char *orig = dest;
131
   
177
   
132
    while ((*(dest++) = *(src++)))
178
    while ((*(dest++) = *(src++)))
133
        ;
179
        ;
134
    return orig;
180
    return orig;
135
}
181
}
136
 
182
 
137
/** @}
183
/** @}
138
 */
184
 */
139
 
185