FreeBSD/Linux Kernel Cross Reference
sys/lib/libsa/bcopy.c
1 /* $NetBSD: bcopy.c,v 1.9 2003/08/07 16:32:25 agc Exp $ */
2
3 /*-
4 * Copyright (c) 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 *
31 * @(#)bcopy.c 8.1 (Berkeley) 6/11/93
32 */
33
34 #include <sys/types.h>
35 #include "stand.h"
36
37 #undef bcopy /* in case of LIBSA_USE_MEMCPY */
38
39 /*
40 * This is designed to be small, not fast.
41 */
42 void
43 bcopy(s1, s2, n)
44 const void *s1;
45 void *s2;
46 size_t n;
47 {
48 const char *f = s1;
49 char *t = s2;
50
51 if (f < t) {
52 f += n;
53 t += n;
54 while (n-- > 0)
55 *--t = *--f;
56 } else
57 while (n-- > 0)
58 *t++ = *f++;
59 }
Cache object: dbc50f12250f8e848494fbb5815f97fa
|