Annotation of sys/lib/libkern/arch/powerpc/memcpy.c, Revision 1.1.1.1
1.1 nbrk 1: /* $OpenBSD: memcpy.c,v 1.2 2003/06/02 23:28:08 millert Exp $ */
2: /* $NetBSD: bcopy.c,v 1.5 1995/04/22 13:46:50 cgd Exp $ */
3:
4: /*-
5: * Copyright (c) 1993
6: * The Regents of the University of California. All rights reserved.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
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: * 3. 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.
19: *
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
30: * SUCH DAMAGE.
31: *
32: * @(#)bcopy.c 8.1 (Berkeley) 6/11/93
33: */
34:
35: #include <sys/types.h>
36:
37: /*
38: * This is designed to be small, not fast.
39: */
40: void *
41: memcpy(s1, s2, n)
42: void *s1;
43: const void *s2;
44: size_t n;
45: {
46: register const char *f = s2;
47: register char *t = s1;
48:
49: if (f < t) {
50: f += n;
51: t += n;
52: while (n-- > 0)
53: *--t = *--f;
54: } else
55: while (n-- > 0)
56: *t++ = *f++;
57: return s1;
58: }
CVSweb