b037a55f36
Restore the essence of 898960247a8b2e6534738b7a3a244855f379faf9, which sabotages tail call optimization. This is necessary even when the mutually recursive functions are in separate compilation units.
36 lines
794 B
C
36 lines
794 B
C
#include "test/jemalloc_test.h"
|
|
|
|
#define NTHREADS 4
|
|
#define NALLOCS_PER_THREAD 50
|
|
#define DUMP_INTERVAL 1
|
|
#define BT_COUNT_CHECK_INTERVAL 5
|
|
|
|
#define alloc_n_proto(n) \
|
|
void *alloc_##n(unsigned bits);
|
|
alloc_n_proto(0)
|
|
alloc_n_proto(1)
|
|
|
|
#define alloc_n_gen(n) \
|
|
void * \
|
|
alloc_##n(unsigned bits) \
|
|
{ \
|
|
void *p; \
|
|
\
|
|
if (bits == 0) \
|
|
p = mallocx(1, 0); \
|
|
else { \
|
|
switch (bits & 0x1U) { \
|
|
case 0: \
|
|
p = (alloc_0(bits >> 1)); \
|
|
break; \
|
|
case 1: \
|
|
p = (alloc_1(bits >> 1)); \
|
|
break; \
|
|
default: not_reached(); \
|
|
} \
|
|
} \
|
|
/* Intentionally sabotage tail call optimization. */ \
|
|
assert_ptr_not_null(p, "Unexpected mallocx() failure"); \
|
|
return (p); \
|
|
}
|