[BACK]Return to finalize.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / gc

Diff for /OpenXM_contrib2/asir2000/gc/finalize.c between version 1.1.1.1 and 1.6

version 1.1.1.1, 1999/12/03 07:39:09 version 1.6, 2002/07/24 08:00:08
Line 1 
Line 1 
 /*  /*
  * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers   * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers
  * Copyright (c) 1991-1996 by Xerox Corporation.  All rights reserved.   * Copyright (c) 1991-1996 by Xerox Corporation.  All rights reserved.
    * Copyright (c) 1996-1999 by Silicon Graphics.  All rights reserved.
   
  * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED   * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
  * OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.   * OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.
Line 13 
Line 14 
  */   */
 /* Boehm, February 1, 1996 1:19 pm PST */  /* Boehm, February 1, 1996 1:19 pm PST */
 # define I_HIDE_POINTERS  # define I_HIDE_POINTERS
 # include "gc_priv.h"  # include "private/gc_pmark.h"
 # include "gc_mark.h"  
   
   # ifdef FINALIZE_ON_DEMAND
       int GC_finalize_on_demand = 1;
   # else
       int GC_finalize_on_demand = 0;
   # endif
   
   # ifdef JAVA_FINALIZATION
       int GC_java_finalization = 1;
   # else
       int GC_java_finalization = 0;
   # endif
   
 /* Type of mark procedure used for marking from finalizable object.     */  /* Type of mark procedure used for marking from finalizable object.     */
 /* This procedure normally does not mark the object, only its           */  /* This procedure normally does not mark the object, only its           */
 /* descendents.                                                         */  /* descendents.                                                         */
Line 73  static signed_word log_fo_table_size = -1;
Line 85  static signed_word log_fo_table_size = -1;
   
 word GC_fo_entries = 0;  word GC_fo_entries = 0;
   
 # ifdef SRC_M3  void GC_push_finalizer_structures GC_PROTO((void))
 void GC_push_finalizer_structures()  
 {  {
     GC_push_all((ptr_t)(&dl_head), (ptr_t)(&dl_head) + sizeof(word));      GC_push_all((ptr_t)(&dl_head), (ptr_t)(&dl_head) + sizeof(word));
     GC_push_all((ptr_t)(&fo_head), (ptr_t)(&fo_head) + sizeof(word));      GC_push_all((ptr_t)(&fo_head), (ptr_t)(&fo_head) + sizeof(word));
       GC_push_all((ptr_t)(&GC_finalize_now),
                   (ptr_t)(&GC_finalize_now) + sizeof(word));
 }  }
 # endif  
   
 /* Double the size of a hash table. *size_ptr is the log of its current */  /* Double the size of a hash table. *size_ptr is the log of its current */
 /* size.  May be a noop.                                                */  /* size.  May be a noop.                                                */
