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