Implement the *allocx() API.
Implement the *allocx() API, which is a successor to the *allocm() API.
The *allocx() functions are slightly simpler to use because they have
fewer parameters, they directly return the results of primary interest,
and mallocx()/rallocx() avoid the strict aliasing pitfall that
allocm()/rallocx() share with posix_memalign(). The following code
violates strict aliasing rules:
foo_t *foo;
allocm((void **)&foo, NULL, 42, 0);
whereas the following is safe:
foo_t *foo;
void *p;
allocm(&p, NULL, 42, 0);
foo = (foo_t *)p;
mallocx() does not have this problem:
foo_t *foo = (foo_t *)mallocx(42, 0);
2013-12-13 14:35:52 +08:00
|
|
|
#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);
|
2013-12-16 07:54:18 +08:00
|
|
|
#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) {
|
2015-07-25 09:18:03 +08:00
|
|
|
test_fail("Allocation at %p (len=%zu) contains %#x "
|
|
|
|
"rather than %#x at offset %zu", p, len, b, c,
|
|
|
|
offset+i);
|
2013-12-16 07:54:18 +08:00
|
|
|
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) {
|
2014-05-28 13:17:01 +08:00
|
|
|
memset((void *)((uintptr_t)q+psz), FILL_BYTE,
|
2014-05-21 17:13:21 +08:00
|
|
|
qsz-psz);
|
2013-12-16 07:54:18 +08:00
|
|
|
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;
|
2014-03-31 02:22:23 +08:00
|
|
|
#define MAX_ALIGN (ZU(1) << 25)
|
2013-12-16 07:54:18 +08:00
|
|
|
|
|
|
|
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
|
|
|
|
|
2013-12-17 05:37:21 +08:00
|
|
|
TEST_BEGIN(test_lg_align_and_zero)
|
2013-12-16 07:54:18 +08:00
|
|
|
{
|
|
|
|
void *p, *q;
|
2013-12-17 05:37:21 +08:00
|
|
|
size_t lg_align, sz;
|
2014-03-31 02:22:23 +08:00
|
|
|
#define MAX_LG_ALIGN 25
|
2013-12-17 05:37:21 +08:00
|
|
|
#define MAX_VALIDATE (ZU(1) << 22)
|
2013-12-16 07:54:18 +08:00
|
|
|
|
|
|
|
lg_align = ZU(0);
|
2013-12-17 05:37:21 +08:00
|
|
|
p = mallocx(1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
|
2013-12-16 07:54:18 +08:00
|
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
|
|
|
|
|
|
for (lg_align++; lg_align <= MAX_LG_ALIGN; lg_align++) {
|
2013-12-17 05:37:21 +08:00
|
|
|
q = rallocx(p, 1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
|
2013-12-16 07:54:18 +08:00
|
|
|
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);
|
2013-12-17 05:37:21 +08:00
|
|
|
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");
|
2014-05-21 17:13:21 +08:00
|
|
|
assert_false(validate_fill(
|
2014-05-28 13:17:01 +08:00
|
|
|
(void *)((uintptr_t)q+sz-MAX_VALIDATE),
|
2014-05-21 17:13:21 +08:00
|
|
|
0, 0, MAX_VALIDATE), "Expected zeroed memory");
|
2013-12-17 05:37:21 +08:00
|
|
|
}
|
2013-12-16 07:54:18 +08:00
|
|
|
p = q;
|
|
|
|
}
|
|
|
|
dallocx(p, 0);
|
2013-12-17 05:37:21 +08:00
|
|
|
#undef MAX_VALIDATE
|
2013-12-16 07:54:18 +08:00
|
|
|
#undef MAX_LG_ALIGN
|
Implement the *allocx() API.
Implement the *allocx() API, which is a successor to the *allocm() API.
The *allocx() functions are slightly simpler to use because they have
fewer parameters, they directly return the results of primary interest,
and mallocx()/rallocx() avoid the strict aliasing pitfall that
allocm()/rallocx() share with posix_memalign(). The following code
violates strict aliasing rules:
foo_t *foo;
allocm((void **)&foo, NULL, 42, 0);
whereas the following is safe:
foo_t *foo;
void *p;
allocm(&p, NULL, 42, 0);
foo = (foo_t *)p;
mallocx() does not have this problem:
foo_t *foo = (foo_t *)mallocx(42, 0);
2013-12-13 14:35:52 +08:00
|
|
|
}
|
|
|
|
TEST_END
|
|
|
|
|
|
|
|
int
|
|
|
|
main(void)
|
|
|
|
{
|
|
|
|
|
|
|
|
return (test(
|
2013-12-16 07:54:18 +08:00
|
|
|
test_grow_and_shrink,
|
|
|
|
test_zero,
|
|
|
|
test_align,
|
2013-12-17 05:37:21 +08:00
|
|
|
test_lg_align_and_zero));
|
Implement the *allocx() API.
Implement the *allocx() API, which is a successor to the *allocm() API.
The *allocx() functions are slightly simpler to use because they have
fewer parameters, they directly return the results of primary interest,
and mallocx()/rallocx() avoid the strict aliasing pitfall that
allocm()/rallocx() share with posix_memalign(). The following code
violates strict aliasing rules:
foo_t *foo;
allocm((void **)&foo, NULL, 42, 0);
whereas the following is safe:
foo_t *foo;
void *p;
allocm(&p, NULL, 42, 0);
foo = (foo_t *)p;
mallocx() does not have this problem:
foo_t *foo = (foo_t *)mallocx(42, 0);
2013-12-13 14:35:52 +08:00
|
|
|
}
|