Subversion Repositories HelenOS

Rev

Rev 2125 | Rev 3056 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2071 jermar 2
 * Copyright (c) 2001-2004 Jakub Jermar
1 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
 
1757 jermar 29
/** @addtogroup generic
1702 cejka 30
 * @{
31
 */
32
 
1264 jermar 33
/**
1702 cejka 34
 * @file
1264 jermar 35
 * @brief   Memory string operations.
36
 *
37
 * This file provides architecture independent functions
38
 * to manipulate blocks of memory. These functions
39
 * are optimized as much as generic functions of
40
 * this type can be. However, architectures are
41
 * free to provide even more optimized versions of these
42
 * functions.
43
 */
44
 
1 jermar 45
#include <memstr.h>
46
#include <arch/types.h>
1612 jermar 47
#include <align.h>
1 jermar 48
 
62 decky 49
/** Copy block of memory
50
 *
51
 * Copy cnt bytes from src address to dst address.
882 jermar 52
 * The copying is done word-by-word and then byte-by-byte.
53
 * The source and destination memory areas cannot overlap.
62 decky 54
 *
55
 * @param src Origin address to copy from.
56
 * @param dst Origin address to copy to.
57
 * @param cnt Number of bytes to copy.
58
 *
59
 */
360 jermar 60
void *_memcpy(void * dst, const void *src, size_t cnt)
1 jermar 61
{
882 jermar 62
    int i, j;
1 jermar 63
 
1780 jermar 64
    if (ALIGN_UP((uintptr_t) src, sizeof(unative_t)) != (uintptr_t) src ||
65
        ALIGN_UP((uintptr_t) dst, sizeof(unative_t)) != (uintptr_t) dst) {
1612 jermar 66
        for (i = 0; i < cnt; i++)
1780 jermar 67
            ((uint8_t *) dst)[i] = ((uint8_t *) src)[i];
1612 jermar 68
    } else {
69
 
1780 jermar 70
        for (i = 0; i < cnt/sizeof(unative_t); i++)
71
            ((unative_t *) dst)[i] = ((unative_t *) src)[i];
195 vana 72
 
1780 jermar 73
        for (j = 0; j < cnt%sizeof(unative_t); j++)
74
            ((uint8_t *)(((unative_t *) dst) + i))[j] = ((uint8_t *)(((unative_t *) src) + i))[j];
1612 jermar 75
    }
882 jermar 76
 
2125 decky 77
    return (char *) src;
1 jermar 78
}
79
 
62 decky 80
/** Fill block of memory
81
 *
82
 * Fill cnt bytes at dst address with the value x.
83
 * The filling is done byte-by-byte.
84
 *
85
 * @param dst Origin address to fill.
86
 * @param cnt Number of bytes to fill.
87
 * @param x   Value to fill.
88
 *
89
 */
1780 jermar 90
void _memsetb(uintptr_t dst, size_t cnt, uint8_t x)
1 jermar 91
{
92
    int i;
1780 jermar 93
    uint8_t *p = (uint8_t *) dst;
1 jermar 94
 
2125 decky 95
    for (i = 0; i < cnt; i++)
1 jermar 96
        p[i] = x;
97
}
200 palkovsky 98
 
99
/** Fill block of memory
100
 *
101
 * Fill cnt words at dst address with the value x.
102
 * The filling is done word-by-word.
103
 *
104
 * @param dst Origin address to fill.
105
 * @param cnt Number of words to fill.
106
 * @param x   Value to fill.
107
 *
108
 */
1780 jermar 109
void _memsetw(uintptr_t dst, size_t cnt, uint16_t x)
200 palkovsky 110
{
111
    int i;
1780 jermar 112
    uint16_t *p = (uint16_t *) dst;
200 palkovsky 113
 
2125 decky 114
    for (i = 0; i < cnt; i++)
200 palkovsky 115
        p[i] = x;  
116
}
1702 cejka 117
 
2125 decky 118
/** Copy string
119
 *
120
 * Copy string from src address to dst address.
121
 * The copying is done char-by-char until the null
122
 * character. The source and destination memory areas
123
 * cannot overlap.
124
 *
125
 * @param src Origin string to copy from.
126
 * @param dst Origin string to copy to.
127
 *
128
 */
129
char *strcpy(char *dest, const char *src)
130
{
131
    char *orig = dest;
132
 
2272 jermar 133
    while ((*(dest++) = *(src++)))
134
        ;
2125 decky 135
    return orig;
136
}
137
 
1757 jermar 138
/** @}
1702 cejka 139
 */