2010-01-24 18:53:40 +08:00
|
|
|
#define JEMALLOC_CHUNK_MMAP_C_
|
2010-02-12 06:45:59 +08:00
|
|
|
#include "jemalloc/internal/jemalloc_internal.h"
|
2010-01-24 18:53:40 +08:00
|
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
/* Data. */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Used by chunk_alloc_mmap() to decide whether to attempt the fast path and
|
2010-09-06 01:35:13 +08:00
|
|
|
* potentially avoid some system calls.
|
2010-01-24 18:53:40 +08:00
|
|
|
*/
|
|
|
|
#ifndef NO_TLS
|
2010-09-06 01:35:13 +08:00
|
|
|
static __thread bool mmap_unaligned_tls
|
|
|
|
JEMALLOC_ATTR(tls_model("initial-exec"));
|
|
|
|
#define MMAP_UNALIGNED_GET() mmap_unaligned_tls
|
|
|
|
#define MMAP_UNALIGNED_SET(v) do { \
|
|
|
|
mmap_unaligned_tls = (v); \
|
|
|
|
} while (0)
|
|
|
|
#else
|
|
|
|
static pthread_key_t mmap_unaligned_tsd;
|
|
|
|
#define MMAP_UNALIGNED_GET() ((bool)pthread_getspecific(mmap_unaligned_tsd))
|
|
|
|
#define MMAP_UNALIGNED_SET(v) do { \
|
|
|
|
pthread_setspecific(mmap_unaligned_tsd, (void *)(v)); \
|
|
|
|
} while (0)
|
2010-01-24 18:53:40 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
/* Function prototypes for non-inline static functions. */
|
|
|
|
|
2010-05-11 05:17:00 +08:00
|
|
|
static void *pages_map(void *addr, size_t size, bool noreserve);
|
2010-01-24 18:53:40 +08:00
|
|
|
static void pages_unmap(void *addr, size_t size);
|
2010-09-21 07:05:41 +08:00
|
|
|
static void *chunk_alloc_mmap_slow(size_t size, bool unaligned,
|
|
|
|
bool noreserve);
|
2010-05-11 05:17:00 +08:00
|
|
|
static void *chunk_alloc_mmap_internal(size_t size, bool noreserve);
|
2010-01-24 18:53:40 +08:00
|
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
|
|
|
|
static void *
|
2010-05-11 05:17:00 +08:00
|
|
|
pages_map(void *addr, size_t size, bool noreserve)
|
2010-01-24 18:53:40 +08:00
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We don't use MAP_FIXED here, because it can cause the *replacement*
|
|
|
|
* of existing mappings, and we only want to create new mappings.
|
|
|
|
*/
|
2010-05-11 05:17:00 +08:00
|
|
|
int flags = MAP_PRIVATE | MAP_ANON;
|
|
|
|
#ifdef MAP_NORESERVE
|
|
|
|
if (noreserve)
|
|
|
|
flags |= MAP_NORESERVE;
|
|
|
|
#endif
|
|
|
|
ret = mmap(addr, size, PROT_READ | PROT_WRITE, flags, -1, 0);
|
2010-01-24 18:53:40 +08:00
|
|
|
assert(ret != NULL);
|
|
|
|
|
|
|
|
if (ret == MAP_FAILED)
|
|
|
|
ret = NULL;
|
|
|
|
else if (addr != NULL && ret != addr) {
|
|
|
|
/*
|
|
|
|
* We succeeded in mapping memory, but not in the right place.
|
|
|
|
*/
|
|
|
|
if (munmap(ret, size) == -1) {
|
2010-09-21 07:05:41 +08:00
|
|
|
char buf[BUFERROR_BUF];
|
2010-01-24 18:53:40 +08:00
|
|
|
|
2010-09-21 07:05:41 +08:00
|
|
|
buferror(errno, buf, sizeof(buf));
|
2010-03-04 09:45:38 +08:00
|
|
|
malloc_write("<jemalloc>: Error in munmap(): ");
|
|
|
|
malloc_write(buf);
|
|
|
|
malloc_write("\n");
|
2010-01-24 18:53:40 +08:00
|
|
|
if (opt_abort)
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
ret = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(ret == NULL || (addr == NULL && ret != addr)
|
|
|
|
|| (addr != NULL && ret == addr));
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
pages_unmap(void *addr, size_t size)
|
|
|
|
{
|
|
|
|
|
|
|
|
if (munmap(addr, size) == -1) {
|
2010-09-21 07:05:41 +08:00
|
|
|
char buf[BUFERROR_BUF];
|
2010-01-24 18:53:40 +08:00
|
|
|
|
2010-09-21 07:05:41 +08:00
|
|
|
buferror(errno, buf, sizeof(buf));
|
2010-03-04 09:45:38 +08:00
|
|
|
malloc_write("<jemalloc>: Error in munmap(): ");
|
|
|
|
malloc_write(buf);
|
|
|
|
malloc_write("\n");
|
2010-01-24 18:53:40 +08:00
|
|
|
if (opt_abort)
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *
|
2010-05-11 05:17:00 +08:00
|
|
|
chunk_alloc_mmap_slow(size_t size, bool unaligned, bool noreserve)
|
2010-01-24 18:53:40 +08:00
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
size_t offset;
|
|
|
|
|
|
|
|
/* Beware size_t wrap-around. */
|
|
|
|
if (size + chunksize <= size)
|
|
|
|
return (NULL);
|
|
|
|
|
2010-05-11 05:17:00 +08:00
|
|
|
ret = pages_map(NULL, size + chunksize, noreserve);
|
2010-01-24 18:53:40 +08:00
|
|
|
if (ret == NULL)
|
|
|
|
return (NULL);
|
|
|
|
|
|
|
|
/* Clean up unneeded leading/trailing space. */
|
|
|
|
offset = CHUNK_ADDR2OFFSET(ret);
|
|
|
|
if (offset != 0) {
|
|
|
|
/* Note that mmap() returned an unaligned mapping. */
|
|
|
|
unaligned = true;
|
|
|
|
|
|
|
|
/* Leading space. */
|
|
|
|
pages_unmap(ret, chunksize - offset);
|
|
|
|
|
|
|
|
ret = (void *)((uintptr_t)ret +
|
|
|
|
(chunksize - offset));
|
|
|
|
|
|
|
|
/* Trailing space. */
|
|
|
|
pages_unmap((void *)((uintptr_t)ret + size),
|
|
|
|
offset);
|
|
|
|
} else {
|
|
|
|
/* Trailing space only. */
|
|
|
|
pages_unmap((void *)((uintptr_t)ret + size),
|
|
|
|
chunksize);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If mmap() returned an aligned mapping, reset mmap_unaligned so that
|
|
|
|
* the next chunk_alloc_mmap() execution tries the fast allocation
|
|
|
|
* method.
|
|
|
|
*/
|
|
|
|
if (unaligned == false)
|
2010-09-06 01:35:13 +08:00
|
|
|
MMAP_UNALIGNED_SET(false);
|
2010-01-24 18:53:40 +08:00
|
|
|
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
2010-05-11 05:17:00 +08:00
|
|
|
static void *
|
|
|
|
chunk_alloc_mmap_internal(size_t size, bool noreserve)
|
2010-01-24 18:53:40 +08:00
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ideally, there would be a way to specify alignment to mmap() (like
|
|
|
|
* NetBSD has), but in the absence of such a feature, we have to work
|
|
|
|
* hard to efficiently create aligned mappings. The reliable, but
|
|
|
|
* slow method is to create a mapping that is over-sized, then trim the
|
|
|
|
* excess. However, that always results in at least one call to
|
|
|
|
* pages_unmap().
|
|
|
|
*
|
|
|
|
* A more optimistic approach is to try mapping precisely the right
|
|
|
|
* amount, then try to append another mapping if alignment is off. In
|
|
|
|
* practice, this works out well as long as the application is not
|
|
|
|
* interleaving mappings via direct mmap() calls. If we do run into a
|
|
|
|
* situation where there is an interleaved mapping and we are unable to
|
|
|
|
* extend an unaligned mapping, our best option is to switch to the
|
|
|
|
* slow method until mmap() returns another aligned mapping. This will
|
|
|
|
* tend to leave a gap in the memory map that is too small to cause
|
|
|
|
* later problems for the optimistic method.
|
|
|
|
*
|
|
|
|
* Another possible confounding factor is address space layout
|
|
|
|
* randomization (ASLR), which causes mmap(2) to disregard the
|
|
|
|
* requested address. mmap_unaligned tracks whether the previous
|
|
|
|
* chunk_alloc_mmap() execution received any unaligned or relocated
|
|
|
|
* mappings, and if so, the current execution will immediately fall
|
|
|
|
* back to the slow method. However, we keep track of whether the fast
|
|
|
|
* method would have succeeded, and if so, we make a note to try the
|
|
|
|
* fast method next time.
|
|
|
|
*/
|
|
|
|
|
2010-09-06 01:35:13 +08:00
|
|
|
if (MMAP_UNALIGNED_GET() == false) {
|
2010-01-24 18:53:40 +08:00
|
|
|
size_t offset;
|
|
|
|
|
2010-05-11 05:17:00 +08:00
|
|
|
ret = pages_map(NULL, size, noreserve);
|
2010-01-24 18:53:40 +08:00
|
|
|
if (ret == NULL)
|
|
|
|
return (NULL);
|
|
|
|
|
|
|
|
offset = CHUNK_ADDR2OFFSET(ret);
|
|
|
|
if (offset != 0) {
|
2010-09-06 01:35:13 +08:00
|
|
|
MMAP_UNALIGNED_SET(true);
|
2010-01-24 18:53:40 +08:00
|
|
|
/* Try to extend chunk boundary. */
|
|
|
|
if (pages_map((void *)((uintptr_t)ret + size),
|
2010-05-11 05:17:00 +08:00
|
|
|
chunksize - offset, noreserve) == NULL) {
|
2010-01-24 18:53:40 +08:00
|
|
|
/*
|
|
|
|
* Extension failed. Clean up, then revert to
|
|
|
|
* the reliable-but-expensive method.
|
|
|
|
*/
|
|
|
|
pages_unmap(ret, size);
|
2010-09-06 01:35:13 +08:00
|
|
|
ret = chunk_alloc_mmap_slow(size, true,
|
|
|
|
noreserve);
|
2010-01-24 18:53:40 +08:00
|
|
|
} else {
|
|
|
|
/* Clean up unneeded leading space. */
|
|
|
|
pages_unmap(ret, chunksize - offset);
|
|
|
|
ret = (void *)((uintptr_t)ret + (chunksize -
|
|
|
|
offset));
|
|
|
|
}
|
|
|
|
}
|
2010-01-28 10:27:09 +08:00
|
|
|
} else
|
2010-05-11 05:17:00 +08:00
|
|
|
ret = chunk_alloc_mmap_slow(size, false, noreserve);
|
2010-01-24 18:53:40 +08:00
|
|
|
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
2010-05-11 05:17:00 +08:00
|
|
|
void *
|
|
|
|
chunk_alloc_mmap(size_t size)
|
|
|
|
{
|
2011-02-14 10:44:59 +08:00
|
|
|
|
|
|
|
return (chunk_alloc_mmap_internal(size, false));
|
2010-05-11 05:17:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
chunk_alloc_mmap_noreserve(size_t size)
|
|
|
|
{
|
2011-02-14 10:44:59 +08:00
|
|
|
|
|
|
|
return (chunk_alloc_mmap_internal(size, true));
|
2010-05-11 05:17:00 +08:00
|
|
|
}
|
|
|
|
|
2010-01-24 18:53:40 +08:00
|
|
|
void
|
|
|
|
chunk_dealloc_mmap(void *chunk, size_t size)
|
|
|
|
{
|
|
|
|
|
|
|
|
pages_unmap(chunk, size);
|
|
|
|
}
|
2010-09-06 01:35:13 +08:00
|
|
|
|
|
|
|
bool
|
|
|
|
chunk_mmap_boot(void)
|
|
|
|
{
|
|
|
|
|
|
|
|
#ifdef NO_TLS
|
|
|
|
if (pthread_key_create(&mmap_unaligned_tsd, NULL) != 0) {
|
|
|
|
malloc_write("<jemalloc>: Error in pthread_key_create()\n");
|
|
|
|
return (true);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return (false);
|
|
|
|
}
|