]>
git.saurik.com Git - apple/xnu.git/blob - libsyscall/wrappers/string/memcpy.c
28920058c79c16d26c1558d35b4a046fe630578d
2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * sizeof(word) MUST BE A POWER OF TWO
37 * SO THAT wmask BELOW IS ALL ONES
39 typedef int word
; /* "word" used for optimal copy speed */
41 #define wsize sizeof(word)
42 #define wmask (wsize - 1)
45 * Copy a block of memory, handling overlap.
46 * This is the routine that actually implements
47 * (the portable versions of) bcopy, memcpy, and memmove.
50 __attribute__((visibility("hidden")))
52 _libkernel_memmove(void *dst0
, const void *src0
, size_t length
)
55 const char *src
= src0
;
58 if (length
== 0 || dst
== src
) { /* nothing to do */
63 * Macros: loop-t-times; and loop-t-times, t>0
65 #define TLOOP(s) if (t) TLOOP1(s)
66 #define TLOOP1(s) do { s; } while (--t)
68 if ((unsigned long)dst
< (unsigned long)src
) {
72 t
= (uintptr_t)src
; /* only need low bits */
73 if ((t
| (uintptr_t)dst
) & wmask
) {
75 * Try to align operands. This cannot be done
76 * unless the low bits match.
78 if ((t
^ (uintptr_t)dst
) & wmask
|| length
< wsize
) {
81 t
= wsize
- (t
& wmask
);
84 TLOOP1(*dst
++ = *src
++);
87 * Copy whole words, then mop up any trailing bytes.
90 TLOOP(*(word
*)dst
= *(word
*)src
; src
+= wsize
; dst
+= wsize
);
92 TLOOP(*dst
++ = *src
++);
95 * Copy backwards. Otherwise essentially the same.
96 * Alignment works as before, except that it takes
97 * (t&wmask) bytes to align, not wsize-(t&wmask).
102 if ((t
| (uintptr_t)dst
) & wmask
) {
103 if ((t
^ (uintptr_t)dst
) & wmask
|| length
<= wsize
) {
109 TLOOP1(*--dst
= *--src
);
112 TLOOP(src
-= wsize
; dst
-= wsize
; *(word
*)dst
= *(word
*)src
);
114 TLOOP(*--dst
= *--src
);
120 __attribute__((visibility("hidden")))
122 bcopy(const void *s1
, void *s2
, size_t n
)