blob: e9ee84873de50a3b60a4cf8e978d4bf6eae9665f [file] [log] [blame]
H. Peter Anvin1965aae2008-10-22 22:26:29 -07001#ifndef _ASM_X86_STRING_32_H
2#define _ASM_X86_STRING_32_H
Linus Torvalds1da177e2005-04-16 15:20:36 -07003
4#ifdef __KERNEL__
Linus Torvalds1da177e2005-04-16 15:20:36 -07005
Joe Perches06b0f572008-03-23 01:03:33 -07006/* Let gcc decide whether to inline or use the out of line functions */
Linus Torvalds1da177e2005-04-16 15:20:36 -07007
8#define __HAVE_ARCH_STRCPY
Andi Kleenb520b852007-07-21 17:09:59 +02009extern char *strcpy(char *dest, const char *src);
Linus Torvalds1da177e2005-04-16 15:20:36 -070010
11#define __HAVE_ARCH_STRNCPY
Andi Kleenb520b852007-07-21 17:09:59 +020012extern char *strncpy(char *dest, const char *src, size_t count);
Linus Torvalds1da177e2005-04-16 15:20:36 -070013
14#define __HAVE_ARCH_STRCAT
Andi Kleenb520b852007-07-21 17:09:59 +020015extern char *strcat(char *dest, const char *src);
Linus Torvalds1da177e2005-04-16 15:20:36 -070016
17#define __HAVE_ARCH_STRNCAT
Andi Kleenb520b852007-07-21 17:09:59 +020018extern char *strncat(char *dest, const char *src, size_t count);
Linus Torvalds1da177e2005-04-16 15:20:36 -070019
20#define __HAVE_ARCH_STRCMP
Andi Kleenb520b852007-07-21 17:09:59 +020021extern int strcmp(const char *cs, const char *ct);
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
23#define __HAVE_ARCH_STRNCMP
Andi Kleenb520b852007-07-21 17:09:59 +020024extern int strncmp(const char *cs, const char *ct, size_t count);
Linus Torvalds1da177e2005-04-16 15:20:36 -070025
26#define __HAVE_ARCH_STRCHR
Andi Kleenb520b852007-07-21 17:09:59 +020027extern char *strchr(const char *s, int c);
Linus Torvalds1da177e2005-04-16 15:20:36 -070028
Linus Torvalds1da177e2005-04-16 15:20:36 -070029#define __HAVE_ARCH_STRLEN
Andi Kleenb520b852007-07-21 17:09:59 +020030extern size_t strlen(const char *s);
Linus Torvalds1da177e2005-04-16 15:20:36 -070031
Joe Perches78d64fc2008-05-12 15:44:39 +020032static __always_inline void *__memcpy(void *to, const void *from, size_t n)
Linus Torvalds1da177e2005-04-16 15:20:36 -070033{
Joe Perches78d64fc2008-05-12 15:44:39 +020034 int d0, d1, d2;
35 asm volatile("rep ; movsl\n\t"
36 "movl %4,%%ecx\n\t"
37 "andl $3,%%ecx\n\t"
38 "jz 1f\n\t"
39 "rep ; movsb\n\t"
40 "1:"
41 : "=&c" (d0), "=&D" (d1), "=&S" (d2)
42 : "0" (n / 4), "g" (n), "1" ((long)to), "2" ((long)from)
43 : "memory");
44 return to;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045}
46
47/*
Denis Vlasenkod5b63d72005-05-01 08:58:48 -070048 * This looks ugly, but the compiler can optimize it totally,
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 * as the count is constant.
50 */
Joe Perches78d64fc2008-05-12 15:44:39 +020051static __always_inline void *__constant_memcpy(void *to, const void *from,
52 size_t n)
Linus Torvalds1da177e2005-04-16 15:20:36 -070053{
Denis Vlasenkod5b63d72005-05-01 08:58:48 -070054 long esi, edi;
Joe Perches78d64fc2008-05-12 15:44:39 +020055 if (!n)
56 return to;
57
Denis Vlasenkod5b63d72005-05-01 08:58:48 -070058 switch (n) {
Joe Perches78d64fc2008-05-12 15:44:39 +020059 case 1:
60 *(char *)to = *(char *)from;
61 return to;
62 case 2:
63 *(short *)to = *(short *)from;
64 return to;
65 case 4:
66 *(int *)to = *(int *)from;
67 return to;
Joe Perches78d64fc2008-05-12 15:44:39 +020068 case 3:
69 *(short *)to = *(short *)from;
70 *((char *)to + 2) = *((char *)from + 2);
71 return to;
72 case 5:
73 *(int *)to = *(int *)from;
74 *((char *)to + 4) = *((char *)from + 4);
75 return to;
76 case 6:
77 *(int *)to = *(int *)from;
78 *((short *)to + 2) = *((short *)from + 2);
79 return to;
80 case 8:
81 *(int *)to = *(int *)from;
82 *((int *)to + 1) = *((int *)from + 1);
83 return to;
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 }
Joe Perches78d64fc2008-05-12 15:44:39 +020085
86 esi = (long)from;
87 edi = (long)to;
88 if (n >= 5 * 4) {
Denis Vlasenkod5b63d72005-05-01 08:58:48 -070089 /* large block: use rep prefix */
90 int ecx;
Joe Perches78d64fc2008-05-12 15:44:39 +020091 asm volatile("rep ; movsl"
92 : "=&c" (ecx), "=&D" (edi), "=&S" (esi)
93 : "0" (n / 4), "1" (edi), "2" (esi)
94 : "memory"
Denis Vlasenkod5b63d72005-05-01 08:58:48 -070095 );
96 } else {
97 /* small block: don't clobber ecx + smaller code */
Joe Perches78d64fc2008-05-12 15:44:39 +020098 if (n >= 4 * 4)
99 asm volatile("movsl"
100 : "=&D"(edi), "=&S"(esi)
101 : "0"(edi), "1"(esi)
102 : "memory");
103 if (n >= 3 * 4)
104 asm volatile("movsl"
105 : "=&D"(edi), "=&S"(esi)
106 : "0"(edi), "1"(esi)
107 : "memory");
108 if (n >= 2 * 4)
109 asm volatile("movsl"
110 : "=&D"(edi), "=&S"(esi)
111 : "0"(edi), "1"(esi)
112 : "memory");
113 if (n >= 1 * 4)
114 asm volatile("movsl"
115 : "=&D"(edi), "=&S"(esi)
116 : "0"(edi), "1"(esi)
117 : "memory");
Denis Vlasenkod5b63d72005-05-01 08:58:48 -0700118 }
119 switch (n % 4) {
120 /* tail */
Joe Perches78d64fc2008-05-12 15:44:39 +0200121 case 0:
122 return to;
123 case 1:
124 asm volatile("movsb"
125 : "=&D"(edi), "=&S"(esi)
126 : "0"(edi), "1"(esi)
127 : "memory");
128 return to;
129 case 2:
130 asm volatile("movsw"
131 : "=&D"(edi), "=&S"(esi)
132 : "0"(edi), "1"(esi)
133 : "memory");
134 return to;
135 default:
136 asm volatile("movsw\n\tmovsb"
137 : "=&D"(edi), "=&S"(esi)
138 : "0"(edi), "1"(esi)
139 : "memory");
140 return to;
Denis Vlasenkod5b63d72005-05-01 08:58:48 -0700141 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142}
143
144#define __HAVE_ARCH_MEMCPY
Daniel Micay6974f0c2017-07-12 14:36:10 -0700145extern void *memcpy(void *, const void *, size_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146
Daniel Micay6974f0c2017-07-12 14:36:10 -0700147#ifndef CONFIG_FORTIFY_SOURCE
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148#ifdef CONFIG_X86_USE_3DNOW
149
150#include <asm/mmx.h>
151
152/*
153 * This CPU favours 3DNow strongly (eg AMD Athlon)
154 */
155
Joe Perches78d64fc2008-05-12 15:44:39 +0200156static inline void *__constant_memcpy3d(void *to, const void *from, size_t len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157{
158 if (len < 512)
159 return __constant_memcpy(to, from, len);
160 return _mmx_memcpy(to, from, len);
161}
162
Joe Perches78d64fc2008-05-12 15:44:39 +0200163static inline void *__memcpy3d(void *to, const void *from, size_t len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164{
165 if (len < 512)
166 return __memcpy(to, from, len);
167 return _mmx_memcpy(to, from, len);
168}
169
Joe Perches78d64fc2008-05-12 15:44:39 +0200170#define memcpy(t, f, n) \
171 (__builtin_constant_p((n)) \
172 ? __constant_memcpy3d((t), (f), (n)) \
173 : __memcpy3d((t), (f), (n)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174
175#else
176
177/*
178 * No 3D Now!
179 */
Joe Perches78d64fc2008-05-12 15:44:39 +0200180
Vegard Nossumf8561292008-04-04 00:53:23 +0200181#ifndef CONFIG_KMEMCHECK
Arjan van de Venff60fab2009-09-28 14:21:22 +0200182
183#if (__GNUC__ >= 4)
184#define memcpy(t, f, n) __builtin_memcpy(t, f, n)
185#else
Joe Perches78d64fc2008-05-12 15:44:39 +0200186#define memcpy(t, f, n) \
187 (__builtin_constant_p((n)) \
188 ? __constant_memcpy((t), (f), (n)) \
189 : __memcpy((t), (f), (n)))
Arjan van de Venff60fab2009-09-28 14:21:22 +0200190#endif
Vegard Nossumf8561292008-04-04 00:53:23 +0200191#else
192/*
193 * kmemcheck becomes very happy if we use the REP instructions unconditionally,
194 * because it means that we know both memory operands in advance.
195 */
196#define memcpy(t, f, n) __memcpy((t), (f), (n))
197#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198
199#endif
Daniel Micay6974f0c2017-07-12 14:36:10 -0700200#endif /* !CONFIG_FORTIFY_SOURCE */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201
202#define __HAVE_ARCH_MEMMOVE
Joe Perches78d64fc2008-05-12 15:44:39 +0200203void *memmove(void *dest, const void *src, size_t n);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204
Daniel Micay6974f0c2017-07-12 14:36:10 -0700205extern int memcmp(const void *, const void *, size_t);
206#ifndef CONFIG_FORTIFY_SOURCE
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207#define memcmp __builtin_memcmp
Daniel Micay6974f0c2017-07-12 14:36:10 -0700208#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209
210#define __HAVE_ARCH_MEMCHR
Joe Perches78d64fc2008-05-12 15:44:39 +0200211extern void *memchr(const void *cs, int c, size_t count);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212
Joe Perches78d64fc2008-05-12 15:44:39 +0200213static inline void *__memset_generic(void *s, char c, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214{
Joe Perches78d64fc2008-05-12 15:44:39 +0200215 int d0, d1;
216 asm volatile("rep\n\t"
217 "stosb"
218 : "=&c" (d0), "=&D" (d1)
219 : "a" (c), "1" (s), "0" (count)
220 : "memory");
221 return s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222}
223
224/* we might want to write optimized versions of these later */
Joe Perches78d64fc2008-05-12 15:44:39 +0200225#define __constant_count_memset(s, c, count) __memset_generic((s), (c), (count))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226
227/*
Joe Perches78d64fc2008-05-12 15:44:39 +0200228 * memset(x, 0, y) is a reasonably common thing to do, so we want to fill
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229 * things 32 bits at a time even when we don't know the size of the
230 * area at compile-time..
231 */
Joe Perches78d64fc2008-05-12 15:44:39 +0200232static __always_inline
233void *__constant_c_memset(void *s, unsigned long c, size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234{
Joe Perches78d64fc2008-05-12 15:44:39 +0200235 int d0, d1;
236 asm volatile("rep ; stosl\n\t"
237 "testb $2,%b3\n\t"
238 "je 1f\n\t"
239 "stosw\n"
240 "1:\ttestb $1,%b3\n\t"
241 "je 2f\n\t"
242 "stosb\n"
243 "2:"
244 : "=&c" (d0), "=&D" (d1)
245 : "a" (c), "q" (count), "0" (count/4), "1" ((long)s)
246 : "memory");
247 return s;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248}
249
250/* Added by Gertjan van Wingerde to make minix and sysv module work */
251#define __HAVE_ARCH_STRNLEN
Joe Perches78d64fc2008-05-12 15:44:39 +0200252extern size_t strnlen(const char *s, size_t count);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253/* end of additional stuff */
254
255#define __HAVE_ARCH_STRSTR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256extern char *strstr(const char *cs, const char *ct);
257
258/*
259 * This looks horribly ugly, but the compiler can optimize it totally,
260 * as we by now know that both pattern and count is constant..
261 */
Joe Perches78d64fc2008-05-12 15:44:39 +0200262static __always_inline
263void *__constant_c_and_count_memset(void *s, unsigned long pattern,
264 size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265{
266 switch (count) {
Joe Perches78d64fc2008-05-12 15:44:39 +0200267 case 0:
268 return s;
269 case 1:
270 *(unsigned char *)s = pattern & 0xff;
271 return s;
272 case 2:
273 *(unsigned short *)s = pattern & 0xffff;
274 return s;
275 case 3:
276 *(unsigned short *)s = pattern & 0xffff;
277 *((unsigned char *)s + 2) = pattern & 0xff;
278 return s;
279 case 4:
280 *(unsigned long *)s = pattern;
281 return s;
282 }
283
284#define COMMON(x) \
285 asm volatile("rep ; stosl" \
286 x \
287 : "=&c" (d0), "=&D" (d1) \
H. Peter Anvin1a20d3e2008-05-26 13:36:53 -0700288 : "a" (eax), "0" (count/4), "1" ((long)s) \
Joe Perches78d64fc2008-05-12 15:44:39 +0200289 : "memory")
290
291 {
292 int d0, d1;
H. Peter Anvin1a20d3e2008-05-26 13:36:53 -0700293#if __GNUC__ == 4 && __GNUC_MINOR__ == 0
294 /* Workaround for broken gcc 4.0 */
295 register unsigned long eax asm("%eax") = pattern;
296#else
297 unsigned long eax = pattern;
298#endif
299
Joe Perches78d64fc2008-05-12 15:44:39 +0200300 switch (count % 4) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301 case 0:
Joe Perches78d64fc2008-05-12 15:44:39 +0200302 COMMON("");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 return s;
304 case 1:
Joe Perches78d64fc2008-05-12 15:44:39 +0200305 COMMON("\n\tstosb");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 return s;
307 case 2:
Joe Perches78d64fc2008-05-12 15:44:39 +0200308 COMMON("\n\tstosw");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309 return s;
Joe Perches78d64fc2008-05-12 15:44:39 +0200310 default:
311 COMMON("\n\tstosw\n\tstosb");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 return s;
Joe Perches78d64fc2008-05-12 15:44:39 +0200313 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314 }
Joe Perches78d64fc2008-05-12 15:44:39 +0200315
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316#undef COMMON
317}
318
Joe Perches78d64fc2008-05-12 15:44:39 +0200319#define __constant_c_x_memset(s, c, count) \
320 (__builtin_constant_p(count) \
321 ? __constant_c_and_count_memset((s), (c), (count)) \
322 : __constant_c_memset((s), (c), (count)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323
Joe Perches78d64fc2008-05-12 15:44:39 +0200324#define __memset(s, c, count) \
325 (__builtin_constant_p(count) \
326 ? __constant_count_memset((s), (c), (count)) \
327 : __memset_generic((s), (c), (count)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328
329#define __HAVE_ARCH_MEMSET
Daniel Micay6974f0c2017-07-12 14:36:10 -0700330extern void *memset(void *, int, size_t);
331#ifndef CONFIG_FORTIFY_SOURCE
Arjan van de Venff60fab2009-09-28 14:21:22 +0200332#if (__GNUC__ >= 4)
333#define memset(s, c, count) __builtin_memset(s, c, count)
334#else
Joe Perches78d64fc2008-05-12 15:44:39 +0200335#define memset(s, c, count) \
336 (__builtin_constant_p(c) \
337 ? __constant_c_x_memset((s), (0x01010101UL * (unsigned char)(c)), \
338 (count)) \
339 : __memset((s), (c), (count)))
Arjan van de Venff60fab2009-09-28 14:21:22 +0200340#endif
Daniel Micay6974f0c2017-07-12 14:36:10 -0700341#endif /* !CONFIG_FORTIFY_SOURCE */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342
343/*
344 * find the first occurrence of byte 'c', or 1 past the area if none
345 */
346#define __HAVE_ARCH_MEMSCAN
Joe Perches78d64fc2008-05-12 15:44:39 +0200347extern void *memscan(void *addr, int c, size_t size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348
349#endif /* __KERNEL__ */
350
H. Peter Anvin1965aae2008-10-22 22:26:29 -0700351#endif /* _ASM_X86_STRING_32_H */