* Author:
* Dietmar Maurer (dietmar@ximian.com)
*
- * (C) 2001 Ximian, Inc.
+ * Copyright 2001-2003 Ximian, Inc (http://www.ximian.com)
+ * Copyright 2004-2009 Novell, Inc (http://www.novell.com)
*/
#include <config.h>
#include <string.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
#define MEM_ALIGN 8
+#if MONO_SMALL_CONFIG
+#define MONO_MEMPOOL_PAGESIZE 4096
+#define MONO_MEMPOOL_MINSIZE 256
+#else
#define MONO_MEMPOOL_PAGESIZE 8192
#define MONO_MEMPOOL_MINSIZE 512
+#endif
#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;
guint32 allocated;
} d;
};
+#endif
+
+static long total_bytes_allocated = 0;
/**
* mono_mempool_new:
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->pos = (guint8*)pool + sizeof (MonoMemPool);
pool->end = pool->pos + initial_size - sizeof (MonoMemPool);
pool->d.allocated = pool->size = initial_size;
+ total_bytes_allocated += initial_size;
return pool;
+#endif
}
/**
void
mono_mempool_destroy (MonoMemPool *pool)
{
+#ifdef MALLOC_ALLOCATION
+ mono_mempool_empty (pool);
+
+ g_free (pool);
+#else
MonoMemPool *p, *n;
+ total_bytes_allocated -= pool->d.allocated;
+
p = pool;
while (p) {
n = p->next;
g_free (p);
p = n;
}
+#endif
}
/**
void
mono_mempool_invalidate (MonoMemPool *pool)
{
+#ifdef MALLOC_ALLOCATION
+ g_assert_not_reached ();
+#else
MonoMemPool *p, *n;
p = pool;
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
}
/**
void
mono_mempool_stats (MonoMemPool *pool)
{
+#ifdef MALLOC_ALLOCATION
+ g_assert_not_reached ();
+#else
MonoMemPool *p;
int count = 0;
guint32 still_free = 0;
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 limit)
+mono_backtrace (int size)
{
- void *array[limit];
+ void *array[BACKTRACE_DEPTH];
char **names;
- int i;
- backtrace (array, limit);
- names = backtrace_symbols (array, limit);
- for (i = 1; i < limit; ++i) {
+ 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]);
}
- g_free (names);
+ free (names);
+ LeaveCriticalSection (&mempool_tracing_lock);
}
#endif
while (target < size) {
target += target / 2;
}
- if (target > MONO_MEMPOOL_PAGESIZE)
+ if (target > MONO_MEMPOOL_PAGESIZE && size <= 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 = (size + MEM_ALIGN - 1) & ~(MEM_ALIGN - 1);
+#ifdef MALLOC_ALLOCATION
+ {
+ Chunk *c = g_malloc (sizeof (Chunk) + size);
+
+ c->next = pool->chunks;
+ pool->chunks = c;
+ c->size = size;
+
+ pool->allocated += size;
+
+ rval = ((guint8*)c) + sizeof (Chunk);
+ }
+#else
rval = pool->pos;
pool->pos = (guint8*)rval + size;
#ifdef TRACE_ALLOCATIONS
if (pool == mono_get_corlib ()->mempool) {
- g_print ("Allocating %d bytes\n", size);
- mono_backtrace (7);
+ mono_backtrace (size);
}
#endif
if (G_UNLIKELY (pool->pos >= pool->end)) {
np->size = sizeof (MonoMemPool) + size;
np->end = np->pos + np->size - sizeof (MonoMemPool);
pool->d.allocated += sizeof (MonoMemPool) + size;
+ total_bytes_allocated += sizeof (MonoMemPool) + size;
return (guint8*)np + sizeof (MonoMemPool);
} else {
int new_size = get_next_size (pool, size);
np->end = np->pos;
pool->end = pool->pos + new_size - sizeof (MonoMemPool);
pool->d.allocated += new_size;
+ total_bytes_allocated += new_size;
rval = pool->pos;
pool->pos += size;
}
return rval;
+#endif
}
/**
mono_mempool_alloc0 (MonoMemPool *pool, guint size)
{
gpointer rval;
-
+
+#ifdef MALLOC_ALLOCATION
+ rval = mono_mempool_alloc (pool, size);
+#else
size = (size + MEM_ALIGN - 1) & ~(MEM_ALIGN - 1);
rval = pool->pos;
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 (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;
return TRUE;
p = p->next;
}
+#endif
return FALSE;
}
guint32
mono_mempool_get_allocated (MonoMemPool *pool)
{
+#ifdef MALLOC_ALLOCATION
+ return pool->allocated;
+#else
return pool->d.allocated;
+#endif
+}
+
+/**
+ * mono_mempool_get_bytes_allocated:
+ *
+ * Return the number of bytes currently allocated for mempools.
+ */
+long
+mono_mempool_get_bytes_allocated (void)
+{
+ return total_bytes_allocated;
}