2 * sgen-bridge.c: Simple generational GC.
4 * Copyright 2011 Novell, Inc (http://www.novell.com)
5 * Copyright 2011 Xamarin Inc (http://www.xamarin.com)
7 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
8 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
10 * Permission is hereby granted to use or copy this program
11 * for any purpose, provided the above notices are retained on all copies.
12 * Permission to modify the code and to distribute modified code is granted,
13 * provided the above notices are retained, and a notice that the code was
14 * modified is included with the above copyright notice.
17 * Copyright 2001-2003 Ximian, Inc
18 * Copyright 2003-2010 Novell, Inc.
20 * Permission is hereby granted, free of charge, to any person obtaining
21 * a copy of this software and associated documentation files (the
22 * "Software"), to deal in the Software without restriction, including
23 * without limitation the rights to use, copy, modify, merge, publish,
24 * distribute, sublicense, and/or sell copies of the Software, and to
25 * permit persons to whom the Software is furnished to do so, subject to
26 * the following conditions:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
31 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
48 #include "sgen-bridge.h"
49 #include "sgen-hash-table.h"
50 #include "sgen-qsort.h"
51 #include "tabledefs.h"
52 #include "utils/mono-logger-internal.h"
53 #include "utils/mono-time.h"
54 #include "utils/mono-compiler.h"
58 //#define TEST_NEW_XREFS
61 #if !defined(NEW_XREFS) || defined(TEST_NEW_XREFS)
66 #define XREFS new_xrefs
68 #define XREFS old_xrefs
73 int capacity; /* if negative, data points to another DynArray's data */
93 * FIXME: Optimizations:
95 * Don't allocate a scrs array for just one source. Most objects have
96 * just one source, so use the srcs pointer itself.
98 typedef struct _HashEntry {
103 guint32 is_visited : 1;
104 guint32 finishing_time : 31;
105 struct _HashEntry *forwarded_to;
118 } HashEntryWithAccounting;
120 typedef struct _SCC {
123 int num_bridge_entries;
126 * New and old xrefs are typically mutually exclusive. Only when TEST_NEW_XREFS is
127 * enabled we do both, and compare the results. This should only be done for
128 * debugging, obviously.
131 DynIntArray old_xrefs; /* these are incoming, not outgoing */
134 DynIntArray new_xrefs;
138 static SgenHashTable hash_table = SGEN_HASH_TABLE_INIT (INTERNAL_MEM_BRIDGE_HASH_TABLE, INTERNAL_MEM_BRIDGE_HASH_TABLE_ENTRY, sizeof (HashEntry), mono_aligned_addr_hash, NULL);
140 static guint32 current_time;
142 static gboolean bridge_accounting_enabled = FALSE;
144 static SgenBridgeProcessor *bridge_processor;
152 dyn_array_init (DynArray *da)
160 dyn_array_uninit (DynArray *da, int elem_size)
162 if (da->capacity < 0) {
167 if (da->capacity == 0)
170 sgen_free_internal_dynamic (da->data, elem_size * da->capacity, INTERNAL_MEM_BRIDGE_DATA);
175 dyn_array_empty (DynArray *da)
177 if (da->capacity < 0)
184 dyn_array_ensure_capacity (DynArray *da, int capacity, int elem_size)
186 int old_capacity = da->capacity;
189 g_assert (capacity > 0);
191 if (capacity <= old_capacity)
194 if (old_capacity <= 0)
196 while (capacity > da->capacity)
199 new_data = sgen_alloc_internal_dynamic (elem_size * da->capacity, INTERNAL_MEM_BRIDGE_DATA, TRUE);
200 memcpy (new_data, da->data, elem_size * da->size);
201 if (old_capacity > 0)
202 sgen_free_internal_dynamic (da->data, elem_size * old_capacity, INTERNAL_MEM_BRIDGE_DATA);
207 dyn_array_is_copy (DynArray *da)
209 return da->capacity < 0;
213 dyn_array_ensure_independent (DynArray *da, int elem_size)
215 if (!dyn_array_is_copy (da))
217 dyn_array_ensure_capacity (da, da->size, elem_size);
218 g_assert (da->capacity > 0);
222 dyn_array_add (DynArray *da, int elem_size)
226 dyn_array_ensure_capacity (da, da->size + 1, elem_size);
228 p = da->data + da->size * elem_size;
234 dyn_array_copy (DynArray *dst, DynArray *src, int elem_size)
236 dyn_array_uninit (dst, elem_size);
241 dst->size = src->size;
243 dst->data = src->data;
248 dyn_array_int_init (DynIntArray *da)
250 dyn_array_init (&da->array);
254 dyn_array_int_uninit (DynIntArray *da)
256 dyn_array_uninit (&da->array, sizeof (int));
260 dyn_array_int_size (DynIntArray *da)
262 return da->array.size;
266 dyn_array_int_empty (DynIntArray *da)
268 dyn_array_empty (&da->array);
272 dyn_array_int_add (DynIntArray *da, int x)
274 int *p = dyn_array_add (&da->array, sizeof (int));
279 dyn_array_int_get (DynIntArray *da, int x)
281 return ((int*)da->array.data)[x];
285 dyn_array_int_set (DynIntArray *da, int idx, int val)
287 ((int*)da->array.data)[idx] = val;
291 dyn_array_int_ensure_capacity (DynIntArray *da, int capacity)
293 dyn_array_ensure_capacity (&da->array, capacity, sizeof (int));
297 dyn_array_int_ensure_independent (DynIntArray *da)
299 dyn_array_ensure_independent (&da->array, sizeof (int));
303 dyn_array_int_copy (DynIntArray *dst, DynIntArray *src)
305 dyn_array_copy (&dst->array, &src->array, sizeof (int));
309 dyn_array_int_is_copy (DynIntArray *da)
311 return dyn_array_is_copy (&da->array);
317 dyn_array_ptr_init (DynPtrArray *da)
319 dyn_array_init (&da->array);
323 dyn_array_ptr_uninit (DynPtrArray *da)
325 if (da->array.capacity == 1)
326 dyn_array_ptr_init (da);
328 dyn_array_uninit (&da->array, sizeof (void*));
332 dyn_array_ptr_size (DynPtrArray *da)
334 return da->array.size;
338 dyn_array_ptr_empty (DynPtrArray *da)
340 dyn_array_empty (&da->array);
344 dyn_array_ptr_get (DynPtrArray *da, int x)
346 if (da->array.capacity == 1) {
348 return da->array.data;
350 return ((void**)da->array.data)[x];
354 dyn_array_ptr_add (DynPtrArray *da, void *ptr)
358 if (da->array.capacity == 0) {
359 da->array.capacity = 1;
361 p = (void**)&da->array.data;
362 } else if (da->array.capacity == 1) {
363 void *ptr0 = da->array.data;
365 dyn_array_init (&da->array);
366 p0 = dyn_array_add (&da->array, sizeof (void*));
368 p = dyn_array_add (&da->array, sizeof (void*));
370 p = dyn_array_add (&da->array, sizeof (void*));
375 #define dyn_array_ptr_push dyn_array_ptr_add
378 dyn_array_ptr_pop (DynPtrArray *da)
380 int size = da->array.size;
383 if (da->array.capacity == 1) {
384 p = dyn_array_ptr_get (da, 0);
385 dyn_array_init (&da->array);
387 g_assert (da->array.capacity > 1);
388 dyn_array_ensure_independent (&da->array, sizeof (void*));
389 p = dyn_array_ptr_get (da, size - 1);
398 dyn_array_scc_init (DynSCCArray *da)
400 dyn_array_init (&da->array);
404 dyn_array_scc_uninit (DynSCCArray *da)
406 dyn_array_uninit (&da->array, sizeof (SCC));
410 dyn_array_scc_size (DynSCCArray *da)
412 return da->array.size;
416 dyn_array_scc_add (DynSCCArray *da)
418 return dyn_array_add (&da->array, sizeof (SCC));
422 dyn_array_scc_get_ptr (DynSCCArray *da, int x)
424 return &((SCC*)da->array.data)[x];
429 static DynIntArray merge_array;
432 dyn_array_int_contains (DynIntArray *da, int x)
435 for (i = 0; i < dyn_array_int_size (da); ++i)
436 if (dyn_array_int_get (da, i) == x)
442 enable_accounting (void)
444 bridge_accounting_enabled = TRUE;
445 hash_table = (SgenHashTable)SGEN_HASH_TABLE_INIT (INTERNAL_MEM_BRIDGE_HASH_TABLE, INTERNAL_MEM_BRIDGE_HASH_TABLE_ENTRY, sizeof (HashEntryWithAccounting), mono_aligned_addr_hash, NULL);
448 static MonoGCBridgeObjectKind
449 class_kind (MonoClass *class)
451 MonoGCBridgeObjectKind res = bridge_callbacks.bridge_class_kind (class);
453 /* If it's a bridge, nothing we can do about it. */
454 if (res == GC_BRIDGE_TRANSPARENT_BRIDGE_CLASS || res == GC_BRIDGE_OPAQUE_BRIDGE_CLASS)
457 /* Non bridge classes with no pointers will never point to a bridge, so we can savely ignore them. */
458 if (!class->has_references) {
459 SGEN_LOG (6, "class %s is opaque\n", class->name);
460 return GC_BRIDGE_OPAQUE_CLASS;
463 /* Some arrays can be ignored */
464 if (class->rank == 1) {
465 MonoClass *elem_class = class->element_class;
467 /* FIXME the bridge check can be quite expensive, cache it at the class level. */
468 /* An array of a sealed type that is not a bridge will never get to a bridge */
469 if ((elem_class->flags & TYPE_ATTRIBUTE_SEALED) && !elem_class->has_references && !bridge_callbacks.bridge_class_kind (elem_class)) {
470 SGEN_LOG (6, "class %s is opaque\n", class->name);
471 return GC_BRIDGE_OPAQUE_CLASS;
475 return GC_BRIDGE_TRANSPARENT_CLASS;
479 get_hash_entry (MonoObject *obj, gboolean *existing)
481 HashEntry *entry = sgen_hash_table_lookup (&hash_table, obj);
492 memset (&new_entry, 0, sizeof (HashEntry));
494 dyn_array_ptr_init (&new_entry.srcs);
495 new_entry.v.dfs1.finishing_time = 0;
497 sgen_hash_table_replace (&hash_table, obj, &new_entry, NULL);
499 return sgen_hash_table_lookup (&hash_table, obj);
503 add_source (HashEntry *entry, HashEntry *src)
505 dyn_array_ptr_add (&entry->srcs, src);
516 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
517 int entry_size = dyn_array_ptr_size (&entry->srcs);
518 total_srcs += entry_size;
519 if (entry_size > max_srcs)
520 max_srcs = entry_size;
521 dyn_array_ptr_uninit (&entry->srcs);
522 } SGEN_HASH_TABLE_FOREACH_END;
524 sgen_hash_table_clean (&hash_table);
526 dyn_array_int_uninit (&merge_array);
527 //g_print ("total srcs %d - max %d\n", total_srcs, max_srcs);
531 register_bridge_object (MonoObject *obj)
533 HashEntry *entry = get_hash_entry (obj, NULL);
534 entry->is_bridge = TRUE;
539 register_finishing_time (HashEntry *entry, guint32 t)
541 g_assert (entry->v.dfs1.finishing_time == 0);
542 /* finishing_time has 31 bits, so it must be within signed int32 range. */
543 g_assert (t > 0 && t <= G_MAXINT32);
544 entry->v.dfs1.finishing_time = t;
547 static int ignored_objects;
550 is_opaque_object (MonoObject *obj)
552 if ((obj->vtable->gc_bits & SGEN_GC_BIT_BRIDGE_OPAQUE_OBJECT) == SGEN_GC_BIT_BRIDGE_OPAQUE_OBJECT) {
553 SGEN_LOG (6, "ignoring %s\n", obj->vtable->klass->name);
561 object_needs_expansion (MonoObject **objp)
563 MonoObject *obj = *objp;
564 MonoObject *fwd = SGEN_OBJECT_IS_FORWARDED (obj);
567 if (is_opaque_object (fwd))
569 return sgen_hash_table_lookup (&hash_table, fwd) != NULL;
571 if (is_opaque_object (obj))
573 if (!sgen_object_is_live (obj))
575 return sgen_hash_table_lookup (&hash_table, obj) != NULL;
579 follow_forward (HashEntry *entry)
581 while (entry->v.dfs1.forwarded_to) {
582 HashEntry *next = entry->v.dfs1.forwarded_to;
583 if (next->v.dfs1.forwarded_to)
584 entry->v.dfs1.forwarded_to = next->v.dfs1.forwarded_to;
590 static DynPtrArray registered_bridges;
591 static DynPtrArray dfs_stack;
593 static int dfs1_passes, dfs2_passes;
596 * DFS1 maintains a stack, where each two entries are effectively one entry. (FIXME:
597 * Optimize this via pointer tagging.) There are two different types of entries:
599 * entry, src: entry needs to be expanded via scanning, and linked to from src
600 * NULL, entry: entry has already been expanded and needs to be finished
604 #define HANDLE_PTR(ptr,obj) do { \
605 MonoObject *dst = (MonoObject*)*(ptr); \
606 if (dst && object_needs_expansion (&dst)) { \
608 dyn_array_ptr_push (&dfs_stack, obj_entry); \
609 dyn_array_ptr_push (&dfs_stack, follow_forward (get_hash_entry (dst, NULL))); \
614 dfs1 (HashEntry *obj_entry)
617 g_assert (dyn_array_ptr_size (&dfs_stack) == 0);
619 dyn_array_ptr_push (&dfs_stack, NULL);
620 dyn_array_ptr_push (&dfs_stack, obj_entry);
627 obj_entry = dyn_array_ptr_pop (&dfs_stack);
629 /* obj_entry needs to be expanded */
630 src = dyn_array_ptr_pop (&dfs_stack);
632 g_assert (!src->v.dfs1.forwarded_to);
634 obj_entry = follow_forward (obj_entry);
637 g_assert (!obj_entry->v.dfs1.forwarded_to);
638 obj = sgen_hash_table_key_for_value_pointer (obj_entry);
641 if (!obj_entry->v.dfs1.is_visited) {
644 obj_entry->v.dfs1.is_visited = 1;
646 /* push the finishing entry on the stack */
647 dyn_array_ptr_push (&dfs_stack, obj_entry);
648 dyn_array_ptr_push (&dfs_stack, NULL);
650 #include "sgen-scan-object.h"
653 * We can remove non-bridge objects with a single outgoing
654 * link by forwarding links going to it.
656 * This is the first time we've encountered this object, so
657 * no links to it have yet been added. We'll keep it that
658 * way by setting the forward pointer, and instead of
659 * continuing processing this object, we start over with the
660 * object it points to.
662 if (!obj_entry->is_bridge && num_links == 1) {
663 HashEntry *dst_entry = dyn_array_ptr_pop (&dfs_stack);
664 HashEntry *obj_entry_again = dyn_array_ptr_pop (&dfs_stack);
665 g_assert (obj_entry_again == obj_entry);
666 g_assert (!dst_entry->v.dfs1.forwarded_to);
667 if (obj_entry != dst_entry) {
668 obj_entry->v.dfs1.forwarded_to = dst_entry;
669 obj_entry = dst_entry;
676 //g_print ("link %s -> %s\n", sgen_safe_name (src->obj), sgen_safe_name (obj));
677 g_assert (!obj_entry->v.dfs1.forwarded_to);
678 add_source (obj_entry, src);
680 //g_print ("starting with %s\n", sgen_safe_name (obj));
683 /* obj_entry needs to be finished */
685 obj_entry = dyn_array_ptr_pop (&dfs_stack);
687 //g_print ("finish %s\n", sgen_safe_name (obj_entry->obj));
688 register_finishing_time (obj_entry, ++current_time);
690 } while (dyn_array_ptr_size (&dfs_stack) > 0);
693 static DynSCCArray sccs;
694 static SCC *current_scc;
697 * At the end of bridge processing we need to end up with an (acyclyc) graph of bridge
698 * object SCCs, where the links between the nodes (each one an SCC) in that graph represent
699 * the presence of a direct or indirect link between those SCCs. An example:
704 * A -> B -> c -> e -> F
706 * A, B, D and F are SCCs that contain bridge objects, c and e don't contain bridge objects.
707 * The graph we need to produce from this is:
714 * Note that we don't need to produce an edge from A to F. It's sufficient that F is
715 * indirectly reachable from A.
717 * The old algorithm would create a set, for each SCC, of bridge SCCs that can reach it,
718 * directly or indirectly, by merging the ones sets for those that reach it directly. The
719 * sets it would build up are these:
728 * The merge operations on these sets turned out to be huge time sinks.
730 * The new algorithm proceeds in two passes: During DFS2, it only builds up the sets of SCCs
731 * that directly point to each SCC:
740 * This is the adjacency list for the SCC graph, in other words. In a separate step
741 * afterwards, it does a depth-first traversal of that graph, for each bridge node, to get
742 * to the final list. It uses a flag to avoid traversing any node twice.
745 scc_add_xref (SCC *src, SCC *dst)
747 g_assert (src != dst);
748 g_assert (src->index != dst->index);
752 * FIXME: Right now we don't even unique the direct ancestors, but just add to the
753 * list. Doing a containment check slows this algorithm down to almost the speed of
754 * the old one. Use the flag instead!
756 dyn_array_int_add (&dst->new_xrefs, src->index);
760 if (dyn_array_int_is_copy (&dst->old_xrefs)) {
762 dyn_array_int_ensure_independent (&dst->old_xrefs);
763 for (i = 0; i < dyn_array_int_size (&dst->old_xrefs); ++i) {
764 int j = dyn_array_int_get (&dst->old_xrefs, i);
765 SCC *bridge_scc = dyn_array_scc_get_ptr (&sccs, j);
766 g_assert (!bridge_scc->flag);
767 bridge_scc->flag = TRUE;
771 if (src->num_bridge_entries) {
775 dyn_array_int_add (&dst->old_xrefs, src->index);
776 } else if (dyn_array_int_size (&dst->old_xrefs) == 0) {
777 dyn_array_int_copy (&dst->old_xrefs, &src->old_xrefs);
780 for (i = 0; i < dyn_array_int_size (&src->old_xrefs); ++i) {
781 int j = dyn_array_int_get (&src->old_xrefs, i);
782 SCC *bridge_scc = dyn_array_scc_get_ptr (&sccs, j);
783 g_assert (bridge_scc->num_bridge_entries);
784 if (!bridge_scc->flag) {
785 bridge_scc->flag = TRUE;
786 dyn_array_int_add (&dst->old_xrefs, j);
794 scc_add_entry (SCC *scc, HashEntry *entry)
796 g_assert (entry->v.dfs2.scc_index < 0);
797 entry->v.dfs2.scc_index = scc->index;
798 if (entry->is_bridge)
799 ++scc->num_bridge_entries;
803 dfs2 (HashEntry *entry)
807 g_assert (dyn_array_ptr_size (&dfs_stack) == 0);
809 dyn_array_ptr_push (&dfs_stack, entry);
812 entry = dyn_array_ptr_pop (&dfs_stack);
815 if (entry->v.dfs2.scc_index >= 0) {
816 if (entry->v.dfs2.scc_index != current_scc->index)
817 scc_add_xref (dyn_array_scc_get_ptr (&sccs, entry->v.dfs2.scc_index), current_scc);
821 scc_add_entry (current_scc, entry);
823 for (i = 0; i < dyn_array_ptr_size (&entry->srcs); ++i)
824 dyn_array_ptr_push (&dfs_stack, dyn_array_ptr_get (&entry->srcs, i));
825 } while (dyn_array_ptr_size (&dfs_stack) > 0);
828 /* If xrefs is a copy then we haven't set a single flag. */
829 if (dyn_array_int_is_copy (¤t_scc->old_xrefs))
831 for (i = 0; i < dyn_array_int_size (¤t_scc->old_xrefs); ++i) {
832 int j = dyn_array_int_get (¤t_scc->old_xrefs, i);
833 SCC *bridge_scc = dyn_array_scc_get_ptr (&sccs, j);
834 g_assert (bridge_scc->flag);
835 bridge_scc->flag = FALSE;
842 gather_xrefs (SCC *scc)
845 for (i = 0; i < dyn_array_int_size (&scc->new_xrefs); ++i) {
846 int index = dyn_array_int_get (&scc->new_xrefs, i);
847 SCC *src = dyn_array_scc_get_ptr (&sccs, index);
851 if (src->num_bridge_entries)
852 dyn_array_int_add (&merge_array, index);
859 reset_flags (SCC *scc)
862 for (i = 0; i < dyn_array_int_size (&scc->new_xrefs); ++i) {
863 int index = dyn_array_int_get (&scc->new_xrefs, i);
864 SCC *src = dyn_array_scc_get_ptr (&sccs, index);
868 if (!src->num_bridge_entries)
874 static char *dump_prefix = NULL;
879 static int counter = 0;
883 int prefix_len = strlen (dump_prefix);
884 char filename [prefix_len + 64];
888 sprintf (filename, "%s.%d.gexf", dump_prefix, counter++);
889 file = fopen (filename, "w");
892 fprintf (stderr, "Warning: Could not open bridge dump file `%s` for writing: %s\n", filename, strerror (errno));
896 fprintf (file, "<gexf xmlns=\"http://www.gexf.net/1.2draft\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://www.gexf.net/1.2draft http://www.gexf.net/1.2draft/gexf.xsd\" version=\"1.2\">\n");
898 fprintf (file, "<graph defaultedgetype=\"directed\">\n"
899 "<attributes class=\"node\">\n"
900 "<attribute id=\"0\" title=\"class\" type=\"string\"/>\n"
901 "<attribute id=\"1\" title=\"bridge\" type=\"boolean\"/>\n"
904 fprintf (file, "<nodes>\n");
905 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
906 MonoVTable *vt = (MonoVTable*) SGEN_LOAD_VTABLE (obj);
907 fprintf (file, "<node id=\"%p\"><attvalues><attvalue for=\"0\" value=\"%s.%s\"/><attvalue for=\"1\" value=\"%s\"/></attvalues></node>\n",
908 obj, vt->klass->name_space, vt->klass->name, entry->is_bridge ? "true" : "false");
909 } SGEN_HASH_TABLE_FOREACH_END;
910 fprintf (file, "</nodes>\n");
912 fprintf (file, "<edges>\n");
913 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
915 for (i = 0; i < dyn_array_ptr_size (&entry->srcs); ++i) {
916 HashEntry *src = dyn_array_ptr_get (&entry->srcs, i);
917 fprintf (file, "<edge id=\"%d\" source=\"%p\" target=\"%p\"/>\n", edge_id++, sgen_hash_table_key_for_value_pointer (src), obj);
919 } SGEN_HASH_TABLE_FOREACH_END;
920 fprintf (file, "</edges>\n");
922 fprintf (file, "</graph></gexf>\n");
928 set_dump_prefix (const char *prefix)
930 dump_prefix = strdup (prefix);
934 compare_hash_entries (const HashEntry *e1, const HashEntry *e2)
936 /* We can cast to signed int here because finishing_time has only 31 bits. */
937 return (gint32)e2->v.dfs1.finishing_time - (gint32)e1->v.dfs1.finishing_time;
940 DEF_QSORT_INLINE(hash_entries, HashEntry*, compare_hash_entries)
942 static unsigned long step_1, step_2, step_3, step_4, step_5, step_6;
943 static int fist_pass_links, second_pass_links, sccs_links;
944 static int max_sccs_links = 0;
947 register_finalized_object (MonoObject *obj)
949 g_assert (sgen_need_bridge_processing ());
950 dyn_array_ptr_push (®istered_bridges, obj);
956 dyn_array_ptr_empty (®istered_bridges);
960 processing_stw_step (void)
966 SGEN_TV_DECLARE (atv);
967 SGEN_TV_DECLARE (btv);
969 if (!dyn_array_ptr_size (®istered_bridges))
972 SGEN_TV_GETTIME (btv);
976 dyn_array_ptr_init (&dfs_stack);
977 dyn_array_int_init (&merge_array);
981 First we insert all bridges into the hash table and then we do dfs1.
983 It must be done in 2 steps since the bridge arrays doesn't come in reverse topological order,
984 which means that we can have entry N pointing to entry N + 1.
986 If we dfs1 entry N before N + 1 is registered we'll not consider N + 1 for this bridge
987 pass and not create the required xref between the two.
989 bridge_count = dyn_array_ptr_size (®istered_bridges);
990 for (i = 0; i < bridge_count ; ++i)
991 register_bridge_object (dyn_array_ptr_get (®istered_bridges, i));
993 for (i = 0; i < bridge_count; ++i)
994 dfs1 (get_hash_entry (dyn_array_ptr_get (®istered_bridges, i), NULL));
996 /* Remove all forwarded objects. */
997 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
998 if (entry->v.dfs1.forwarded_to) {
999 g_assert (dyn_array_ptr_size (&entry->srcs) == 0);
1000 SGEN_HASH_TABLE_FOREACH_REMOVE (TRUE);
1003 } SGEN_HASH_TABLE_FOREACH_END;
1005 SGEN_TV_GETTIME (atv);
1006 step_2 = SGEN_TV_ELAPSED (btv, atv);
1012 static int num_registered_bridges, hash_table_size;
1015 processing_build_callback_data (int generation)
1018 int num_sccs, num_xrefs;
1019 int max_entries, max_xrefs;
1023 HashEntry **all_entries;
1024 MonoGCBridgeSCC **api_sccs;
1025 MonoGCBridgeXRef *api_xrefs;
1026 SGEN_TV_DECLARE (atv);
1027 SGEN_TV_DECLARE (btv);
1029 g_assert (bridge_processor->num_sccs == 0 && bridge_processor->num_xrefs == 0);
1030 g_assert (!bridge_processor->api_sccs && !bridge_processor->api_xrefs);
1032 if (!dyn_array_ptr_size (®istered_bridges))
1035 g_assert (bridge_processing_in_progress);
1037 SGEN_TV_GETTIME (atv);
1039 /* alloc and fill array of all entries */
1041 all_entries = sgen_alloc_internal_dynamic (sizeof (HashEntry*) * hash_table.num_entries, INTERNAL_MEM_BRIDGE_DATA, TRUE);
1044 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
1045 g_assert (entry->v.dfs1.finishing_time > 0);
1046 all_entries [j++] = entry;
1047 fist_pass_links += dyn_array_ptr_size (&entry->srcs);
1048 } SGEN_HASH_TABLE_FOREACH_END;
1049 g_assert (j == hash_table.num_entries);
1050 hash_table_size = hash_table.num_entries;
1052 /* sort array according to decreasing finishing time */
1053 qsort_hash_entries (all_entries, hash_table.num_entries);
1055 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
1056 entry->v.dfs2.scc_index = -1;
1057 } SGEN_HASH_TABLE_FOREACH_END;
1059 SGEN_TV_GETTIME (btv);
1060 step_3 = SGEN_TV_ELAPSED (atv, btv);
1062 /* second DFS pass */
1064 dyn_array_scc_init (&sccs);
1065 for (i = 0; i < hash_table.num_entries; ++i) {
1066 HashEntry *entry = all_entries [i];
1067 if (entry->v.dfs2.scc_index < 0) {
1068 int index = dyn_array_scc_size (&sccs);
1069 current_scc = dyn_array_scc_add (&sccs);
1070 current_scc->index = index;
1071 current_scc->num_bridge_entries = 0;
1073 current_scc->flag = FALSE;
1074 dyn_array_int_init (¤t_scc->new_xrefs);
1077 dyn_array_int_init (¤t_scc->old_xrefs);
1079 current_scc->api_index = -1;
1085 * If a node has only one incoming edge, we just copy the source's
1086 * xrefs array, effectively removing the source from the graph.
1087 * This takes care of long linked lists.
1089 if (!current_scc->num_bridge_entries && dyn_array_int_size (¤t_scc->new_xrefs) == 1) {
1091 j = dyn_array_int_get (¤t_scc->new_xrefs, 0);
1092 src = dyn_array_scc_get_ptr (&sccs, j);
1093 if (src->num_bridge_entries)
1094 dyn_array_int_set (¤t_scc->new_xrefs, 0, j);
1096 dyn_array_int_copy (¤t_scc->new_xrefs, &src->new_xrefs);
1103 #ifdef TEST_NEW_XREFS
1104 for (j = 0; j < dyn_array_scc_size (&sccs); ++j) {
1105 SCC *scc = dyn_array_scc_get_ptr (&sccs, j);
1106 g_assert (!scc->flag);
1110 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
1111 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
1112 g_assert (scc->index == i);
1113 if (!scc->num_bridge_entries)
1116 dyn_array_int_empty (&merge_array);
1119 dyn_array_int_copy (&scc->new_xrefs, &merge_array);
1120 dyn_array_int_ensure_independent (&scc->new_xrefs);
1122 #ifdef TEST_NEW_XREFS
1123 for (j = 0; j < dyn_array_scc_size (&sccs); ++j) {
1124 SCC *scc = dyn_array_scc_get_ptr (&sccs, j);
1125 g_assert (!scc->flag);
1130 #ifdef TEST_NEW_XREFS
1131 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
1132 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
1133 g_assert (scc->index == i);
1134 if (!scc->num_bridge_entries)
1137 g_assert (dyn_array_int_size (&scc->new_xrefs) == dyn_array_int_size (&scc->old_xrefs));
1138 for (j = 0; j < dyn_array_int_size (&scc->new_xrefs); ++j)
1139 g_assert (dyn_array_int_contains (&scc->old_xrefs, dyn_array_int_get (&scc->new_xrefs, j)));
1145 * Compute the weight of each object. The weight of an object is its size plus the size of all
1146 * objects it points do. When the an object is pointed by multiple objects we distribute it's weight
1147 * equally among them. This distribution gives a rough estimate of the real impact of making the object
1150 * The reasoning for this model is that complex graphs with single roots will have a bridge with very high
1151 * value in comparison to others.
1153 * The all_entries array has all objects topologically sorted. To correctly propagate the weights it must be
1154 * done in reverse topological order - so we calculate the weight of the pointed-to objects before processing
1155 * pointer-from objects.
1157 * We log those objects in the opposite order for no particular reason. The other constrain is that it should use the same
1158 * direction as the other logging loop that records live/dead information.
1160 if (bridge_accounting_enabled) {
1161 for (i = hash_table.num_entries - 1; i >= 0; --i) {
1163 HashEntryWithAccounting *entry = (HashEntryWithAccounting*)all_entries [i];
1165 entry->weight += (double)sgen_safe_object_get_size (sgen_hash_table_key_for_value_pointer (entry));
1166 w = entry->weight / dyn_array_ptr_size (&entry->entry.srcs);
1167 for (j = 0; j < dyn_array_ptr_size (&entry->entry.srcs); ++j) {
1168 HashEntryWithAccounting *other = (HashEntryWithAccounting *)dyn_array_ptr_get (&entry->entry.srcs, j);
1172 for (i = 0; i < hash_table.num_entries; ++i) {
1173 HashEntryWithAccounting *entry = (HashEntryWithAccounting*)all_entries [i];
1174 if (entry->entry.is_bridge) {
1175 MonoObject *obj = sgen_hash_table_key_for_value_pointer (entry);
1176 MonoClass *klass = ((MonoVTable*)SGEN_LOAD_VTABLE (obj))->klass;
1177 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC, "OBJECT %s::%s (%p) weight %f", klass->name_space, klass->name, obj, entry->weight);
1182 sccs_size = dyn_array_scc_size (&sccs);
1184 for (i = 0; i < hash_table.num_entries; ++i) {
1185 HashEntry *entry = all_entries [i];
1186 second_pass_links += dyn_array_ptr_size (&entry->srcs);
1189 SGEN_TV_GETTIME (atv);
1190 step_4 = SGEN_TV_ELAPSED (btv, atv);
1192 //g_print ("%d sccs\n", sccs.size);
1194 dyn_array_ptr_uninit (&dfs_stack);
1196 /* init data for callback */
1199 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
1200 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
1201 g_assert (scc->index == i);
1202 if (scc->num_bridge_entries)
1204 sccs_links += dyn_array_int_size (&scc->XREFS);
1205 max_sccs_links = MAX (max_sccs_links, dyn_array_int_size (&scc->XREFS));
1208 api_sccs = sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeSCC*) * num_sccs, INTERNAL_MEM_BRIDGE_DATA, TRUE);
1211 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
1212 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
1213 if (!scc->num_bridge_entries)
1216 api_sccs [j] = sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeSCC) + sizeof (MonoObject*) * scc->num_bridge_entries, INTERNAL_MEM_BRIDGE_DATA, TRUE);
1217 api_sccs [j]->is_alive = FALSE;
1218 api_sccs [j]->num_objs = scc->num_bridge_entries;
1219 scc->num_bridge_entries = 0;
1220 scc->api_index = j++;
1222 num_xrefs += dyn_array_int_size (&scc->XREFS);
1225 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
1226 if (entry->is_bridge) {
1227 SCC *scc = dyn_array_scc_get_ptr (&sccs, entry->v.dfs2.scc_index);
1228 api_sccs [scc->api_index]->objs [scc->num_bridge_entries++] = sgen_hash_table_key_for_value_pointer (entry);
1230 } SGEN_HASH_TABLE_FOREACH_END;
1232 api_xrefs = sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeXRef) * num_xrefs, INTERNAL_MEM_BRIDGE_DATA, TRUE);
1234 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
1236 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
1237 if (!scc->num_bridge_entries)
1239 for (k = 0; k < dyn_array_int_size (&scc->XREFS); ++k) {
1240 SCC *src_scc = dyn_array_scc_get_ptr (&sccs, dyn_array_int_get (&scc->XREFS, k));
1241 if (!src_scc->num_bridge_entries)
1243 api_xrefs [j].src_scc_index = src_scc->api_index;
1244 api_xrefs [j].dst_scc_index = scc->api_index;
1249 SGEN_TV_GETTIME (btv);
1250 step_5 = SGEN_TV_ELAPSED (atv, btv);
1255 max_entries = max_xrefs = 0;
1256 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
1257 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
1258 if (scc->num_bridge_entries)
1260 if (scc->num_bridge_entries > max_entries)
1261 max_entries = scc->num_bridge_entries;
1262 if (dyn_array_int_size (&scc->XREFS) > max_xrefs)
1263 max_xrefs = dyn_array_int_size (&scc->XREFS);
1265 dyn_array_int_uninit (&scc->new_xrefs);
1268 dyn_array_int_uninit (&scc->old_xrefs);
1272 dyn_array_scc_uninit (&sccs);
1274 sgen_free_internal_dynamic (all_entries, sizeof (HashEntry*) * hash_table.num_entries, INTERNAL_MEM_BRIDGE_DATA);
1277 /* Empty the registered bridges array */
1278 num_registered_bridges = dyn_array_ptr_size (®istered_bridges);
1279 dyn_array_ptr_empty (®istered_bridges);
1281 SGEN_TV_GETTIME (atv);
1282 step_6 = SGEN_TV_ELAPSED (btv, atv);
1284 //g_print ("%d sccs containing bridges - %d max bridge objects - %d max xrefs\n", j, max_entries, max_xrefs);
1286 bridge_processor->num_sccs = num_sccs;
1287 bridge_processor->api_sccs = api_sccs;
1288 bridge_processor->num_xrefs = num_xrefs;
1289 bridge_processor->api_xrefs = api_xrefs;
1293 processing_after_callback (int generation)
1296 int num_sccs = bridge_processor->num_sccs;
1297 MonoGCBridgeSCC **api_sccs = bridge_processor->api_sccs;
1299 if (bridge_accounting_enabled) {
1300 for (i = 0; i < num_sccs; ++i) {
1301 for (j = 0; j < api_sccs [i]->num_objs; ++j)
1302 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC,
1303 "OBJECT %s (%p) SCC [%d] %s",
1304 sgen_safe_name (api_sccs [i]->objs [j]), api_sccs [i]->objs [j],
1306 api_sccs [i]->is_alive ? "ALIVE" : "DEAD");
1310 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC, "GC_NEW_BRIDGE num-objects %d num_hash_entries %d sccs size %d init %.2fms df1 %.2fms sort %.2fms dfs2 %.2fms setup-cb %.2fms free-data %.2fms links %d/%d/%d/%d dfs passes %d/%d ignored %d",
1311 num_registered_bridges, hash_table_size, dyn_array_scc_size (&sccs),
1318 fist_pass_links, second_pass_links, sccs_links, max_sccs_links,
1319 dfs1_passes, dfs2_passes, ignored_objects);
1321 step_1 = 0; /* We must cleanup since this value is used as an accumulator. */
1322 fist_pass_links = second_pass_links = sccs_links = max_sccs_links = 0;
1323 dfs1_passes = dfs2_passes = ignored_objects = 0;
1327 describe_pointer (MonoObject *obj)
1332 for (i = 0; i < dyn_array_ptr_size (®istered_bridges); ++i) {
1333 if (obj == dyn_array_ptr_get (®istered_bridges, i)) {
1334 printf ("Pointer is a registered bridge object.\n");
1339 entry = sgen_hash_table_lookup (&hash_table, obj);
1343 printf ("Bridge hash table entry %p:\n", entry);
1344 printf (" is bridge: %d\n", (int)entry->is_bridge);
1345 printf (" is visited: %d\n", (int)entry->v.dfs1.is_visited);
1349 sgen_new_bridge_init (SgenBridgeProcessor *collector)
1351 collector->reset_data = reset_data;
1352 collector->processing_stw_step = processing_stw_step;
1353 collector->processing_build_callback_data = processing_build_callback_data;
1354 collector->processing_after_callback = processing_after_callback;
1355 collector->class_kind = class_kind;
1356 collector->register_finalized_object = register_finalized_object;
1357 collector->describe_pointer = describe_pointer;
1358 collector->enable_accounting = enable_accounting;
1359 collector->set_dump_prefix = set_dump_prefix;
1361 bridge_processor = collector;