Subversion Repositories HelenOS

Rev

Rev 1963 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
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
15
 *   derived from this software without specific prior written permission.
16
 *
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
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
1264 jermar 29
/**
30
 * @file    memstr.c
31
 * @brief   Memory string operations.
32
 *
33
 * This file provides architecture independent functions
34
 * to manipulate blocks of memory. These functions
35
 * are optimized as much as generic functions of
36
 * this type can be. However, architectures are
37
 * free to provide even more optimized versions of these
38
 * functions.
39
 */
40
 
1 jermar 41
#include <memstr.h>
42
#include <arch/types.h>
43
 
62 decky 44
/** Copy block of memory
45
 *
46
 * Copy cnt bytes from src address to dst address.
882 jermar 47
 * The copying is done word-by-word and then byte-by-byte.
48
 * The source and destination memory areas cannot overlap.
62 decky 49
 *
50
 * @param src Origin address to copy from.
51
 * @param dst Origin address to copy to.
52
 * @param cnt Number of bytes to copy.
53
 *
54
 */
360 jermar 55
void *_memcpy(void * dst, const void *src, size_t cnt)
1 jermar 56
{
882 jermar 57
    int i, j;
1 jermar 58
 
882 jermar 59
    for (i = 0; i < cnt/sizeof(__native); i++)
60
        ((__native *) dst)[i] = ((__native *) src)[i];
195 vana 61
 
882 jermar 62
    for (j = 0; j < cnt%sizeof(__native); j++)
63
        ((__u8 *)(((__native *) dst) + i))[j] = ((__u8 *)(((__native *) src) + i))[j];
64
 
195 vana 65
    return (char *)src;
1 jermar 66
}
67
 
62 decky 68
/** Fill block of memory
69
 *
70
 * Fill cnt bytes at dst address with the value x.
71
 * The filling is done byte-by-byte.
72
 *
73
 * @param dst Origin address to fill.
74
 * @param cnt Number of bytes to fill.
75
 * @param x   Value to fill.
76
 *
77
 */
72 decky 78
void _memsetb(__address dst, size_t cnt, __u8 x)
1 jermar 79
{
80
    int i;
81
    __u8 *p = (__u8 *) dst;
82
 
83
    for(i=0; i<cnt; i++)
84
        p[i] = x;
85
}
200 palkovsky 86
 
87
/** Fill block of memory
88
 *
89
 * Fill cnt words at dst address with the value x.
90
 * The filling is done word-by-word.
91
 *
92
 * @param dst Origin address to fill.
93
 * @param cnt Number of words to fill.
94
 * @param x   Value to fill.
95
 *
96
 */
97
void _memsetw(__address dst, size_t cnt, __u16 x)
98
{
99
    int i;
202 palkovsky 100
    __u16 *p = (__u16 *) dst;
200 palkovsky 101
 
102
    for(i=0; i<cnt; i++)
103
        p[i] = x;  
104
}