2002-01-29 07:54:51 +00:00
|
|
|
/* Malloc implementation for multiple threads without lock contention.
|
2014-01-01 11:03:15 +00:00
|
|
|
Copyright (C) 2001-2014 Free Software Foundation, Inc.
|
2002-01-29 07:54:51 +00:00
|
|
|
This file is part of the GNU C Library.
|
|
|
|
Contributed by Wolfram Gloger <wg@malloc.de>, 2001.
|
|
|
|
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
2002-08-26 22:40:48 +00:00
|
|
|
modify it under the terms of the GNU Lesser General Public License as
|
|
|
|
published by the Free Software Foundation; either version 2.1 of the
|
2002-01-29 07:54:51 +00:00
|
|
|
License, or (at your option) any later version.
|
|
|
|
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2002-08-26 22:40:48 +00:00
|
|
|
Lesser General Public License for more details.
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2002-08-26 22:40:48 +00:00
|
|
|
You should have received a copy of the GNU Lesser General Public
|
2012-02-09 23:18:22 +00:00
|
|
|
License along with the GNU C Library; see the file COPYING.LIB. If
|
|
|
|
not, see <http://www.gnu.org/licenses/>. */
|
2002-01-29 07:54:51 +00:00
|
|
|
|
|
|
|
/* What to do if the standard debugging hooks are in place and a
|
|
|
|
corrupt pointer is detected: do nothing (0), print an error message
|
|
|
|
(1), or call abort() (2). */
|
|
|
|
|
|
|
|
/* Hooks for debugging versions. The initial hooks just call the
|
|
|
|
initialization routine, then do the normal work. */
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
|
|
|
malloc_hook_ini (size_t sz, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
|
|
|
__malloc_hook = NULL;
|
2014-01-02 08:38:18 +00:00
|
|
|
ptmalloc_init ();
|
|
|
|
return __libc_malloc (sz);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
|
|
|
realloc_hook_ini (void *ptr, size_t sz, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
|
|
|
__malloc_hook = NULL;
|
|
|
|
__realloc_hook = NULL;
|
2014-01-02 08:38:18 +00:00
|
|
|
ptmalloc_init ();
|
|
|
|
return __libc_realloc (ptr, sz);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
|
|
|
memalign_hook_ini (size_t alignment, size_t sz, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
|
|
|
__memalign_hook = NULL;
|
2014-01-02 08:38:18 +00:00
|
|
|
ptmalloc_init ();
|
|
|
|
return __libc_memalign (alignment, sz);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Whether we are using malloc checking. */
|
|
|
|
static int using_malloc_checking;
|
|
|
|
|
|
|
|
/* A flag that is set by malloc_set_state, to signal that malloc checking
|
|
|
|
must not be enabled on the request from the user (via the MALLOC_CHECK_
|
|
|
|
environment variable). It is reset by __malloc_check_init to tell
|
|
|
|
malloc_set_state that the user has requested malloc checking.
|
|
|
|
|
|
|
|
The purpose of this flag is to make sure that malloc checking is not
|
|
|
|
enabled when the heap to be restored was constructed without malloc
|
|
|
|
checking, and thus does not contain the required magic bytes.
|
|
|
|
Otherwise the heap would be corrupted by calls to free and realloc. If
|
|
|
|
it turns out that the heap was created with malloc checking and the
|
|
|
|
user has requested it malloc_set_state just calls __malloc_check_init
|
|
|
|
again to enable it. On the other hand, reusing such a heap without
|
|
|
|
further malloc checking is safe. */
|
|
|
|
static int disallow_malloc_check;
|
|
|
|
|
|
|
|
/* Activate a standard set of debugging hooks. */
|
|
|
|
void
|
2013-06-08 00:22:23 +00:00
|
|
|
__malloc_check_init (void)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2014-01-02 08:38:18 +00:00
|
|
|
if (disallow_malloc_check)
|
|
|
|
{
|
|
|
|
disallow_malloc_check = 0;
|
|
|
|
return;
|
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
using_malloc_checking = 1;
|
|
|
|
__malloc_hook = malloc_check;
|
|
|
|
__free_hook = free_check;
|
|
|
|
__realloc_hook = realloc_check;
|
|
|
|
__memalign_hook = memalign_check;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* A simple, standard set of debugging hooks. Overhead is `only' one
|
|
|
|
byte per chunk; still this will catch most cases of double frees or
|
|
|
|
overruns. The goal here is to avoid obscure crashes due to invalid
|
|
|
|
usage, unlike in the MALLOC_DEBUG code. */
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
#define MAGICBYTE(p) ((((size_t) p >> 3) ^ ((size_t) p >> 11)) & 0xFF)
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2014-12-12 00:38:15 +00:00
|
|
|
/* Visualize the chunk as being partitioned into blocks of 256 bytes from the
|
|
|
|
highest address of the chunk, downwards. The beginning of each block tells
|
|
|
|
us the size of the previous block, up to the actual size of the requested
|
|
|
|
memory. Our magic byte is right at the end of the requested size, so we
|
|
|
|
must reach it with this iteration, otherwise we have witnessed a memory
|
|
|
|
corruption. */
|
2012-09-05 16:19:00 +00:00
|
|
|
static size_t
|
2014-01-02 08:38:18 +00:00
|
|
|
malloc_check_get_size (mchunkptr p)
|
2012-09-05 16:19:00 +00:00
|
|
|
{
|
2014-12-12 00:38:15 +00:00
|
|
|
size_t size;
|
2012-09-05 16:19:00 +00:00
|
|
|
unsigned char c;
|
2014-01-02 08:38:18 +00:00
|
|
|
unsigned char magic = MAGICBYTE (p);
|
2012-09-05 16:19:00 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
assert (using_malloc_checking == 1);
|
2012-09-05 16:19:00 +00:00
|
|
|
|
2014-12-12 00:38:15 +00:00
|
|
|
for (size = chunksize (p) - 1 + (chunk_is_mmapped (p) ? 0 : SIZE_SZ);
|
|
|
|
(c = ((unsigned char *) p)[size]) != magic;
|
2014-01-02 08:38:18 +00:00
|
|
|
size -= c)
|
|
|
|
{
|
2014-12-12 00:38:15 +00:00
|
|
|
if (c <= 0 || size < (c + 2 * SIZE_SZ))
|
|
|
|
{
|
|
|
|
malloc_printerr (check_action, "malloc_check_get_size: memory corruption",
|
|
|
|
chunk2mem (p));
|
|
|
|
return 0;
|
|
|
|
}
|
2012-09-05 16:19:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* chunk2mem size. */
|
2014-01-02 08:38:18 +00:00
|
|
|
return size - 2 * SIZE_SZ;
|
2012-09-05 16:19:00 +00:00
|
|
|
}
|
|
|
|
|
2002-01-29 07:54:51 +00:00
|
|
|
/* Instrument a chunk with overrun detector byte(s) and convert it
|
|
|
|
into a user pointer with requested size sz. */
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
2002-01-29 07:54:51 +00:00
|
|
|
internal_function
|
2014-01-02 08:38:18 +00:00
|
|
|
mem2mem_check (void *ptr, size_t sz)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
|
|
|
mchunkptr p;
|
2014-01-02 08:38:18 +00:00
|
|
|
unsigned char *m_ptr = ptr;
|
2014-12-12 00:38:15 +00:00
|
|
|
size_t i;
|
2002-01-29 07:54:51 +00:00
|
|
|
|
|
|
|
if (!ptr)
|
|
|
|
return ptr;
|
2014-01-02 08:38:18 +00:00
|
|
|
|
|
|
|
p = mem2chunk (ptr);
|
2014-12-12 00:38:15 +00:00
|
|
|
for (i = chunksize (p) - (chunk_is_mmapped (p) ? 2 * SIZE_SZ + 1 : SIZE_SZ + 1);
|
|
|
|
i > sz;
|
|
|
|
i -= 0xFF)
|
2014-01-02 08:38:18 +00:00
|
|
|
{
|
2014-12-12 00:38:15 +00:00
|
|
|
if (i - sz < 0x100)
|
|
|
|
{
|
|
|
|
m_ptr[i] = (unsigned char) (i - sz);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
m_ptr[i] = 0xFF;
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
2014-01-02 08:38:18 +00:00
|
|
|
m_ptr[sz] = MAGICBYTE (p);
|
|
|
|
return (void *) m_ptr;
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Convert a pointer to be free()d or realloc()ed to a valid chunk
|
|
|
|
pointer. If the provided pointer is not valid, return NULL. */
|
|
|
|
|
|
|
|
static mchunkptr
|
|
|
|
internal_function
|
2014-01-02 08:38:18 +00:00
|
|
|
mem2chunk_check (void *mem, unsigned char **magic_p)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
|
|
|
mchunkptr p;
|
|
|
|
INTERNAL_SIZE_T sz, c;
|
|
|
|
unsigned char magic;
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
if (!aligned_OK (mem))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
p = mem2chunk (mem);
|
|
|
|
if (!chunk_is_mmapped (p))
|
|
|
|
{
|
|
|
|
/* Must be a chunk in conventional heap memory. */
|
|
|
|
int contig = contiguous (&main_arena);
|
2014-12-12 00:38:15 +00:00
|
|
|
sz = chunksize (p);
|
2014-01-02 08:38:18 +00:00
|
|
|
if ((contig &&
|
|
|
|
((char *) p < mp_.sbrk_base ||
|
|
|
|
((char *) p + sz) >= (mp_.sbrk_base + main_arena.system_mem))) ||
|
|
|
|
sz < MINSIZE || sz & MALLOC_ALIGN_MASK || !inuse (p) ||
|
|
|
|
(!prev_inuse (p) && (p->prev_size & MALLOC_ALIGN_MASK ||
|
|
|
|
(contig && (char *) prev_chunk (p) < mp_.sbrk_base) ||
|
|
|
|
next_chunk (prev_chunk (p)) != p)))
|
|
|
|
return NULL;
|
|
|
|
|
2014-12-12 00:38:15 +00:00
|
|
|
magic = MAGICBYTE (p);
|
|
|
|
for (sz += SIZE_SZ - 1; (c = ((unsigned char *) p)[sz]) != magic; sz -= c)
|
2014-01-02 08:38:18 +00:00
|
|
|
{
|
2014-12-12 00:38:15 +00:00
|
|
|
if (c <= 0 || sz < (c + 2 * SIZE_SZ))
|
|
|
|
return NULL;
|
2014-01-02 08:38:18 +00:00
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
2014-01-02 08:38:18 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
unsigned long offset, page_mask = GLRO (dl_pagesize) - 1;
|
|
|
|
|
|
|
|
/* mmap()ed chunks have MALLOC_ALIGNMENT or higher power-of-two
|
|
|
|
alignment relative to the beginning of a page. Check this
|
|
|
|
first. */
|
|
|
|
offset = (unsigned long) mem & page_mask;
|
|
|
|
if ((offset != MALLOC_ALIGNMENT && offset != 0 && offset != 0x10 &&
|
|
|
|
offset != 0x20 && offset != 0x40 && offset != 0x80 && offset != 0x100 &&
|
|
|
|
offset != 0x200 && offset != 0x400 && offset != 0x800 && offset != 0x1000 &&
|
|
|
|
offset < 0x2000) ||
|
|
|
|
!chunk_is_mmapped (p) || (p->size & PREV_INUSE) ||
|
|
|
|
((((unsigned long) p - p->prev_size) & page_mask) != 0) ||
|
2014-12-12 00:38:15 +00:00
|
|
|
((sz = chunksize (p)), ((p->prev_size + sz) & page_mask) != 0))
|
2014-01-02 08:38:18 +00:00
|
|
|
return NULL;
|
|
|
|
|
2014-12-12 00:38:15 +00:00
|
|
|
magic = MAGICBYTE (p);
|
|
|
|
for (sz -= 1; (c = ((unsigned char *) p)[sz]) != magic; sz -= c)
|
2014-01-02 08:38:18 +00:00
|
|
|
{
|
2014-12-12 00:38:15 +00:00
|
|
|
if (c <= 0 || sz < (c + 2 * SIZE_SZ))
|
|
|
|
return NULL;
|
2014-01-02 08:38:18 +00:00
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
2014-01-02 08:38:18 +00:00
|
|
|
((unsigned char *) p)[sz] ^= 0xFF;
|
2005-04-27 01:39:11 +00:00
|
|
|
if (magic_p)
|
2014-01-02 08:38:18 +00:00
|
|
|
*magic_p = (unsigned char *) p + sz;
|
2002-01-29 07:54:51 +00:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for corruption of the top chunk, and try to recover if
|
|
|
|
necessary. */
|
|
|
|
|
|
|
|
static int
|
|
|
|
internal_function
|
2014-01-02 08:38:18 +00:00
|
|
|
top_check (void)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2014-01-02 08:38:18 +00:00
|
|
|
mchunkptr t = top (&main_arena);
|
|
|
|
char *brk, *new_brk;
|
2002-01-29 07:54:51 +00:00
|
|
|
INTERNAL_SIZE_T front_misalign, sbrk_size;
|
2014-01-02 08:38:18 +00:00
|
|
|
unsigned long pagesz = GLRO (dl_pagesize);
|
|
|
|
|
|
|
|
if (t == initial_top (&main_arena) ||
|
|
|
|
(!chunk_is_mmapped (t) &&
|
|
|
|
chunksize (t) >= MINSIZE &&
|
|
|
|
prev_inuse (t) &&
|
|
|
|
(!contiguous (&main_arena) ||
|
|
|
|
(char *) t + chunksize (t) == mp_.sbrk_base + main_arena.system_mem)))
|
2004-12-14 21:18:36 +00:00
|
|
|
return 0;
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2004-09-09 21:10:29 +00:00
|
|
|
malloc_printerr (check_action, "malloc: top chunk is corrupt", t);
|
2002-01-29 07:54:51 +00:00
|
|
|
|
|
|
|
/* Try to set up a new top chunk. */
|
2014-01-02 08:38:18 +00:00
|
|
|
brk = MORECORE (0);
|
|
|
|
front_misalign = (unsigned long) chunk2mem (brk) & MALLOC_ALIGN_MASK;
|
2002-01-29 07:54:51 +00:00
|
|
|
if (front_misalign > 0)
|
|
|
|
front_misalign = MALLOC_ALIGNMENT - front_misalign;
|
|
|
|
sbrk_size = front_misalign + mp_.top_pad + MINSIZE;
|
2014-01-02 08:38:18 +00:00
|
|
|
sbrk_size += pagesz - ((unsigned long) (brk + sbrk_size) & (pagesz - 1));
|
|
|
|
new_brk = (char *) (MORECORE (sbrk_size));
|
|
|
|
if (new_brk == (char *) (MORECORE_FAILURE))
|
2005-04-27 01:39:11 +00:00
|
|
|
{
|
2011-09-11 02:12:38 +00:00
|
|
|
__set_errno (ENOMEM);
|
2005-04-27 01:39:11 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
/* Call the `morecore' hook if necessary. */
|
2013-12-09 16:14:12 +00:00
|
|
|
void (*hook) (void) = atomic_forced_read (__after_morecore_hook);
|
2009-04-16 21:22:16 +00:00
|
|
|
if (hook)
|
2014-01-02 08:38:18 +00:00
|
|
|
(*hook)();
|
2002-01-29 07:54:51 +00:00
|
|
|
main_arena.system_mem = (new_brk - mp_.sbrk_base) + sbrk_size;
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
top (&main_arena) = (mchunkptr) (brk + front_misalign);
|
|
|
|
set_head (top (&main_arena), (sbrk_size - front_misalign) | PREV_INUSE);
|
2002-01-29 07:54:51 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
|
|
|
malloc_check (size_t sz, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2011-09-10 22:10:17 +00:00
|
|
|
void *victim;
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
if (sz + 1 == 0)
|
|
|
|
{
|
|
|
|
__set_errno (ENOMEM);
|
|
|
|
return NULL;
|
|
|
|
}
|
2005-04-27 01:39:11 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
|
|
|
victim = (top_check () >= 0) ? _int_malloc (&main_arena, sz + 1) : NULL;
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
|
|
|
return mem2mem_check (victim, sz);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2014-01-02 08:38:18 +00:00
|
|
|
free_check (void *mem, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
|
|
|
mchunkptr p;
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
if (!mem)
|
2002-01-29 07:54:51 +00:00
|
|
|
return;
|
2014-01-02 08:38:18 +00:00
|
|
|
|
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
|
|
|
p = mem2chunk_check (mem, NULL);
|
|
|
|
if (!p)
|
|
|
|
{
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
|
|
|
|
|
|
|
malloc_printerr (check_action, "free(): invalid pointer", mem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (chunk_is_mmapped (p))
|
|
|
|
{
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
|
|
|
munmap_chunk (p);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
_int_free (&main_arena, p, 1);
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
|
|
|
realloc_check (void *oldmem, size_t bytes, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2009-02-07 22:01:49 +00:00
|
|
|
INTERNAL_SIZE_T nb;
|
2014-01-02 08:38:18 +00:00
|
|
|
void *newmem = 0;
|
2005-04-27 01:39:11 +00:00
|
|
|
unsigned char *magic_p;
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
if (bytes + 1 == 0)
|
|
|
|
{
|
|
|
|
__set_errno (ENOMEM);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (oldmem == 0)
|
|
|
|
return malloc_check (bytes, NULL);
|
|
|
|
|
|
|
|
if (bytes == 0)
|
|
|
|
{
|
|
|
|
free_check (oldmem, NULL);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
|
|
|
const mchunkptr oldp = mem2chunk_check (oldmem, &magic_p);
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
|
|
|
if (!oldp)
|
|
|
|
{
|
|
|
|
malloc_printerr (check_action, "realloc(): invalid pointer", oldmem);
|
|
|
|
return malloc_check (bytes, NULL);
|
|
|
|
}
|
|
|
|
const INTERNAL_SIZE_T oldsize = chunksize (oldp);
|
|
|
|
|
|
|
|
checked_request2size (bytes + 1, nb);
|
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
|
|
|
|
|
|
|
if (chunk_is_mmapped (oldp))
|
|
|
|
{
|
2002-01-29 07:54:51 +00:00
|
|
|
#if HAVE_MREMAP
|
2014-01-02 08:38:18 +00:00
|
|
|
mchunkptr newp = mremap_chunk (oldp, nb);
|
|
|
|
if (newp)
|
|
|
|
newmem = chunk2mem (newp);
|
|
|
|
else
|
2002-01-29 07:54:51 +00:00
|
|
|
#endif
|
2014-01-02 08:38:18 +00:00
|
|
|
{
|
|
|
|
/* Note the extra SIZE_SZ overhead. */
|
|
|
|
if (oldsize - SIZE_SZ >= nb)
|
|
|
|
newmem = oldmem; /* do nothing */
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Must alloc, copy, free. */
|
|
|
|
if (top_check () >= 0)
|
|
|
|
newmem = _int_malloc (&main_arena, bytes + 1);
|
|
|
|
if (newmem)
|
|
|
|
{
|
|
|
|
memcpy (newmem, oldmem, oldsize - 2 * SIZE_SZ);
|
|
|
|
munmap_chunk (oldp);
|
|
|
|
}
|
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
}
|
2014-01-02 08:38:18 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
if (top_check () >= 0)
|
|
|
|
{
|
|
|
|
INTERNAL_SIZE_T nb;
|
|
|
|
checked_request2size (bytes + 1, nb);
|
|
|
|
newmem = _int_realloc (&main_arena, oldp, oldsize, nb);
|
|
|
|
}
|
2009-02-07 22:49:34 +00:00
|
|
|
}
|
2005-04-27 01:39:11 +00:00
|
|
|
|
|
|
|
/* mem2chunk_check changed the magic byte in the old chunk.
|
|
|
|
If newmem is NULL, then the old chunk will still be used though,
|
|
|
|
so we need to invert that change here. */
|
2014-01-02 08:38:18 +00:00
|
|
|
if (newmem == NULL)
|
|
|
|
*magic_p ^= 0xFF;
|
2005-04-27 01:39:11 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
return mem2mem_check (newmem, bytes);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
static void *
|
|
|
|
memalign_check (size_t alignment, size_t bytes, const void *caller)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2014-01-02 08:38:18 +00:00
|
|
|
void *mem;
|
|
|
|
|
|
|
|
if (alignment <= MALLOC_ALIGNMENT)
|
|
|
|
return malloc_check (bytes, NULL);
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
if (alignment < MINSIZE)
|
|
|
|
alignment = MINSIZE;
|
2002-01-29 07:54:51 +00:00
|
|
|
|
2013-10-10 12:17:13 +00:00
|
|
|
/* If the alignment is greater than SIZE_MAX / 2 + 1 it cannot be a
|
|
|
|
power of 2 and will cause overflow in the check below. */
|
|
|
|
if (alignment > SIZE_MAX / 2 + 1)
|
|
|
|
{
|
|
|
|
__set_errno (EINVAL);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-09 13:41:57 +00:00
|
|
|
/* Check for overflow. */
|
|
|
|
if (bytes > SIZE_MAX - alignment - MINSIZE)
|
|
|
|
{
|
|
|
|
__set_errno (ENOMEM);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-11-20 14:46:02 +00:00
|
|
|
/* Make sure alignment is power of 2. */
|
2014-01-02 08:38:18 +00:00
|
|
|
if (!powerof2 (alignment))
|
|
|
|
{
|
|
|
|
size_t a = MALLOC_ALIGNMENT * 2;
|
|
|
|
while (a < alignment)
|
|
|
|
a <<= 1;
|
|
|
|
alignment = a;
|
|
|
|
}
|
|
|
|
|
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
|
|
|
mem = (top_check () >= 0) ? _int_memalign (&main_arena, alignment, bytes + 1) :
|
|
|
|
NULL;
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
|
|
|
return mem2mem_check (mem, bytes);
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Get/set state: malloc_get_state() records the current state of all
|
|
|
|
malloc variables (_except_ for the actual heap contents and `hook'
|
|
|
|
function pointers) in a system dependent, opaque data structure.
|
|
|
|
This data structure is dynamically allocated and can be free()d
|
|
|
|
after use. malloc_set_state() restores the state of all malloc
|
|
|
|
variables to the previously obtained state. This is especially
|
|
|
|
useful when using this malloc as part of a shared library, and when
|
|
|
|
the heap contents are saved/restored via some other method. The
|
|
|
|
primary example for this is GNU Emacs with its `dumping' procedure.
|
|
|
|
`Hook' function pointers are never saved or restored by these
|
|
|
|
functions, with two exceptions: If malloc checking was in use when
|
|
|
|
malloc_get_state() was called, then malloc_set_state() calls
|
|
|
|
__malloc_check_init() if possible; if malloc checking was not in
|
|
|
|
use in the recorded state but the user requested malloc checking,
|
|
|
|
then the hooks are reset to 0. */
|
|
|
|
|
|
|
|
#define MALLOC_STATE_MAGIC 0x444c4541l
|
2014-01-02 08:38:18 +00:00
|
|
|
#define MALLOC_STATE_VERSION (0 * 0x100l + 4l) /* major*0x100 + minor */
|
|
|
|
|
|
|
|
struct malloc_save_state
|
|
|
|
{
|
|
|
|
long magic;
|
|
|
|
long version;
|
|
|
|
mbinptr av[NBINS * 2 + 2];
|
|
|
|
char *sbrk_base;
|
|
|
|
int sbrked_mem_bytes;
|
2002-01-29 07:54:51 +00:00
|
|
|
unsigned long trim_threshold;
|
|
|
|
unsigned long top_pad;
|
2014-01-02 08:38:18 +00:00
|
|
|
unsigned int n_mmaps_max;
|
2002-01-29 07:54:51 +00:00
|
|
|
unsigned long mmap_threshold;
|
2014-01-02 08:38:18 +00:00
|
|
|
int check_action;
|
2002-01-29 07:54:51 +00:00
|
|
|
unsigned long max_sbrked_mem;
|
|
|
|
unsigned long max_total_mem;
|
2014-01-02 08:38:18 +00:00
|
|
|
unsigned int n_mmaps;
|
|
|
|
unsigned int max_n_mmaps;
|
2002-01-29 07:54:51 +00:00
|
|
|
unsigned long mmapped_mem;
|
|
|
|
unsigned long max_mmapped_mem;
|
2014-01-02 08:38:18 +00:00
|
|
|
int using_malloc_checking;
|
2009-04-08 18:00:34 +00:00
|
|
|
unsigned long max_fast;
|
|
|
|
unsigned long arena_test;
|
|
|
|
unsigned long arena_max;
|
|
|
|
unsigned long narenas;
|
2002-01-29 07:54:51 +00:00
|
|
|
};
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
void *
|
|
|
|
__malloc_get_state (void)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2014-01-02 08:38:18 +00:00
|
|
|
struct malloc_save_state *ms;
|
2002-01-29 07:54:51 +00:00
|
|
|
int i;
|
|
|
|
mbinptr b;
|
|
|
|
|
2014-01-02 08:38:18 +00:00
|
|
|
ms = (struct malloc_save_state *) __libc_malloc (sizeof (*ms));
|
2002-01-29 07:54:51 +00:00
|
|
|
if (!ms)
|
|
|
|
return 0;
|
2014-01-02 08:38:18 +00:00
|
|
|
|
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
|
|
|
malloc_consolidate (&main_arena);
|
2002-01-29 07:54:51 +00:00
|
|
|
ms->magic = MALLOC_STATE_MAGIC;
|
|
|
|
ms->version = MALLOC_STATE_VERSION;
|
|
|
|
ms->av[0] = 0;
|
|
|
|
ms->av[1] = 0; /* used to be binblocks, now no longer used */
|
2014-01-02 08:38:18 +00:00
|
|
|
ms->av[2] = top (&main_arena);
|
2002-01-29 07:54:51 +00:00
|
|
|
ms->av[3] = 0; /* used to be undefined */
|
2014-01-02 08:38:18 +00:00
|
|
|
for (i = 1; i < NBINS; i++)
|
|
|
|
{
|
|
|
|
b = bin_at (&main_arena, i);
|
|
|
|
if (first (b) == b)
|
|
|
|
ms->av[2 * i + 2] = ms->av[2 * i + 3] = 0; /* empty bin */
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ms->av[2 * i + 2] = first (b);
|
|
|
|
ms->av[2 * i + 3] = last (b);
|
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
ms->sbrk_base = mp_.sbrk_base;
|
|
|
|
ms->sbrked_mem_bytes = main_arena.system_mem;
|
|
|
|
ms->trim_threshold = mp_.trim_threshold;
|
|
|
|
ms->top_pad = mp_.top_pad;
|
|
|
|
ms->n_mmaps_max = mp_.n_mmaps_max;
|
|
|
|
ms->mmap_threshold = mp_.mmap_threshold;
|
|
|
|
ms->check_action = check_action;
|
|
|
|
ms->max_sbrked_mem = main_arena.max_system_mem;
|
|
|
|
ms->max_total_mem = 0;
|
|
|
|
ms->n_mmaps = mp_.n_mmaps;
|
|
|
|
ms->max_n_mmaps = mp_.max_n_mmaps;
|
|
|
|
ms->mmapped_mem = mp_.mmapped_mem;
|
|
|
|
ms->max_mmapped_mem = mp_.max_mmapped_mem;
|
|
|
|
ms->using_malloc_checking = using_malloc_checking;
|
2014-01-02 08:38:18 +00:00
|
|
|
ms->max_fast = get_max_fast ();
|
2009-04-08 18:00:34 +00:00
|
|
|
ms->arena_test = mp_.arena_test;
|
|
|
|
ms->arena_max = mp_.arena_max;
|
|
|
|
ms->narenas = narenas;
|
2014-01-02 08:38:18 +00:00
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
|
|
|
return (void *) ms;
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2014-01-02 08:38:18 +00:00
|
|
|
__malloc_set_state (void *msptr)
|
2002-01-29 07:54:51 +00:00
|
|
|
{
|
2014-01-02 08:38:18 +00:00
|
|
|
struct malloc_save_state *ms = (struct malloc_save_state *) msptr;
|
2002-08-25 04:51:08 +00:00
|
|
|
size_t i;
|
2002-01-29 07:54:51 +00:00
|
|
|
mbinptr b;
|
|
|
|
|
|
|
|
disallow_malloc_check = 1;
|
2014-01-02 08:38:18 +00:00
|
|
|
ptmalloc_init ();
|
|
|
|
if (ms->magic != MALLOC_STATE_MAGIC)
|
|
|
|
return -1;
|
|
|
|
|
2002-01-29 07:54:51 +00:00
|
|
|
/* Must fail if the major version is too high. */
|
2014-01-02 08:38:18 +00:00
|
|
|
if ((ms->version & ~0xffl) > (MALLOC_STATE_VERSION & ~0xffl))
|
|
|
|
return -2;
|
|
|
|
|
|
|
|
(void) mutex_lock (&main_arena.mutex);
|
2002-01-29 07:54:51 +00:00
|
|
|
/* There are no fastchunks. */
|
2014-01-02 08:38:18 +00:00
|
|
|
clear_fastchunks (&main_arena);
|
2009-04-08 18:00:34 +00:00
|
|
|
if (ms->version >= 4)
|
2014-01-02 08:38:18 +00:00
|
|
|
set_max_fast (ms->max_fast);
|
2009-04-08 18:00:34 +00:00
|
|
|
else
|
2014-01-02 08:38:18 +00:00
|
|
|
set_max_fast (64); /* 64 used to be the value we always used. */
|
|
|
|
for (i = 0; i < NFASTBINS; ++i)
|
2009-03-13 23:53:18 +00:00
|
|
|
fastbin (&main_arena, i) = 0;
|
2014-01-02 08:38:18 +00:00
|
|
|
for (i = 0; i < BINMAPSIZE; ++i)
|
2002-01-29 07:54:51 +00:00
|
|
|
main_arena.binmap[i] = 0;
|
2014-01-02 08:38:18 +00:00
|
|
|
top (&main_arena) = ms->av[2];
|
2002-01-29 07:54:51 +00:00
|
|
|
main_arena.last_remainder = 0;
|
2014-01-02 08:38:18 +00:00
|
|
|
for (i = 1; i < NBINS; i++)
|
|
|
|
{
|
|
|
|
b = bin_at (&main_arena, i);
|
|
|
|
if (ms->av[2 * i + 2] == 0)
|
|
|
|
{
|
|
|
|
assert (ms->av[2 * i + 3] == 0);
|
|
|
|
first (b) = last (b) = b;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (ms->version >= 3 &&
|
|
|
|
(i < NSMALLBINS || (largebin_index (chunksize (ms->av[2 * i + 2])) == i &&
|
|
|
|
largebin_index (chunksize (ms->av[2 * i + 3])) == i)))
|
|
|
|
{
|
|
|
|
first (b) = ms->av[2 * i + 2];
|
|
|
|
last (b) = ms->av[2 * i + 3];
|
|
|
|
/* Make sure the links to the bins within the heap are correct. */
|
|
|
|
first (b)->bk = b;
|
|
|
|
last (b)->fd = b;
|
|
|
|
/* Set bit in binblocks. */
|
|
|
|
mark_bin (&main_arena, i);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Oops, index computation from chunksize must have changed.
|
|
|
|
Link the whole list into unsorted_chunks. */
|
|
|
|
first (b) = last (b) = b;
|
|
|
|
b = unsorted_chunks (&main_arena);
|
|
|
|
ms->av[2 * i + 2]->bk = b;
|
|
|
|
ms->av[2 * i + 3]->fd = b->fd;
|
|
|
|
b->fd->bk = ms->av[2 * i + 3];
|
|
|
|
b->fd = ms->av[2 * i + 2];
|
|
|
|
}
|
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
2014-01-02 08:38:18 +00:00
|
|
|
if (ms->version < 3)
|
|
|
|
{
|
|
|
|
/* Clear fd_nextsize and bk_nextsize fields. */
|
|
|
|
b = unsorted_chunks (&main_arena)->fd;
|
|
|
|
while (b != unsorted_chunks (&main_arena))
|
|
|
|
{
|
|
|
|
if (!in_smallbin_range (chunksize (b)))
|
|
|
|
{
|
|
|
|
b->fd_nextsize = NULL;
|
|
|
|
b->bk_nextsize = NULL;
|
|
|
|
}
|
|
|
|
b = b->fd;
|
|
|
|
}
|
2007-05-21 16:13:18 +00:00
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
mp_.sbrk_base = ms->sbrk_base;
|
|
|
|
main_arena.system_mem = ms->sbrked_mem_bytes;
|
|
|
|
mp_.trim_threshold = ms->trim_threshold;
|
|
|
|
mp_.top_pad = ms->top_pad;
|
|
|
|
mp_.n_mmaps_max = ms->n_mmaps_max;
|
|
|
|
mp_.mmap_threshold = ms->mmap_threshold;
|
|
|
|
check_action = ms->check_action;
|
|
|
|
main_arena.max_system_mem = ms->max_sbrked_mem;
|
|
|
|
mp_.n_mmaps = ms->n_mmaps;
|
|
|
|
mp_.max_n_mmaps = ms->max_n_mmaps;
|
|
|
|
mp_.mmapped_mem = ms->mmapped_mem;
|
|
|
|
mp_.max_mmapped_mem = ms->max_mmapped_mem;
|
|
|
|
/* add version-dependent code here */
|
2014-01-02 08:38:18 +00:00
|
|
|
if (ms->version >= 1)
|
|
|
|
{
|
|
|
|
/* Check whether it is safe to enable malloc checking, or whether
|
|
|
|
it is necessary to disable it. */
|
|
|
|
if (ms->using_malloc_checking && !using_malloc_checking &&
|
|
|
|
!disallow_malloc_check)
|
|
|
|
__malloc_check_init ();
|
|
|
|
else if (!ms->using_malloc_checking && using_malloc_checking)
|
|
|
|
{
|
|
|
|
__malloc_hook = NULL;
|
|
|
|
__free_hook = NULL;
|
|
|
|
__realloc_hook = NULL;
|
|
|
|
__memalign_hook = NULL;
|
|
|
|
using_malloc_checking = 0;
|
|
|
|
}
|
2002-01-29 07:54:51 +00:00
|
|
|
}
|
2014-01-02 08:38:18 +00:00
|
|
|
if (ms->version >= 4)
|
|
|
|
{
|
|
|
|
mp_.arena_test = ms->arena_test;
|
|
|
|
mp_.arena_max = ms->arena_max;
|
|
|
|
narenas = ms->narenas;
|
|
|
|
}
|
|
|
|
check_malloc_state (&main_arena);
|
|
|
|
|
|
|
|
(void) mutex_unlock (&main_arena.mutex);
|
2002-01-29 07:54:51 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Local variables:
|
|
|
|
* c-basic-offset: 2
|
|
|
|
* End:
|
|
|
|
*/
|