86abd0dcd8
Refactor the test harness to support three types of tests:
- unit: White box unit tests. These tests have full access to all
internal jemalloc library symbols. Though in actuality all symbols
are prefixed by jet_, macro-based name mangling abstracts this away
from test code.
- integration: Black box integration tests. These tests link with
the installable shared jemalloc library, and with the exception of
some utility code and configure-generated macro definitions, they have
no access to jemalloc internals.
- stress: Black box stress tests. These tests link with the installable
shared jemalloc library, as well as with an internal allocator with
symbols prefixed by jet_ (same as for unit tests) that can be used to
allocate data structures that are internal to the test code.
Move existing tests into test/{unit,integration}/ as appropriate.
Split out internal parts of jemalloc_defs.h.in and put them in
jemalloc_internal_defs.h.in. This reduces internals exposure to
applications that #include <jemalloc/jemalloc.h>.
Refactor jemalloc.h header generation so that a single header file
results, and the prototypes can be used to generate jet_ prototypes for
tests. Split jemalloc.h.in into multiple parts (jemalloc_defs.h.in,
jemalloc_macros.h.in, jemalloc_protos.h.in, jemalloc_mangle.h.in) and
use a shell script to generate a unified jemalloc.h at configure time.
Change the default private namespace prefix from "" to "je_".
Add missing private namespace mangling.
Remove hard-coded private_namespace.h. Instead generate it and
private_unnamespace.h from private_symbols.txt. Use similar logic for
public symbols, which aids in name mangling for jet_ symbols.
Add test_warn() and test_fail(). Replace existing exit(1) calls with
test_fail() calls.
152 lines
3.0 KiB
C
152 lines
3.0 KiB
C
#include "test/jemalloc_test.h"
|
|
|
|
#if (LG_BITMAP_MAXBITS > 12)
|
|
# define MAXBITS 4500
|
|
#else
|
|
# define MAXBITS (1U << LG_BITMAP_MAXBITS)
|
|
#endif
|
|
|
|
static void
|
|
test_bitmap_size(void)
|
|
{
|
|
size_t i, prev_size;
|
|
|
|
prev_size = 0;
|
|
for (i = 1; i <= MAXBITS; i++) {
|
|
size_t size = bitmap_size(i);
|
|
assert(size >= prev_size);
|
|
prev_size = size;
|
|
}
|
|
}
|
|
|
|
static void
|
|
test_bitmap_init(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 1; i <= MAXBITS; i++) {
|
|
bitmap_info_t binfo;
|
|
bitmap_info_init(&binfo, i);
|
|
{
|
|
size_t j;
|
|
bitmap_t *bitmap = malloc(sizeof(bitmap_t) *
|
|
bitmap_info_ngroups(&binfo));
|
|
bitmap_init(bitmap, &binfo);
|
|
|
|
for (j = 0; j < i; j++)
|
|
assert(bitmap_get(bitmap, &binfo, j) == false);
|
|
free(bitmap);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void
|
|
test_bitmap_set(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 1; i <= MAXBITS; i++) {
|
|
bitmap_info_t binfo;
|
|
bitmap_info_init(&binfo, i);
|
|
{
|
|
size_t j;
|
|
bitmap_t *bitmap = malloc(sizeof(bitmap_t) *
|
|
bitmap_info_ngroups(&binfo));
|
|
bitmap_init(bitmap, &binfo);
|
|
|
|
for (j = 0; j < i; j++)
|
|
bitmap_set(bitmap, &binfo, j);
|
|
assert(bitmap_full(bitmap, &binfo));
|
|
free(bitmap);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void
|
|
test_bitmap_unset(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 1; i <= MAXBITS; i++) {
|
|
bitmap_info_t binfo;
|
|
bitmap_info_init(&binfo, i);
|
|
{
|
|
size_t j;
|
|
bitmap_t *bitmap = malloc(sizeof(bitmap_t) *
|
|
bitmap_info_ngroups(&binfo));
|
|
bitmap_init(bitmap, &binfo);
|
|
|
|
for (j = 0; j < i; j++)
|
|
bitmap_set(bitmap, &binfo, j);
|
|
assert(bitmap_full(bitmap, &binfo));
|
|
for (j = 0; j < i; j++)
|
|
bitmap_unset(bitmap, &binfo, j);
|
|
for (j = 0; j < i; j++)
|
|
bitmap_set(bitmap, &binfo, j);
|
|
assert(bitmap_full(bitmap, &binfo));
|
|
free(bitmap);
|
|
}
|
|
}
|
|
}
|
|
|
|
static void
|
|
test_bitmap_sfu(void)
|
|
{
|
|
size_t i;
|
|
|
|
for (i = 1; i <= MAXBITS; i++) {
|
|
bitmap_info_t binfo;
|
|
bitmap_info_init(&binfo, i);
|
|
{
|
|
ssize_t j;
|
|
bitmap_t *bitmap = malloc(sizeof(bitmap_t) *
|
|
bitmap_info_ngroups(&binfo));
|
|
bitmap_init(bitmap, &binfo);
|
|
|
|
/* Iteratively set bits starting at the beginning. */
|
|
for (j = 0; j < i; j++)
|
|
assert(bitmap_sfu(bitmap, &binfo) == j);
|
|
assert(bitmap_full(bitmap, &binfo));
|
|
|
|
/*
|
|
* Iteratively unset bits starting at the end, and
|
|
* verify that bitmap_sfu() reaches the unset bits.
|
|
*/
|
|
for (j = i - 1; j >= 0; j--) {
|
|
bitmap_unset(bitmap, &binfo, j);
|
|
assert(bitmap_sfu(bitmap, &binfo) == j);
|
|
bitmap_unset(bitmap, &binfo, j);
|
|
}
|
|
assert(bitmap_get(bitmap, &binfo, 0) == false);
|
|
|
|
/*
|
|
* Iteratively set bits starting at the beginning, and
|
|
* verify that bitmap_sfu() looks past them.
|
|
*/
|
|
for (j = 1; j < i; j++) {
|
|
bitmap_set(bitmap, &binfo, j - 1);
|
|
assert(bitmap_sfu(bitmap, &binfo) == j);
|
|
bitmap_unset(bitmap, &binfo, j);
|
|
}
|
|
assert(bitmap_sfu(bitmap, &binfo) == i - 1);
|
|
assert(bitmap_full(bitmap, &binfo));
|
|
free(bitmap);
|
|
}
|
|
}
|
|
}
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
malloc_printf("Test begin\n");
|
|
|
|
test_bitmap_size();
|
|
test_bitmap_init();
|
|
test_bitmap_set();
|
|
test_bitmap_unset();
|
|
test_bitmap_sfu();
|
|
|
|
malloc_printf("Test end\n");
|
|
return (0);
|
|
}
|