Line 97  signed_word * log_size_ptr;
Line 109  signed_word * log_size_ptr;
     word old_size = ((log_old_size == -1)? 0: (1 << log_old_size));      word old_size = ((log_old_size == -1)? 0: (1 << log_old_size));
     register word new_size = 1 << log_new_size;      register word new_size = 1 << log_new_size;
     struct hash_chain_entry **new_table = (struct hash_chain_entry **)      struct hash_chain_entry **new_table = (struct hash_chain_entry **)
         GC_generic_malloc_inner_ignore_off_page(          GC_INTERNAL_MALLOC_IGNORE_OFF_PAGE(
                 (size_t)new_size * sizeof(struct hash_chain_entry *), NORMAL);                  (size_t)new_size * sizeof(struct hash_chain_entry *), NORMAL);
   
     if (new_table == 0) {      if (new_table == 0) {
Line 166  signed_word * log_size_ptr;
Line 178  signed_word * log_size_ptr;
 #       endif  #       endif
         GC_grow_table((struct hash_chain_entry ***)(&dl_head),          GC_grow_table((struct hash_chain_entry ***)(&dl_head),
                       &log_dl_table_size);                        &log_dl_table_size);
 #       ifdef PRINTSTATS  #       ifdef CONDPRINT
             if (GC_print_stats) {
             GC_printf1("Grew dl table to %lu entries\n",              GC_printf1("Grew dl table to %lu entries\n",
                         (unsigned long)(1 << log_dl_table_size));                          (unsigned long)(1 << log_dl_table_size));
             }
 #       endif  #       endif
 #       ifndef THREADS  #       ifndef THREADS
             ENABLE_SIGNALS();              ENABLE_SIGNALS();
Line 186  signed_word * log_size_ptr;
Line 200  signed_word * log_size_ptr;
             return(1);              return(1);
         }          }
     }      }
 #   ifdef THREADS      new_dl = (struct disappearing_link *)
           GC_INTERNAL_MALLOC(sizeof(struct disappearing_link),NORMAL);
       if (0 == new_dl) {
   #     ifdef THREADS
           UNLOCK();
           ENABLE_SIGNALS();
   #     endif
       new_dl = (struct disappearing_link *)        new_dl = (struct disappearing_link *)
         GC_generic_malloc_inner(sizeof(struct disappearing_link),NORMAL);                GC_oom_fn(sizeof(struct disappearing_link));
 #   else        if (0 == new_dl) {
       new_dl = (struct disappearing_link *)          GC_finalization_failures++;
         GC_malloc(sizeof(struct disappearing_link));          return(0);
 #   endif        }
     if (new_dl != 0) {        /* It's not likely we'll make it here, but ... */
         new_dl -> dl_hidden_obj = HIDE_POINTER(obj);  #     ifdef THREADS
         new_dl -> dl_hidden_link = HIDE_POINTER(link);          DISABLE_SIGNALS();
         dl_set_next(new_dl, dl_head[index]);          LOCK();
         dl_head[index] = new_dl;  #     endif
         GC_dl_entries++;  
     } else {  
         GC_finalization_failures++;  
     }      }
       new_dl -> dl_hidden_obj = HIDE_POINTER(obj);
       new_dl -> dl_hidden_link = HIDE_POINTER(link);
       dl_set_next(new_dl, dl_head[index]);
       dl_head[index] = new_dl;
       GC_dl_entries++;
 #   ifdef THREADS  #   ifdef THREADS
         UNLOCK();          UNLOCK();
         ENABLE_SIGNALS();          ENABLE_SIGNALS();
Line 235  signed_word * log_size_ptr;
Line 257  signed_word * log_size_ptr;
             GC_dl_entries--;              GC_dl_entries--;
             UNLOCK();              UNLOCK();
             ENABLE_SIGNALS();              ENABLE_SIGNALS();
             GC_free((GC_PTR)curr_dl);  #           ifdef DBG_HDRS_ALL
                 dl_set_next(curr_dl, 0);
   #           else
                 GC_free((GC_PTR)curr_dl);
   #           endif
             return(1);              return(1);
         }          }
         prev_dl = curr_dl;          prev_dl = curr_dl;
