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.
 */
 
 /** @addtogroup generic   
 * @{
 */
 
/**
 * @file
 * @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 1612 → 1702

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