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)
6 * Copyright 2001-2003 Ximian, Inc
7 * Copyright 2003-2010 Novell, Inc.
8 * Licensed under the MIT license. See LICENSE file in the project root for full license information.
17 #include "sgen/sgen-gc.h"
18 #include "sgen-bridge-internals.h"
19 #include "sgen/sgen-hash-table.h"
20 #include "sgen/sgen-qsort.h"
21 #include "sgen/sgen-client.h"
22 #include "utils/mono-logger-internals.h"
46 * FIXME: Optimizations:
48 * Don't allocate a scrs array for just one source. Most objects have
49 * just one source, so use the srcs pointer itself.
51 typedef struct _HashEntry {
52 GCObject *obj; /* This is a duplicate - it's already stored in the hash table */
67 } HashEntryWithAccounting;
72 int num_bridge_entries;
73 DynIntArray xrefs; /* these are incoming, not outgoing */
76 static SgenHashTable hash_table = SGEN_HASH_TABLE_INIT (INTERNAL_MEM_OLD_BRIDGE_HASH_TABLE, INTERNAL_MEM_OLD_BRIDGE_HASH_TABLE_ENTRY, sizeof (HashEntry), mono_aligned_addr_hash, NULL);
78 static int current_time;
80 static gboolean bridge_accounting_enabled = FALSE;
82 static SgenBridgeProcessor *bridge_processor;
90 dyn_array_init (DynArray *da)
98 dyn_array_uninit (DynArray *da, int elem_size)
100 if (da->capacity <= 0)
103 sgen_free_internal_dynamic (da->data, elem_size * da->capacity, INTERNAL_MEM_BRIDGE_DATA);
108 dyn_array_ensure_capacity (DynArray *da, int capacity, int elem_size)
110 int old_capacity = da->capacity;
113 if (capacity <= old_capacity)
116 if (da->capacity == 0)
118 while (capacity > da->capacity)
121 new_data = (char *)sgen_alloc_internal_dynamic (elem_size * da->capacity, INTERNAL_MEM_BRIDGE_DATA, TRUE);
122 memcpy (new_data, da->data, elem_size * da->size);
123 sgen_free_internal_dynamic (da->data, elem_size * old_capacity, INTERNAL_MEM_BRIDGE_DATA);
128 dyn_array_add (DynArray *da, int elem_size)
132 dyn_array_ensure_capacity (da, da->size + 1, elem_size);
134 p = da->data + da->size * elem_size;
141 dyn_array_int_init (DynIntArray *da)
143 dyn_array_init (&da->array);
147 dyn_array_int_uninit (DynIntArray *da)
149 dyn_array_uninit (&da->array, sizeof (int));
153 dyn_array_int_size (DynIntArray *da)
155 return da->array.size;
159 dyn_array_int_set_size (DynIntArray *da, int size)
161 da->array.size = size;
165 dyn_array_int_add (DynIntArray *da, int x)
167 int *p = (int *)dyn_array_add (&da->array, sizeof (int));
172 dyn_array_int_get (DynIntArray *da, int x)
174 return ((int*)da->array.data)[x];
178 dyn_array_int_set (DynIntArray *da, int idx, int val)
180 ((int*)da->array.data)[idx] = val;
184 dyn_array_int_ensure_capacity (DynIntArray *da, int capacity)
186 dyn_array_ensure_capacity (&da->array, capacity, sizeof (int));
190 dyn_array_int_set_all (DynIntArray *dst, DynIntArray *src)
192 dyn_array_int_ensure_capacity (dst, src->array.size);
193 memcpy (dst->array.data, src->array.data, src->array.size * sizeof (int));
194 dst->array.size = src->array.size;
200 dyn_array_ptr_init (DynPtrArray *da)
202 dyn_array_init (&da->array);
206 dyn_array_ptr_uninit (DynPtrArray *da)
208 dyn_array_uninit (&da->array, sizeof (void*));
212 dyn_array_ptr_size (DynPtrArray *da)
214 return da->array.size;
218 dyn_array_ptr_set_size (DynPtrArray *da, int size)
220 da->array.size = size;
224 dyn_array_ptr_get (DynPtrArray *da, int x)
226 return ((void**)da->array.data)[x];
230 dyn_array_ptr_add (DynPtrArray *da, void *ptr)
232 void **p = (void **)dyn_array_add (&da->array, sizeof (void*));
236 #define dyn_array_ptr_push dyn_array_ptr_add
239 dyn_array_ptr_pop (DynPtrArray *da)
242 int size = da->array.size;
244 p = dyn_array_ptr_get (da, size - 1);
252 dyn_array_scc_init (DynSCCArray *da)
254 dyn_array_init (&da->array);
258 dyn_array_scc_uninit (DynSCCArray *da)
260 dyn_array_uninit (&da->array, sizeof (SCC));
264 dyn_array_scc_size (DynSCCArray *da)
266 return da->array.size;
270 dyn_array_scc_add (DynSCCArray *da)
272 return (SCC *)dyn_array_add (&da->array, sizeof (SCC));
276 dyn_array_scc_get_ptr (DynSCCArray *da, int x)
278 return &((SCC*)da->array.data)[x];
283 static DynIntArray merge_array;
286 dyn_array_int_contains (DynIntArray *da, int x)
289 for (i = 0; i < dyn_array_int_size (da); ++i)
290 if (dyn_array_int_get (da, i) == x)
297 dyn_array_int_merge (DynIntArray *dst, DynIntArray *src)
301 dyn_array_int_ensure_capacity (&merge_array, dyn_array_int_size (dst) + dyn_array_int_size (src));
302 dyn_array_int_set_size (&merge_array, 0);
304 for (i = j = 0; i < dyn_array_int_size (dst) || j < dyn_array_int_size (src); ) {
305 if (i < dyn_array_int_size (dst) && j < dyn_array_int_size (src)) {
306 int a = dyn_array_int_get (dst, i);
307 int b = dyn_array_int_get (src, j);
309 dyn_array_int_add (&merge_array, a);
312 dyn_array_int_add (&merge_array, a);
316 dyn_array_int_add (&merge_array, b);
319 } else if (i < dyn_array_int_size (dst)) {
320 dyn_array_int_add (&merge_array, dyn_array_int_get (dst, i));
323 dyn_array_int_add (&merge_array, dyn_array_int_get (src, j));
328 if (dyn_array_int_size (&merge_array) > dyn_array_int_size (dst)) {
329 dyn_array_int_set_all (dst, &merge_array);
334 dyn_array_int_merge_one (DynIntArray *array, int value)
338 int size = dyn_array_int_size (array);
340 for (i = 0; i < size; ++i) {
341 if (dyn_array_int_get (array, i) == value)
343 else if (dyn_array_int_get (array, i) > value)
347 dyn_array_int_ensure_capacity (array, size + 1);
350 tmp = dyn_array_int_get (array, i);
351 for (; i < size; ++i) {
352 dyn_array_int_set (array, i, value);
354 tmp = dyn_array_int_get (array, i + 1);
356 dyn_array_int_set (array, size, value);
358 dyn_array_int_set (array, size, value);
361 dyn_array_int_set_size (array, size + 1);
366 enable_accounting (void)
368 SgenHashTable table = SGEN_HASH_TABLE_INIT (INTERNAL_MEM_BRIDGE_HASH_TABLE, INTERNAL_MEM_BRIDGE_HASH_TABLE_ENTRY, sizeof (HashEntryWithAccounting), mono_aligned_addr_hash, NULL);
369 bridge_accounting_enabled = TRUE;
373 static MonoGCBridgeObjectKind
374 class_kind (MonoClass *klass)
376 return bridge_callbacks.bridge_class_kind (klass);
380 get_hash_entry (GCObject *obj, gboolean *existing)
382 HashEntry *entry = (HashEntry *)sgen_hash_table_lookup (&hash_table, obj);
393 memset (&new_entry, 0, sizeof (HashEntry));
396 dyn_array_ptr_init (&new_entry.srcs);
397 new_entry.finishing_time = -1;
398 new_entry.scc_index = -1;
400 sgen_hash_table_replace (&hash_table, obj, &new_entry, NULL);
402 return (HashEntry *)sgen_hash_table_lookup (&hash_table, obj);
406 add_source (HashEntry *entry, HashEntry *src)
408 dyn_array_ptr_add (&entry->srcs, src);
414 GCObject *obj G_GNUC_UNUSED;
419 SGEN_HASH_TABLE_FOREACH (&hash_table, GCObject *, obj, HashEntry *, entry) {
420 int entry_size = dyn_array_ptr_size (&entry->srcs);
421 total_srcs += entry_size;
422 if (entry_size > max_srcs)
423 max_srcs = entry_size;
424 dyn_array_ptr_uninit (&entry->srcs);
425 } SGEN_HASH_TABLE_FOREACH_END;
427 sgen_hash_table_clean (&hash_table);
429 dyn_array_int_uninit (&merge_array);
430 //g_print ("total srcs %d - max %d\n", total_srcs, max_srcs);
434 register_bridge_object (GCObject *obj)
436 HashEntry *entry = get_hash_entry (obj, NULL);
437 entry->is_bridge = TRUE;
442 register_finishing_time (HashEntry *entry, int t)
444 g_assert (entry->finishing_time < 0);
445 entry->finishing_time = t;
449 object_is_live (GCObject **objp)
451 GCObject *obj = *objp;
452 GCObject *fwd = SGEN_OBJECT_IS_FORWARDED (obj);
455 return sgen_hash_table_lookup (&hash_table, fwd) == NULL;
457 if (!sgen_object_is_live (obj))
459 return sgen_hash_table_lookup (&hash_table, obj) == NULL;
462 static DynPtrArray registered_bridges;
463 static DynPtrArray dfs_stack;
465 static int dfs1_passes, dfs2_passes;
469 #define HANDLE_PTR(ptr,obj) do { \
470 GCObject *dst = (GCObject*)*(ptr); \
471 if (dst && !object_is_live (&dst)) { \
472 dyn_array_ptr_push (&dfs_stack, obj_entry); \
473 dyn_array_ptr_push (&dfs_stack, get_hash_entry (dst, NULL)); \
478 dfs1 (HashEntry *obj_entry)
481 g_assert (dyn_array_ptr_size (&dfs_stack) == 0);
483 dyn_array_ptr_push (&dfs_stack, NULL);
484 dyn_array_ptr_push (&dfs_stack, obj_entry);
490 obj_entry = (HashEntry *)dyn_array_ptr_pop (&dfs_stack);
494 src = (HashEntry *)dyn_array_ptr_pop (&dfs_stack);
496 obj = obj_entry->obj;
497 desc = sgen_obj_get_descriptor_safe (obj);
500 //g_print ("link %s -> %s\n", sgen_safe_name (src->obj), sgen_safe_name (obj));
501 add_source (obj_entry, src);
503 //g_print ("starting with %s\n", sgen_safe_name (obj));
506 if (obj_entry->is_visited)
509 obj_entry->is_visited = TRUE;
511 dyn_array_ptr_push (&dfs_stack, obj_entry);
512 /* NULL marks that the next entry is to be finished */
513 dyn_array_ptr_push (&dfs_stack, NULL);
516 #include "sgen/sgen-scan-object.h"
518 obj_entry = (HashEntry *)dyn_array_ptr_pop (&dfs_stack);
520 //g_print ("finish %s\n", sgen_safe_name (obj_entry->obj));
521 register_finishing_time (obj_entry, current_time++);
523 } while (dyn_array_ptr_size (&dfs_stack) > 0);
527 scc_add_xref (SCC *src, SCC *dst)
529 g_assert (src != dst);
530 g_assert (src->index != dst->index);
532 if (dyn_array_int_contains (&dst->xrefs, src->index))
534 if (src->num_bridge_entries) {
535 dyn_array_int_merge_one (&dst->xrefs, src->index);
538 dyn_array_int_merge (&dst->xrefs, &src->xrefs);
539 for (i = 0; i < dyn_array_int_size (&dst->xrefs); ++i)
540 g_assert (dyn_array_int_get (&dst->xrefs, i) != dst->index);
545 scc_add_entry (SCC *scc, HashEntry *entry)
547 g_assert (entry->scc_index < 0);
548 entry->scc_index = scc->index;
549 if (entry->is_bridge)
550 ++scc->num_bridge_entries;
553 static DynSCCArray sccs;
554 static SCC *current_scc;
557 dfs2 (HashEntry *entry)
561 g_assert (dyn_array_ptr_size (&dfs_stack) == 0);
563 dyn_array_ptr_push (&dfs_stack, entry);
566 entry = (HashEntry *)dyn_array_ptr_pop (&dfs_stack);
569 if (entry->scc_index >= 0) {
570 if (entry->scc_index != current_scc->index)
571 scc_add_xref (dyn_array_scc_get_ptr (&sccs, entry->scc_index), current_scc);
575 scc_add_entry (current_scc, entry);
577 for (i = 0; i < dyn_array_ptr_size (&entry->srcs); ++i)
578 dyn_array_ptr_push (&dfs_stack, dyn_array_ptr_get (&entry->srcs, i));
579 } while (dyn_array_ptr_size (&dfs_stack) > 0);
583 compare_hash_entries (const HashEntry *e1, const HashEntry *e2)
585 return e2->finishing_time - e1->finishing_time;
588 DEF_QSORT_INLINE(hash_entries, HashEntry*, compare_hash_entries)
590 static unsigned long step_1, step_2, step_3, step_4, step_5, step_6;
591 static int fist_pass_links, second_pass_links, sccs_links;
592 static int max_sccs_links = 0;
595 register_finalized_object (GCObject *obj)
597 g_assert (sgen_need_bridge_processing ());
598 dyn_array_ptr_push (®istered_bridges, obj);
604 dyn_array_ptr_set_size (®istered_bridges, 0);
608 processing_stw_step (void)
612 SGEN_TV_DECLARE (atv);
613 SGEN_TV_DECLARE (btv);
615 if (!dyn_array_ptr_size (®istered_bridges))
618 SGEN_TV_GETTIME (btv);
622 dyn_array_ptr_init (&dfs_stack);
623 dyn_array_int_init (&merge_array);
627 First we insert all bridges into the hash table and then we do dfs1.
629 It must be done in 2 steps since the bridge arrays doesn't come in reverse topological order,
630 which means that we can have entry N pointing to entry N + 1.
632 If we dfs1 entry N before N + 1 is registered we'll not consider N + 1 for this bridge
633 pass and not create the required xref between the two.
635 bridge_count = dyn_array_ptr_size (®istered_bridges);
636 for (i = 0; i < bridge_count ; ++i)
637 register_bridge_object ((GCObject *)dyn_array_ptr_get (®istered_bridges, i));
639 for (i = 0; i < bridge_count; ++i)
640 dfs1 (get_hash_entry ((GCObject *)dyn_array_ptr_get (®istered_bridges, i), NULL));
642 SGEN_TV_GETTIME (atv);
643 step_2 = SGEN_TV_ELAPSED (btv, atv);
646 static int num_registered_bridges, hash_table_size;
649 processing_build_callback_data (int generation)
652 int num_sccs, num_xrefs;
653 int max_entries, max_xrefs;
654 GCObject *obj G_GNUC_UNUSED;
656 HashEntry **all_entries;
657 MonoGCBridgeSCC **api_sccs;
658 MonoGCBridgeXRef *api_xrefs;
659 SGEN_TV_DECLARE (atv);
660 SGEN_TV_DECLARE (btv);
662 g_assert (bridge_processor->num_sccs == 0 && bridge_processor->num_xrefs == 0);
663 g_assert (!bridge_processor->api_sccs && !bridge_processor->api_xrefs);
665 if (!dyn_array_ptr_size (®istered_bridges))
668 g_assert (bridge_processing_in_progress);
670 SGEN_TV_GETTIME (atv);
672 /* alloc and fill array of all entries */
674 all_entries = (HashEntry **)sgen_alloc_internal_dynamic (sizeof (HashEntry*) * hash_table.num_entries, INTERNAL_MEM_BRIDGE_DATA, TRUE);
677 SGEN_HASH_TABLE_FOREACH (&hash_table, GCObject *, obj, HashEntry *, entry) {
678 g_assert (entry->finishing_time >= 0);
679 all_entries [j++] = entry;
680 fist_pass_links += dyn_array_ptr_size (&entry->srcs);
681 } SGEN_HASH_TABLE_FOREACH_END;
682 g_assert (j == hash_table.num_entries);
683 hash_table_size = hash_table.num_entries;
685 /* sort array according to decreasing finishing time */
686 qsort_hash_entries (all_entries, hash_table.num_entries);
688 SGEN_TV_GETTIME (btv);
689 step_3 = SGEN_TV_ELAPSED (atv, btv);
691 /* second DFS pass */
693 dyn_array_scc_init (&sccs);
694 for (i = 0; i < hash_table.num_entries; ++i) {
695 HashEntry *entry = all_entries [i];
696 if (entry->scc_index < 0) {
697 int index = dyn_array_scc_size (&sccs);
698 current_scc = dyn_array_scc_add (&sccs);
699 current_scc->index = index;
700 current_scc->num_bridge_entries = 0;
701 current_scc->api_index = -1;
702 dyn_array_int_init (¤t_scc->xrefs);
709 * Compute the weight of each object. The weight of an object is its size plus the size of all
710 * objects it points do. When the an object is pointed by multiple objects we distribute it's weight
711 * equally among them. This distribution gives a rough estimate of the real impact of making the object
714 * The reasoning for this model is that complex graphs with single roots will have a bridge with very high
715 * value in comparison to others.
717 * The all_entries array has all objects topologically sorted. To correctly propagate the weights it must be
718 * done in reverse topological order - so we calculate the weight of the pointed-to objects before processing
719 * pointer-from objects.
721 * We log those objects in the opposite order for no particular reason. The other constrain is that it should use the same
722 * direction as the other logging loop that records live/dead information.
724 if (bridge_accounting_enabled) {
725 for (i = hash_table.num_entries - 1; i >= 0; --i) {
727 HashEntryWithAccounting *entry = (HashEntryWithAccounting*)all_entries [i];
729 entry->weight += (double)sgen_safe_object_get_size (entry->entry.obj);
730 w = entry->weight / dyn_array_ptr_size (&entry->entry.srcs);
731 for (j = 0; j < dyn_array_ptr_size (&entry->entry.srcs); ++j) {
732 HashEntryWithAccounting *other = (HashEntryWithAccounting *)dyn_array_ptr_get (&entry->entry.srcs, j);
736 for (i = 0; i < hash_table.num_entries; ++i) {
737 HashEntryWithAccounting *entry = (HashEntryWithAccounting*)all_entries [i];
738 if (entry->entry.is_bridge) {
739 MonoClass *klass = SGEN_LOAD_VTABLE (entry->entry.obj)->klass;
740 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);
745 for (i = 0; i < hash_table.num_entries; ++i) {
746 HashEntry *entry = all_entries [i];
747 second_pass_links += dyn_array_ptr_size (&entry->srcs);
750 SGEN_TV_GETTIME (atv);
751 step_4 = SGEN_TV_ELAPSED (btv, atv);
753 //g_print ("%d sccs\n", sccs.size);
755 dyn_array_ptr_uninit (&dfs_stack);
757 /* init data for callback */
760 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
761 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
762 g_assert (scc->index == i);
763 if (scc->num_bridge_entries)
765 sccs_links += dyn_array_int_size (&scc->xrefs);
766 max_sccs_links = MAX (max_sccs_links, dyn_array_int_size (&scc->xrefs));
769 api_sccs = (MonoGCBridgeSCC **)sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeSCC*) * num_sccs, INTERNAL_MEM_BRIDGE_DATA, TRUE);
772 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
773 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
774 if (!scc->num_bridge_entries)
777 api_sccs [j] = (MonoGCBridgeSCC *)sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeSCC) + sizeof (MonoObject*) * scc->num_bridge_entries, INTERNAL_MEM_BRIDGE_DATA, TRUE);
778 api_sccs [j]->is_alive = FALSE;
779 api_sccs [j]->num_objs = scc->num_bridge_entries;
780 scc->num_bridge_entries = 0;
781 scc->api_index = j++;
783 num_xrefs += dyn_array_int_size (&scc->xrefs);
786 SGEN_HASH_TABLE_FOREACH (&hash_table, GCObject *, obj, HashEntry *, entry) {
787 if (entry->is_bridge) {
788 SCC *scc = dyn_array_scc_get_ptr (&sccs, entry->scc_index);
789 api_sccs [scc->api_index]->objs [scc->num_bridge_entries++] = (MonoObject*)entry->obj;
791 } SGEN_HASH_TABLE_FOREACH_END;
793 api_xrefs = (MonoGCBridgeXRef *)sgen_alloc_internal_dynamic (sizeof (MonoGCBridgeXRef) * num_xrefs, INTERNAL_MEM_BRIDGE_DATA, TRUE);
795 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
797 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
798 if (!scc->num_bridge_entries)
800 for (k = 0; k < dyn_array_int_size (&scc->xrefs); ++k) {
801 SCC *src_scc = dyn_array_scc_get_ptr (&sccs, dyn_array_int_get (&scc->xrefs, k));
802 if (!src_scc->num_bridge_entries)
804 api_xrefs [j].src_scc_index = src_scc->api_index;
805 api_xrefs [j].dst_scc_index = scc->api_index;
810 SGEN_TV_GETTIME (btv);
811 step_5 = SGEN_TV_ELAPSED (atv, btv);
816 max_entries = max_xrefs = 0;
817 for (i = 0; i < dyn_array_scc_size (&sccs); ++i) {
818 SCC *scc = dyn_array_scc_get_ptr (&sccs, i);
819 if (scc->num_bridge_entries)
821 if (scc->num_bridge_entries > max_entries)
822 max_entries = scc->num_bridge_entries;
823 if (dyn_array_int_size (&scc->xrefs) > max_xrefs)
824 max_xrefs = dyn_array_int_size (&scc->xrefs);
825 dyn_array_int_uninit (&scc->xrefs);
828 dyn_array_scc_uninit (&sccs);
830 sgen_free_internal_dynamic (all_entries, sizeof (HashEntry*) * hash_table.num_entries, INTERNAL_MEM_BRIDGE_DATA);
833 /* Empty the registered bridges array */
834 num_registered_bridges = dyn_array_ptr_size (®istered_bridges);
835 dyn_array_ptr_set_size (®istered_bridges, 0);
837 SGEN_TV_GETTIME (atv);
838 step_6 = SGEN_TV_ELAPSED (btv, atv);
840 //g_print ("%d sccs containing bridges - %d max bridge objects - %d max xrefs\n", j, max_entries, max_xrefs);
842 bridge_processor->num_sccs = num_sccs;
843 bridge_processor->api_sccs = api_sccs;
844 bridge_processor->num_xrefs = num_xrefs;
845 bridge_processor->api_xrefs = api_xrefs;
849 processing_after_callback (int generation)
852 int num_sccs = bridge_processor->num_sccs;
853 MonoGCBridgeSCC **api_sccs = bridge_processor->api_sccs;
855 if (bridge_accounting_enabled) {
856 for (i = 0; i < num_sccs; ++i) {
857 for (j = 0; j < api_sccs [i]->num_objs; ++j) {
858 GCVTable vtable = SGEN_LOAD_VTABLE (api_sccs [i]->objs [j]);
859 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC,
860 "OBJECT %s.%s (%p) SCC [%d] %s",
861 sgen_client_vtable_get_namespace (vtable), sgen_client_vtable_get_name (vtable), api_sccs [i]->objs [j],
863 api_sccs [i]->is_alive ? "ALIVE" : "DEAD");
868 mono_trace (G_LOG_LEVEL_INFO, MONO_TRACE_GC, "GC_OLD_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",
869 num_registered_bridges, hash_table_size, dyn_array_scc_size (&sccs),
876 fist_pass_links, second_pass_links, sccs_links, max_sccs_links,
877 dfs1_passes, dfs2_passes);
879 step_1 = 0; /* We must cleanup since this value is used as an accumulator. */
880 fist_pass_links = second_pass_links = sccs_links = max_sccs_links = 0;
881 dfs1_passes = dfs2_passes = 0;
885 describe_pointer (GCObject *obj)
890 for (i = 0; i < dyn_array_ptr_size (®istered_bridges); ++i) {
891 if (obj == dyn_array_ptr_get (®istered_bridges, i)) {
892 printf ("Pointer is a registered bridge object.\n");
897 entry = (HashEntry *)sgen_hash_table_lookup (&hash_table, obj);
901 printf ("Bridge hash table entry %p:\n", entry);
902 printf (" is bridge: %d\n", (int)entry->is_bridge);
903 printf (" is visited: %d\n", (int)entry->is_visited);
907 sgen_old_bridge_init (SgenBridgeProcessor *collector)
909 collector->reset_data = reset_data;
910 collector->processing_stw_step = processing_stw_step;
911 collector->processing_build_callback_data = processing_build_callback_data;
912 collector->processing_after_callback = processing_after_callback;
913 collector->class_kind = class_kind;
914 collector->register_finalized_object = register_finalized_object;
915 collector->describe_pointer = describe_pointer;
916 collector->enable_accounting = enable_accounting;
918 bridge_processor = collector;