* Dietmar Maurer (dietmar@ximian.com)
* Patrik Torstensson
*
- * (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 <sys/stat.h>
-#include <mono/os/gc_wrapper.h>
+#include <mono/metadata/gc-internal.h>
#include <mono/utils/mono-compiler.h>
#include <mono/utils/mono-logger.h>
+#include <mono/utils/mono-membar.h>
+#include <mono/utils/mono-counters.h>
#include <mono/metadata/object.h>
#include <mono/metadata/object-internals.h>
#include <mono/metadata/domain-internals.h>
#include <mono/metadata/class-internals.h>
#include <mono/metadata/assembly.h>
#include <mono/metadata/exception.h>
-#include <mono/metadata/cil-coff.h>
-#include <mono/metadata/rawbuffer.h>
#include <mono/metadata/metadata-internals.h>
#include <mono/metadata/gc-internal.h>
#include <mono/metadata/appdomain.h>
#include <mono/metadata/mono-config.h>
#include <mono/metadata/threads-types.h>
#include <metadata/threads.h>
+#include <metadata/profiler-private.h>
+#include <mono/metadata/coree.h>
/* #define DEBUG_DOMAIN_UNLOAD */
* but we can't depend on this).
*/
static guint32 appdomain_thread_id = -1;
+
+/*
+ * Avoid calling TlsSetValue () if possible, since in the io-layer, it acquires
+ * a global lock (!) so it is a contention point.
+ */
+#if (defined(__i386__) || defined(__x86_64__)) && !defined(PLATFORM_WIN32)
+#define NO_TLS_SET_VALUE
+#endif
#ifdef HAVE_KW_THREAD
+
static __thread MonoDomain * tls_appdomain MONO_TLS_FAST;
+
#define GET_APPDOMAIN() tls_appdomain
+
+#ifdef NO_TLS_SET_VALUE
+#define SET_APPDOMAIN(x) do { \
+ tls_appdomain = x; \
+} while (FALSE)
+#else
#define SET_APPDOMAIN(x) do { \
tls_appdomain = x; \
TlsSetValue (appdomain_thread_id, x); \
} while (FALSE)
+#endif
-#else
+#else /* !HAVE_KW_THREAD */
#define GET_APPDOMAIN() ((MonoDomain *)TlsGetValue (appdomain_thread_id))
#define SET_APPDOMAIN(x) TlsSetValue (appdomain_thread_id, x);
static guint16 appdomain_list_size = 0;
static guint16 appdomain_next = 0;
static MonoDomain **appdomains_list = NULL;
+static MonoImage *exe_image;
+
+gboolean mono_dont_free_domains;
#define mono_appdomains_lock() EnterCriticalSection (&appdomains_mutex)
#define mono_appdomains_unlock() LeaveCriticalSection (&appdomains_mutex)
static MonoDomain *mono_root_domain = NULL;
+/* some statistics */
+static int max_domain_code_size = 0;
+static int max_domain_code_alloc = 0;
+static int total_domain_code_alloc = 0;
+
/* AppConfigInfo: Information about runtime versions supported by an
* aplication.
*/
/*
* Contains information about AOT loaded code.
*/
-static MonoJitInfoTable *aot_modules = NULL;
+static MonoAotModuleInfoTable *aot_modules = NULL;
/* This is the list of runtime versions supported by this JIT.
*/
{"v1.0.3705", "1.0", { {1,0,5000,0}, {7,0,5000,0} } },
{"v1.1.4322", "1.0", { {1,0,5000,0}, {7,0,5000,0} } },
{"v2.0.50215","2.0", { {2,0,0,0}, {8,0,0,0} } },
- {"v2.0.50727","2.0", { {2,0,0,0}, {8,0,0,0} } }
+ {"v2.0.50727","2.0", { {2,0,0,0}, {8,0,0,0} } },
+ {"v4.0.20506","4.0", { {4,0,0,0}, {10,0,0,0} } },
+ {"moonlight", "2.1", { {2,0,5,0}, {9,0,0,0} } },
};
/* The stable runtime version */
#define DEFAULT_RUNTIME_VERSION "v1.1.4322"
+/* Callbacks installed by the JIT */
+static MonoCreateDomainFunc create_domain_hook;
+static MonoFreeDomainFunc free_domain_hook;
+
+/* This is intentionally not in the header file, so people don't misuse it. */
+extern void _mono_debug_init_corlib (MonoDomain *domain);
+
static void
-get_runtimes_from_exe (const char *exe_file, const MonoRuntimeInfo** runtimes);
+get_runtimes_from_exe (const char *exe_file, MonoImage **exe_image, const MonoRuntimeInfo** runtimes);
static const MonoRuntimeInfo*
get_runtime_by_version (const char *version);
guint32
mono_domain_get_tls_key (void)
{
+#ifdef NO_TLS_SET_VALUE
+ g_assert_not_reached ();
+ return 0;
+#else
return appdomain_thread_id;
+#endif
}
gint32
return offset;
}
+#define JIT_INFO_TABLE_FILL_RATIO_NOM 3
+#define JIT_INFO_TABLE_FILL_RATIO_DENOM 4
+#define JIT_INFO_TABLE_FILLED_NUM_ELEMENTS (MONO_JIT_INFO_TABLE_CHUNK_SIZE * JIT_INFO_TABLE_FILL_RATIO_NOM / JIT_INFO_TABLE_FILL_RATIO_DENOM)
+
+#define JIT_INFO_TABLE_LOW_WATERMARK(n) ((n) / 2)
+#define JIT_INFO_TABLE_HIGH_WATERMARK(n) ((n) * 5 / 6)
+
+#define JIT_INFO_TOMBSTONE_MARKER ((MonoMethod*)NULL)
+#define IS_JIT_INFO_TOMBSTONE(ji) ((ji)->method == JIT_INFO_TOMBSTONE_MARKER)
+
+#define JIT_INFO_TABLE_HAZARD_INDEX 0
+#define JIT_INFO_HAZARD_INDEX 1
+
+static int
+jit_info_table_num_elements (MonoJitInfoTable *table)
+{
+ int i;
+ int num_elements = 0;
+
+ for (i = 0; i < table->num_chunks; ++i) {
+ MonoJitInfoTableChunk *chunk = table->chunks [i];
+ int chunk_num_elements = chunk->num_elements;
+ int j;
+
+ for (j = 0; j < chunk_num_elements; ++j) {
+ if (!IS_JIT_INFO_TOMBSTONE (chunk->data [j]))
+ ++num_elements;
+ }
+ }
+
+ return num_elements;
+}
+
+static MonoJitInfoTableChunk*
+jit_info_table_new_chunk (void)
+{
+ MonoJitInfoTableChunk *chunk = g_new0 (MonoJitInfoTableChunk, 1);
+ chunk->refcount = 1;
+
+ return chunk;
+}
+
static MonoJitInfoTable *
-mono_jit_info_table_new (void)
+jit_info_table_new (MonoDomain *domain)
{
- return g_array_new (FALSE, FALSE, sizeof (gpointer));
+ MonoJitInfoTable *table = g_malloc0 (sizeof (MonoJitInfoTable) + sizeof (MonoJitInfoTableChunk*));
+
+ table->domain = domain;
+ table->num_chunks = 1;
+ table->chunks [0] = jit_info_table_new_chunk ();
+
+ return table;
}
static void
-mono_jit_info_table_free (MonoJitInfoTable *table)
+jit_info_table_free (MonoJitInfoTable *table)
+{
+ int i;
+ int num_chunks = table->num_chunks;
+ MonoDomain *domain = table->domain;
+
+ mono_domain_lock (domain);
+
+ table->domain->num_jit_info_tables--;
+ if (table->domain->num_jit_info_tables <= 1) {
+ GSList *list;
+
+ for (list = table->domain->jit_info_free_queue; list; list = list->next)
+ g_free (list->data);
+
+ g_slist_free (table->domain->jit_info_free_queue);
+ table->domain->jit_info_free_queue = NULL;
+ }
+
+ /* At this point we assume that there are no other threads
+ still accessing the table, so we don't have to worry about
+ hazardous pointers. */
+
+ for (i = 0; i < num_chunks; ++i) {
+ MonoJitInfoTableChunk *chunk = table->chunks [i];
+ int num_elements;
+ int j;
+
+ if (--chunk->refcount > 0)
+ continue;
+
+ num_elements = chunk->num_elements;
+ for (j = 0; j < num_elements; ++j) {
+ MonoJitInfo *ji = chunk->data [j];
+
+ if (IS_JIT_INFO_TOMBSTONE (ji))
+ g_free (ji);
+ }
+
+ g_free (chunk);
+ }
+
+ mono_domain_unlock (domain);
+
+ g_free (table);
+}
+
+/* Can be called with hp==NULL, in which case it acts as an ordinary
+ pointer fetch. It's used that way indirectly from
+ mono_jit_info_table_add(), which doesn't have to care about hazards
+ because it holds the respective domain lock. */
+static gpointer
+get_hazardous_pointer (gpointer volatile *pp, MonoThreadHazardPointers *hp, int hazard_index)
+{
+ gpointer p;
+
+ for (;;) {
+ /* Get the pointer */
+ p = *pp;
+ /* If we don't have hazard pointers just return the
+ pointer. */
+ if (!hp)
+ return p;
+ /* Make it hazardous */
+ mono_hazard_pointer_set (hp, hazard_index, p);
+ /* Check that it's still the same. If not, try
+ again. */
+ if (*pp != p) {
+ mono_hazard_pointer_clear (hp, hazard_index);
+ continue;
+ }
+ break;
+ }
+
+ return p;
+}
+
+/* The jit_info_table is sorted in ascending order by the end
+ * addresses of the compiled methods. The reason why we have to do
+ * this is that once we introduce tombstones, it becomes possible for
+ * code ranges to overlap, and if we sort by code start and insert at
+ * the back of the table, we cannot guarantee that we won't overlook
+ * an entry.
+ *
+ * There are actually two possible ways to do the sorting and
+ * inserting which work with our lock-free mechanism:
+ *
+ * 1. Sort by start address and insert at the front. When looking for
+ * an entry, find the last one with a start address lower than the one
+ * you're looking for, then work your way to the front of the table.
+ *
+ * 2. Sort by end address and insert at the back. When looking for an
+ * entry, find the first one with an end address higher than the one
+ * you're looking for, then work your way to the end of the table.
+ *
+ * We chose the latter out of convenience.
+ */
+static int
+jit_info_table_index (MonoJitInfoTable *table, gint8 *addr)
{
- g_array_free (table, TRUE);
+ int left = 0, right = table->num_chunks;
+
+ g_assert (left < right);
+
+ do {
+ int pos = (left + right) / 2;
+ MonoJitInfoTableChunk *chunk = table->chunks [pos];
+
+ if (addr < chunk->last_code_end)
+ right = pos;
+ else
+ left = pos + 1;
+ } while (left < right);
+ g_assert (left == right);
+
+ if (left >= table->num_chunks)
+ return table->num_chunks - 1;
+ return left;
}
static int
-mono_jit_info_table_index (MonoJitInfoTable *table, char *addr)
+jit_info_table_chunk_index (MonoJitInfoTableChunk *chunk, MonoThreadHazardPointers *hp, gint8 *addr)
{
- int left = 0, right = table->len;
+ int left = 0, right = chunk->num_elements;
while (left < right) {
int pos = (left + right) / 2;
- MonoJitInfo *ji = g_array_index (table, gpointer, pos);
- char *start = ji->code_start;
- char *end = start + ji->code_size;
+ MonoJitInfo *ji = get_hazardous_pointer((gpointer volatile*)&chunk->data [pos], hp, JIT_INFO_HAZARD_INDEX);
+ gint8 *code_end = (gint8*)ji->code_start + ji->code_size;
- if (addr < start)
+ if (addr < code_end)
right = pos;
- else if (addr >= end)
- left = pos + 1;
else
- return pos;
+ left = pos + 1;
}
+ g_assert (left == right);
return left;
}
-MonoJitInfo *
+MonoJitInfo*
mono_jit_info_table_find (MonoDomain *domain, char *addr)
{
- MonoJitInfoTable *table = domain->jit_info_table;
+ MonoJitInfoTable *table;
MonoJitInfo *ji;
- guint left = 0, right;
+ int chunk_pos, pos;
+ MonoThreadHazardPointers *hp = mono_hazard_pointer_get ();
+
+ ++mono_stats.jit_info_table_lookup_count;
+
+ /* First we have to get the domain's jit_info_table. This is
+ complicated by the fact that a writer might substitute a
+ new table and free the old one. What the writer guarantees
+ us is that it looks at the hazard pointers after it has
+ changed the jit_info_table pointer. So, if we guard the
+ table by a hazard pointer and make sure that the pointer is
+ still there after we've made it hazardous, we don't have to
+ worry about the writer freeing the table. */
+ table = get_hazardous_pointer ((gpointer volatile*)&domain->jit_info_table, hp, JIT_INFO_TABLE_HAZARD_INDEX);
+
+ chunk_pos = jit_info_table_index (table, (gint8*)addr);
+ g_assert (chunk_pos < table->num_chunks);
+
+ pos = jit_info_table_chunk_index (table->chunks [chunk_pos], hp, (gint8*)addr);
+
+ /* We now have a position that's very close to that of the
+ first element whose end address is higher than the one
+ we're looking for. If we don't have the exact position,
+ then we have a position below that one, so we'll just
+ search upward until we find our element. */
+ do {
+ MonoJitInfoTableChunk *chunk = table->chunks [chunk_pos];
+
+ while (pos < chunk->num_elements) {
+ ji = get_hazardous_pointer ((gpointer volatile*)&chunk->data [pos], hp, JIT_INFO_HAZARD_INDEX);
+
+ ++pos;
+
+ if (IS_JIT_INFO_TOMBSTONE (ji)) {
+ mono_hazard_pointer_clear (hp, JIT_INFO_HAZARD_INDEX);
+ continue;
+ }
+ if ((gint8*)addr >= (gint8*)ji->code_start
+ && (gint8*)addr < (gint8*)ji->code_start + ji->code_size) {
+ mono_hazard_pointer_clear (hp, JIT_INFO_TABLE_HAZARD_INDEX);
+ mono_hazard_pointer_clear (hp, JIT_INFO_HAZARD_INDEX);
+ return ji;
+ }
- mono_domain_lock (domain);
+ /* If we find a non-tombstone element which is already
+ beyond what we're looking for, we have to end the
+ search. */
+ if ((gint8*)addr < (gint8*)ji->code_start)
+ goto not_found;
+ }
- right = table->len;
- while (left < right) {
- guint pos = (left + right) / 2;
- ji = g_array_index (table, gpointer, pos);
+ ++chunk_pos;
+ pos = 0;
+ } while (chunk_pos < table->num_chunks);
- if (addr < (char*)ji->code_start)
- right = pos;
- else if (addr >= (char*)ji->code_start + ji->code_size)
- left = pos + 1;
- else {
- mono_domain_unlock (domain);
- return ji;
- }
- }
- mono_domain_unlock (domain);
+ not_found:
+ mono_hazard_pointer_clear (hp, JIT_INFO_TABLE_HAZARD_INDEX);
+ mono_hazard_pointer_clear (hp, JIT_INFO_HAZARD_INDEX);
/* maybe it is shared code, so we also search in the root domain */
ji = NULL;
return ji;
}
+static G_GNUC_UNUSED void
+jit_info_table_check (MonoJitInfoTable *table)
+{
+ int i;
+
+ for (i = 0; i < table->num_chunks; ++i) {
+ MonoJitInfoTableChunk *chunk = table->chunks [i];
+ int j;
+
+ g_assert (chunk->refcount > 0 /* && chunk->refcount <= 8 */);
+ if (chunk->refcount > 10)
+ printf("warning: chunk refcount is %d\n", chunk->refcount);
+ g_assert (chunk->num_elements <= MONO_JIT_INFO_TABLE_CHUNK_SIZE);
+
+ for (j = 0; j < chunk->num_elements; ++j) {
+ MonoJitInfo *this = chunk->data [j];
+ MonoJitInfo *next;
+
+ g_assert ((gint8*)this->code_start + this->code_size <= chunk->last_code_end);
+
+ if (j < chunk->num_elements - 1)
+ next = chunk->data [j + 1];
+ else if (i < table->num_chunks - 1) {
+ int k;
+
+ for (k = i + 1; k < table->num_chunks; ++k)
+ if (table->chunks [k]->num_elements > 0)
+ break;
+
+ if (k >= table->num_chunks)
+ return;
+
+ g_assert (table->chunks [k]->num_elements > 0);
+ next = table->chunks [k]->data [0];
+ } else
+ return;
+
+ g_assert ((gint8*)this->code_start + this->code_size <= (gint8*)next->code_start + next->code_size);
+ }
+ }
+}
+
+static MonoJitInfoTable*
+jit_info_table_realloc (MonoJitInfoTable *old)
+{
+ int i;
+ int num_elements = jit_info_table_num_elements (old);
+ int required_size;
+ int num_chunks;
+ int new_chunk, new_element;
+ MonoJitInfoTable *new;
+
+ /* number of needed places for elements needed */
+ required_size = (int)((long)num_elements * JIT_INFO_TABLE_FILL_RATIO_DENOM / JIT_INFO_TABLE_FILL_RATIO_NOM);
+ num_chunks = (required_size + MONO_JIT_INFO_TABLE_CHUNK_SIZE - 1) / MONO_JIT_INFO_TABLE_CHUNK_SIZE;
+
+ new = g_malloc (sizeof (MonoJitInfoTable) + sizeof (MonoJitInfoTableChunk*) * num_chunks);
+ new->domain = old->domain;
+ new->num_chunks = num_chunks;
+
+ for (i = 0; i < num_chunks; ++i)
+ new->chunks [i] = jit_info_table_new_chunk ();
+
+ new_chunk = 0;
+ new_element = 0;
+ for (i = 0; i < old->num_chunks; ++i) {
+ MonoJitInfoTableChunk *chunk = old->chunks [i];
+ int chunk_num_elements = chunk->num_elements;
+ int j;
+
+ for (j = 0; j < chunk_num_elements; ++j) {
+ if (!IS_JIT_INFO_TOMBSTONE (chunk->data [j])) {
+ g_assert (new_chunk < num_chunks);
+ new->chunks [new_chunk]->data [new_element] = chunk->data [j];
+ if (++new_element >= JIT_INFO_TABLE_FILLED_NUM_ELEMENTS) {
+ new->chunks [new_chunk]->num_elements = new_element;
+ ++new_chunk;
+ new_element = 0;
+ }
+ }
+ }
+ }
+
+ if (new_chunk < num_chunks) {
+ g_assert (new_chunk == num_chunks - 1);
+ new->chunks [new_chunk]->num_elements = new_element;
+ g_assert (new->chunks [new_chunk]->num_elements > 0);
+ }
+
+ for (i = 0; i < num_chunks; ++i) {
+ MonoJitInfoTableChunk *chunk = new->chunks [i];
+ MonoJitInfo *ji = chunk->data [chunk->num_elements - 1];
+
+ new->chunks [i]->last_code_end = (gint8*)ji->code_start + ji->code_size;
+ }
+
+ return new;
+}
+
+static void
+jit_info_table_split_chunk (MonoJitInfoTableChunk *chunk, MonoJitInfoTableChunk **new1p, MonoJitInfoTableChunk **new2p)
+{
+ MonoJitInfoTableChunk *new1 = jit_info_table_new_chunk ();
+ MonoJitInfoTableChunk *new2 = jit_info_table_new_chunk ();
+
+ g_assert (chunk->num_elements == MONO_JIT_INFO_TABLE_CHUNK_SIZE);
+
+ new1->num_elements = MONO_JIT_INFO_TABLE_CHUNK_SIZE / 2;
+ new2->num_elements = MONO_JIT_INFO_TABLE_CHUNK_SIZE - new1->num_elements;
+
+ memcpy ((void*)new1->data, (void*)chunk->data, sizeof (MonoJitInfo*) * new1->num_elements);
+ memcpy ((void*)new2->data, (void*)(chunk->data + new1->num_elements), sizeof (MonoJitInfo*) * new2->num_elements);
+
+ new1->last_code_end = (gint8*)new1->data [new1->num_elements - 1]->code_start
+ + new1->data [new1->num_elements - 1]->code_size;
+ new2->last_code_end = (gint8*)new2->data [new2->num_elements - 1]->code_start
+ + new2->data [new2->num_elements - 1]->code_size;
+
+ *new1p = new1;
+ *new2p = new2;
+}
+
+static MonoJitInfoTable*
+jit_info_table_copy_and_split_chunk (MonoJitInfoTable *table, MonoJitInfoTableChunk *chunk)
+{
+ MonoJitInfoTable *new_table = g_malloc (sizeof (MonoJitInfoTable)
+ + sizeof (MonoJitInfoTableChunk*) * (table->num_chunks + 1));
+ int i, j;
+
+ new_table->domain = table->domain;
+ new_table->num_chunks = table->num_chunks + 1;
+
+ j = 0;
+ for (i = 0; i < table->num_chunks; ++i) {
+ if (table->chunks [i] == chunk) {
+ jit_info_table_split_chunk (chunk, &new_table->chunks [j], &new_table->chunks [j + 1]);
+ j += 2;
+ } else {
+ new_table->chunks [j] = table->chunks [i];
+ ++new_table->chunks [j]->refcount;
+ ++j;
+ }
+ }
+
+ g_assert (j == new_table->num_chunks);
+
+ return new_table;
+}
+
+static MonoJitInfoTableChunk*
+jit_info_table_purify_chunk (MonoJitInfoTableChunk *old)
+{
+ MonoJitInfoTableChunk *new = jit_info_table_new_chunk ();
+ int i, j;
+
+ j = 0;
+ for (i = 0; i < old->num_elements; ++i) {
+ if (!IS_JIT_INFO_TOMBSTONE (old->data [i]))
+ new->data [j++] = old->data [i];
+ }
+
+ new->num_elements = j;
+ if (new->num_elements > 0)
+ new->last_code_end = (gint8*)new->data [j - 1]->code_start + new->data [j - 1]->code_size;
+ else
+ new->last_code_end = old->last_code_end;
+
+ return new;
+}
+
+static MonoJitInfoTable*
+jit_info_table_copy_and_purify_chunk (MonoJitInfoTable *table, MonoJitInfoTableChunk *chunk)
+{
+ MonoJitInfoTable *new_table = g_malloc (sizeof (MonoJitInfoTable)
+ + sizeof (MonoJitInfoTableChunk*) * table->num_chunks);
+ int i, j;
+
+ new_table->domain = table->domain;
+ new_table->num_chunks = table->num_chunks;
+
+ j = 0;
+ for (i = 0; i < table->num_chunks; ++i) {
+ if (table->chunks [i] == chunk)
+ new_table->chunks [j++] = jit_info_table_purify_chunk (table->chunks [i]);
+ else {
+ new_table->chunks [j] = table->chunks [i];
+ ++new_table->chunks [j]->refcount;
+ ++j;
+ }
+ }
+
+ g_assert (j == new_table->num_chunks);
+
+ return new_table;
+}
+
+/* As we add an element to the table the case can arise that the chunk
+ * to which we need to add is already full. In that case we have to
+ * allocate a new table and do something about that chunk. We have
+ * several strategies:
+ *
+ * If the number of elements in the table is below the low watermark
+ * or above the high watermark, we reallocate the whole table.
+ * Otherwise we only concern ourselves with the overflowing chunk:
+ *
+ * If there are no tombstones in the chunk then we split the chunk in
+ * two, each half full.
+ *
+ * If the chunk does contain tombstones, we just make a new copy of
+ * the chunk without the tombstones, which will have room for at least
+ * the one element we have to add.
+ */
+static MonoJitInfoTable*
+jit_info_table_chunk_overflow (MonoJitInfoTable *table, MonoJitInfoTableChunk *chunk)
+{
+ int num_elements = jit_info_table_num_elements (table);
+ int i;
+
+ if (num_elements < JIT_INFO_TABLE_LOW_WATERMARK (table->num_chunks * MONO_JIT_INFO_TABLE_CHUNK_SIZE)
+ || num_elements > JIT_INFO_TABLE_HIGH_WATERMARK (table->num_chunks * MONO_JIT_INFO_TABLE_CHUNK_SIZE)) {
+ //printf ("reallocing table\n");
+ return jit_info_table_realloc (table);
+ }
+
+ /* count the number of non-tombstone elements in the chunk */
+ num_elements = 0;
+ for (i = 0; i < chunk->num_elements; ++i) {
+ if (!IS_JIT_INFO_TOMBSTONE (chunk->data [i]))
+ ++num_elements;
+ }
+
+ if (num_elements == MONO_JIT_INFO_TABLE_CHUNK_SIZE) {
+ //printf ("splitting chunk\n");
+ return jit_info_table_copy_and_split_chunk (table, chunk);
+ }
+
+ //printf ("purifying chunk\n");
+ return jit_info_table_copy_and_purify_chunk (table, chunk);
+}
+
+/* We add elements to the table by first making space for them by
+ * shifting the elements at the back to the right, one at a time.
+ * This results in duplicate entries during the process, but during
+ * all the time the table is in a sorted state. Also, when an element
+ * is replaced by another one, the element that replaces it has an end
+ * address that is equal to or lower than that of the replaced
+ * element. That property is necessary to guarantee that when
+ * searching for an element we end up at a position not higher than
+ * the one we're looking for (i.e. we either find the element directly
+ * or we end up to the left of it).
+ */
void
mono_jit_info_table_add (MonoDomain *domain, MonoJitInfo *ji)
{
- MonoJitInfoTable *table = domain->jit_info_table;
- gpointer start = ji->code_start;
- int pos;
+ MonoJitInfoTable *table;
+ int chunk_pos, pos;
+ MonoJitInfoTableChunk *chunk;
+ int num_elements;
+ int i;
+
+ g_assert (ji->method != NULL);
mono_domain_lock (domain);
- pos = mono_jit_info_table_index (table, start);
- g_array_insert_val (table, pos, ji);
+ ++mono_stats.jit_info_table_insert_count;
+
+ table = domain->jit_info_table;
+
+ restart:
+ chunk_pos = jit_info_table_index (table, (gint8*)ji->code_start + ji->code_size);
+ g_assert (chunk_pos < table->num_chunks);
+ chunk = table->chunks [chunk_pos];
+
+ if (chunk->num_elements >= MONO_JIT_INFO_TABLE_CHUNK_SIZE) {
+ MonoJitInfoTable *new_table = jit_info_table_chunk_overflow (table, chunk);
+
+ /* Debugging code, should be removed. */
+ //jit_info_table_check (new_table);
+
+ domain->jit_info_table = new_table;
+ mono_memory_barrier ();
+ domain->num_jit_info_tables++;
+ mono_thread_hazardous_free_or_queue (table, (MonoHazardousFreeFunc)jit_info_table_free);
+ table = new_table;
+
+ goto restart;
+ }
+
+ /* Debugging code, should be removed. */
+ //jit_info_table_check (table);
+
+ num_elements = chunk->num_elements;
+
+ pos = jit_info_table_chunk_index (chunk, NULL, (gint8*)ji->code_start + ji->code_size);
+
+ /* First we need to size up the chunk by one, by copying the
+ last item, or inserting the first one, if the table is
+ empty. */
+ if (num_elements > 0)
+ chunk->data [num_elements] = chunk->data [num_elements - 1];
+ else
+ chunk->data [0] = ji;
+ mono_memory_write_barrier ();
+ chunk->num_elements = ++num_elements;
+
+ /* Shift the elements up one by one. */
+ for (i = num_elements - 2; i >= pos; --i) {
+ mono_memory_write_barrier ();
+ chunk->data [i + 1] = chunk->data [i];
+ }
+
+ /* Now we have room and can insert the new item. */
+ mono_memory_write_barrier ();
+ chunk->data [pos] = ji;
+
+ /* Set the high code end address chunk entry. */
+ chunk->last_code_end = (gint8*)chunk->data [chunk->num_elements - 1]->code_start
+ + chunk->data [chunk->num_elements - 1]->code_size;
+
+ /* Debugging code, should be removed. */
+ //jit_info_table_check (table);
+
mono_domain_unlock (domain);
}
+static MonoJitInfo*
+mono_jit_info_make_tombstone (MonoJitInfo *ji)
+{
+ MonoJitInfo *tombstone = g_new0 (MonoJitInfo, 1);
+
+ tombstone->code_start = ji->code_start;
+ tombstone->code_size = ji->code_size;
+ tombstone->method = JIT_INFO_TOMBSTONE_MARKER;
+
+ return tombstone;
+}
+
+/*
+ * LOCKING: domain lock
+ */
+static void
+mono_jit_info_free_or_queue (MonoDomain *domain, MonoJitInfo *ji)
+{
+ if (domain->num_jit_info_tables <= 1) {
+ /* Can it actually happen that we only have one table
+ but ji is still hazardous? */
+ mono_thread_hazardous_free_or_queue (ji, g_free);
+ } else {
+ domain->jit_info_free_queue = g_slist_prepend (domain->jit_info_free_queue, ji);
+ }
+}
+
void
mono_jit_info_table_remove (MonoDomain *domain, MonoJitInfo *ji)
{
- MonoJitInfoTable *table = domain->jit_info_table;
+ MonoJitInfoTable *table;
+ MonoJitInfoTableChunk *chunk;
gpointer start = ji->code_start;
- int pos;
+ int chunk_pos, pos;
mono_domain_lock (domain);
- pos = mono_jit_info_table_index (table, start);
- if (g_array_index (table, gpointer, pos) != ji) {
- MonoJitInfo *ji2 = g_array_index (table, gpointer, pos);
- g_assert (ji == ji2);
- }
- g_assert (g_array_index (table, gpointer, pos) == ji);
+ table = domain->jit_info_table;
+
+ ++mono_stats.jit_info_table_remove_count;
+
+ chunk_pos = jit_info_table_index (table, start);
+ g_assert (chunk_pos < table->num_chunks);
+
+ pos = jit_info_table_chunk_index (table->chunks [chunk_pos], NULL, start);
+
+ do {
+ chunk = table->chunks [chunk_pos];
+
+ while (pos < chunk->num_elements) {
+ if (chunk->data [pos] == ji)
+ goto found;
+
+ g_assert (IS_JIT_INFO_TOMBSTONE (chunk->data [pos]));
+ g_assert ((guint8*)chunk->data [pos]->code_start + chunk->data [pos]->code_size
+ <= (guint8*)ji->code_start + ji->code_size);
+
+ ++pos;
+ }
+
+ ++chunk_pos;
+ pos = 0;
+ } while (chunk_pos < table->num_chunks);
+
+ found:
+ g_assert (chunk->data [pos] == ji);
+
+ chunk->data [pos] = mono_jit_info_make_tombstone (ji);
+
+ /* Debugging code, should be removed. */
+ //jit_info_table_check (table);
+
+ mono_jit_info_free_or_queue (domain, ji);
- g_array_remove_index (table, pos);
mono_domain_unlock (domain);
-}
+}
+
+static MonoAotModuleInfoTable*
+mono_aot_module_info_table_new (void)
+{
+ return g_array_new (FALSE, FALSE, sizeof (gpointer));
+}
static int
-aot_info_table_index (MonoJitInfoTable *table, char *addr)
+aot_info_table_index (MonoAotModuleInfoTable *table, char *addr)
{
int left = 0, right = table->len;
mono_appdomains_lock ();
if (!aot_modules)
- aot_modules = mono_jit_info_table_new ();
+ aot_modules = mono_aot_module_info_table_new ();
pos = aot_info_table_index (aot_modules, start);
jit_info_next_value);
}
+MonoGenericJitInfo*
+mono_jit_info_get_generic_jit_info (MonoJitInfo *ji)
+{
+ if (ji->has_generic_jit_info)
+ return (MonoGenericJitInfo*)&ji->clauses [ji->num_clauses];
+ else
+ return NULL;
+}
+
+/*
+ * mono_jit_info_get_generic_sharing_context:
+ * @ji: a jit info
+ *
+ * Returns the jit info's generic sharing context, or NULL if it
+ * doesn't have one.
+ */
+MonoGenericSharingContext*
+mono_jit_info_get_generic_sharing_context (MonoJitInfo *ji)
+{
+ MonoGenericJitInfo *gi = mono_jit_info_get_generic_jit_info (ji);
+
+ if (gi)
+ return gi->generic_sharing_context;
+ else
+ return NULL;
+}
+
+/*
+ * mono_jit_info_set_generic_sharing_context:
+ * @ji: a jit info
+ * @gsctx: a generic sharing context
+ *
+ * Sets the jit info's generic sharing context. The jit info must
+ * have memory allocated for the context.
+ */
+void
+mono_jit_info_set_generic_sharing_context (MonoJitInfo *ji, MonoGenericSharingContext *gsctx)
+{
+ MonoGenericJitInfo *gi = mono_jit_info_get_generic_jit_info (ji);
+
+ g_assert (gi);
+
+ gi->generic_sharing_context = gsctx;
+}
+
+void
+mono_install_create_domain_hook (MonoCreateDomainFunc func)
+{
+ create_domain_hook = func;
+}
+
+void
+mono_install_free_domain_hook (MonoFreeDomainFunc func)
+{
+ free_domain_hook = func;
+}
+
/**
* mono_string_equal:
* @s1: First string to compare
bit = i / sizeof (gpointer);
domain_gc_bitmap [bit / 32] |= 1 << (bit % 32);
}
- domain_gc_desc = mono_gc_make_descr_from_bitmap (domain_gc_bitmap, bit + 1);
+ domain_gc_desc = mono_gc_make_descr_from_bitmap ((gsize*)domain_gc_bitmap, bit + 1);
}
mono_appdomains_unlock ();
domain->friendly_name = NULL;
domain->search_path = NULL;
+ mono_gc_register_root ((char*)&(domain->MONO_DOMAIN_FIRST_GC_TRACKED), G_STRUCT_OFFSET (MonoDomain, MONO_DOMAIN_LAST_GC_TRACKED) - G_STRUCT_OFFSET (MonoDomain, MONO_DOMAIN_FIRST_GC_TRACKED), NULL);
+
+ mono_profiler_appdomain_event (domain, MONO_PROFILE_START_LOAD);
+
domain->mp = mono_mempool_new ();
domain->code_mp = mono_code_manager_new ();
domain->env = mono_g_hash_table_new_type ((GHashFunc)mono_string_hash, (GCompareFunc)mono_string_equal, MONO_HASH_KEY_VALUE_GC);
domain->proxy_vtable_hash = g_hash_table_new ((GHashFunc)mono_ptrarray_hash, (GCompareFunc)mono_ptrarray_equal);
domain->static_data_array = NULL;
mono_jit_code_hash_init (&domain->jit_code_hash);
- domain->ldstr_table = mono_g_hash_table_new ((GHashFunc)mono_string_hash, (GCompareFunc)mono_string_equal);
- domain->jit_info_table = mono_jit_info_table_new ();
- domain->class_init_trampoline_hash = g_hash_table_new (mono_aligned_addr_hash, NULL);
- domain->jump_trampoline_hash = g_hash_table_new (mono_aligned_addr_hash, NULL);
+ domain->ldstr_table = mono_g_hash_table_new_type ((GHashFunc)mono_string_hash, (GCompareFunc)mono_string_equal, MONO_HASH_KEY_VALUE_GC);
+ domain->num_jit_info_tables = 1;
+ domain->jit_info_table = jit_info_table_new (domain);
+ domain->jit_info_free_queue = NULL;
domain->finalizable_objects_hash = g_hash_table_new (mono_aligned_addr_hash, NULL);
- domain->jit_trampoline_hash = g_hash_table_new (mono_aligned_addr_hash, NULL);
- domain->delegate_trampoline_hash = g_hash_table_new (mono_aligned_addr_hash, NULL);
+#ifndef HAVE_SGEN_GC
+ domain->track_resurrection_handles_hash = g_hash_table_new (mono_aligned_addr_hash, NULL);
+#endif
InitializeCriticalSection (&domain->lock);
InitializeCriticalSection (&domain->assemblies_lock);
+ InitializeCriticalSection (&domain->jit_code_hash_lock);
+ InitializeCriticalSection (&domain->finalizable_objects_hash_lock);
+
+ domain->method_rgctx_hash = NULL;
mono_appdomains_lock ();
domain_id_alloc (domain);
mono_appdomains_unlock ();
+ mono_perfcounters->loader_appdomains++;
+ mono_perfcounters->loader_total_appdomains++;
+
+ mono_debug_domain_create (domain);
+
+ if (create_domain_hook)
+ create_domain_hook (domain);
+
+ mono_profiler_appdomain_loaded (domain, MONO_PROFILE_OK);
+
return domain;
}
if (domain)
g_assert_not_reached ();
- MONO_GC_PRE_INIT ();
+#ifdef PLATFORM_WIN32
+ /* Avoid system error message boxes. */
+ SetErrorMode (SEM_FAILCRITICALERRORS | SEM_NOOPENFILEERRORBOX);
+
+ mono_load_coree (exe_filename);
+#endif
+
+ mono_perfcounters_init ();
+
+ mono_counters_register ("Max native code in a domain", MONO_COUNTER_INT|MONO_COUNTER_JIT, &max_domain_code_size);
+ mono_counters_register ("Max code space allocated in a domain", MONO_COUNTER_INT|MONO_COUNTER_JIT, &max_domain_code_alloc);
+ mono_counters_register ("Total code space allocated", MONO_COUNTER_INT|MONO_COUNTER_JIT, &total_domain_code_alloc);
+
+ mono_gc_base_init ();
appdomain_thread_id = TlsAlloc ();
InitializeCriticalSection (&appdomains_mutex);
mono_metadata_init ();
- mono_raw_buffer_init ();
mono_images_init ();
mono_assemblies_init ();
mono_classes_init ();
/* Get a list of runtimes supported by the exe */
if (exe_filename != NULL) {
- get_runtimes_from_exe (exe_filename, runtimes);
+ /*
+ * This function will load the exe file as a MonoImage. We need to close it, but
+ * that would mean it would be reloaded later. So instead, we save it to
+ * exe_image, and close it during shutdown.
+ */
+ get_runtimes_from_exe (exe_filename, &exe_image, runtimes);
+#ifdef PLATFORM_WIN32
+ if (!exe_image) {
+ exe_image = mono_assembly_open_from_bundle (exe_filename, NULL, FALSE);
+ if (!exe_image)
+ exe_image = mono_image_open (exe_filename, NULL);
+ }
+ mono_fixup_exe_image (exe_image);
+#endif
} else if (runtime_version != NULL) {
runtimes [0] = get_runtime_by_version (runtime_version);
runtimes [1] = NULL;
ass = mono_assembly_load_corlib (current_runtime, &status);
if (status != MONO_IMAGE_OK && status != MONO_IMAGE_ERROR_ERRNO)
break;
+
+ }
+
+ /* Now that we have a runtime, set the policy for unhandled exceptions */
+ if (mono_framework_version () < 2) {
+ mono_runtime_unhandled_exception_policy_set (MONO_UNHANDLED_POLICY_LEGACY);
}
if ((status != MONO_IMAGE_OK) || (ass == NULL)) {
mono_defaults.internals_visible_class = mono_class_from_name (
mono_defaults.corlib, "System.Runtime.CompilerServices", "InternalsVisibleToAttribute");
+ mono_defaults.critical_finalizer_object = mono_class_from_name (
+ mono_defaults.corlib, "System.Runtime.ConstrainedExecution", "CriticalFinalizerObject");
+
+ /*
+ * mscorlib needs a little help, only now it can load its friends list (after we have
+ * loaded the InternalsVisibleToAttribute), load it now
+ */
+ mono_assembly_load_friends (ass);
+
mono_defaults.safehandle_class = mono_class_from_name (
mono_defaults.corlib, "System.Runtime.InteropServices", "SafeHandle");
domain->friendly_name = g_path_get_basename (filename);
+ _mono_debug_init_corlib (domain);
+
return domain;
}
void
mono_cleanup (void)
{
+ mono_close_exe_image ();
+
mono_loader_cleanup ();
mono_classes_cleanup ();
mono_assemblies_cleanup ();
mono_images_cleanup ();
- mono_raw_buffer_cleanup ();
+ mono_debug_cleanup ();
mono_metadata_cleanup ();
TlsFree (appdomain_thread_id);
DeleteCriticalSection (&appdomains_mutex);
}
+void
+mono_close_exe_image (void)
+{
+ if (exe_image)
+ mono_image_close (exe_image);
+}
+
/**
* mono_get_root_domain:
*
return GET_APPDOMAIN ();
}
+void
+mono_domain_set_internal_with_options (MonoDomain *domain, gboolean migrate_exception)
+{
+ MonoThread *thread;
+
+ if (mono_domain_get () == domain)
+ return;
+
+ SET_APPDOMAIN (domain);
+ SET_APPCONTEXT (domain->default_context);
+
+ if (migrate_exception) {
+ thread = mono_thread_current ();
+ if (!thread->abort_exc)
+ return;
+
+ g_assert (thread->abort_exc->object.vtable->domain != domain);
+ MONO_OBJECT_SETREF (thread, abort_exc, mono_get_exception_thread_abort ());
+ g_assert (thread->abort_exc->object.vtable->domain == domain);
+ }
+}
+
/**
* mono_domain_set_internal:
* @domain: the new domain
void
mono_domain_set_internal (MonoDomain *domain)
{
- SET_APPDOMAIN (domain);
- SET_APPCONTEXT (domain->default_context);
+ mono_domain_set_internal_with_options (domain, TRUE);
}
void
MonoAssembly *
mono_domain_assembly_open (MonoDomain *domain, const char *name)
{
+ MonoDomain *current;
MonoAssembly *ass;
GSList *tmp;
}
mono_domain_assemblies_unlock (domain);
- if (!(ass = mono_assembly_open (name, NULL)))
- return NULL;
+ if (domain != mono_domain_get ()) {
+ current = mono_domain_get ();
- return ass;
-}
+ mono_domain_set (domain, FALSE);
+ ass = mono_assembly_open (name, NULL);
+ mono_domain_set (current, FALSE);
+ } else {
+ ass = mono_assembly_open (name, NULL);
+ }
-static void
-dynamic_method_info_free (gpointer key, gpointer value, gpointer user_data)
-{
- MonoJitDynamicMethodInfo *di = value;
- mono_code_manager_destroy (di->code_mp);
- g_free (di);
+ return ass;
}
static void
-delete_jump_list (gpointer key, gpointer value, gpointer user_data)
+free_slist (gpointer key, gpointer value, gpointer user_data)
{
g_slist_free (value);
}
void
mono_domain_free (MonoDomain *domain, gboolean force)
{
+ int code_size, code_alloc;
GSList *tmp;
if ((domain == mono_root_domain) && !force) {
g_warning ("cant unload root domain");
return;
}
- mono_debugger_event (MONO_DEBUGGER_EVENT_DOMAIN_UNLOAD, domain->domain_id, 0);
+ if (mono_dont_free_domains)
+ return;
+
+ mono_profiler_appdomain_event (domain, MONO_PROFILE_START_UNLOAD);
+
+ if (free_domain_hook)
+ free_domain_hook (domain);
+
+ mono_debug_domain_unload (domain);
+
+ mono_gc_clear_domain (domain);
mono_appdomains_lock ();
appdomains_list [domain->domain_id] = NULL;
domain->static_data_array = NULL;
}
mono_internal_hash_table_destroy (&domain->jit_code_hash);
- if (domain->dynamic_code_hash) {
- g_hash_table_foreach (domain->dynamic_code_hash, dynamic_method_info_free, NULL);
- g_hash_table_destroy (domain->dynamic_code_hash);
- domain->dynamic_code_hash = NULL;
- }
mono_g_hash_table_destroy (domain->ldstr_table);
domain->ldstr_table = NULL;
- mono_jit_info_table_free (domain->jit_info_table);
+
+ /*
+ * There might still be jit info tables of this domain which
+ * are not freed. Since the domain cannot be in use anymore,
+ * this will free them.
+ */
+ mono_thread_hazardous_try_free_all ();
+ g_assert (domain->num_jit_info_tables == 1);
+ jit_info_table_free (domain->jit_info_table);
domain->jit_info_table = NULL;
+ g_assert (!domain->jit_info_free_queue);
+
+ /* collect statistics */
+ code_alloc = mono_code_manager_size (domain->code_mp, &code_size);
+ total_domain_code_alloc += code_alloc;
+ max_domain_code_alloc = MAX (max_domain_code_alloc, code_alloc);
+ max_domain_code_size = MAX (max_domain_code_size, code_size);
+
#ifdef DEBUG_DOMAIN_UNLOAD
mono_mempool_invalidate (domain->mp);
mono_code_manager_invalidate (domain->code_mp);
#else
+ mono_perfcounters->loader_bytes -= mono_mempool_get_allocated (domain->mp);
mono_mempool_destroy (domain->mp);
domain->mp = NULL;
mono_code_manager_destroy (domain->code_mp);
domain->code_mp = NULL;
#endif
- if (domain->jump_target_hash) {
- g_hash_table_foreach (domain->jump_target_hash, delete_jump_list, NULL);
- g_hash_table_destroy (domain->jump_target_hash);
- domain->jump_target_hash = NULL;
- }
+
+ mono_reflection_cleanup_domain (domain);
+
if (domain->type_hash) {
mono_g_hash_table_destroy (domain->type_hash);
domain->type_hash = NULL;
}
- if (domain->refobject_hash) {
- mono_g_hash_table_destroy (domain->refobject_hash);
- domain->refobject_hash = NULL;
- }
if (domain->type_init_exception_hash) {
mono_g_hash_table_destroy (domain->type_init_exception_hash);
domain->type_init_exception_hash = NULL;
}
- g_hash_table_destroy (domain->class_init_trampoline_hash);
- domain->class_init_trampoline_hash = NULL;
- g_hash_table_destroy (domain->jump_trampoline_hash);
- domain->jump_trampoline_hash = NULL;
g_hash_table_destroy (domain->finalizable_objects_hash);
domain->finalizable_objects_hash = NULL;
- g_hash_table_destroy (domain->jit_trampoline_hash);
- domain->jit_trampoline_hash = NULL;
- g_hash_table_destroy (domain->delegate_trampoline_hash);
- domain->delegate_trampoline_hash = NULL;
- if (domain->delegate_invoke_impl_with_target_hash) {
- g_hash_table_destroy (domain->delegate_invoke_impl_with_target_hash);
- domain->delegate_invoke_impl_with_target_hash = NULL;
+#ifndef HAVE_SGEN_GC
+ if (domain->track_resurrection_objects_hash) {
+ g_hash_table_foreach (domain->track_resurrection_objects_hash, free_slist, NULL);
+ g_hash_table_destroy (domain->track_resurrection_objects_hash);
+ }
+ if (domain->track_resurrection_handles_hash)
+ g_hash_table_destroy (domain->track_resurrection_handles_hash);
+#endif
+ if (domain->method_rgctx_hash) {
+ g_hash_table_destroy (domain->method_rgctx_hash);
+ domain->method_rgctx_hash = NULL;
}
- if (domain->delegate_invoke_impl_no_target_hash) {
- g_hash_table_destroy (domain->delegate_invoke_impl_no_target_hash);
- domain->delegate_invoke_impl_no_target_hash = NULL;
+ if (domain->generic_virtual_cases) {
+ g_hash_table_destroy (domain->generic_virtual_cases);
+ domain->generic_virtual_cases = NULL;
}
+
+ DeleteCriticalSection (&domain->finalizable_objects_hash_lock);
DeleteCriticalSection (&domain->assemblies_lock);
+ DeleteCriticalSection (&domain->jit_code_hash_lock);
DeleteCriticalSection (&domain->lock);
domain->setup = NULL;
/* FIXME: anything else required ? */
+ mono_profiler_appdomain_event (domain, MONO_PROFILE_END_UNLOAD);
+
mono_gc_free_fixed (domain);
+ mono_perfcounters->loader_appdomains--;
+
if ((domain == mono_root_domain))
mono_root_domain = NULL;
}
return domain->domain_id;
}
+/*
+ * mono_domain_alloc:
+ *
+ * LOCKING: Acquires the domain lock.
+ */
+gpointer
+mono_domain_alloc (MonoDomain *domain, guint size)
+{
+ gpointer res;
+
+ mono_domain_lock (domain);
+ mono_perfcounters->loader_bytes += size;
+ res = mono_mempool_alloc (domain->mp, size);
+ mono_domain_unlock (domain);
+
+ return res;
+}
+
+/*
+ * mono_domain_alloc0:
+ *
+ * LOCKING: Acquires the domain lock.
+ */
+gpointer
+mono_domain_alloc0 (MonoDomain *domain, guint size)
+{
+ gpointer res;
+
+ mono_domain_lock (domain);
+ mono_perfcounters->loader_bytes += size;
+ res = mono_mempool_alloc0 (domain->mp, size);
+ mono_domain_unlock (domain);
+
+ return res;
+}
+
+/*
+ * mono_domain_code_reserve:
+ *
+ * LOCKING: Acquires the domain lock.
+ */
+void*
+mono_domain_code_reserve (MonoDomain *domain, int size)
+{
+ gpointer res;
+
+ mono_domain_lock (domain);
+ res = mono_code_manager_reserve (domain->code_mp, size);
+ mono_domain_unlock (domain);
+
+ return res;
+}
+
+/*
+ * mono_domain_code_reserve_align:
+ *
+ * LOCKING: Acquires the domain lock.
+ */
+void*
+mono_domain_code_reserve_align (MonoDomain *domain, int size, int alignment)
+{
+ gpointer res;
+
+ mono_domain_lock (domain);
+ res = mono_code_manager_reserve_align (domain->code_mp, size, alignment);
+ mono_domain_unlock (domain);
+
+ return res;
+}
+
+/*
+ * mono_domain_code_commit:
+ *
+ * LOCKING: Acquires the domain lock.
+ */
+void
+mono_domain_code_commit (MonoDomain *domain, void *data, int size, int newsize)
+{
+ mono_domain_lock (domain);
+ mono_code_manager_commit (domain->code_mp, data, size, newsize);
+ mono_domain_unlock (domain);
+}
+
+/*
+ * mono_domain_code_foreach:
+ * Iterate over the code thunks of the code manager of @domain.
+ *
+ * The @func callback MUST not take any locks. If it really needs to, it must respect
+ * the locking rules of the runtime: http://www.mono-project.com/Mono:Runtime:Documentation:ThreadSafety
+ * LOCKING: Acquires the domain lock.
+ */
+
+void
+mono_domain_code_foreach (MonoDomain *domain, MonoCodeManagerFunc func, void *user_data)
+{
+ mono_domain_lock (domain);
+ mono_code_manager_foreach (domain->code_mp, func, user_data);
+ mono_domain_unlock (domain);
+}
+
+
void
mono_context_set (MonoAppContext * new_context)
{
GMarkupParseContext *context;
char *text;
gsize len;
- struct stat buf;
const char *bundled_config;
char *config_filename;
} else {
config_filename = g_strconcat (exe_filename, ".config", NULL);
- if (stat (config_filename, &buf) != 0) {
- g_free (config_filename);
- return NULL;
- }
-
if (!g_file_get_contents (config_filename, &text, &len, NULL)) {
g_free (config_filename);
return NULL;
}
static void
-get_runtimes_from_exe (const char *exe_file, const MonoRuntimeInfo** runtimes)
+get_runtimes_from_exe (const char *exe_file, MonoImage **exe_image, const MonoRuntimeInfo** runtimes)
{
AppConfigInfo* app_config;
char *version;
return;
}
- /*
- * FIXME: This would cause us to unload the image, and it will be loaded again later.
- * Disabling it will mean the initial exe will not be unloaded on shutdown.
- */
- //mono_image_close (image);
+ *exe_image = image;
runtimes [0] = get_runtime_by_version (image->version);
runtimes [1] = NULL;
{
const MonoRuntimeInfo* runtimes [G_N_ELEMENTS (supported_runtimes) + 1];
const MonoRuntimeInfo *rinfo;
+ MonoImage *image;
- get_runtimes_from_exe (filename, runtimes);
+ get_runtimes_from_exe (filename, &image, runtimes);
rinfo = runtimes [0];
if (!rinfo)
return NULL;
}
+
+/**
+ * mono_framework_version:
+ *
+ * Return the major version of the framework curently executing.
+ */
+int
+mono_framework_version (void)
+{
+ return current_runtime->framework_version [0] - '0';
+}
+