b2c31660be
Extract profiling code from malloc(), imemalign(), calloc(), realloc(), mallocx(), rallocx(), and xallocx(). This slightly reduces the amount of code compiled into the fast paths, but the primary benefit is the combinatorial complexity reduction. Simplify iralloc[t]() by creating a separate ixalloc() that handles the no-move cases. Further simplify [mrxn]allocx() (and by implication [mrn]allocm()) to make request size overflows due to size class and/or alignment constraints trigger undefined behavior (detected by debug-only assertions). Report ENOMEM rather than EINVAL if an OOM occurs during heap profiling backtrace creation in imemalign(). This bug impacted posix_memalign() and aligned_alloc().
120 lines
2.9 KiB
C
120 lines
2.9 KiB
C
#include "test/jemalloc_test.h"
|
|
|
|
#define CHUNK 0x400000
|
|
/* #define MAXALIGN ((size_t)UINT64_C(0x80000000000)) */
|
|
#define MAXALIGN ((size_t)0x2000000LU)
|
|
#define NITER 4
|
|
|
|
TEST_BEGIN(test_basic)
|
|
{
|
|
size_t nsz, rsz, sz;
|
|
void *p;
|
|
|
|
sz = 42;
|
|
nsz = nallocx(sz, 0);
|
|
assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
|
|
p = mallocx(sz, 0);
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
rsz = sallocx(p, 0);
|
|
assert_zu_ge(rsz, sz, "Real size smaller than expected");
|
|
assert_zu_eq(nsz, rsz, "nallocx()/sallocx() size mismatch");
|
|
dallocx(p, 0);
|
|
|
|
p = mallocx(sz, 0);
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
dallocx(p, 0);
|
|
|
|
nsz = nallocx(sz, MALLOCX_ZERO);
|
|
assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
|
|
p = mallocx(sz, MALLOCX_ZERO);
|
|
assert_ptr_not_null(p, "Unexpected mallocx() error");
|
|
rsz = sallocx(p, 0);
|
|
assert_zu_eq(nsz, rsz, "nallocx()/sallocx() rsize mismatch");
|
|
dallocx(p, 0);
|
|
}
|
|
TEST_END
|
|
|
|
TEST_BEGIN(test_alignment_errors)
|
|
{
|
|
void *p;
|
|
size_t nsz, sz, alignment;
|
|
|
|
#if LG_SIZEOF_PTR == 3
|
|
alignment = UINT64_C(0x4000000000000000);
|
|
sz = UINT64_C(0x8400000000000001);
|
|
#else
|
|
alignment = 0x40000000LU;
|
|
sz = 0x84000001LU;
|
|
#endif
|
|
nsz = nallocx(sz, MALLOCX_ALIGN(alignment));
|
|
assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
|
|
p = mallocx(sz, MALLOCX_ALIGN(alignment));
|
|
assert_ptr_null(p, "Expected error for mallocx(%zu, %#x)", sz,
|
|
MALLOCX_ALIGN(alignment));
|
|
}
|
|
TEST_END
|
|
|
|
TEST_BEGIN(test_alignment_and_size)
|
|
{
|
|
size_t nsz, rsz, sz, alignment, total;
|
|
unsigned i;
|
|
void *ps[NITER];
|
|
|
|
for (i = 0; i < NITER; i++)
|
|
ps[i] = NULL;
|
|
|
|
for (alignment = 8;
|
|
alignment <= MAXALIGN;
|
|
alignment <<= 1) {
|
|
total = 0;
|
|
for (sz = 1;
|
|
sz < 3 * alignment && sz < (1U << 31);
|
|
sz += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
|
|
for (i = 0; i < NITER; i++) {
|
|
nsz = nallocx(sz, MALLOCX_ALIGN(alignment) |
|
|
MALLOCX_ZERO);
|
|
assert_zu_ne(nsz, 0,
|
|
"nallocx() error for alignment=%zu, "
|
|
"size=%zu (%#zx)", alignment, sz, sz);
|
|
ps[i] = mallocx(sz, MALLOCX_ALIGN(alignment) |
|
|
MALLOCX_ZERO);
|
|
assert_ptr_not_null(ps[i],
|
|
"mallocx() error for alignment=%zu, "
|
|
"size=%zu (%#zx)", alignment, sz, sz);
|
|
rsz = sallocx(ps[i], 0);
|
|
assert_zu_ge(rsz, sz,
|
|
"Real size smaller than expected for "
|
|
"alignment=%zu, size=%zu", alignment, sz);
|
|
assert_zu_eq(nsz, rsz,
|
|
"nallocx()/sallocx() size mismatch for "
|
|
"alignment=%zu, size=%zu", alignment, sz);
|
|
assert_ptr_null(
|
|
(void *)((uintptr_t)ps[i] & (alignment-1)),
|
|
"%p inadequately aligned for"
|
|
" alignment=%zu, size=%zu", ps[i],
|
|
alignment, sz);
|
|
total += rsz;
|
|
if (total >= (MAXALIGN << 1))
|
|
break;
|
|
}
|
|
for (i = 0; i < NITER; i++) {
|
|
if (ps[i] != NULL) {
|
|
dallocx(ps[i], 0);
|
|
ps[i] = NULL;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
TEST_END
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
|
|
return (test(
|
|
test_basic,
|
|
test_alignment_errors,
|
|
test_alignment_and_size));
|
|
}
|