6b13f685e
 김민수
BSP 최초 추가
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/*
* Copyright 2010 Tilera Corporation. All Rights Reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, version 2.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
* NON INFRINGEMENT. See the GNU General Public License for
* more details.
*/
#include <linux/types.h>
#include <linux/string.h>
#include <linux/module.h>
void *memmove(void *dest, const void *src, size_t n)
{
if ((const char *)src >= (char *)dest + n
|| (char *)dest >= (const char *)src + n) {
/* We found no overlap, so let memcpy do all the heavy
* lifting (prefetching, etc.)
*/
return memcpy(dest, src, n);
}
if (n != 0) {
const uint8_t *in;
uint8_t x;
uint8_t *out;
int stride;
if (src < dest) {
/* copy backwards */
in = (const uint8_t *)src + n - 1;
out = (uint8_t *)dest + n - 1;
stride = -1;
} else {
/* copy forwards */
in = (const uint8_t *)src;
out = (uint8_t *)dest;
stride = 1;
}
/* Manually software-pipeline this loop. */
x = *in;
in += stride;
while (--n != 0) {
*out = x;
out += stride;
x = *in;
in += stride;
}
*out = x;
}
return dest;
}
EXPORT_SYMBOL(memmove);
|