Subversion Repositories HelenOS

Rev

Rev 3274 | 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
 *
3404 jermar 37
 * This file provides architecture independent functions to manipulate blocks of
38
 * 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
 * versions of these functions.
1264 jermar 41
 */
42
 
1 jermar 43
#include <memstr.h>
44
#include <arch/types.h>
1612 jermar 45
#include <align.h>
1 jermar 46
 
3404 jermar 47
/** Copy block of memory.
62 decky 48
 *
3404 jermar 49
 * 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
 * cannot overlap.
62 decky 52
 *
3404 jermar 53
 * @param src       Source address to copy from.
54
 * @param dst       Destination address to copy to.
55
 * @param cnt       Number of bytes to copy.
62 decky 56
 *
3404 jermar 57
 * @return      Destination address.
62 decky 58
 */
3404 jermar 59
void *_memcpy(void *dst, const void *src, size_t cnt)
1 jermar 60
{
2745 decky 61
    unsigned int i, j;
1 jermar 62
 
1780 jermar 63
    if (ALIGN_UP((uintptr_t) src, sizeof(unative_t)) != (uintptr_t) src ||
3404 jermar 64
        ALIGN_UP((uintptr_t) dst, sizeof(unative_t)) != (uintptr_t) dst) {
1612 jermar 65
        for (i = 0; i < cnt; i++)
1780 jermar 66
            ((uint8_t *) dst)[i] = ((uint8_t *) src)[i];
1612 jermar 67
    } else {
3056 decky 68
        for (i = 0; i < cnt / sizeof(unative_t); i++)
1780 jermar 69
            ((unative_t *) dst)[i] = ((unative_t *) src)[i];
195 vana 70
 
3056 decky 71
        for (j = 0; j < cnt % sizeof(unative_t); j++)
3404 jermar 72
            ((uint8_t *)(((unative_t *) dst) + i))[j] =
73
                ((uint8_t *)(((unative_t *) src) + i))[j];
1612 jermar 74
    }
882 jermar 75
 
3274 jermar 76
    return (char *) dst;
1 jermar 77
}
78
 
62 decky 79
/** Fill block of memory
80
 *
3404 jermar 81
 * Fill cnt bytes at dst address with the value x.  The filling is done
82
 * byte-by-byte.
62 decky 83
 *
3404 jermar 84
 * @param dst       Destination address to fill.
85
 * @param cnt       Number of bytes to fill.
86
 * @param x     Value to fill.
62 decky 87
 *
88
 */
3104 svoboda 89
void _memsetb(void *dst, size_t cnt, uint8_t x)
1 jermar 90
{
2745 decky 91
    unsigned int i;
1780 jermar 92
    uint8_t *p = (uint8_t *) dst;
1 jermar 93
 
2125 decky 94
    for (i = 0; i < cnt; i++)
1 jermar 95
        p[i] = x;
96
}
200 palkovsky 97
 
3404 jermar 98
/** Fill block of memory.
200 palkovsky 99
 *
3404 jermar 100
 * Fill cnt words at dst address with the value x.  The filling is done
101
 * word-by-word.
200 palkovsky 102
 *
3404 jermar 103
 * @param dst       Destination address to fill.
104
 * @param cnt       Number of words to fill.
105
 * @param x     Value to fill.
200 palkovsky 106
 *
107
 */
3104 svoboda 108
void _memsetw(void *dst, size_t cnt, uint16_t x)
200 palkovsky 109
{
2745 decky 110
    unsigned int i;
1780 jermar 111
    uint16_t *p = (uint16_t *) dst;
200 palkovsky 112
 
2125 decky 113
    for (i = 0; i < cnt; i++)
200 palkovsky 114
        p[i] = x;  
115
}
1702 cejka 116
 
3404 jermar 117
/** Copy string.
2125 decky 118
 *
3404 jermar 119
 * 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
121
 * areas cannot overlap.
2125 decky 122
 *
3404 jermar 123
 * @param src       Source string to copy from.
124
 * @param dst       Destination string to copy to.
2125 decky 125
 *
3404 jermar 126
 * @return      Address of the destination string.
2125 decky 127
 */
128
char *strcpy(char *dest, const char *src)
129
{
130
    char *orig = dest;
131
 
2272 jermar 132
    while ((*(dest++) = *(src++)))
133
        ;
2125 decky 134
    return orig;
135
}
136
 
1757 jermar 137
/** @}
1702 cejka 138
 */