37 lines
1 KiB
C
37 lines
1 KiB
C
|
/******************************************************************************
|
||
|
|
* Copyright (c) 2004, 2008 IBM Corporation
|
||
|
|
* All rights reserved.
|
||
|
|
* This program and the accompanying materials
|
||
|
|
* are made available under the terms of the BSD License
|
||
|
|
* which accompanies this distribution, and is available at
|
||
|
|
* http://www.opensource.org/licenses/bsd-license.php
|
||
|
|
*
|
||
|
|
* Contributors:
|
||
|
|
* IBM Corporation - initial implementation
|
||
|
|
*****************************************************************************/
|
||
|
|
|
||
|
|
#include <stddef.h>
|
||
|
|
|
||
|
|
void *memcpy(void *dest, const void *src, size_t n);
|
||
|
|
void *memmove(void *dest, const void *src, size_t n);
|
||
|
|
void *memmove(void *dest, const void *src, size_t n)
|
||
|
|
{
|
||
|
|
/* Do the buffers overlap in a bad way? */
|
||
|
|
if (src < dest && src + n >= dest) {
|
||
|
|
char *cdest;
|
||
|
|
const char *csrc;
|
||
|
|
int i;
|
||
|
|
|
||
|
|
/* Copy from end to start */
|
||
|
|
cdest = dest + n - 1;
|
||
|
|
csrc = src + n - 1;
|
||
|
|
for (i = 0; i < n; i++) {
|
||
|
|
*cdest-- = *csrc--;
|
||
|
|
}
|
||
|
|
return dest;
|
||
|
|
} else {
|
||
|
|
/* Normal copy is possible */
|
||
|
|
return memcpy(dest, src, n);
|
||
|
|
}
|
||
|
|
}
|