158f0484fSRodney W. Grimes /*- 258f0484fSRodney W. Grimes * Copyright (c) 1990, 1993 358f0484fSRodney W. Grimes * The Regents of the University of California. All rights reserved. 458f0484fSRodney W. Grimes * 558f0484fSRodney W. Grimes * This code is derived from software contributed to Berkeley by 658f0484fSRodney W. Grimes * Chris Torek. 758f0484fSRodney W. Grimes * 858f0484fSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 958f0484fSRodney W. Grimes * modification, are permitted provided that the following conditions 1058f0484fSRodney W. Grimes * are met: 1158f0484fSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 1258f0484fSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 1358f0484fSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 1458f0484fSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 1558f0484fSRodney W. Grimes * documentation and/or other materials provided with the distribution. 1658f0484fSRodney W. Grimes * 3. All advertising materials mentioning features or use of this software 1758f0484fSRodney W. Grimes * must display the following acknowledgement: 1858f0484fSRodney W. Grimes * This product includes software developed by the University of 1958f0484fSRodney W. Grimes * California, Berkeley and its contributors. 2058f0484fSRodney W. Grimes * 4. Neither the name of the University nor the names of its contributors 2158f0484fSRodney W. Grimes * may be used to endorse or promote products derived from this software 2258f0484fSRodney W. Grimes * without specific prior written permission. 2358f0484fSRodney W. Grimes * 2458f0484fSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 2558f0484fSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2658f0484fSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2758f0484fSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2858f0484fSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2958f0484fSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 3058f0484fSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 3158f0484fSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 3258f0484fSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 3358f0484fSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3458f0484fSRodney W. Grimes * SUCH DAMAGE. 3558f0484fSRodney W. Grimes */ 3658f0484fSRodney W. Grimes 3758f0484fSRodney W. Grimes #if defined(LIBC_SCCS) && !defined(lint) 3858f0484fSRodney W. Grimes static char sccsid[] = "@(#)bcopy.c 8.1 (Berkeley) 6/4/93"; 3958f0484fSRodney W. Grimes #endif /* LIBC_SCCS and not lint */ 4058f0484fSRodney W. Grimes #include <sys/cdefs.h> 41de5fe5d5SDavid E. O'Brien __FBSDID("$FreeBSD$"); 42de5fe5d5SDavid E. O'Brien 4358f0484fSRodney W. Grimes #include <string.h> 4458f0484fSRodney W. Grimes 4558f0484fSRodney W. Grimes /* 4658f0484fSRodney W. Grimes * sizeof(word) MUST BE A POWER OF TWO 4758f0484fSRodney W. Grimes * SO THAT wmask BELOW IS ALL ONES 4858f0484fSRodney W. Grimes */ 4958f0484fSRodney W. Grimes typedef int word; /* "word" used for optimal copy speed */ 5058f0484fSRodney W. Grimes 5158f0484fSRodney W. Grimes #define wsize sizeof(word) 5258f0484fSRodney W. Grimes #define wmask (wsize - 1) 5358f0484fSRodney W. Grimes 5458f0484fSRodney W. Grimes /* 5558f0484fSRodney W. Grimes * Copy a block of memory, handling overlap. 5658f0484fSRodney W. Grimes * This is the routine that actually implements 5758f0484fSRodney W. Grimes * (the portable versions of) bcopy, memcpy, and memmove. 5858f0484fSRodney W. Grimes */ 5958f0484fSRodney W. Grimes #ifdef MEMCOPY 6058f0484fSRodney W. Grimes void * 6158f0484fSRodney W. Grimes memcpy(dst0, src0, length) 6258f0484fSRodney W. Grimes #else 6358f0484fSRodney W. Grimes #ifdef MEMMOVE 6458f0484fSRodney W. Grimes void * 6558f0484fSRodney W. Grimes memmove(dst0, src0, length) 6658f0484fSRodney W. Grimes #else 6758f0484fSRodney W. Grimes void 6858f0484fSRodney W. Grimes bcopy(src0, dst0, length) 6958f0484fSRodney W. Grimes #endif 7058f0484fSRodney W. Grimes #endif 7158f0484fSRodney W. Grimes void *dst0; 7258f0484fSRodney W. Grimes const void *src0; 738fb3f3f6SDavid E. O'Brien size_t length; 7458f0484fSRodney W. Grimes { 758fb3f3f6SDavid E. O'Brien char *dst = dst0; 768fb3f3f6SDavid E. O'Brien const char *src = src0; 778fb3f3f6SDavid E. O'Brien size_t t; 7858f0484fSRodney W. Grimes 7958f0484fSRodney W. Grimes if (length == 0 || dst == src) /* nothing to do */ 8058f0484fSRodney W. Grimes goto done; 8158f0484fSRodney W. Grimes 8258f0484fSRodney W. Grimes /* 8358f0484fSRodney W. Grimes * Macros: loop-t-times; and loop-t-times, t>0 8458f0484fSRodney W. Grimes */ 8558f0484fSRodney W. Grimes #define TLOOP(s) if (t) TLOOP1(s) 8658f0484fSRodney W. Grimes #define TLOOP1(s) do { s; } while (--t) 8758f0484fSRodney W. Grimes 8858f0484fSRodney W. Grimes if ((unsigned long)dst < (unsigned long)src) { 8958f0484fSRodney W. Grimes /* 9058f0484fSRodney W. Grimes * Copy forward. 9158f0484fSRodney W. Grimes */ 9258f0484fSRodney W. Grimes t = (int)src; /* only need low bits */ 9358f0484fSRodney W. Grimes if ((t | (int)dst) & wmask) { 9458f0484fSRodney W. Grimes /* 9558f0484fSRodney W. Grimes * Try to align operands. This cannot be done 9658f0484fSRodney W. Grimes * unless the low bits match. 9758f0484fSRodney W. Grimes */ 9858f0484fSRodney W. Grimes if ((t ^ (int)dst) & wmask || length < wsize) 9958f0484fSRodney W. Grimes t = length; 10058f0484fSRodney W. Grimes else 10158f0484fSRodney W. Grimes t = wsize - (t & wmask); 10258f0484fSRodney W. Grimes length -= t; 10358f0484fSRodney W. Grimes TLOOP1(*dst++ = *src++); 10458f0484fSRodney W. Grimes } 10558f0484fSRodney W. Grimes /* 10658f0484fSRodney W. Grimes * Copy whole words, then mop up any trailing bytes. 10758f0484fSRodney W. Grimes */ 10858f0484fSRodney W. Grimes t = length / wsize; 10958f0484fSRodney W. Grimes TLOOP(*(word *)dst = *(word *)src; src += wsize; dst += wsize); 11058f0484fSRodney W. Grimes t = length & wmask; 11158f0484fSRodney W. Grimes TLOOP(*dst++ = *src++); 11258f0484fSRodney W. Grimes } else { 11358f0484fSRodney W. Grimes /* 11458f0484fSRodney W. Grimes * Copy backwards. Otherwise essentially the same. 11558f0484fSRodney W. Grimes * Alignment works as before, except that it takes 11658f0484fSRodney W. Grimes * (t&wmask) bytes to align, not wsize-(t&wmask). 11758f0484fSRodney W. Grimes */ 11858f0484fSRodney W. Grimes src += length; 11958f0484fSRodney W. Grimes dst += length; 12058f0484fSRodney W. Grimes t = (int)src; 12158f0484fSRodney W. Grimes if ((t | (int)dst) & wmask) { 12258f0484fSRodney W. Grimes if ((t ^ (int)dst) & wmask || length <= wsize) 12358f0484fSRodney W. Grimes t = length; 12458f0484fSRodney W. Grimes else 12558f0484fSRodney W. Grimes t &= wmask; 12658f0484fSRodney W. Grimes length -= t; 12758f0484fSRodney W. Grimes TLOOP1(*--dst = *--src); 12858f0484fSRodney W. Grimes } 12958f0484fSRodney W. Grimes t = length / wsize; 13058f0484fSRodney W. Grimes TLOOP(src -= wsize; dst -= wsize; *(word *)dst = *(word *)src); 13158f0484fSRodney W. Grimes t = length & wmask; 13258f0484fSRodney W. Grimes TLOOP(*--dst = *--src); 13358f0484fSRodney W. Grimes } 13458f0484fSRodney W. Grimes done: 13558f0484fSRodney W. Grimes #if defined(MEMCOPY) || defined(MEMMOVE) 13658f0484fSRodney W. Grimes return (dst0); 13758f0484fSRodney W. Grimes #else 13858f0484fSRodney W. Grimes return; 13958f0484fSRodney W. Grimes #endif 14058f0484fSRodney W. Grimes } 141