2020-06-15 14:18:57 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
2020-06-15 14:18:57 +00:00
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
2022-08-11 19:13:18 +00:00
|
|
|
#include "libc/intrin/bits.h"
|
2020-09-28 08:13:56 +00:00
|
|
|
#include "libc/mem/mem.h"
|
2021-02-02 11:45:31 +00:00
|
|
|
#include "libc/nexgen32e/nexgen32e.h"
|
2022-08-11 19:26:30 +00:00
|
|
|
#include "libc/stdio/rand.h"
|
2021-02-02 11:45:31 +00:00
|
|
|
#include "libc/stdio/stdio.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
#include "libc/str/str.h"
|
2021-02-02 11:45:31 +00:00
|
|
|
#include "libc/testlib/ezbench.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
#include "libc/testlib/testlib.h"
|
|
|
|
|
2021-02-02 11:45:31 +00:00
|
|
|
TEST(memcpy, test) {
|
2020-06-15 14:18:57 +00:00
|
|
|
char *b1, *b2;
|
|
|
|
for (unsigned n = 0; n < 1026; ++n) {
|
2021-02-01 11:33:13 +00:00
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1, memcpy(b1, b2, n), "%ld\n\t%#.*s\n\t%#.*s", n, n, b1, n, b2);
|
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
|
|
|
free(b2);
|
|
|
|
free(b1);
|
|
|
|
}
|
|
|
|
for (unsigned n = kHalfCache3 - 1; n < kHalfCache3 + 2; ++n) {
|
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1, memcpy(b1, b2, n), "%ld\n\t%#.*s\n\t%#.*s", n, n, b1, n, b2);
|
2020-06-15 14:18:57 +00:00
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
2021-02-01 11:33:13 +00:00
|
|
|
free(b2);
|
|
|
|
free(b1);
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-02-02 11:45:31 +00:00
|
|
|
TEST(mempcpy, test) {
|
2020-06-15 14:18:57 +00:00
|
|
|
char *b1, *b2;
|
|
|
|
for (unsigned n = 0; n < 1026; ++n) {
|
2021-02-01 11:33:13 +00:00
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1 + n, mempcpy(b1, b2, n));
|
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
|
|
|
free(b2);
|
|
|
|
free(b1);
|
|
|
|
}
|
|
|
|
for (unsigned n = kHalfCache3 - 1; n < kHalfCache3 + 2; ++n) {
|
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1 + n, mempcpy(b1, b2, n));
|
2020-06-15 14:18:57 +00:00
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
2021-02-01 11:33:13 +00:00
|
|
|
free(b2);
|
|
|
|
free(b1);
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-02-02 11:45:31 +00:00
|
|
|
TEST(memcpy, direct) {
|
2020-06-15 14:18:57 +00:00
|
|
|
char *b1, *b2;
|
|
|
|
for (unsigned n = 0; n < 1026; ++n) {
|
2021-02-01 11:33:13 +00:00
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1, (memcpy)(b1, b2, n), "%ld\n\t%#.*s\n\t%#.*s", n, n, b1, n,
|
|
|
|
b2);
|
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
|
|
|
free(b2);
|
|
|
|
free(b1);
|
|
|
|
}
|
|
|
|
for (unsigned n = kHalfCache3 - 1; n < kHalfCache3 + 2; ++n) {
|
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1, (memcpy)(b1, b2, n), "%ld\n\t%#.*s\n\t%#.*s", n, n, b1, n,
|
|
|
|
b2);
|
2020-06-15 14:18:57 +00:00
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
2021-02-01 11:33:13 +00:00
|
|
|
free(b2);
|
|
|
|
free(b1);
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-02-02 11:45:31 +00:00
|
|
|
TEST(mempcpy, direct) {
|
2020-06-15 14:18:57 +00:00
|
|
|
char *b1, *b2;
|
|
|
|
for (unsigned n = 0; n < 1026; ++n) {
|
2021-02-01 11:33:13 +00:00
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2021-02-02 11:45:31 +00:00
|
|
|
ASSERT_EQ(b1 + n, (mempcpy)(b1, b2, n));
|
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
|
|
|
free(b2);
|
|
|
|
free(b1);
|
|
|
|
}
|
|
|
|
for (unsigned n = kHalfCache3 - 1; n < kHalfCache3 + 2; ++n) {
|
|
|
|
b1 = malloc(n);
|
|
|
|
b2 = malloc(n);
|
2022-10-10 11:12:06 +00:00
|
|
|
rngset(b1, n, _rand64, -1);
|
|
|
|
rngset(b2, n, _rand64, -1);
|
2020-06-15 14:18:57 +00:00
|
|
|
ASSERT_EQ(b1 + n, (mempcpy)(b1, b2, n));
|
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, n));
|
2021-02-01 11:33:13 +00:00
|
|
|
free(b2);
|
|
|
|
free(b1);
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(memcpy, overlapping_isFineIfCopyingBackwards) {
|
|
|
|
for (size_t i = 0; i < 32; ++i) {
|
2021-02-01 11:33:13 +00:00
|
|
|
char *b1 = malloc(64 + i);
|
|
|
|
char *b2 = malloc(64 + i);
|
2020-06-15 14:18:57 +00:00
|
|
|
memcpy(b1, b2, 64);
|
|
|
|
memcpy(b1, b1 + i, 64 - i);
|
|
|
|
memmove(b2, b2 + i, 64 - i);
|
|
|
|
ASSERT_EQ(0, memcmp(b1, b2, 64));
|
2021-02-01 11:33:13 +00:00
|
|
|
free(b2);
|
|
|
|
free(b1);
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
|
|
|
}
|
2020-09-07 04:39:00 +00:00
|
|
|
|
|
|
|
TEST(stpcpy, test) {
|
|
|
|
volatile char *p;
|
|
|
|
volatile char b[16];
|
|
|
|
volatile const char *s1 = "hello";
|
|
|
|
volatile const char *s2 = "there";
|
|
|
|
p = b;
|
|
|
|
p = stpcpy(p, s1);
|
|
|
|
EXPECT_EQ((intptr_t)b + 5, (intptr_t)p);
|
|
|
|
EXPECT_STREQ("hello", b);
|
|
|
|
p = stpcpy(p, s2);
|
|
|
|
EXPECT_EQ((intptr_t)b + 10, (intptr_t)p);
|
|
|
|
EXPECT_STREQ("hellothere", b);
|
|
|
|
}
|
2020-09-28 08:13:56 +00:00
|
|
|
|
|
|
|
TEST(memcpy, testBackwardsOverlap3) {
|
|
|
|
volatile char *c;
|
|
|
|
c = malloc(3);
|
|
|
|
memcpy(c, "\e[C", 3);
|
|
|
|
memcpy(c, c + 1, VEIL("r", 3) - 1);
|
|
|
|
EXPECT_EQ('[', c[0]);
|
|
|
|
EXPECT_EQ('C', c[1]);
|
|
|
|
free(c);
|
|
|
|
}
|
2021-02-02 11:45:31 +00:00
|
|
|
|
|
|
|
#define B(F, N) \
|
|
|
|
do { \
|
2022-10-10 11:12:06 +00:00
|
|
|
char *d = rngset(malloc(N), N, _rand64, -1); \
|
|
|
|
char *s = rngset(malloc(N), N, _rand64, -1); \
|
2021-02-02 11:45:31 +00:00
|
|
|
EZBENCH2(#F " " #N, donothing, \
|
|
|
|
EXPROPRIATE(F(VEIL("r", d), VEIL("r", s), N))); \
|
|
|
|
free(d); \
|
|
|
|
free(s); \
|
|
|
|
} while (0)
|
|
|
|
|
2021-08-05 21:43:53 +00:00
|
|
|
void BB(size_t N) {
|
|
|
|
B(memcpy, N);
|
|
|
|
(fprintf)(stderr, "\n");
|
|
|
|
}
|
2021-02-02 11:45:31 +00:00
|
|
|
|
|
|
|
BENCH(memcpy, bench) {
|
|
|
|
BB(0);
|
|
|
|
BB(1);
|
|
|
|
BB(2);
|
|
|
|
BB(3);
|
|
|
|
BB(7);
|
|
|
|
BB(8);
|
|
|
|
BB(15);
|
|
|
|
BB(16);
|
|
|
|
BB(31);
|
|
|
|
BB(32);
|
|
|
|
BB(63);
|
|
|
|
BB(64);
|
|
|
|
BB(255);
|
|
|
|
BB(256);
|
|
|
|
BB(1023);
|
|
|
|
BB(1024);
|
|
|
|
BB(PAGESIZE);
|
|
|
|
BB(FRAMESIZE);
|
|
|
|
}
|