* Copyright (c) 1990 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* %sccs.include.redist.c%
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid
[] = "@(#)bcopy.c 5.10 (Berkeley) %G%";
#endif /* LIBC_SCCS and not lint */
* sizeof(word) MUST BE A POWER OF TWO
* SO THAT wmask BELOW IS ALL ONES
typedef int word
; /* "word" used for optimal copy speed */
#define wsize sizeof(word)
#define wmask (wsize - 1)
* Copy a block of memory, handling overlap.
* This is the routine that actually implements
* (the portable versions of) bcopy, memcpy, and memmove.
memcpy(dst0
, src0
, length
)
memmove(dst0
, src0
, length
)
bcopy(src0
, dst0
, length
)
register char *dst
= dst0
;
register const char *src
= src0
;
if (length
== 0 || dst
== src
) /* nothing to do */
* Macros: loop-t-times; and loop-t-times, t>0
#define TLOOP(s) if (t) TLOOP1(s)
#define TLOOP1(s) do { s; } while (--t)
if ((unsigned long)dst
< (unsigned long)src
) {
t
= (int)src
; /* only need low bits */
if ((t
| (int)dst
) & wmask
) {
* Try to align operands. This cannot be done
* unless the low bits match.
if ((t
^ (int)dst
) & wmask
|| length
< wsize
)
* Copy whole words, then mop up any trailing bytes.
TLOOP(*(word
*)dst
= *(word
*)src
; src
+= wsize
; dst
+= wsize
);
* Copy backwards. Otherwise essentially the same.
* Alignment works as before, except that it takes
* (t&wmask) bytes to align, not wsize-(t&wmask).
if ((t
| (int)dst
) & wmask
) {
if ((t
^ (int)dst
) & wmask
|| length
<= wsize
)
TLOOP(src
-= wsize
; dst
-= wsize
; *(word
*)dst
= *(word
*)src
);