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.
47 #include "sgen-bridge.h"
48 #include "sgen-hash-table.h"
49 #include "sgen-qsort.h"
50 #include "utils/mono-logger-internal.h"
51 #include "utils/mono-time.h"
52 #include "utils/mono-compiler.h"
77 * FIXME: Optimizations:
79 * Don't allocate a scrs array for just one source. Most objects have
80 * just one source, so use the srcs pointer itself.
82 typedef struct _HashEntry {
83 MonoObject *obj; /* This is a duplicate - it's already stored in the hash table */
98 } HashEntryWithAccounting;
100 typedef struct _SCC {
103 int num_bridge_entries;
104 DynIntArray xrefs; /* these are incoming, not outgoing */
107 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);
109 static int current_time;
111 static gboolean bridge_accounting_enabled = FALSE;
120 dyn_array_init (DynArray *da)
128 dyn_array_uninit (DynArray *da, int elem_size)
130 if (da->capacity <= 0)
133 sgen_free_internal_dynamic (da->data, elem_size * da->capacity, INTERNAL_MEM_BRIDGE_DATA);
138 dyn_array_ensure_capacity (DynArray *da, int capacity, int elem_size)
140 int old_capacity = da->capacity;
143 if (capacity <= old_capacity)
146 if (da->capacity == 0)
148 while (capacity > da->capacity)
151 new_data = sgen_alloc_internal_dynamic (elem_size * da->capacity, INTERNAL_MEM_BRIDGE_DATA, TRUE);
152 memcpy (new_data, da->data, elem_size * da->size);
153 sgen_free_internal_dynamic (da->data, elem_size * old_capacity, INTERNAL_MEM_BRIDGE_DATA);
158 dyn_array_add (DynArray *da, int elem_size)
162 dyn_array_ensure_capacity (da, da->size + 1, elem_size);
164 p = da->data + da->size * elem_size;
171 dyn_array_int_init (DynIntArray *da)
173 dyn_array_init (&da->array);
177 dyn_array_int_uninit (DynIntArray *da)
179 dyn_array_uninit (&da->array, sizeof (int));
183 dyn_array_int_size (DynIntArray *da)
185 return da->array.size;
189 dyn_array_int_set_size (DynIntArray *da, int size)
191 da->array.size = size;
195 dyn_array_int_add (DynIntArray *da, int x)
197 int *p = dyn_array_add (&da->array, sizeof (int));
202 dyn_array_int_get (DynIntArray *da, int x)
204 return ((int*)da->array.data)[x];
208 dyn_array_int_set (DynIntArray *da, int idx, int val)
210 ((int*)da->array.data)[idx] = val;
214 dyn_array_int_ensure_capacity (DynIntArray *da, int capacity)
216 dyn_array_ensure_capacity (&da->array, capacity, sizeof (int));
220 dyn_array_int_set_all (DynIntArray *dst, DynIntArray *src)
222 dyn_array_int_ensure_capacity (dst, src->array.size);
223 memcpy (dst->array.data, src->array.data, src->array.size * sizeof (int));
224 dst->array.size = src->array.size;
230 dyn_array_ptr_init (DynPtrArray *da)
232 dyn_array_init (&da->array);
236 dyn_array_ptr_uninit (DynPtrArray *da)
238 dyn_array_uninit (&da->array, sizeof (void*));
242 dyn_array_ptr_size (DynPtrArray *da)
244 return da->array.size;
248 dyn_array_ptr_set_size (DynPtrArray *da, int size)
250 da->array.size = size;
254 dyn_array_ptr_get (DynPtrArray *da, int x)
256 return ((void**)da->array.data)[x];
260 dyn_array_ptr_add (DynPtrArray *da, void *ptr)
262 void **p = dyn_array_add (&da->array, sizeof (void*));
266 #define dyn_array_ptr_push dyn_array_ptr_add
269 dyn_array_ptr_pop (DynPtrArray *da)
272 int size = da->array.size;
274 p = dyn_array_ptr_get (da, size - 1);
282 dyn_array_scc_init (DynSCCArray *da)
284 dyn_array_init (&da->array);
288 dyn_array_scc_uninit (DynSCCArray *da)
290 dyn_array_uninit (&da->array, sizeof (SCC));
294 dyn_array_scc_size (DynSCCArray *da)
296 return da->array.size;
300 dyn_array_scc_add (DynSCCArray *da)
302 return dyn_array_add (&da->array, sizeof (SCC));
306 dyn_array_scc_get_ptr (DynSCCArray *da, int x)
308 return &((SCC*)da->array.data)[x];
313 static DynIntArray merge_array;
316 dyn_array_int_contains (DynIntArray *da, int x)
319 for (i = 0; i < dyn_array_int_size (da); ++i)
320 if (dyn_array_int_get (da, i) == x)
327 dyn_array_int_merge (DynIntArray *dst, DynIntArray *src)
331 dyn_array_int_ensure_capacity (&merge_array, dyn_array_int_size (dst) + dyn_array_int_size (src));
332 dyn_array_int_set_size (&merge_array, 0);
334 for (i = j = 0; i < dyn_array_int_size (dst) || j < dyn_array_int_size (src); ) {
335 if (i < dyn_array_int_size (dst) && j < dyn_array_int_size (src)) {
336 int a = dyn_array_int_get (dst, i);
337 int b = dyn_array_int_get (src, j);
339 dyn_array_int_add (&merge_array, a);
342 dyn_array_int_add (&merge_array, a);
346 dyn_array_int_add (&merge_array, b);
349 } else if (i < dyn_array_int_size (dst)) {
350 dyn_array_int_add (&merge_array, dyn_array_int_get (dst, i));
353 dyn_array_int_add (&merge_array, dyn_array_int_get (src, j));
358 if (dyn_array_int_size (&merge_array) > dyn_array_int_size (dst)) {
359 dyn_array_int_set_all (dst, &merge_array);
364 dyn_array_int_merge_one (DynIntArray *array, int value)
368 int size = dyn_array_int_size (array);
370 for (i = 0; i < size; ++i) {
371 if (dyn_array_int_get (array, i) == value)
373 else if (dyn_array_int_get (array, i) > value)
377 dyn_array_int_ensure_capacity (array, size + 1);
380 tmp = dyn_array_int_get (array, i);
381 for (; i < size; ++i) {
382 dyn_array_int_set (array, i, value);
384 tmp = dyn_array_int_get (array, i + 1);
386 dyn_array_int_set (array, size, value);
388 dyn_array_int_set (array, size, value);
391 dyn_array_int_set_size (array, size + 1);
396 enable_accounting (void)
398 bridge_accounting_enabled = TRUE;
399 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);
402 static MonoGCBridgeObjectKind
403 class_kind (MonoClass *class)
405 return bridge_callbacks.bridge_class_kind (class);
409 get_hash_entry (MonoObject *obj, gboolean *existing)
411 HashEntry *entry = sgen_hash_table_lookup (&hash_table, obj);
422 memset (&new_entry, 0, sizeof (HashEntry));
425 dyn_array_ptr_init (&new_entry.srcs);
426 new_entry.finishing_time = -1;
427 new_entry.scc_index = -1;
429 sgen_hash_table_replace (&hash_table, obj, &new_entry, NULL);
431 return sgen_hash_table_lookup (&hash_table, obj);
435 add_source (HashEntry *entry, HashEntry *src)
437 dyn_array_ptr_add (&entry->srcs, src);
448 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
449 int entry_size = dyn_array_ptr_size (&entry->srcs);
450 total_srcs += entry_size;
451 if (entry_size > max_srcs)
452 max_srcs = entry_size;
453 dyn_array_ptr_uninit (&entry->srcs);
454 } SGEN_HASH_TABLE_FOREACH_END;
456 sgen_hash_table_clean (&hash_table);
458 dyn_array_int_uninit (&merge_array);
459 //g_print ("total srcs %d - max %d\n", total_srcs, max_srcs);
463 register_bridge_object (MonoObject *obj)
465 HashEntry *entry = get_hash_entry (obj, NULL);
466 entry->is_bridge = TRUE;
471 register_finishing_time (HashEntry *entry, int t)
473 g_assert (entry->finishing_time < 0);
474 entry->finishing_time = t;
478 object_is_live (MonoObject **objp)
480 MonoObject *obj = *objp;
481 MonoObject *fwd = SGEN_OBJECT_IS_FORWARDED (obj);
484 return sgen_hash_table_lookup (&hash_table, fwd) == NULL;
486 if (!sgen_object_is_live (obj))
488 return sgen_hash_table_lookup (&hash_table, obj) == NULL;
491 static DynPtrArray registered_bridges;
492 static DynPtrArray dfs_stack;
494 static int dsf1_passes, dsf2_passes;
498 #define HANDLE_PTR(ptr,obj) do { \
499 MonoObject *dst = (MonoObject*)*(ptr); \
500 if (dst && !object_is_live (&dst)) { \
501 dyn_array_ptr_push (&dfs_stack, obj_entry); \
502 dyn_array_ptr_push (&dfs_stack, get_hash_entry (dst, NULL)); \
507 dfs1 (HashEntry *obj_entry)
510 g_assert (dyn_array_ptr_size (&dfs_stack) == 0);
512 dyn_array_ptr_push (&dfs_stack, NULL);
513 dyn_array_ptr_push (&dfs_stack, obj_entry);
520 obj_entry = dyn_array_ptr_pop (&dfs_stack);
522 src = dyn_array_ptr_pop (&dfs_stack);
524 obj = obj_entry->obj;
528 //g_print ("link %s -> %s\n", sgen_safe_name (src->obj), sgen_safe_name (obj));
529 add_source (obj_entry, src);
531 //g_print ("starting with %s\n", sgen_safe_name (obj));
534 if (obj_entry->is_visited)
537 obj_entry->is_visited = TRUE;
539 dyn_array_ptr_push (&dfs_stack, obj_entry);
540 /* NULL marks that the next entry is to be finished */
541 dyn_array_ptr_push (&dfs_stack, NULL);
543 #include "sgen-scan-object.h"
545 obj_entry = dyn_array_ptr_pop (&dfs_stack);
547 //g_print ("finish %s\n", sgen_safe_name (obj_entry->obj));
548 register_finishing_time (obj_entry, current_time++);
550 } while (dyn_array_ptr_size (&dfs_stack) > 0);
554 scc_add_xref (SCC *src, SCC *dst)
556 g_assert (src != dst);
557 g_assert (src->index != dst->index);
559 if (dyn_array_int_contains (&dst->xrefs, src->index))
561 if (src->num_bridge_entries) {
562 dyn_array_int_merge_one (&dst->xrefs, src->index);
565 dyn_array_int_merge (&dst->xrefs, &src->xrefs);
566 for (i = 0; i < dyn_array_int_size (&dst->xrefs); ++i)
567 g_assert (dyn_array_int_get (&dst->xrefs, i) != dst->index);
572 scc_add_entry (SCC *scc, HashEntry *entry)
574 g_assert (entry->scc_index < 0);
575 entry->scc_index = scc->index;
576 if (entry->is_bridge)
577 ++scc->num_bridge_entries;
580 static DynSCCArray sccs;
581 static SCC *current_scc;
584 dfs2 (HashEntry *entry)
588 g_assert (dyn_array_ptr_size (&dfs_stack) == 0);
590 dyn_array_ptr_push (&dfs_stack, entry);
593 entry = dyn_array_ptr_pop (&dfs_stack);
596 if (entry->scc_index >= 0) {
597 if (entry->scc_index != current_scc->index)
598 scc_add_xref (dyn_array_scc_get_ptr (&sccs, entry->scc_index), current_scc);
602 scc_add_entry (current_scc, entry);
604 for (i = 0; i < dyn_array_ptr_size (&entry->srcs); ++i)
605 dyn_array_ptr_push (&dfs_stack, dyn_array_ptr_get (&entry->srcs, i));
606 } while (dyn_array_ptr_size (&dfs_stack) > 0);
610 compare_hash_entries (const HashEntry *e1, const HashEntry *e2)
612 return e2->finishing_time - e1->finishing_time;
615 DEF_QSORT_INLINE(hash_entries, HashEntry*, compare_hash_entries)
617 static unsigned long step_1, step_2, step_3, step_4, step_5, step_6, step_7, step_8;
618 static int fist_pass_links, second_pass_links, sccs_links;
619 static int max_sccs_links = 0;
622 register_finalized_object (MonoObject *obj)
624 g_assert (sgen_need_bridge_processing ());
625 dyn_array_ptr_push (®istered_bridges, obj);
631 dyn_array_ptr_set_size (®istered_bridges, 0);
635 processing_stw_step (void)
639 SGEN_TV_DECLARE (atv);
640 SGEN_TV_DECLARE (btv);
642 if (!dyn_array_ptr_size (®istered_bridges))
646 * bridge_processing_in_progress must be set with the world
647 * stopped. If not there would be race conditions.
649 bridge_processing_in_progress = TRUE;
651 SGEN_TV_GETTIME (btv);
655 dyn_array_ptr_init (&dfs_stack);
656 dyn_array_int_init (&merge_array);
660 First we insert all bridges into the hash table and then we do dfs1.
662 It must be done in 2 steps since the bridge arrays doesn't come in reverse topological order,
663 which means that we can have entry N pointing to entry N + 1.
665 If we dfs1 entry N before N + 1 is registered we'll not consider N + 1 for this bridge
666 pass and not create the required xref between the two.
668 bridge_count = dyn_array_ptr_size (®istered_bridges);
669 for (i = 0; i < bridge_count ; ++i)
670 register_bridge_object (dyn_array_ptr_get (®istered_bridges, i));
672 for (i = 0; i < bridge_count; ++i)
673 dfs1 (get_hash_entry (dyn_array_ptr_get (®istered_bridges, i), NULL));
675 SGEN_TV_GETTIME (atv);
676 step_2 = SGEN_TV_ELAPSED (btv, atv);
680 is_bridge_object_alive (MonoObject *obj, void *data)
682 SgenHashTable *table = data;
683 unsigned char *value = sgen_hash_table_lookup (table, obj);
690 processing_finish (int generation)
693 int num_sccs, num_xrefs;
694 int max_entries, max_xrefs;
695 int hash_table_size, sccs_size;
698 int num_registered_bridges;
699 HashEntry **all_entries;
700 MonoGCBridgeSCC **api_sccs;
701 MonoGCBridgeXRef *api_xrefs;
702 SgenHashTable alive_hash = SGEN_HASH_TABLE_INIT (INTERNAL_MEM_BRIDGE_ALIVE_HASH_TABLE, INTERNAL_MEM_BRIDGE_ALIVE_HASH_TABLE_ENTRY, 1, mono_aligned_addr_hash, NULL);
703 SGEN_TV_DECLARE (atv);
704 SGEN_TV_DECLARE (btv);
706 if (!dyn_array_ptr_size (®istered_bridges))
709 g_assert (bridge_processing_in_progress);
711 SGEN_TV_GETTIME (atv);
713 /* alloc and fill array of all entries */
715 all_entries = sgen_alloc_internal_dynamic (sizeof (HashEntry*) * hash_table.num_entries, INTERNAL_MEM_BRIDGE_DATA, TRUE);
718 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
719 g_assert (entry->finishing_time >= 0);
720 all_entries [j++] = entry;
721 fist_pass_links += dyn_array_ptr_size (&entry->srcs);
722 } SGEN_HASH_TABLE_FOREACH_END;
723 g_assert (j == hash_table.num_entries);
724 hash_table_size = hash_table.num_entries;
726 /* sort array according to decreasing finishing time */
727 qsort_hash_entries (all_entries, hash_table.num_entries);
729 SGEN_TV_GETTIME (btv);
730 step_3 = SGEN_TV_ELAPSED (atv, btv);
732 /* second DFS pass */
734 dyn_array_scc_init (&sccs);
735 for (i = 0; i < hash_table.num_entries; ++i) {
736 HashEntry *entry = all_entries [i];
737 if (entry->scc_index < 0) {
738 int index = dyn_array_scc_size (&sccs);
739 current_scc = dyn_array_scc_add (&sccs);
740 current_scc->index = index;
741 current_scc->num_bridge_entries = 0;
742 current_scc->api_index = -1;
743 dyn_array_int_init (¤t_scc->xrefs);
750 * Compute the weight of each object. The weight of an object is its size plus the size of all
751 * objects it points do. When the an object is pointed by multiple objects we distribute it's weight
752 * equally among them. This distribution gives a rough estimate of the real impact of making the object
755 * The reasoning for this model is that complex graphs with single roots will have a bridge with very high
756 * value in comparison to others.
758 * The all_entries array has all objects topologically sorted. To correctly propagate the weights it must be
759 * done in reverse topological order - so we calculate the weight of the pointed-to objects before processing
760 * pointer-from objects.
762 * We log those objects in the opposite order for no particular reason. The other constrain is that it should use the same
763 * direction as the other logging loop that records live/dead information.
765 if (bridge_accounting_enabled) {
766 for (i = hash_table.num_entries - 1; i >= 0; --i) {
768 HashEntryWithAccounting *entry = (HashEntryWithAccounting*)all_entries [i];
770 entry->weight += (double)sgen_safe_object_get_size (entry->entry.obj);
771 w = entry->weight / dyn_array_ptr_size (&entry->entry.srcs);
772 for (j = 0; j < dyn_array_ptr_size (&entry->entry.srcs); ++j) {
773 HashEntryWithAccounting *other = (HashEntryWithAccounting *)dyn_array_ptr_get (&entry->entry.srcs, j);
777 for (i = 0; i < hash_table.num_entries; ++i) {
778 HashEntryWithAccounting *entry = (HashEntryWithAccounting*)all_entries [i];
779 if (entry->entry.is_bridge) {
780 MonoClass *klass = ((MonoVTable*)SGEN_LOAD_VTABLE (entry->entry.obj))->klass;
781 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC, "OBJECT %s::%s (%p) weight %f", klass->name_space, klass->name, entry->entry.obj, entry->weight);
786 sccs_size = dyn_array_scc_size (&sccs);
788 for (i = 0; i < hash_table.num_entries; ++i) {
789 HashEntry *entry = all_entries [i];
790 second_pass_links += dyn_array_ptr_size (&entry->srcs);
793 SGEN_TV_GETTIME (atv);
794 step_4 = SGEN_TV_ELAPSED (btv, atv);
796 //g_print ("%d sccs\n", sccs.size);
798 dyn_array_ptr_uninit (&dfs_stack);
800 /* init data for callback */
803 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
804 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
805 g_assert (scc->index == i);
806 if (scc->num_bridge_entries)
808 sccs_links += dyn_array_int_size (&scc->xrefs);
809 max_sccs_links = MAX (max_sccs_links, dyn_array_int_size (&scc->xrefs));
812 api_sccs = sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeSCC*) * num_sccs, INTERNAL_MEM_BRIDGE_DATA, TRUE);
815 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
816 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
817 if (!scc->num_bridge_entries)
820 api_sccs [j] = sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeSCC) + sizeof (MonoObject*) * scc->num_bridge_entries, INTERNAL_MEM_BRIDGE_DATA, TRUE);
821 api_sccs [j]->is_alive = FALSE;
822 api_sccs [j]->num_objs = scc->num_bridge_entries;
823 scc->num_bridge_entries = 0;
824 scc->api_index = j++;
826 num_xrefs += dyn_array_int_size (&scc->xrefs);
829 SGEN_HASH_TABLE_FOREACH (&hash_table, obj, entry) {
830 if (entry->is_bridge) {
831 SCC *scc = dyn_array_scc_get_ptr (&sccs, entry->scc_index);
832 api_sccs [scc->api_index]->objs [scc->num_bridge_entries++] = entry->obj;
834 } SGEN_HASH_TABLE_FOREACH_END;
836 api_xrefs = sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeXRef) * num_xrefs, INTERNAL_MEM_BRIDGE_DATA, TRUE);
838 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
840 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
841 if (!scc->num_bridge_entries)
843 for (k = 0; k < dyn_array_int_size (&scc->xrefs); ++k) {
844 SCC *src_scc = dyn_array_scc_get_ptr (&sccs, dyn_array_int_get (&scc->xrefs, k));
845 if (!src_scc->num_bridge_entries)
847 api_xrefs [j].src_scc_index = src_scc->api_index;
848 api_xrefs [j].dst_scc_index = scc->api_index;
853 SGEN_TV_GETTIME (btv);
854 step_5 = SGEN_TV_ELAPSED (atv, btv);
859 max_entries = max_xrefs = 0;
860 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
861 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
862 if (scc->num_bridge_entries)
864 if (scc->num_bridge_entries > max_entries)
865 max_entries = scc->num_bridge_entries;
866 if (dyn_array_int_size (&scc->xrefs) > max_xrefs)
867 max_xrefs = dyn_array_int_size (&scc->xrefs);
868 dyn_array_int_uninit (&scc->xrefs);
871 dyn_array_scc_uninit (&sccs);
873 sgen_free_internal_dynamic (all_entries, sizeof (HashEntry*) * hash_table.num_entries, INTERNAL_MEM_BRIDGE_DATA);
876 /* Empty the registered bridges array */
877 num_registered_bridges = dyn_array_ptr_size (®istered_bridges);
878 dyn_array_ptr_set_size (®istered_bridges, 0);
880 SGEN_TV_GETTIME (atv);
881 step_6 = SGEN_TV_ELAPSED (btv, atv);
883 //g_print ("%d sccs containing bridges - %d max bridge objects - %d max xrefs\n", j, max_entries, max_xrefs);
887 bridge_callbacks.cross_references (num_sccs, api_sccs, num_xrefs, api_xrefs);
889 /* Release for finalization those objects we no longer care. */
890 SGEN_TV_GETTIME (btv);
891 step_7 = SGEN_TV_ELAPSED (atv, btv);
893 for (i = 0; i < num_sccs; ++i) {
894 unsigned char alive = api_sccs [i]->is_alive ? 1 : 0;
895 for (j = 0; j < api_sccs [i]->num_objs; ++j) {
896 /* Build hash table for nulling weak links. */
897 sgen_hash_table_replace (&alive_hash, api_sccs [i]->objs [j], &alive, NULL);
899 /* Release for finalization those objects we no longer care. */
900 if (!api_sccs [i]->is_alive)
901 sgen_mark_bridge_object (api_sccs [i]->objs [j]);
905 /* Null weak links to dead objects. */
906 sgen_null_links_with_predicate (GENERATION_NURSERY, is_bridge_object_alive, &alive_hash);
907 if (generation == GENERATION_OLD)
908 sgen_null_links_with_predicate (GENERATION_OLD, is_bridge_object_alive, &alive_hash);
910 sgen_hash_table_clean (&alive_hash);
912 if (bridge_accounting_enabled) {
913 for (i = 0; i < num_sccs; ++i) {
914 for (j = 0; j < api_sccs [i]->num_objs; ++j)
915 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC,
916 "OBJECT %s (%p) SCC [%d] %s",
917 sgen_safe_name (api_sccs [i]->objs [j]), api_sccs [i]->objs [j],
919 api_sccs [i]->is_alive ? "ALIVE" : "DEAD");
923 /* free callback data */
925 for (i = 0; i < num_sccs; ++i) {
926 sgen_free_internal_dynamic (api_sccs [i],
927 sizeof (MonoGCBridgeSCC) + sizeof (MonoObject*) * api_sccs [i]->num_objs,
928 INTERNAL_MEM_BRIDGE_DATA);
930 sgen_free_internal_dynamic (api_sccs, sizeof (MonoGCBridgeSCC*) * num_sccs, INTERNAL_MEM_BRIDGE_DATA);
932 sgen_free_internal_dynamic (api_xrefs, sizeof (MonoGCBridgeXRef) * num_xrefs, INTERNAL_MEM_BRIDGE_DATA);
934 SGEN_TV_GETTIME (atv);
935 step_8 = SGEN_TV_ELAPSED (btv, atv);
937 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC, "GC_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 user-cb %.2fms clenanup %.2fms links %d/%d/%d/%d dfs passes %d/%d",
938 num_registered_bridges, hash_table_size, dyn_array_scc_size (&sccs),
947 fist_pass_links, second_pass_links, sccs_links, max_sccs_links,
948 dsf1_passes, dsf2_passes);
950 step_1 = 0; /* We must cleanup since this value is used as an accumulator. */
952 bridge_processing_in_progress = FALSE;
956 describe_pointer (MonoObject *obj)
961 for (i = 0; i < dyn_array_ptr_size (®istered_bridges); ++i) {
962 if (obj == dyn_array_ptr_get (®istered_bridges, i)) {
963 printf ("Pointer is a registered bridge object.\n");
968 entry = sgen_hash_table_lookup (&hash_table, obj);
972 printf ("Bridge hash table entry %p:\n", entry);
973 printf (" is bridge: %d\n", (int)entry->is_bridge);
974 printf (" is visited: %d\n", (int)entry->is_visited);
978 sgen_new_bridge_init (SgenBridgeProcessor *collector)
980 collector->reset_data = reset_data;
981 collector->processing_stw_step = processing_stw_step;
982 collector->processing_finish = processing_finish;
983 collector->class_kind = class_kind;
984 collector->register_finalized_object = register_finalized_object;
985 collector->describe_pointer = describe_pointer;
986 collector->enable_accounting = enable_accounting;