xref: /netbsd-src/common/lib/libc/string/bcopy.c (revision 37c9f0a654f1f14465cded15c4577522438c5585)
1*37c9f0a6Schristos /*	$NetBSD: bcopy.c,v 1.1 2005/12/20 19:28:52 christos Exp $	*/
2*37c9f0a6Schristos 
3*37c9f0a6Schristos /*-
4*37c9f0a6Schristos  * Copyright (c) 1990, 1993
5*37c9f0a6Schristos  *	The Regents of the University of California.  All rights reserved.
6*37c9f0a6Schristos  *
7*37c9f0a6Schristos  * This code is derived from software contributed to Berkeley by
8*37c9f0a6Schristos  * Chris Torek.
9*37c9f0a6Schristos  *
10*37c9f0a6Schristos  * Redistribution and use in source and binary forms, with or without
11*37c9f0a6Schristos  * modification, are permitted provided that the following conditions
12*37c9f0a6Schristos  * are met:
13*37c9f0a6Schristos  * 1. Redistributions of source code must retain the above copyright
14*37c9f0a6Schristos  *    notice, this list of conditions and the following disclaimer.
15*37c9f0a6Schristos  * 2. Redistributions in binary form must reproduce the above copyright
16*37c9f0a6Schristos  *    notice, this list of conditions and the following disclaimer in the
17*37c9f0a6Schristos  *    documentation and/or other materials provided with the distribution.
18*37c9f0a6Schristos  * 3. Neither the name of the University nor the names of its contributors
19*37c9f0a6Schristos  *    may be used to endorse or promote products derived from this software
20*37c9f0a6Schristos  *    without specific prior written permission.
21*37c9f0a6Schristos  *
22*37c9f0a6Schristos  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23*37c9f0a6Schristos  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24*37c9f0a6Schristos  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25*37c9f0a6Schristos  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26*37c9f0a6Schristos  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27*37c9f0a6Schristos  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28*37c9f0a6Schristos  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29*37c9f0a6Schristos  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30*37c9f0a6Schristos  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31*37c9f0a6Schristos  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32*37c9f0a6Schristos  * SUCH DAMAGE.
33*37c9f0a6Schristos  */
34*37c9f0a6Schristos 
35*37c9f0a6Schristos #include <sys/cdefs.h>
36*37c9f0a6Schristos #if defined(LIBC_SCCS) && !defined(lint)
37*37c9f0a6Schristos #if 0
38*37c9f0a6Schristos static char sccsid[] = "@(#)bcopy.c	8.1 (Berkeley) 6/4/93";
39*37c9f0a6Schristos #else
40*37c9f0a6Schristos __RCSID("$NetBSD: bcopy.c,v 1.1 2005/12/20 19:28:52 christos Exp $");
41*37c9f0a6Schristos #endif
42*37c9f0a6Schristos #endif /* LIBC_SCCS and not lint */
43*37c9f0a6Schristos 
44*37c9f0a6Schristos #if !defined(_KERNEL) && !defined(_STANDALONE)
45*37c9f0a6Schristos #include <assert.h>
46*37c9f0a6Schristos #include <string.h>
47*37c9f0a6Schristos #else
48*37c9f0a6Schristos #include <lib/libkern/libkern.h>
49*37c9f0a6Schristos #endif
50*37c9f0a6Schristos 
51*37c9f0a6Schristos /*
52*37c9f0a6Schristos  * sizeof(word) MUST BE A POWER OF TWO
53*37c9f0a6Schristos  * SO THAT wmask BELOW IS ALL ONES
54*37c9f0a6Schristos  */
55*37c9f0a6Schristos typedef	long word;		/* "word" used for optimal copy speed */
56*37c9f0a6Schristos 
57*37c9f0a6Schristos #define	wsize	sizeof(word)
58*37c9f0a6Schristos #define	wmask	(wsize - 1)
59*37c9f0a6Schristos 
60*37c9f0a6Schristos /*
61*37c9f0a6Schristos  * Copy a block of memory, handling overlap.
62*37c9f0a6Schristos  * This is the routine that actually implements
63*37c9f0a6Schristos  * (the portable versions of) bcopy, memcpy, and memmove.
64*37c9f0a6Schristos  */
65*37c9f0a6Schristos #ifdef MEMCOPY
66*37c9f0a6Schristos void *
67*37c9f0a6Schristos memcpy(dst0, src0, length)
68*37c9f0a6Schristos #else
69*37c9f0a6Schristos #ifdef MEMMOVE
70*37c9f0a6Schristos void *
71*37c9f0a6Schristos memmove(dst0, src0, length)
72*37c9f0a6Schristos #else
73*37c9f0a6Schristos void
74*37c9f0a6Schristos bcopy(src0, dst0, length)
75*37c9f0a6Schristos #endif
76*37c9f0a6Schristos #endif
77*37c9f0a6Schristos 	void *dst0;
78*37c9f0a6Schristos 	const void *src0;
79*37c9f0a6Schristos 	size_t length;
80*37c9f0a6Schristos {
81*37c9f0a6Schristos 	char *dst = dst0;
82*37c9f0a6Schristos 	const char *src = src0;
83*37c9f0a6Schristos 	size_t t;
84*37c9f0a6Schristos 	unsigned long u;
85*37c9f0a6Schristos 
86*37c9f0a6Schristos 	_DIAGASSERT(dst0 != 0);
87*37c9f0a6Schristos 	_DIAGASSERT(src0 != 0);
88*37c9f0a6Schristos 
89*37c9f0a6Schristos 	if (length == 0 || dst == src)		/* nothing to do */
90*37c9f0a6Schristos 		goto done;
91*37c9f0a6Schristos 
92*37c9f0a6Schristos 	/*
93*37c9f0a6Schristos 	 * Macros: loop-t-times; and loop-t-times, t>0
94*37c9f0a6Schristos 	 */
95*37c9f0a6Schristos #define	TLOOP(s) if (t) TLOOP1(s)
96*37c9f0a6Schristos #define	TLOOP1(s) do { s; } while (--t)
97*37c9f0a6Schristos 
98*37c9f0a6Schristos 	if ((unsigned long)dst < (unsigned long)src) {
99*37c9f0a6Schristos 		/*
100*37c9f0a6Schristos 		 * Copy forward.
101*37c9f0a6Schristos 		 */
102*37c9f0a6Schristos 		u = (unsigned long)src;	/* only need low bits */
103*37c9f0a6Schristos 		if ((u | (unsigned long)dst) & wmask) {
104*37c9f0a6Schristos 			/*
105*37c9f0a6Schristos 			 * Try to align operands.  This cannot be done
106*37c9f0a6Schristos 			 * unless the low bits match.
107*37c9f0a6Schristos 			 */
108*37c9f0a6Schristos 			if ((u ^ (unsigned long)dst) & wmask || length < wsize)
109*37c9f0a6Schristos 				t = length;
110*37c9f0a6Schristos 			else
111*37c9f0a6Schristos 				t = wsize - (size_t)(u & wmask);
112*37c9f0a6Schristos 			length -= t;
113*37c9f0a6Schristos 			TLOOP1(*dst++ = *src++);
114*37c9f0a6Schristos 		}
115*37c9f0a6Schristos 		/*
116*37c9f0a6Schristos 		 * Copy whole words, then mop up any trailing bytes.
117*37c9f0a6Schristos 		 */
118*37c9f0a6Schristos 		t = length / wsize;
119*37c9f0a6Schristos 		TLOOP(*(word *)(void *)dst = *(const word *)(const void *)src; src += wsize; dst += wsize);
120*37c9f0a6Schristos 		t = length & wmask;
121*37c9f0a6Schristos 		TLOOP(*dst++ = *src++);
122*37c9f0a6Schristos 	} else {
123*37c9f0a6Schristos 		/*
124*37c9f0a6Schristos 		 * Copy backwards.  Otherwise essentially the same.
125*37c9f0a6Schristos 		 * Alignment works as before, except that it takes
126*37c9f0a6Schristos 		 * (t&wmask) bytes to align, not wsize-(t&wmask).
127*37c9f0a6Schristos 		 */
128*37c9f0a6Schristos 		src += length;
129*37c9f0a6Schristos 		dst += length;
130*37c9f0a6Schristos 		_DIAGASSERT((unsigned long)dst >= (unsigned long)dst0);
131*37c9f0a6Schristos 		_DIAGASSERT((unsigned long)src >= (unsigned long)src0);
132*37c9f0a6Schristos 		u = (unsigned long)src;
133*37c9f0a6Schristos 		if ((u | (unsigned long)dst) & wmask) {
134*37c9f0a6Schristos 			if ((u ^ (unsigned long)dst) & wmask || length <= wsize)
135*37c9f0a6Schristos 				t = length;
136*37c9f0a6Schristos 			else
137*37c9f0a6Schristos 				t = (size_t)(u & wmask);
138*37c9f0a6Schristos 			length -= t;
139*37c9f0a6Schristos 			TLOOP1(*--dst = *--src);
140*37c9f0a6Schristos 		}
141*37c9f0a6Schristos 		t = length / wsize;
142*37c9f0a6Schristos 		TLOOP(src -= wsize; dst -= wsize; *(word *)(void *)dst = *(const word *)(const void *)src);
143*37c9f0a6Schristos 		t = length & wmask;
144*37c9f0a6Schristos 		TLOOP(*--dst = *--src);
145*37c9f0a6Schristos 	}
146*37c9f0a6Schristos done:
147*37c9f0a6Schristos #if defined(MEMCOPY) || defined(MEMMOVE)
148*37c9f0a6Schristos 	return (dst0);
149*37c9f0a6Schristos #else
150*37c9f0a6Schristos 	return;
151*37c9f0a6Schristos #endif
152*37c9f0a6Schristos }
153