WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/lib/memstr.c


/*
 * Copyright (C) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/**
 * @file    memstr.c
 * @brief   Memory string operations.
 *
 * This file provides architecture independent functions
 * to manipulate blocks of memory. These functions
 * are optimized as much as generic functions of
 * this type can be. However, architectures are
 * free to provide even more optimized versions of these
 * functions.
 */
 
#include <memstr.h>
#include <arch/types.h>
#include <align.h>
 
/** Copy block of memory
 *
 * Copy cnt bytes from src address to dst address.
 * The copying is done word-by-word and then byte-by-byte.
 * The source and destination memory areas cannot overlap.
 *
 * @param src Origin address to copy from.
 * @param dst Origin address to copy to.
 * @param cnt Number of bytes to copy.
 *
 */
void *_memcpy(void * dst, const void *src, size_t cnt)
{
    int i, j;
   
    if (ALIGN_UP((__address) src, sizeof(__native)) != (__address) src ||
        ALIGN_UP((__address) dst, sizeof(__native)) != (__address) dst) {
        for (i = 0; i < cnt; i++)
            ((__u8 *) dst)[i] = ((__u8 *) src)[i];
    } else {
   
        for (i = 0; i < cnt/sizeof(__native); i++)
            ((__native *) dst)[i] = ((__native *) src)[i];
       
        for (j = 0; j < cnt%sizeof(__native); j++)
            ((__u8 *)(((__native *) dst) + i))[j] = ((__u8 *)(((__native *) src) + i))[j];
    }
       
    return (char *)src;
}
 
/** Fill block of memory
 *
 * Fill cnt bytes at dst address with the value x.
 * The filling is done byte-by-byte.
 *
 * @param dst Origin address to fill.
 * @param cnt Number of bytes to fill.
 * @param x   Value to fill.
 *
 */
void _memsetb(__address dst, size_t cnt, __u8 x)
{
    int i;
    __u8 *p = (__u8 *) dst;
   
    for(i=0; i<cnt; i++)
        p[i] = x;
}
 
/** Fill block of memory
 *
 * Fill cnt words at dst address with the value x.
 * The filling is done word-by-word.
 *
 * @param dst Origin address to fill.
 * @param cnt Number of words to fill.
 * @param x   Value to fill.
 *
 */
void _memsetw(__address dst, size_t cnt, __u16 x)
{
    int i;
    __u16 *p = (__u16 *) dst;
   
    for(i=0; i<cnt; i++)
        p[i] = x;  
}
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/lib/memstr.c – Rev 1264 → 1612

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