Remove the handler trash stack, which is now unused. (g_signal_init):

2005-12-30  Matthias Clasen  <mclasen@redhat.com>

	* gsignal.c: Remove the handler trash stack, which
	is now unused.
	(g_signal_init): Remove the restriction that HandlerMatch
	must be the same size as GList, and obsolete comments
	referring to mem chunks.

diff --git a/gobject/ChangeLog b/gobject/ChangeLog
index 2e8ea18..0ff3ef4 100644 (file)
--- a/gobject/ChangeLog
+++ b/gobject/ChangeLog
@@ -2,6 +2,9 @@
 
        * gsignal.c: Remove the handler trash stack, which
        is now unused.
+       (g_signal_init): Remove the restriction that HandlerMatch
+       must be the same size as GList, and obsolete comments 
+       referring to mem chunks.
 
 2005-12-24  Matthias Clasen  <mclasen@redhat.com>
 

diff --git a/gobject/gsignal.c b/gobject/gsignal.c
index b878d70..8bd1478 100644 (file)
--- a/gobject/gsignal.c
+++ b/gobject/gsignal.c
@@ -387,11 +387,6 @@ handler_match_prepend (HandlerMatch *list,
 {
   HandlerMatch *node;
   
-  /* yeah, we could use our own memchunk here, introducing yet more
-   * rarely used cached nodes and extra allocation overhead.
-   * instead, we use GList* nodes, since they are exactly the size
-   * we need and are already cached. g_signal_init() asserts this.
-   */
   node = g_slice_new (HandlerMatch);
   node->handler = handler;
   node->next = list;
@@ -714,9 +709,6 @@ g_signal_init (void)
   SIGNAL_LOCK ();
   if (!g_n_signal_nodes)
     {
-      /* handler_id_node_prepend() requires this */
-      g_assert (sizeof (GList) == sizeof (HandlerMatch));
-      
       /* setup handler list binary searchable array hash table (in german, that'd be one word ;) */
       g_handler_list_bsa_ht = g_hash_table_new (g_direct_hash, NULL);
       g_signal_key_bsa = g_bsearch_array_create (&g_signal_key_bconfig);