Yinghai Lu | 8fee13a4 | 2010-08-02 16:21:22 -0700 | [diff] [blame] | 1 | #include "../string.c" |
Vivek Goyal | 820e8fe | 2014-03-18 15:26:38 -0400 | [diff] [blame] | 2 | |
Vivek Goyal | 820e8fe | 2014-03-18 15:26:38 -0400 | [diff] [blame] | 3 | #ifdef CONFIG_X86_32 |
Kees Cook | bf0118d | 2016-04-20 13:55:45 -0700 | [diff] [blame^] | 4 | void *__memcpy(void *dest, const void *src, size_t n) |
Vivek Goyal | 820e8fe | 2014-03-18 15:26:38 -0400 | [diff] [blame] | 5 | { |
| 6 | int d0, d1, d2; |
| 7 | asm volatile( |
| 8 | "rep ; movsl\n\t" |
| 9 | "movl %4,%%ecx\n\t" |
| 10 | "rep ; movsb\n\t" |
| 11 | : "=&c" (d0), "=&D" (d1), "=&S" (d2) |
| 12 | : "0" (n >> 2), "g" (n & 3), "1" (dest), "2" (src) |
| 13 | : "memory"); |
| 14 | |
| 15 | return dest; |
| 16 | } |
| 17 | #else |
Kees Cook | bf0118d | 2016-04-20 13:55:45 -0700 | [diff] [blame^] | 18 | void *__memcpy(void *dest, const void *src, size_t n) |
Vivek Goyal | 820e8fe | 2014-03-18 15:26:38 -0400 | [diff] [blame] | 19 | { |
| 20 | long d0, d1, d2; |
| 21 | asm volatile( |
| 22 | "rep ; movsq\n\t" |
| 23 | "movq %4,%%rcx\n\t" |
| 24 | "rep ; movsb\n\t" |
| 25 | : "=&c" (d0), "=&D" (d1), "=&S" (d2) |
| 26 | : "0" (n >> 3), "g" (n & 7), "1" (dest), "2" (src) |
| 27 | : "memory"); |
| 28 | |
| 29 | return dest; |
| 30 | } |
| 31 | #endif |
Vivek Goyal | 0499955 | 2014-03-18 15:26:40 -0400 | [diff] [blame] | 32 | |
| 33 | void *memset(void *s, int c, size_t n) |
| 34 | { |
| 35 | int i; |
| 36 | char *ss = s; |
| 37 | |
| 38 | for (i = 0; i < n; i++) |
| 39 | ss[i] = c; |
| 40 | return s; |
| 41 | } |
Kees Cook | bf0118d | 2016-04-20 13:55:45 -0700 | [diff] [blame^] | 42 | |
| 43 | /* |
| 44 | * This memcpy is overlap safe (i.e. it is memmove without conflicting |
| 45 | * with other definitions of memmove from the various decompressors. |
| 46 | */ |
| 47 | void *memcpy(void *dest, const void *src, size_t n) |
| 48 | { |
| 49 | unsigned char *d = dest; |
| 50 | const unsigned char *s = src; |
| 51 | |
| 52 | if (d <= s || d - s >= n) |
| 53 | return __memcpy(dest, src, n); |
| 54 | |
| 55 | while (n-- > 0) |
| 56 | d[n] = s[n]; |
| 57 | |
| 58 | return dest; |
| 59 | } |