test-strcpy_chk.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  1. /* Test and measure __strcpy_chk 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 STRCPY_RESULT
  17. # define STRCPY_RESULT(dst, len) dst
  18. # define TEST_MAIN
  19. # define TEST_NAME "strcpy_chk"
  20. # include "../string/test-string.h"
  21. /* This test case implicitly tests the availability of the __chk_fail
  22. symbol, which is part of the public ABI and may be used
  23. externally. */
  24. extern void __attribute__ ((noreturn)) __chk_fail (void);
  25. char *simple_strcpy_chk (char *, const char *, size_t);
  26. extern char *normal_strcpy (char *, const char *, size_t)
  27. __asm ("strcpy");
  28. extern char *__strcpy_chk (char *, const char *, size_t);
  29. IMPL (simple_strcpy_chk, 0)
  30. IMPL (normal_strcpy, 1)
  31. IMPL (__strcpy_chk, 2)
  32. char *
  33. simple_strcpy_chk (char *dst, const char *src, size_t len)
  34. {
  35. char *ret = dst;
  36. if (! len)
  37. __chk_fail ();
  38. while ((*dst++ = *src++) != '\0')
  39. if (--len == 0)
  40. __chk_fail ();
  41. return ret;
  42. }
  43. #endif
  44. #include <fcntl.h>
  45. #include <paths.h>
  46. #include <setjmp.h>
  47. #include <signal.h>
  48. static int test_main (void);
  49. #define TEST_FUNCTION test_main
  50. #include <support/test-driver.c>
  51. #include <support/support.h>
  52. volatile int chk_fail_ok;
  53. jmp_buf chk_fail_buf;
  54. static void
  55. handler (int sig)
  56. {
  57. if (chk_fail_ok)
  58. {
  59. chk_fail_ok = 0;
  60. longjmp (chk_fail_buf, 1);
  61. }
  62. else
  63. _exit (127);
  64. }
  65. typedef char *(*proto_t) (char *, const char *, size_t);
  66. static void
  67. do_one_test (impl_t *impl, char *dst, const char *src,
  68. size_t len, size_t dlen)
  69. {
  70. char *res;
  71. if (dlen <= len)
  72. {
  73. if (impl->test == 1)
  74. return;
  75. chk_fail_ok = 1;
  76. if (setjmp (chk_fail_buf) == 0)
  77. {
  78. res = CALL (impl, dst, src, dlen);
  79. printf ("*** Function %s (%zd; %zd) did not __chk_fail\n",
  80. impl->name, len, dlen);
  81. chk_fail_ok = 0;
  82. ret = 1;
  83. }
  84. return;
  85. }
  86. else
  87. res = CALL (impl, dst, src, dlen);
  88. if (res != STRCPY_RESULT (dst, len))
  89. {
  90. printf ("Wrong result in function %s %p %p\n", impl->name,
  91. res, STRCPY_RESULT (dst, len));
  92. ret = 1;
  93. return;
  94. }
  95. if (strcmp (dst, src) != 0)
  96. {
  97. printf ("Wrong result in function %s dst \"%s\" src \"%s\"\n",
  98. impl->name, dst, src);
  99. ret = 1;
  100. return;
  101. }
  102. }
  103. static void
  104. do_test (size_t align1, size_t align2, size_t len, size_t dlen, int max_char)
  105. {
  106. size_t i;
  107. char *s1, *s2;
  108. align1 &= 7;
  109. if (align1 + len >= page_size)
  110. return;
  111. align2 &= 7;
  112. if (align2 + len >= page_size)
  113. return;
  114. s1 = (char *) buf1 + align1;
  115. s2 = (char *) buf2 + align2;
  116. for (i = 0; i < len; i++)
  117. s1[i] = 32 + 23 * i % (max_char - 32);
  118. s1[len] = 0;
  119. FOR_EACH_IMPL (impl, 0)
  120. do_one_test (impl, s2, s1, len, dlen);
  121. }
  122. static void
  123. do_random_tests (void)
  124. {
  125. size_t i, j, n, align1, align2, len, dlen;
  126. unsigned char *p1 = buf1 + page_size - 512;
  127. unsigned char *p2 = buf2 + page_size - 512;
  128. unsigned char *res;
  129. for (n = 0; n < ITERATIONS; n++)
  130. {
  131. align1 = random () & 31;
  132. if (random () & 1)
  133. align2 = random () & 31;
  134. else
  135. align2 = align1 + (random () & 24);
  136. len = random () & 511;
  137. j = align1;
  138. if (align2 > j)
  139. j = align2;
  140. if (len + j >= 511)
  141. len = 510 - j - (random () & 7);
  142. j = len + align1 + 64;
  143. if (j > 512)
  144. j = 512;
  145. for (i = 0; i < j; i++)
  146. {
  147. if (i == len + align1)
  148. p1[i] = 0;
  149. else
  150. {
  151. p1[i] = random () & 255;
  152. if (i >= align1 && i < len + align1 && !p1[i])
  153. p1[i] = (random () & 127) + 3;
  154. }
  155. }
  156. switch (random () & 7)
  157. {
  158. case 0:
  159. dlen = len - (random () & 31);
  160. if (dlen > len)
  161. dlen = len;
  162. break;
  163. case 1:
  164. dlen = (size_t) -1;
  165. break;
  166. case 2:
  167. dlen = len + 1 + (random () & 65535);
  168. break;
  169. case 3:
  170. dlen = len + 1 + (random () & 255);
  171. break;
  172. case 4:
  173. dlen = len + 1 + (random () & 31);
  174. break;
  175. case 5:
  176. dlen = len + 1 + (random () & 7);
  177. break;
  178. case 6:
  179. dlen = len + 1 + (random () & 3);
  180. break;
  181. default:
  182. dlen = len + 1;
  183. break;
  184. }
  185. FOR_EACH_IMPL (impl, 1)
  186. {
  187. if (dlen <= len)
  188. {
  189. if (impl->test != 1)
  190. {
  191. chk_fail_ok = 1;
  192. if (setjmp (chk_fail_buf) == 0)
  193. {
  194. res = (unsigned char *)
  195. CALL (impl, (char *) p2 + align2,
  196. (char *) p1 + align1, dlen);
  197. printf ("Iteration %zd - did not __chk_fail\n", n);
  198. chk_fail_ok = 0;
  199. ret = 1;
  200. }
  201. }
  202. continue;
  203. }
  204. memset (p2 - 64, '\1', 512 + 64);
  205. res = (unsigned char *)
  206. CALL (impl, (char *) p2 + align2, (char *) p1 + align1, dlen);
  207. if (res != STRCPY_RESULT (p2 + align2, len))
  208. {
  209. printf ("\
  210. Iteration %zd - wrong result in function %s (%zd, %zd, %zd) %p != %p\n",
  211. n, impl->name, align1, align2, len, res,
  212. STRCPY_RESULT (p2 + align2, len));
  213. ret = 1;
  214. }
  215. for (j = 0; j < align2 + 64; ++j)
  216. {
  217. if (p2[j - 64] != '\1')
  218. {
  219. printf ("\
  220. Iteration %zd - garbage before, %s (%zd, %zd, %zd)\n",
  221. n, impl->name, align1, align2, len);
  222. ret = 1;
  223. break;
  224. }
  225. }
  226. for (j = align2 + len + 1; j < 512; ++j)
  227. {
  228. if (p2[j] != '\1')
  229. {
  230. printf ("\
  231. Iteration %zd - garbage after, %s (%zd, %zd, %zd)\n",
  232. n, impl->name, align1, align2, len);
  233. ret = 1;
  234. break;
  235. }
  236. }
  237. if (memcmp (p1 + align1, p2 + align2, len + 1))
  238. {
  239. printf ("\
  240. Iteration %zd - different strings, %s (%zd, %zd, %zd)\n",
  241. n, impl->name, align1, align2, len);
  242. ret = 1;
  243. }
  244. }
  245. }
  246. }
  247. static int
  248. test_main (void)
  249. {
  250. size_t i;
  251. set_fortify_handler (handler);
  252. test_init ();
  253. printf ("%23s", "");
  254. FOR_EACH_IMPL (impl, 0)
  255. printf ("\t%s", impl->name);
  256. putchar ('\n');
  257. for (i = 0; i < 16; ++i)
  258. {
  259. do_test (0, 0, i, i + 1, 127);
  260. do_test (0, 0, i, i + 1, 255);
  261. do_test (0, i, i, i + 1, 127);
  262. do_test (i, 0, i, i + 1, 255);
  263. }
  264. for (i = 1; i < 8; ++i)
  265. {
  266. do_test (0, 0, 8 << i, (8 << i) + 1, 127);
  267. do_test (8 - i, 2 * i, (8 << i), (8 << i) + 1, 127);
  268. }
  269. for (i = 1; i < 8; ++i)
  270. {
  271. do_test (i, 2 * i, (8 << i), (8 << i) + 1, 127);
  272. do_test (2 * i, i, (8 << i), (8 << i) + 1, 255);
  273. do_test (i, i, (8 << i), (8 << i) + 1, 127);
  274. do_test (i, i, (8 << i), (8 << i) + 1, 255);
  275. }
  276. for (i = 0; i < 16; ++i)
  277. {
  278. do_test (0, 0, i, i + 256, 127);
  279. do_test (0, 0, i, i + 256, 255);
  280. do_test (0, i, i, i + 256, 127);
  281. do_test (i, 0, i, i + 256, 255);
  282. }
  283. for (i = 1; i < 8; ++i)
  284. {
  285. do_test (0, 0, 8 << i, (8 << i) + 256, 127);
  286. do_test (8 - i, 2 * i, (8 << i), (8 << i) + 256, 127);
  287. }
  288. for (i = 1; i < 8; ++i)
  289. {
  290. do_test (i, 2 * i, (8 << i), (8 << i) + 256, 127);
  291. do_test (2 * i, i, (8 << i), (8 << i) + 256, 255);
  292. do_test (i, i, (8 << i), (8 << i) + 256, 127);
  293. do_test (i, i, (8 << i), (8 << i) + 256, 255);
  294. }
  295. for (i = 0; i < 16; ++i)
  296. {
  297. do_test (0, 0, i, i, 127);
  298. do_test (0, 0, i, i + 2, 255);
  299. do_test (0, i, i, i + 3, 127);
  300. do_test (i, 0, i, i + 4, 255);
  301. }
  302. for (i = 1; i < 8; ++i)
  303. {
  304. do_test (0, 0, 8 << i, (8 << i) - 15, 127);
  305. do_test (8 - i, 2 * i, (8 << i), (8 << i) + 5, 127);
  306. }
  307. for (i = 1; i < 8; ++i)
  308. {
  309. do_test (i, 2 * i, (8 << i), (8 << i) + i, 127);
  310. do_test (2 * i, i, (8 << i), (8 << i) + (i - 1), 255);
  311. do_test (i, i, (8 << i), (8 << i) + i + 2, 127);
  312. do_test (i, i, (8 << i), (8 << i) + i + 3, 255);
  313. }
  314. do_random_tests ();
  315. return ret;
  316. }