40cbd30d50
Fix huge_ralloc_no_move() to succeed if an allocation request results in the same usable size as the existing allocation, even if the request size is smaller than the usable size. This bug did not cause correctness issues, but it could cause unnecessary moves during reallocation.
186 lines
4.3 KiB
C
186 lines
4.3 KiB
C
#include "test/jemalloc_test.h"
|
|
|
|
TEST_BEGIN(test_grow_and_shrink)
|
|
{
|
|
void *p, *q;
|
|
size_t tsz;
|
|
#define NCYCLES 3
|
|
unsigned i, j;
|
|
#define NSZS 2500
|
|
size_t szs[NSZS];
|
|
#define MAXSZ ZU(12 * 1024 * 1024)
|
|
|
|
p = mallocx(1, 0);
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
szs[0] = sallocx(p, 0);
|
|
|
|
for (i = 0; i < NCYCLES; i++) {
|
|
for (j = 1; j < NSZS && szs[j-1] < MAXSZ; j++) {
|
|
q = rallocx(p, szs[j-1]+1, 0);
|
|
assert_ptr_not_null(q,
|
|
"Unexpected rallocx() error for size=%zu-->%zu",
|
|
szs[j-1], szs[j-1]+1);
|
|
szs[j] = sallocx(q, 0);
|
|
assert_zu_ne(szs[j], szs[j-1]+1,
|
|
"Expected size to at least: %zu", szs[j-1]+1);
|
|
p = q;
|
|
}
|
|
|
|
for (j--; j > 0; j--) {
|
|
q = rallocx(p, szs[j-1], 0);
|
|
assert_ptr_not_null(q,
|
|
"Unexpected rallocx() error for size=%zu-->%zu",
|
|
szs[j], szs[j-1]);
|
|
tsz = sallocx(q, 0);
|
|
assert_zu_eq(tsz, szs[j-1],
|
|
"Expected size=%zu, got size=%zu", szs[j-1], tsz);
|
|
p = q;
|
|
}
|
|
}
|
|
|
|
dallocx(p, 0);
|
|
#undef MAXSZ
|
|
#undef NSZS
|
|
#undef NCYCLES
|
|
}
|
|
TEST_END
|
|
|
|
static bool
|
|
validate_fill(const void *p, uint8_t c, size_t offset, size_t len)
|
|
{
|
|
bool ret = false;
|
|
const uint8_t *buf = (const uint8_t *)p;
|
|
size_t i;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
uint8_t b = buf[offset+i];
|
|
if (b != c) {
|
|
test_fail("Allocation at %p (len=%zu) contains %#x "
|
|
"rather than %#x at offset %zu", p, len, b, c,
|
|
offset+i);
|
|
ret = true;
|
|
}
|
|
}
|
|
|
|
return (ret);
|
|
}
|
|
|
|
TEST_BEGIN(test_zero)
|
|
{
|
|
void *p, *q;
|
|
size_t psz, qsz, i, j;
|
|
size_t start_sizes[] = {1, 3*1024, 63*1024, 4095*1024};
|
|
#define FILL_BYTE 0xaaU
|
|
#define RANGE 2048
|
|
|
|
for (i = 0; i < sizeof(start_sizes)/sizeof(size_t); i++) {
|
|
size_t start_size = start_sizes[i];
|
|
p = mallocx(start_size, MALLOCX_ZERO);
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
psz = sallocx(p, 0);
|
|
|
|
assert_false(validate_fill(p, 0, 0, psz),
|
|
"Expected zeroed memory");
|
|
memset(p, FILL_BYTE, psz);
|
|
assert_false(validate_fill(p, FILL_BYTE, 0, psz),
|
|
"Expected filled memory");
|
|
|
|
for (j = 1; j < RANGE; j++) {
|
|
q = rallocx(p, start_size+j, MALLOCX_ZERO);
|
|
assert_ptr_not_null(q, "Unexpected rallocx() error");
|
|
qsz = sallocx(q, 0);
|
|
if (q != p || qsz != psz) {
|
|
assert_false(validate_fill(q, FILL_BYTE, 0,
|
|
psz), "Expected filled memory");
|
|
assert_false(validate_fill(q, 0, psz, qsz-psz),
|
|
"Expected zeroed memory");
|
|
}
|
|
if (psz != qsz) {
|
|
memset((void *)((uintptr_t)q+psz), FILL_BYTE,
|
|
qsz-psz);
|
|
psz = qsz;
|
|
}
|
|
p = q;
|
|
}
|
|
assert_false(validate_fill(p, FILL_BYTE, 0, psz),
|
|
"Expected filled memory");
|
|
dallocx(p, 0);
|
|
}
|
|
#undef FILL_BYTE
|
|
}
|
|
TEST_END
|
|
|
|
TEST_BEGIN(test_align)
|
|
{
|
|
void *p, *q;
|
|
size_t align;
|
|
#define MAX_ALIGN (ZU(1) << 25)
|
|
|
|
align = ZU(1);
|
|
p = mallocx(1, MALLOCX_ALIGN(align));
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
|
|
for (align <<= 1; align <= MAX_ALIGN; align <<= 1) {
|
|
q = rallocx(p, 1, MALLOCX_ALIGN(align));
|
|
assert_ptr_not_null(q,
|
|
"Unexpected rallocx() error for align=%zu", align);
|
|
assert_ptr_null(
|
|
(void *)((uintptr_t)q & (align-1)),
|
|
"%p inadequately aligned for align=%zu",
|
|
q, align);
|
|
p = q;
|
|
}
|
|
dallocx(p, 0);
|
|
#undef MAX_ALIGN
|
|
}
|
|
TEST_END
|
|
|
|
TEST_BEGIN(test_lg_align_and_zero)
|
|
{
|
|
void *p, *q;
|
|
size_t lg_align, sz;
|
|
#define MAX_LG_ALIGN 25
|
|
#define MAX_VALIDATE (ZU(1) << 22)
|
|
|
|
lg_align = ZU(0);
|
|
p = mallocx(1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
|
|
for (lg_align++; lg_align <= MAX_LG_ALIGN; lg_align++) {
|
|
q = rallocx(p, 1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
|
|
assert_ptr_not_null(q,
|
|
"Unexpected rallocx() error for lg_align=%zu", lg_align);
|
|
assert_ptr_null(
|
|
(void *)((uintptr_t)q & ((ZU(1) << lg_align)-1)),
|
|
"%p inadequately aligned for lg_align=%zu",
|
|
q, lg_align);
|
|
sz = sallocx(q, 0);
|
|
if ((sz << 1) <= MAX_VALIDATE) {
|
|
assert_false(validate_fill(q, 0, 0, sz),
|
|
"Expected zeroed memory");
|
|
} else {
|
|
assert_false(validate_fill(q, 0, 0, MAX_VALIDATE),
|
|
"Expected zeroed memory");
|
|
assert_false(validate_fill(
|
|
(void *)((uintptr_t)q+sz-MAX_VALIDATE),
|
|
0, 0, MAX_VALIDATE), "Expected zeroed memory");
|
|
}
|
|
p = q;
|
|
}
|
|
dallocx(p, 0);
|
|
#undef MAX_VALIDATE
|
|
#undef MAX_LG_ALIGN
|
|
}
|
|
TEST_END
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
|
|
return (test(
|
|
test_grow_and_shrink,
|
|
test_zero,
|
|
test_align,
|
|
test_lg_align_and_zero));
|
|
}
|