Line 249  out:
Line 275  out:
   
 /* Possible finalization_marker procedures.  Note that mark stack       */  /* Possible finalization_marker procedures.  Note that mark stack       */
 /* overflow is handled by the caller, and is not a disaster.            */  /* overflow is handled by the caller, and is not a disaster.            */
 void GC_normal_finalize_mark_proc(p)  GC_API void GC_normal_finalize_mark_proc(p)
 ptr_t p;  ptr_t p;
 {  {
     hdr * hhdr = HDR(p);      hdr * hhdr = HDR(p);
Line 261  ptr_t p;
Line 287  ptr_t p;
 /* This only pays very partial attention to the mark descriptor.        */  /* This only pays very partial attention to the mark descriptor.        */
 /* It does the right thing for normal and atomic objects, and treats    */  /* It does the right thing for normal and atomic objects, and treats    */
 /* most others as normal.                                               */  /* most others as normal.                                               */
 void GC_ignore_self_finalize_mark_proc(p)  GC_API void GC_ignore_self_finalize_mark_proc(p)
 ptr_t p;  ptr_t p;
 {  {
     hdr * hhdr = HDR(p);      hdr * hhdr = HDR(p);
Line 270  ptr_t p;
Line 296  ptr_t p;
     ptr_t scan_limit;      ptr_t scan_limit;
     ptr_t target_limit = p + WORDS_TO_BYTES(hhdr -> hb_sz) - 1;      ptr_t target_limit = p + WORDS_TO_BYTES(hhdr -> hb_sz) - 1;
   
     if ((descr & DS_TAGS) == DS_LENGTH) {      if ((descr & GC_DS_TAGS) == GC_DS_LENGTH) {
        scan_limit = p + descr - sizeof(word);         scan_limit = p + descr - sizeof(word);
     } else {      } else {
        scan_limit = target_limit + 1 - sizeof(word);         scan_limit = target_limit + 1 - sizeof(word);
Line 284  ptr_t p;
Line 310  ptr_t p;
 }  }
   
 /*ARGSUSED*/  /*ARGSUSED*/
 void GC_null_finalize_mark_proc(p)  GC_API void GC_null_finalize_mark_proc(p)
 ptr_t p;  ptr_t p;
 {  {
 }  }
Line 295  ptr_t p;
Line 321  ptr_t p;
 /* in the nonthreads case, we try to avoid disabling signals,   */  /* in the nonthreads case, we try to avoid disabling signals,   */
 /* since it can be expensive.  Threads packages typically       */  /* since it can be expensive.  Threads packages typically       */
 /* make it cheaper.                                             */  /* make it cheaper.                                             */
 void GC_register_finalizer_inner(obj, fn, cd, ofn, ocd, mp)  /* The last parameter is a procedure that determines            */
   /* marking for finalization ordering.  Any objects marked       */
   /* by that procedure will be guaranteed to not have been        */
   /* finalized when this finalizer is invoked.                    */
   GC_API void GC_register_finalizer_inner(obj, fn, cd, ofn, ocd, mp)
 GC_PTR obj;  GC_PTR obj;
 GC_finalization_proc fn;  GC_finalization_proc fn;
 GC_PTR cd;  GC_PTR cd;
Line 307  finalization_mark_proc * mp;
Line 337  finalization_mark_proc * mp;
     struct finalizable_object * curr_fo, * prev_fo;      struct finalizable_object * curr_fo, * prev_fo;
     int index;      int index;
     struct finalizable_object *new_fo;      struct finalizable_object *new_fo;
       hdr *hhdr;
     DCL_LOCK_STATE;      DCL_LOCK_STATE;
   
 #   ifdef THREADS  #   ifdef THREADS
Line 320  finalization_mark_proc * mp;
Line 351  finalization_mark_proc * mp;
 #       endif  #       endif
         GC_grow_table((struct hash_chain_entry ***)(&fo_head),          GC_grow_table((struct hash_chain_entry ***)(&fo_head),
                       &log_fo_table_size);                        &log_fo_table_size);
 #       ifdef PRINTSTATS  #       ifdef CONDPRINT
             if (GC_print_stats) {
             GC_printf1("Grew fo table to %lu entries\n",              GC_printf1("Grew fo table to %lu entries\n",
                         (unsigned long)(1 << log_fo_table_size));                          (unsigned long)(1 << log_fo_table_size));
             }
 #       endif  #       endif
 #       ifndef THREADS  #       ifndef THREADS
             ENABLE_SIGNALS();              ENABLE_SIGNALS();
Line 352  finalization_mark_proc * mp;
Line 385  finalization_mark_proc * mp;
                   /* May not happen if we get a signal.  But a high     */                    /* May not happen if we get a signal.  But a high     */
                   /* estimate will only make the table larger than      */                    /* estimate will only make the table larger than      */
                   /* necessary.                                         */                    /* necessary.                                         */
 #               ifndef THREADS  #               if !defined(THREADS) && !defined(DBG_HDRS_ALL)
                   GC_free((GC_PTR)curr_fo);                    GC_free((GC_PTR)curr_fo);
 #               endif  #               endif
             } else {              } else {
Line 385  finalization_mark_proc * mp;
Line 418  finalization_mark_proc * mp;
 #       endif  #       endif
         return;          return;
     }      }
 #   ifdef THREADS      GET_HDR(base, hhdr);
       if (0 == hhdr) {
         /* We won't collect it, hence finalizer wouldn't be run. */
   #     ifdef THREADS
             UNLOCK();
             ENABLE_SIGNALS();
   #     endif
         return;
       }
       new_fo = (struct finalizable_object *)
           GC_INTERNAL_MALLOC(sizeof(struct finalizable_object),NORMAL);
       if (0 == new_fo) {
   #     ifdef THREADS
           UNLOCK();
           ENABLE_SIGNALS();
   #     endif
       new_fo = (struct finalizable_object *)        new_fo = (struct finalizable_object *)
         GC_generic_malloc_inner(sizeof(struct finalizable_object),NORMAL);                GC_oom_fn(sizeof(struct finalizable_object));
 #   else        if (0 == new_fo) {
       new_fo = (struct finalizable_object *)          GC_finalization_failures++;
         GC_malloc(sizeof(struct finalizable_object));          return;
 #   endif        }
     if (new_fo != 0) {        /* It's not likely we'll make it here, but ... */
         new_fo -> fo_hidden_base = (word)HIDE_POINTER(base);  #     ifdef THREADS
         new_fo -> fo_fn = fn;          DISABLE_SIGNALS();
         new_fo -> fo_client_data = (ptr_t)cd;          LOCK();
         new_fo -> fo_object_size = GC_size(base);  #     endif
         new_fo -> fo_mark_proc = mp;  
         fo_set_next(new_fo, fo_head[index]);  
         GC_fo_entries++;  
         fo_head[index] = new_fo;  
     } else {  
         GC_finalization_failures++;  
     }      }
       new_fo -> fo_hidden_base = (word)HIDE_POINTER(base);
       new_fo -> fo_fn = fn;
       new_fo -> fo_client_data = (ptr_t)cd;
       new_fo -> fo_object_size = hhdr -> hb_sz;
       new_fo -> fo_mark_proc = mp;
       fo_set_next(new_fo, fo_head[index]);
       GC_fo_entries++;
       fo_head[index] = new_fo;
 #   ifdef THREADS  #   ifdef THREADS
         UNLOCK();          UNLOCK();
         ENABLE_SIGNALS();          ENABLE_SIGNALS();
Line 461  finalization_mark_proc * mp;
Line 511  finalization_mark_proc * mp;
                                 ocd, GC_null_finalize_mark_proc);                                  ocd, GC_null_finalize_mark_proc);
 }  }
   
   #ifndef NO_DEBUGGING
   void GC_dump_finalization()
   {
       struct disappearing_link * curr_dl;
       struct finalizable_object * curr_fo;
       ptr_t real_ptr, real_link;
       int dl_size = (log_dl_table_size == -1 ) ? 0 : (1 << log_dl_table_size);
       int fo_size = (log_fo_table_size == -1 ) ? 0 : (1 << log_fo_table_size);
       int i;
   
       GC_printf0("Disappearing links:\n");
       for (i = 0; i < dl_size; i++) {
         for (curr_dl = dl_head[i]; curr_dl != 0; curr_dl = dl_next(curr_dl)) {
           real_ptr = (ptr_t)REVEAL_POINTER(curr_dl -> dl_hidden_obj);
           real_link = (ptr_t)REVEAL_POINTER(curr_dl -> dl_hidden_link);
           GC_printf2("Object: 0x%lx, Link:0x%lx\n", real_ptr, real_link);
         }
       }
       GC_printf0("Finalizers:\n");
       for (i = 0; i < fo_size; i++) {
         for (curr_fo = fo_head[i]; curr_fo != 0; curr_fo = fo_next(curr_fo)) {
           real_ptr = (ptr_t)REVEAL_POINTER(curr_fo -> fo_hidden_base);
           GC_printf1("Finalizable object: 0x%lx\n", real_ptr);
         }
       }
   }
   #endif
   
 /* Called with world stopped.  Cause disappearing links to disappear,   */  /* Called with world stopped.  Cause disappearing links to disappear,   */
 /* and invoke finalizers.                                               */  /* and invoke finalizers.                                               */
 void GC_finalize()  void GC_finalize()
