/
domain.c
2693 lines (2217 loc) · 73.4 KB
/
domain.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* domain.c: MonoDomain functions
*
* Author:
* Dietmar Maurer (dietmar@ximian.com)
* Patrik Torstensson
*
* Copyright 2001-2003 Ximian, Inc (http://www.ximian.com)
* Copyright 2004-2009 Novell, Inc (http://www.novell.com)
*/
#include <config.h>
#include <glib.h>
#include <string.h>
#include <sys/stat.h>
#include <mono/metadata/gc-internal.h>
#include <mono/utils/mono-compiler.h>
#include <mono/utils/mono-logger-internal.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/metadata-internals.h>
#include <mono/metadata/gc-internal.h>
#include <mono/metadata/appdomain.h>
#include <mono/metadata/mono-debug-debugger.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 */
/* we need to use both the Tls* functions and __thread because
* some archs may generate faster jit code with one meachanism
* or the other (we used to do it because tls slots were GC-tracked,
* 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(HOST_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 /* !HAVE_KW_THREAD */
#define GET_APPDOMAIN() ((MonoDomain *)TlsGetValue (appdomain_thread_id))
#define SET_APPDOMAIN(x) TlsSetValue (appdomain_thread_id, x);
#endif
#define GET_APPCONTEXT() (mono_thread_internal_current ()->current_appcontext)
#define SET_APPCONTEXT(x) MONO_OBJECT_SETREF (mono_thread_internal_current (), current_appcontext, (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 CRITICAL_SECTION 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.
*/
typedef struct {
GSList *supported_runtimes;
char *required_runtime;
int configuration_count;
int startup_count;
} AppConfigInfo;
/*
* AotModuleInfo: Contains information about AOT modules.
*/
typedef struct {
MonoImage *image;
gpointer start, end;
} AotModuleInfo;
static const MonoRuntimeInfo *current_runtime = NULL;
static MonoJitInfoFindInAot jit_info_find_in_aot_func = NULL;
/*
* Contains information about AOT loaded code.
*/
static MonoAotModuleInfoTable *aot_modules = NULL;
/* This is the list of runtime versions supported by this JIT.
*/
static const MonoRuntimeInfo supported_runtimes[] = {
{"v2.0.50215","2.0", { {2,0,0,0}, {8,0,0,0}, { 3, 5, 0, 0 } } },
{"v2.0.50727","2.0", { {2,0,0,0}, {8,0,0,0}, { 3, 5, 0, 0 } } },
{"v4.0.20506","4.0", { {4,0,0,0}, {10,0,0,0}, { 4, 0, 0, 0 } } },
{"v4.0.30128","4.0", { {4,0,0,0}, {10,0,0,0}, { 4, 0, 0, 0 } } },
{"v4.0.30319","4.0", { {4,0,0,0}, {10,0,0,0}, { 4, 0, 0, 0 } } },
{"moonlight", "2.1", { {2,0,5,0}, {9,0,0,0}, { 3, 5, 0, 0 } } },
};
/* The stable runtime version */
#define DEFAULT_RUNTIME_VERSION "v2.0.50727"
/* 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, MonoImage **exe_image, const MonoRuntimeInfo** runtimes);
static const MonoRuntimeInfo*
get_runtime_by_version (const char *version);
static MonoImage*
mono_jit_info_find_aot_module (guint8* addr);
guint32
mono_domain_get_tls_key (void)
{
return appdomain_thread_id;
}
gint32
mono_domain_get_tls_offset (void)
{
int offset = -1;
MONO_THREAD_VAR_OFFSET (tls_appdomain, offset);
/* __asm ("jmp 1f; .section writetext, \"awx\"; 1: movl $tls_appdomain@ntpoff, %0; jmp 2f; .previous; 2:"
: "=r" (offset));*/
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 *
jit_info_table_new (MonoDomain *domain)
{
MonoJitInfoTable *table = g_malloc0 (MONO_SIZEOF_JIT_INFO_TABLE + sizeof (MonoJitInfoTableChunk*));
table->domain = domain;
table->num_chunks = 1;
table->chunks [0] = jit_info_table_new_chunk ();
return table;
}
static void
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)
{
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
jit_info_table_chunk_index (MonoJitInfoTableChunk *chunk, MonoThreadHazardPointers *hp, gint8 *addr)
{
int left = 0, right = chunk->num_elements;
while (left < right) {
int pos = (left + right) / 2;
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 < code_end)
right = pos;
else
left = pos + 1;
}
g_assert (left == right);
return left;
}
MonoJitInfo*
mono_jit_info_table_find (MonoDomain *domain, char *addr)
{
MonoJitInfoTable *table;
MonoJitInfo *ji;
int chunk_pos, pos;
MonoThreadHazardPointers *hp = mono_hazard_pointer_get ();
MonoImage *image;
++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;
}
/* 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;
}
++chunk_pos;
pos = 0;
} while (chunk_pos < table->num_chunks);
not_found:
if (!hp)
return NULL;
mono_hazard_pointer_clear (hp, JIT_INFO_TABLE_HAZARD_INDEX);
mono_hazard_pointer_clear (hp, JIT_INFO_HAZARD_INDEX);
ji = NULL;
/* Maybe its an AOT module */
image = mono_jit_info_find_aot_module ((guint8*)addr);
if (image)
ji = jit_info_find_in_aot_func (domain, image, addr);
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 (MONO_SIZEOF_JIT_INFO_TABLE + 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 (MONO_SIZEOF_JIT_INFO_TABLE
+ 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 (MONO_SIZEOF_JIT_INFO_TABLE
+ 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;
int chunk_pos, pos;
MonoJitInfoTableChunk *chunk;
int num_elements;
int i;
g_assert (ji->method != NULL);
mono_domain_lock (domain);
++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;
MonoJitInfoTableChunk *chunk;
gpointer start = ji->code_start;
int chunk_pos, pos;
mono_domain_lock (domain);
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);
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 (MonoAotModuleInfoTable *table, char *addr)
{
int left = 0, right = table->len;
while (left < right) {
int pos = (left + right) / 2;
AotModuleInfo *ainfo = g_array_index (table, gpointer, pos);
char *start = ainfo->start;
char *end = ainfo->end;
if (addr < start)
right = pos;
else if (addr >= end)
left = pos + 1;
else
return pos;
}
return left;
}
void
mono_jit_info_add_aot_module (MonoImage *image, gpointer start, gpointer end)
{
AotModuleInfo *ainfo = g_new0 (AotModuleInfo, 1);
int pos;
ainfo->image = image;
ainfo->start = start;
ainfo->end = end;
mono_appdomains_lock ();
if (!aot_modules)
aot_modules = mono_aot_module_info_table_new ();
pos = aot_info_table_index (aot_modules, start);
g_array_insert_val (aot_modules, pos, ainfo);
mono_appdomains_unlock ();
}
static MonoImage*
mono_jit_info_find_aot_module (guint8* addr)
{
guint left = 0, right;
if (!aot_modules)
return NULL;
mono_appdomains_lock ();
right = aot_modules->len;
while (left < right) {
guint pos = (left + right) / 2;
AotModuleInfo *ai = g_array_index (aot_modules, gpointer, pos);
if (addr < (guint8*)ai->start)
right = pos;
else if (addr >= (guint8*)ai->end)
left = pos + 1;
else {
mono_appdomains_unlock ();
return ai->image;
}
}
mono_appdomains_unlock ();
return NULL;
}
void
mono_install_jit_info_find_in_aot (MonoJitInfoFindInAot func)
{
jit_info_find_in_aot_func = func;
}
gpointer
mono_jit_info_get_code_start (MonoJitInfo* ji)
{
return ji->code_start;
}
int
mono_jit_info_get_code_size (MonoJitInfo* ji)
{
return ji->code_size;
}
MonoMethod*
mono_jit_info_get_method (MonoJitInfo* ji)
{
return ji->method;
}
static gpointer
jit_info_key_extract (gpointer value)
{
MonoJitInfo *info = (MonoJitInfo*)value;
return info->method;
}
static gpointer*
jit_info_next_value (gpointer value)
{
MonoJitInfo *info = (MonoJitInfo*)value;
return (gpointer*)&info->next_jit_code_hash;
}
void
mono_jit_code_hash_init (MonoInternalHashTable *jit_code_hash)
{
mono_internal_hash_table_init (jit_code_hash,
mono_aligned_addr_hash,
jit_info_key_extract,
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;