Subversion Repositories HelenOS-historic

Rev

Rev 1757 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1757 Rev 1780
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
/**
33
/**
34
 * @file
34
 * @file
35
 * @brief   Memory string operations.
35
 * @brief   Memory string operations.
36
 *
36
 *
37
 * This file provides architecture independent functions
37
 * This file provides architecture independent functions
38
 * to manipulate blocks of memory. These functions
38
 * to manipulate blocks of memory. These functions
39
 * are optimized as much as generic functions of
39
 * are optimized as much as generic functions of
40
 * this type can be. However, architectures are
40
 * this type can be. However, architectures are
41
 * free to provide even more optimized versions of these
41
 * free to provide even more optimized versions of these
42
 * functions.
42
 * functions.
43
 */
43
 */
44
 
44
 
45
#include <memstr.h>
45
#include <memstr.h>
46
#include <arch/types.h>
46
#include <arch/types.h>
47
#include <align.h>
47
#include <align.h>
48
 
48
 
49
/** Copy block of memory
49
/** Copy block of memory
50
 *
50
 *
51
 * Copy cnt bytes from src address to dst address.
51
 * Copy cnt bytes from src address to dst address.
52
 * The copying is done word-by-word and then byte-by-byte.
52
 * The copying is done word-by-word and then byte-by-byte.
53
 * The source and destination memory areas cannot overlap.
53
 * The source and destination memory areas cannot overlap.
54
 *
54
 *
55
 * @param src Origin address to copy from.
55
 * @param src Origin address to copy from.
56
 * @param dst Origin address to copy to.
56
 * @param dst Origin address to copy to.
57
 * @param cnt Number of bytes to copy.
57
 * @param cnt Number of bytes to copy.
58
 *
58
 *
59
 */
59
 */
60
void *_memcpy(void * dst, const void *src, size_t cnt)
60
void *_memcpy(void * dst, const void *src, size_t cnt)
61
{
61
{
62
    int i, j;
62
    int i, j;
63
   
63
   
64
    if (ALIGN_UP((__address) src, sizeof(__native)) != (__address) src ||
64
    if (ALIGN_UP((uintptr_t) src, sizeof(unative_t)) != (uintptr_t) src ||
65
        ALIGN_UP((__address) dst, sizeof(__native)) != (__address) dst) {
65
        ALIGN_UP((uintptr_t) dst, sizeof(unative_t)) != (uintptr_t) dst) {
66
        for (i = 0; i < cnt; i++)
66
        for (i = 0; i < cnt; i++)
67
            ((__u8 *) dst)[i] = ((__u8 *) src)[i];
67
            ((uint8_t *) dst)[i] = ((uint8_t *) src)[i];
68
    } else {
68
    } else {
69
   
69
   
70
        for (i = 0; i < cnt/sizeof(__native); i++)
70
        for (i = 0; i < cnt/sizeof(unative_t); i++)
71
            ((__native *) dst)[i] = ((__native *) src)[i];
71
            ((unative_t *) dst)[i] = ((unative_t *) src)[i];
72
       
72
       
73
        for (j = 0; j < cnt%sizeof(__native); j++)
73
        for (j = 0; j < cnt%sizeof(unative_t); j++)
74
            ((__u8 *)(((__native *) dst) + i))[j] = ((__u8 *)(((__native *) src) + i))[j];
74
            ((uint8_t *)(((unative_t *) dst) + i))[j] = ((uint8_t *)(((unative_t *) src) + i))[j];
75
    }
75
    }
76
       
76
       
77
    return (char *)src;
77
    return (char *)src;
78
}
78
}
79
 
79
 
80
/** Fill block of memory
80
/** Fill block of memory
81
 *
81
 *
82
 * Fill cnt bytes at dst address with the value x.
82
 * Fill cnt bytes at dst address with the value x.
83
 * The filling is done byte-by-byte.
83
 * The filling is done byte-by-byte.
84
 *
84
 *
85
 * @param dst Origin address to fill.
85
 * @param dst Origin address to fill.
86
 * @param cnt Number of bytes to fill.
86
 * @param cnt Number of bytes to fill.
87
 * @param x   Value to fill.
87
 * @param x   Value to fill.
88
 *
88
 *
89
 */
89
 */
90
void _memsetb(__address dst, size_t cnt, __u8 x)
90
void _memsetb(uintptr_t dst, size_t cnt, uint8_t x)
91
{
91
{
92
    int i;
92
    int i;
93
    __u8 *p = (__u8 *) dst;
93
    uint8_t *p = (uint8_t *) dst;
94
   
94
   
95
    for(i=0; i<cnt; i++)
95
    for(i=0; i<cnt; i++)
96
        p[i] = x;
96
        p[i] = x;
97
}
97
}
98
 
98
 
99
/** Fill block of memory
99
/** Fill block of memory
100
 *
100
 *
101
 * Fill cnt words at dst address with the value x.
101
 * Fill cnt words at dst address with the value x.
102
 * The filling is done word-by-word.
102
 * The filling is done word-by-word.
103
 *
103
 *
104
 * @param dst Origin address to fill.
104
 * @param dst Origin address to fill.
105
 * @param cnt Number of words to fill.
105
 * @param cnt Number of words to fill.
106
 * @param x   Value to fill.
106
 * @param x   Value to fill.
107
 *
107
 *
108
 */
108
 */
109
void _memsetw(__address dst, size_t cnt, __u16 x)
109
void _memsetw(uintptr_t dst, size_t cnt, uint16_t x)
110
{
110
{
111
    int i;
111
    int i;
112
    __u16 *p = (__u16 *) dst;
112
    uint16_t *p = (uint16_t *) dst;
113
   
113
   
114
    for(i=0; i<cnt; i++)
114
    for(i=0; i<cnt; i++)
115
        p[i] = x;  
115
        p[i] = x;  
116
}
116
}
117
 
117
 
118
/** @}
118
/** @}
119
 */
119
 */
120
 
120