Line 498  void GC_finalize()
Line 576  void GC_finalize()
     }      }
   /* Mark all objects reachable via chains of 1 or more pointers        */    /* Mark all objects reachable via chains of 1 or more pointers        */
   /* from finalizable objects.                                          */    /* from finalizable objects.                                          */
 #   ifdef PRINTSTATS      GC_ASSERT(GC_mark_state == MS_NONE);
         if (GC_mark_state != MS_NONE) ABORT("Bad mark state");  
 #   endif  
     for (i = 0; i < fo_size; i++) {      for (i = 0; i < fo_size; i++) {
       for (curr_fo = fo_head[i]; curr_fo != 0; curr_fo = fo_next(curr_fo)) {        for (curr_fo = fo_head[i]; curr_fo != 0; curr_fo = fo_next(curr_fo)) {
         real_ptr = (ptr_t)REVEAL_POINTER(curr_fo -> fo_hidden_base);          real_ptr = (ptr_t)REVEAL_POINTER(curr_fo -> fo_hidden_base);
Line 522  void GC_finalize()
Line 598  void GC_finalize()
       while (curr_fo != 0) {        while (curr_fo != 0) {
         real_ptr = (ptr_t)REVEAL_POINTER(curr_fo -> fo_hidden_base);          real_ptr = (ptr_t)REVEAL_POINTER(curr_fo -> fo_hidden_base);
         if (!GC_is_marked(real_ptr)) {          if (!GC_is_marked(real_ptr)) {
 #         ifndef JAVA_FINALIZATION              if (!GC_java_finalization) {
             GC_set_mark_bit(real_ptr);                GC_set_mark_bit(real_ptr);
 #         endif              }
             /* Delete from hash table */              /* Delete from hash table */
               next_fo = fo_next(curr_fo);                next_fo = fo_next(curr_fo);
               if (prev_fo == 0) {                if (prev_fo == 0) {
Line 543  void GC_finalize()
Line 619  void GC_finalize()
               GC_words_finalized +=                GC_words_finalized +=
                         ALIGNED_WORDS(curr_fo -> fo_object_size)                          ALIGNED_WORDS(curr_fo -> fo_object_size)
                         + ALIGNED_WORDS(sizeof(struct finalizable_object));                          + ALIGNED_WORDS(sizeof(struct finalizable_object));
 #           ifdef PRINTSTATS              GC_ASSERT(GC_is_marked(GC_base((ptr_t)curr_fo)));
               if (!GC_is_marked((ptr_t)curr_fo)) {  
                 ABORT("GC_finalize: found accessible unmarked object\n");  
               }  
 #           endif  
             curr_fo = next_fo;              curr_fo = next_fo;
         } else {          } else {
             prev_fo = curr_fo;              prev_fo = curr_fo;
Line 556  void GC_finalize()
Line 628  void GC_finalize()
       }        }
     }      }
   
 # ifdef JAVA_FINALIZATION    if (GC_java_finalization) {
   /* make sure we mark everything reachable from objects finalized      /* make sure we mark everything reachable from objects finalized
      using the no_order mark_proc */         using the no_order mark_proc */
     for (curr_fo = GC_finalize_now;        for (curr_fo = GC_finalize_now;
          curr_fo != NULL; curr_fo = fo_next(curr_fo)) {           curr_fo != NULL; curr_fo = fo_next(curr_fo)) {
         real_ptr = (ptr_t)curr_fo -> fo_hidden_base;          real_ptr = (ptr_t)curr_fo -> fo_hidden_base;
         if (!GC_is_marked(real_ptr)) {          if (!GC_is_marked(real_ptr)) {
             if (curr_fo -> fo_mark_proc == GC_null_finalize_mark_proc) {              if (curr_fo -> fo_mark_proc == GC_null_finalize_mark_proc) {
                 GC_MARK_FO(real_ptr, GC_normal_finalize_mark_proc);                  GC_MARK_FO(real_ptr, GC_normal_finalize_mark_proc);
             }              }
             GC_set_mark_bit(real_ptr);              GC_set_mark_bit(real_ptr);
         }          }
     }        }
 # endif    }
   
   /* Remove dangling disappearing links. */    /* Remove dangling disappearing links. */
     for (i = 0; i < dl_size; i++) {      for (i = 0; i < dl_size; i++) {
Line 595  void GC_finalize()
Line 667  void GC_finalize()
     }      }
 }  }
   
 #ifdef JAVA_FINALIZATION  #ifndef JAVA_FINALIZATION_NOT_NEEDED
   
 /* Enqueue all remaining finalizers to be run - Assumes lock is  /* Enqueue all remaining finalizers to be run - Assumes lock is
  * held, and signals are disabled */   * held, and signals are disabled */
 void GC_enqueue_all_finalizers()  void GC_enqueue_all_finalizers()
 {  {
     struct finalizable_object * curr_fo, * prev_fo, * next_fo;      struct finalizable_object * curr_fo, * prev_fo, * next_fo;
     ptr_t real_ptr, real_link;      ptr_t real_ptr;
     register int i;      register int i;
     int fo_size;      int fo_size;
   
Line 650  void GC_enqueue_all_finalizers()
Line 722  void GC_enqueue_all_finalizers()
  * Unfortunately, the Java standard implies we have to keep running   * Unfortunately, the Java standard implies we have to keep running
  * finalizers until there are no more left, a potential infinite loop.   * finalizers until there are no more left, a potential infinite loop.
  * YUCK.   * YUCK.
    * Note that this is even more dangerous than the usual Java
    * finalizers, in that objects reachable from static variables
    * may have been finalized when these finalizers are run.
    * Finalizers run at this point must be prepared to deal with a
    * mostly broken world.
  * This routine is externally callable, so is called without   * This routine is externally callable, so is called without
  * the allocation lock.   * the allocation lock.
  */   */
 void GC_finalize_all()  GC_API void GC_finalize_all()
 {  {
     DCL_LOCK_STATE;      DCL_LOCK_STATE;
   
Line 672  void GC_finalize_all()
Line 749  void GC_finalize_all()
 }  }
 #endif  #endif
   
   /* Returns true if it is worth calling GC_invoke_finalizers. (Useful if */
   /* finalizers can only be called from some kind of `safe state' and     */
   /* getting into that safe state is expensive.)                          */
   int GC_should_invoke_finalizers GC_PROTO((void))
   {
       return GC_finalize_now != 0;
   }
   
 /* Invoke finalizers for all objects that are ready to be finalized.    */  /* Invoke finalizers for all objects that are ready to be finalized.    */
 /* Should be called without allocation lock.                            */  /* Should be called without allocation lock.                            */
 int GC_invoke_finalizers()  int GC_invoke_finalizers()
 {  {
     register struct finalizable_object * curr_fo;      struct finalizable_object * curr_fo;
     register int count = 0;      int count = 0;
       word mem_freed_before;
       GC_bool first_time = TRUE;
     DCL_LOCK_STATE;      DCL_LOCK_STATE;
   
     while (GC_finalize_now != 0) {      while (GC_finalize_now != 0) {
Line 685  int GC_invoke_finalizers()
Line 772  int GC_invoke_finalizers()
             DISABLE_SIGNALS();              DISABLE_SIGNALS();
             LOCK();              LOCK();
 #       endif  #       endif
           if (first_time) {
               mem_freed_before = GC_mem_freed;
               first_time = FALSE;
           }
         curr_fo = GC_finalize_now;          curr_fo = GC_finalize_now;
 #       ifdef THREADS  #       ifdef THREADS
             if (curr_fo != 0) GC_finalize_now = fo_next(curr_fo);              if (curr_fo != 0) GC_finalize_now = fo_next(curr_fo);
Line 706  int GC_invoke_finalizers()
Line 797  int GC_invoke_finalizers()
             GC_free((GC_PTR)curr_fo);              GC_free((GC_PTR)curr_fo);
 #       endif  #       endif
     }      }
       if (mem_freed_before != GC_mem_freed) {
           LOCK();
           GC_finalizer_mem_freed += (GC_mem_freed - mem_freed_before);
           UNLOCK();
       }
     return count;      return count;
 }  }
   
   void (* GC_finalizer_notifier)() = (void (*) GC_PROTO((void)))0;
   
   static GC_word last_finalizer_notification = 0;
   
   void GC_notify_or_invoke_finalizers GC_PROTO((void))
   {
       if (GC_finalize_now == 0) return;
       if (!GC_finalize_on_demand) {
           (void) GC_invoke_finalizers();
           GC_ASSERT(GC_finalize_now == 0);
           return;
       }
       if (GC_finalizer_notifier != (void (*) GC_PROTO((void)))0
           && last_finalizer_notification != GC_gc_no) {
           last_finalizer_notification = GC_gc_no;
           GC_finalizer_notifier();
       }
   }
   
 # ifdef __STDC__  # ifdef __STDC__
     GC_PTR GC_call_with_alloc_lock(GC_fn_type fn,      GC_PTR GC_call_with_alloc_lock(GC_fn_type fn,
                                          GC_PTR client_data)                                           GC_PTR client_data)
Line 728  int GC_invoke_finalizers()
Line 843  int GC_invoke_finalizers()
 #   endif  #   endif
     result = (*fn)(client_data);      result = (*fn)(client_data);
 #   ifdef THREADS  #   ifdef THREADS
       UNSET_LOCK_HOLDER();  #     ifndef GC_ASSERTIONS
           UNSET_LOCK_HOLDER();
   #     endif /* o.w. UNLOCK() does it implicitly */
       UNLOCK();        UNLOCK();
       ENABLE_SIGNALS();        ENABLE_SIGNALS();
 #   endif  #   endif
     return(result);      return(result);
 }  }
   
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.6
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>