test-memcpy.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. /* Test and measure memcpy functions.
  2. Copyright (C) 1999-2019 Free Software Foundation, Inc.
  3. This file is part of the GNU C Library.
  4. Written by Jakub Jelinek <jakub@redhat.com>, 1999.
  5. The GNU C Library is free software; you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public
  7. License as published by the Free Software Foundation; either
  8. version 2.1 of the License, or (at your option) any later version.
  9. The GNU C Library is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public
  14. License along with the GNU C Library; if not, see
  15. <http://www.gnu.org/licenses/>. */
  16. #ifndef MEMCPY_RESULT
  17. # define MEMCPY_RESULT(dst, len) dst
  18. # define MIN_PAGE_SIZE 131072
  19. # define TEST_MAIN
  20. # define TEST_NAME "memcpy"
  21. # include "test-string.h"
  22. char *simple_memcpy (char *, const char *, size_t);
  23. char *builtin_memcpy (char *, const char *, size_t);
  24. IMPL (simple_memcpy, 0)
  25. IMPL (builtin_memcpy, 0)
  26. IMPL (memcpy, 1)
  27. char *
  28. simple_memcpy (char *dst, const char *src, size_t n)
  29. {
  30. char *ret = dst;
  31. while (n--)
  32. *dst++ = *src++;
  33. return ret;
  34. }
  35. char *
  36. builtin_memcpy (char *dst, const char *src, size_t n)
  37. {
  38. return __builtin_memcpy (dst, src, n);
  39. }
  40. #endif
  41. typedef char *(*proto_t) (char *, const char *, size_t);
  42. static void
  43. do_one_test (impl_t *impl, char *dst, const char *src,
  44. size_t len)
  45. {
  46. size_t i;
  47. /* Must clear the destination buffer set by the previous run. */
  48. for (i = 0; i < len; i++)
  49. dst[i] = 0;
  50. if (CALL (impl, dst, src, len) != MEMCPY_RESULT (dst, len))
  51. {
  52. error (0, 0, "Wrong result in function %s %p %p", impl->name,
  53. CALL (impl, dst, src, len), MEMCPY_RESULT (dst, len));
  54. ret = 1;
  55. return;
  56. }
  57. if (memcmp (dst, src, len) != 0)
  58. {
  59. error (0, 0, "Wrong result in function %s dst %p \"%.*s\" src %p \"%.*s\" len %zu",
  60. impl->name, dst, (int) len, dst, src, (int) len, src, len);
  61. ret = 1;
  62. return;
  63. }
  64. }
  65. static void
  66. do_test (size_t align1, size_t align2, size_t len)
  67. {
  68. size_t i, j;
  69. char *s1, *s2;
  70. align1 &= 63;
  71. if (align1 + len >= page_size)
  72. return;
  73. align2 &= 63;
  74. if (align2 + len >= page_size)
  75. return;
  76. s1 = (char *) (buf1 + align1);
  77. s2 = (char *) (buf2 + align2);
  78. for (i = 0, j = 1; i < len; i++, j += 23)
  79. s1[i] = j;
  80. FOR_EACH_IMPL (impl, 0)
  81. do_one_test (impl, s2, s1, len);
  82. }
  83. static void
  84. do_random_tests (void)
  85. {
  86. size_t i, j, n, align1, align2, len, size1, size2, size;
  87. int c;
  88. unsigned char *p1, *p2;
  89. unsigned char *res;
  90. for (n = 0; n < ITERATIONS; n++)
  91. {
  92. if (n == 0)
  93. {
  94. len = getpagesize ();
  95. size = len + 512;
  96. size1 = size;
  97. size2 = size;
  98. align1 = 512;
  99. align2 = 512;
  100. }
  101. else
  102. {
  103. if ((random () & 255) == 0)
  104. size = 65536;
  105. else
  106. size = 768;
  107. if (size > page_size)
  108. size = page_size;
  109. size1 = size;
  110. size2 = size;
  111. i = random ();
  112. if (i & 3)
  113. size -= 256;
  114. if (i & 1)
  115. size1 -= 256;
  116. if (i & 2)
  117. size2 -= 256;
  118. if (i & 4)
  119. {
  120. len = random () % size;
  121. align1 = size1 - len - (random () & 31);
  122. align2 = size2 - len - (random () & 31);
  123. if (align1 > size1)
  124. align1 = 0;
  125. if (align2 > size2)
  126. align2 = 0;
  127. }
  128. else
  129. {
  130. align1 = random () & 63;
  131. align2 = random () & 63;
  132. len = random () % size;
  133. if (align1 + len > size1)
  134. align1 = size1 - len;
  135. if (align2 + len > size2)
  136. align2 = size2 - len;
  137. }
  138. }
  139. p1 = buf1 + page_size - size1;
  140. p2 = buf2 + page_size - size2;
  141. c = random () & 255;
  142. j = align1 + len + 256;
  143. if (j > size1)
  144. j = size1;
  145. for (i = 0; i < j; ++i)
  146. p1[i] = random () & 255;
  147. FOR_EACH_IMPL (impl, 1)
  148. {
  149. j = align2 + len + 256;
  150. if (j > size2)
  151. j = size2;
  152. memset (p2, c, j);
  153. res = (unsigned char *) CALL (impl,
  154. (char *) (p2 + align2),
  155. (char *) (p1 + align1), len);
  156. if (res != MEMCPY_RESULT (p2 + align2, len))
  157. {
  158. error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, %zd) %p != %p",
  159. n, impl->name, align1, align2, len, res,
  160. MEMCPY_RESULT (p2 + align2, len));
  161. ret = 1;
  162. }
  163. for (i = 0; i < align2; ++i)
  164. {
  165. if (p2[i] != c)
  166. {
  167. error (0, 0, "Iteration %zd - garbage before, %s (%zd, %zd, %zd)",
  168. n, impl->name, align1, align2, len);
  169. ret = 1;
  170. break;
  171. }
  172. }
  173. for (i = align2 + len; i < j; ++i)
  174. {
  175. if (p2[i] != c)
  176. {
  177. error (0, 0, "Iteration %zd - garbage after, %s (%zd, %zd, %zd)",
  178. n, impl->name, align1, align2, len);
  179. ret = 1;
  180. break;
  181. }
  182. }
  183. if (memcmp (p1 + align1, p2 + align2, len))
  184. {
  185. error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd)",
  186. n, impl->name, align1, align2, len);
  187. ret = 1;
  188. }
  189. }
  190. }
  191. }
  192. static void
  193. do_test1 (void)
  194. {
  195. size_t size = 0x100000;
  196. void *large_buf;
  197. large_buf = mmap (NULL, size * 2 + page_size, PROT_READ | PROT_WRITE,
  198. MAP_PRIVATE | MAP_ANON, -1, 0);
  199. if (large_buf == MAP_FAILED)
  200. {
  201. puts ("Failed to allocat large_buf, skipping do_test1");
  202. return;
  203. }
  204. if (mprotect (large_buf + size, page_size, PROT_NONE))
  205. error (EXIT_FAILURE, errno, "mprotect failed");
  206. size_t arrary_size = size / sizeof (uint32_t);
  207. uint32_t *dest = large_buf;
  208. uint32_t *src = large_buf + size + page_size;
  209. size_t i;
  210. for (i = 0; i < arrary_size; i++)
  211. src[i] = (uint32_t) i;
  212. FOR_EACH_IMPL (impl, 0)
  213. {
  214. memset (dest, -1, size);
  215. CALL (impl, (char *) dest, (char *) src, size);
  216. for (i = 0; i < arrary_size; i++)
  217. if (dest[i] != src[i])
  218. {
  219. error (0, 0,
  220. "Wrong result in function %s dst \"%p\" src \"%p\" offset \"%zd\"",
  221. impl->name, dest, src, i);
  222. ret = 1;
  223. break;
  224. }
  225. }
  226. munmap ((void *) dest, size);
  227. munmap ((void *) src, size);
  228. }
  229. int
  230. test_main (void)
  231. {
  232. size_t i;
  233. test_init ();
  234. printf ("%23s", "");
  235. FOR_EACH_IMPL (impl, 0)
  236. printf ("\t%s", impl->name);
  237. putchar ('\n');
  238. for (i = 0; i < 18; ++i)
  239. {
  240. do_test (0, 0, 1 << i);
  241. do_test (i, 0, 1 << i);
  242. do_test (0, i, 1 << i);
  243. do_test (i, i, 1 << i);
  244. }
  245. for (i = 0; i < 32; ++i)
  246. {
  247. do_test (0, 0, i);
  248. do_test (i, 0, i);
  249. do_test (0, i, i);
  250. do_test (i, i, i);
  251. }
  252. for (i = 3; i < 32; ++i)
  253. {
  254. if ((i & (i - 1)) == 0)
  255. continue;
  256. do_test (0, 0, 16 * i);
  257. do_test (i, 0, 16 * i);
  258. do_test (0, i, 16 * i);
  259. do_test (i, i, 16 * i);
  260. }
  261. do_test (0, 0, getpagesize ());
  262. do_random_tests ();
  263. do_test1 ();
  264. return ret;
  265. }
  266. #include <support/test-driver.c>