+/*
+ * mempool.c: efficient memory allocation
+ *
+ * MonoMemPool is for fast allocation of memory. We free
+ * all memory when the pool is destroyed.
+ *
+ * Author:
+ * Dietmar Maurer (dietmar@ximian.com)
+ *
+ * (C) 2001 Ximian, Inc.
+ */
+
#include <config.h>
#include <glib.h>
+#include <string.h>
-#include "jit.h"
+#include "mempool.h"
+#include "mempool-internals.h"
+
+#if USE_MALLOC_FOR_MEMPOOLS
+#define MALLOC_ALLOCATION
+#endif
/*
* MonoMemPool is for fast allocation of memory. We free
* all memory when the pool is destroyed.
*/
-#if SIZEOF_VOID_P > SIZEOF_LONG
-#define MEM_ALIGN SIZEOF_VOID_P
-#else
-#define MEM_ALIGN SIZEOF_LONG
-#endif
+#define MEM_ALIGN 8
#define MONO_MEMPOOL_PAGESIZE 8192
+#define MONO_MEMPOOL_MINSIZE 512
+
+#ifndef G_LIKELY
+#define G_LIKELY(a) (a)
+#define G_UNLIKELY(a) (a)
+#endif
+
+#ifdef MALLOC_ALLOCATION
+typedef struct _Chunk {
+ struct _Chunk *next;
+ guint32 size;
+} Chunk;
+struct _MonoMemPool {
+ Chunk *chunks;
+ guint32 allocated;
+};
+#else
struct _MonoMemPool {
MonoMemPool *next;
gint rest;
- gpointer pos;
+ guint8 *pos, *end;
+ guint32 size;
+ union {
+ double pad; /* to assure proper alignment */
+ guint32 allocated;
+ } d;
};
+#endif
/**
* mono_mempool_new:
* Returns: a new memory pool.
*/
MonoMemPool *
-mono_mempool_new ()
+mono_mempool_new (void)
{
+ return mono_mempool_new_size (MONO_MEMPOOL_PAGESIZE);
+}
+
+MonoMemPool *
+mono_mempool_new_size (int initial_size)
+{
+#ifdef MALLOC_ALLOCATION
+ return g_new0 (MonoMemPool, 1);
+#else
+ MonoMemPool *pool;
+ if (initial_size < MONO_MEMPOOL_MINSIZE)
+ initial_size = MONO_MEMPOOL_MINSIZE;
+ pool = g_malloc (initial_size);
- MonoMemPool *pool = g_malloc (MONO_MEMPOOL_PAGESIZE);
pool->next = NULL;
- pool->pos = (gpointer)pool + sizeof (MonoMemPool);
- pool->rest = MONO_MEMPOOL_PAGESIZE - sizeof (MonoMemPool);
+ pool->pos = (guint8*)pool + sizeof (MonoMemPool);
+ pool->end = pool->pos + initial_size - sizeof (MonoMemPool);
+ pool->d.allocated = pool->size = initial_size;
return pool;
+#endif
}
/**
* mono_mempool_destroy:
- * @pool: the momory pool to destroy
+ * @pool: the memory pool to destroy
*
* Free all memory associated with this pool.
*/
void
mono_mempool_destroy (MonoMemPool *pool)
{
+#ifdef MALLOC_ALLOCATION
+ mono_mempool_empty (pool);
+
+ g_free (pool);
+#else
+ MonoMemPool *p, *n;
+
+ p = pool;
+ while (p) {
+ n = p->next;
+ g_free (p);
+ p = n;
+ }
+#endif
+}
+
+/**
+ * mono_mempool_invalidate:
+ * @pool: the memory pool to invalidate
+ *
+ * Fill the memory associated with this pool to 0x2a (42). Useful for debugging.
+ */
+void
+mono_mempool_invalidate (MonoMemPool *pool)
+{
+#ifdef MALLOC_ALLOCATION
+ g_assert_not_reached ();
+#else
MonoMemPool *p, *n;
p = pool;
+ while (p) {
+ n = p->next;
+ memset (p, 42, p->size);
+ p = n;
+ }
+#endif
+}
+
+void
+mono_mempool_empty (MonoMemPool *pool)
+{
+#ifdef MALLOC_ALLOCATION
+ Chunk *p, *n;
+
+ p = pool->chunks;
+ pool->chunks = NULL;
while (p) {
n = p->next;
g_free (p);
p = n;
}
+
+ pool->allocated = 0;
+#else
+ pool->pos = (guint8*)pool + sizeof (MonoMemPool);
+ pool->end = pool->pos + pool->size - sizeof (MonoMemPool);
+#endif
}
+/**
+ * mono_mempool_stats:
+ * @pool: the momory pool we need stats for
+ *
+ * Print a few stats about the mempool
+ */
+void
+mono_mempool_stats (MonoMemPool *pool)
+{
+#ifdef MALLOC_ALLOCATION
+ g_assert_not_reached ();
+#else
+ MonoMemPool *p;
+ int count = 0;
+ guint32 still_free = 0;
+
+ p = pool;
+ while (p) {
+ still_free += p->end - p->pos;
+ p = p->next;
+ count++;
+ }
+ if (pool) {
+ g_print ("Mempool %p stats:\n", pool);
+ g_print ("Total mem allocated: %d\n", pool->d.allocated);
+ g_print ("Num chunks: %d\n", count);
+ g_print ("Free memory: %d\n", still_free);
+ }
+#endif
+}
+
+#ifndef MALLOC_ALLOCATION
+#ifdef TRACE_ALLOCATIONS
+#include <execinfo.h>
+#include "metadata/appdomain.h"
+#include "metadata/metadata-internals.h"
+
+static CRITICAL_SECTION mempool_tracing_lock;
+#define BACKTRACE_DEPTH 7
+static void
+mono_backtrace (int size)
+{
+ void *array[BACKTRACE_DEPTH];
+ char **names;
+ int i, symbols;
+ static gboolean inited;
+
+ if (!inited) {
+ InitializeCriticalSection (&mempool_tracing_lock);
+ inited = TRUE;
+ }
+
+ EnterCriticalSection (&mempool_tracing_lock);
+ g_print ("Allocating %d bytes\n", size);
+ symbols = backtrace (array, BACKTRACE_DEPTH);
+ names = backtrace_symbols (array, symbols);
+ for (i = 1; i < symbols; ++i) {
+ g_print ("\t%s\n", names [i]);
+ }
+ free (names);
+ LeaveCriticalSection (&mempool_tracing_lock);
+}
+
+#endif
+
+static int
+get_next_size (MonoMemPool *pool, int size)
+{
+ int target = pool->next? pool->next->size: pool->size;
+ size += sizeof (MonoMemPool);
+ /* increase the size */
+ target += target / 2;
+ while (target < size) {
+ target += target / 2;
+ }
+ if (target > MONO_MEMPOOL_PAGESIZE)
+ target = MONO_MEMPOOL_PAGESIZE;
+ /* we are called with size smaller than 4096 */
+ g_assert (size <= MONO_MEMPOOL_PAGESIZE);
+ return target;
+}
+#endif
+
/**
* mono_mempool_alloc:
- * @pool: the momory pool to destroy
+ * @pool: the momory pool to use
* @size: size of the momory block
*
- * Allocates a new block of memory in @pool. @size must
- * be smaller than 256.
+ * Allocates a new block of memory in @pool.
*
* Returns: the address of a newly allocated memory block.
*/
mono_mempool_alloc (MonoMemPool *pool, guint size)
{
gpointer rval;
+
+ size = (size + MEM_ALIGN - 1) & ~(MEM_ALIGN - 1);
- g_assert (pool != NULL);
- g_assert (size < 256);
+#ifdef MALLOC_ALLOCATION
+ {
+ Chunk *c = g_malloc (sizeof (Chunk) + size);
- size = (size + MEM_ALIGN - 1) & ~(MEM_ALIGN - 1);
+ c->next = pool->chunks;
+ pool->chunks = c;
+ c->size = size;
- if (pool->rest < size) {
- MonoMemPool *np = g_malloc (MONO_MEMPOOL_PAGESIZE);
- np->next = pool->next;
- pool->next = np;
- pool->pos = (gpointer)np + sizeof (MonoMemPool);
- pool->rest = MONO_MEMPOOL_PAGESIZE - sizeof (MonoMemPool);
- }
+ pool->allocated += size;
+ rval = ((guint8*)c) + sizeof (Chunk);
+ }
+#else
rval = pool->pos;
- pool->rest -= size;
- pool->pos += size;
+ pool->pos = (guint8*)rval + size;
+
+#ifdef TRACE_ALLOCATIONS
+ if (pool == mono_get_corlib ()->mempool) {
+ mono_backtrace (size);
+ }
+#endif
+ if (G_UNLIKELY (pool->pos >= pool->end)) {
+ pool->pos -= size;
+ if (size >= 4096) {
+ MonoMemPool *np = g_malloc (sizeof (MonoMemPool) + size);
+ np->next = pool->next;
+ pool->next = np;
+ np->pos = (guint8*)np + sizeof (MonoMemPool);
+ np->size = sizeof (MonoMemPool) + size;
+ np->end = np->pos + np->size - sizeof (MonoMemPool);
+ pool->d.allocated += sizeof (MonoMemPool) + size;
+ return (guint8*)np + sizeof (MonoMemPool);
+ } else {
+ int new_size = get_next_size (pool, size);
+ MonoMemPool *np = g_malloc (new_size);
+ np->next = pool->next;
+ pool->next = np;
+ pool->pos = (guint8*)np + sizeof (MonoMemPool);
+ np->pos = (guint8*)np + sizeof (MonoMemPool);
+ np->size = new_size;
+ np->end = np->pos;
+ pool->end = pool->pos + new_size - sizeof (MonoMemPool);
+ pool->d.allocated += new_size;
+
+ rval = pool->pos;
+ pool->pos += size;
+ }
+ }
return rval;
+#endif
}
/**
gpointer
mono_mempool_alloc0 (MonoMemPool *pool, guint size)
{
- gpointer rval = mono_mempool_alloc (pool, size);
+ gpointer rval;
+
+#ifdef MALLOC_ALLOCATION
+ rval = mono_mempool_alloc (pool, size);
+#else
+ size = (size + MEM_ALIGN - 1) & ~(MEM_ALIGN - 1);
+
+ rval = pool->pos;
+ pool->pos = (guint8*)rval + size;
+
+ if (G_UNLIKELY (pool->pos >= pool->end)) {
+ rval = mono_mempool_alloc (pool, size);
+ }
+#ifdef TRACE_ALLOCATIONS
+ else if (pool == mono_get_corlib ()->mempool) {
+ mono_backtrace (size);
+ }
+#endif
+#endif
+
memset (rval, 0, size);
return rval;
}
+/**
+ * mono_mempool_contains_addr:
+ *
+ * Determines whenever ADDR is inside the memory used by the mempool.
+ */
+gboolean
+mono_mempool_contains_addr (MonoMemPool *pool,
+ gpointer addr)
+{
+#ifdef MALLOC_ALLOCATION
+ Chunk *c;
+
+ c = pool->chunks;
+ while (c) {
+ guint8 *p = ((guint8*)c) + sizeof (Chunk);
+
+ if (addr >= (gpointer)p && addr < (gpointer)(p + c->size))
+ return TRUE;
+
+ c = c->next;
+ }
+#else
+ MonoMemPool *p;
+
+ p = pool;
+ while (p) {
+ if (addr > (gpointer)p && addr <= (gpointer)((guint8*)p + p->size))
+ return TRUE;
+ p = p->next;
+ }
+#endif
+
+ return FALSE;
+}
+
+/**
+ * mono_mempool_strdup:
+ *
+ * Same as strdup, but allocates memory from the mempool.
+ * Returns: a pointer to the newly allocated string data inside the mempool.
+ */
+char*
+mono_mempool_strdup (MonoMemPool *pool,
+ const char *s)
+{
+ int l;
+ char *res;
+
+ if (s == NULL)
+ return NULL;
+
+ l = strlen (s);
+ res = mono_mempool_alloc (pool, l + 1);
+ memcpy (res, s, l + 1);
+
+ return res;
+}
+
+/**
+ * mono_mempool_get_allocated:
+ *
+ * Return the amount of memory allocated for this mempool.
+ */
+guint32
+mono_mempool_get_allocated (MonoMemPool *pool)
+{
+#ifdef MALLOC_ALLOCATION
+ return pool->allocated;
+#else
+ return pool->d.allocated;
+#endif
+}
+
+GList*
+g_list_prepend_mempool (MonoMemPool *mp, GList *list, gpointer data)
+{
+ GList *new_list;
+
+ new_list = mono_mempool_alloc (mp, sizeof (GList));
+ new_list->data = data;
+ new_list->prev = list ? list->prev : NULL;
+ new_list->next = list;
+
+ if (new_list->prev)
+ new_list->prev->next = new_list;
+ if (list)
+ list->prev = new_list;
+
+ return new_list;
+}
+
+GSList*
+g_slist_prepend_mempool (MonoMemPool *mp, GSList *list, gpointer data)
+{
+ GSList *new_list;
+
+ new_list = mono_mempool_alloc (mp, sizeof (GSList));
+ new_list->data = data;
+ new_list->next = list;
+
+ return new_list;
+}
+
+GSList*
+g_slist_append_mempool (MonoMemPool *mp, GSList *list, gpointer data)
+{
+ GSList *new_list;
+ GSList *last;
+
+ new_list = mono_mempool_alloc (mp, sizeof (GSList));
+ new_list->data = data;
+ new_list->next = NULL;
+
+ if (list) {
+ last = list;
+ while (last->next)
+ last = last->next;
+ last->next = new_list;
+
+ return list;
+ } else
+ return new_list;
+}
projects / mono.git / blobdiff