/* Test and measure memcpy functions. Copyright (C) 1999-2024 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. The GNU C Library 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. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; if not, see . */ /* test-memcpy-support.h contains all test functions. */ #include "test-memcpy-support.h" static void do_random_tests (void) { size_t i, j, n, align1, align2, len, size1, size2, size; int c; unsigned char *p1, *p2; unsigned char *res; for (n = 0; n < ITERATIONS; n++) { if (n == 0) { len = getpagesize (); size = len + 512; size1 = size; size2 = size; align1 = 512; align2 = 512; } else { if ((random () & 255) == 0) size = 65536; else size = 768; if (size > page_size) size = page_size; size1 = size; size2 = size; i = random (); if (i & 3) size -= 256; if (i & 1) size1 -= 256; if (i & 2) size2 -= 256; if (i & 4) { len = random () % size; align1 = size1 - len - (random () & 31); align2 = size2 - len - (random () & 31); if (align1 > size1) align1 = 0; if (align2 > size2) align2 = 0; } else { align1 = random () & 63; align2 = random () & 63; len = random () % size; if (align1 + len > size1) align1 = size1 - len; if (align2 + len > size2) align2 = size2 - len; } } p1 = buf1 + page_size - size1; p2 = buf2 + page_size - size2; c = random () & 255; j = align1 + len + 256; if (j > size1) j = size1; for (i = 0; i < j; ++i) p1[i] = random () & 255; FOR_EACH_IMPL (impl, 1) { j = align2 + len + 256; if (j > size2) j = size2; memset (p2, c, j); res = (unsigned char *)CALL (impl, (char *)(p2 + align2), (char *)(p1 + align1), len); if (res != MEMCPY_RESULT (p2 + align2, len)) { error (0, 0, "Iteration %zd - wrong result in function %s (%zd, %zd, " "%zd) %p != %p", n, impl->name, align1, align2, len, res, MEMCPY_RESULT (p2 + align2, len)); ret = 1; } for (i = 0; i < align2; ++i) { if (p2[i] != c) { error (0, 0, "Iteration %zd - garbage before, %s (%zd, %zd, %zd)", n, impl->name, align1, align2, len); ret = 1; break; } } for (i = align2 + len; i < j; ++i) { if (p2[i] != c) { error (0, 0, "Iteration %zd - garbage after, %s (%zd, %zd, %zd)", n, impl->name, align1, align2, len); ret = 1; break; } } if (memcmp (p1 + align1, p2 + align2, len)) { error (0, 0, "Iteration %zd - different strings, %s (%zd, %zd, %zd)", n, impl->name, align1, align2, len); ret = 1; } } } } int test_main (void) { size_t i, j; test_init (); printf ("%23s", ""); FOR_EACH_IMPL (impl, 0) printf ("\t%s", impl->name); putchar ('\n'); for (i = 0; i < 18; ++i) { do_test (0, 0, 1 << i); do_test (i, 0, 1 << i); do_test (0, i, 1 << i); do_test (i, i, 1 << i); } for (i = 0; i < 32; ++i) { do_test (0, 0, i); do_test (i, 0, i); do_test (0, i, i); do_test (i, i, i); } for (i = 3; i < 32; ++i) { if ((i & (i - 1)) == 0) continue; do_test (0, 0, 16 * i); do_test (i, 0, 16 * i); do_test (0, i, 16 * i); do_test (i, i, 16 * i); } for (i = 19; i <= 25; ++i) { do_test (255, 0, 1 << i); do_test (0, 4000, 1 << i); do_test (0, 255, i); do_test (0, 4000, i); } do_test (0, 0, getpagesize ()); do_random_tests (); do_test1 (0, 0, 0x100000); do_test1 (0, 0, 0x2000000); for (i = 4096; i < 32768; i += 4096) { for (j = 1; j <= 1024; j <<= 1) { do_test1 (0, j, i); do_test1 (4095, j, i); do_test1 (4096 - j, 0, i); do_test1 (0, j - 1, i); do_test1 (4095, j - 1, i); do_test1 (4096 - j - 1, 0, i); do_test1 (0, j + 1, i); do_test1 (4095, j + 1, i); do_test1 (4096 - j, 1, i); } } for (i = 0x300000; i < 0x2000000; i += 0x235689) { for (j = 64; j <= 1024; j <<= 1) { do_test1 (0, j, i); do_test1 (4095, j, i); do_test1 (4096 - j, 0, i); do_test1 (0, j - 1, i); do_test1 (4095, j - 1, i); do_test1 (4096 - j - 1, 0, i); do_test1 (0, j + 1, i); do_test1 (4095, j + 1, i); do_test1 (4096 - j, 1, i); } } return ret; } #include