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