60 lines
2.0 KiB
C
60 lines
2.0 KiB
C
/* $NetBSD: bcopy.c,v 1.9 2003/08/07 16:32:25 agc Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)bcopy.c 8.1 (Berkeley) 6/11/93
|
|
*/
|
|
|
|
#include <sys/types.h>
|
|
#include "stand.h"
|
|
|
|
#undef bcopy /* in case of LIBSA_USE_MEMCPY */
|
|
|
|
/*
|
|
* This is designed to be small, not fast.
|
|
*/
|
|
void
|
|
bcopy(s1, s2, n)
|
|
const void *s1;
|
|
void *s2;
|
|
size_t n;
|
|
{
|
|
const char *f = s1;
|
|
char *t = s2;
|
|
|
|
if (f < t) {
|
|
f += n;
|
|
t += n;
|
|
while (n-- > 0)
|
|
*--t = *--f;
|
|
} else
|
|
while (n-- > 0)
|
|
*t++ = *f++;
|
|
}
|