Back to index

lightning-sunbird  0.9+nobinonly
Defines | Functions | Variables
reclaim.c File Reference
#include <stdio.h>
#include "gc_priv.h"

Go to the source code of this file.

Defines

#define FOUND_FREE(hblk, word_no)
#define INCR_WORDS(sz)   n_words_found += (sz)
#define DO_OBJ(start_displ)
#define DO_OBJ(start_displ)
#define DO_OBJ(start_displ)
#define DO_OBJ(start_displ)
#define DO_OBJ(start_displ)

Functions

GC_bool GC_block_empty (hdr *hhdr)
ptr_t GC_reclaim_clear (struct hblk *hbp, hdr *hhdr, word sz, ptr_t list, GC_bool abort_if_found)
ptr_t GC_reclaim_clear2 (struct hblk *hbp, hdr *hhdr, ptr_t list, GC_bool abort_if_found)
ptr_t GC_reclaim_clear4 (struct hblk *hbp, hdr *hhdr, ptr_t list, GC_bool abort_if_found)
ptr_t GC_reclaim_uninit (struct hblk *hbp, hdr *hhdr, word sz, ptr_t list, GC_bool abort_if_found)
ptr_t GC_reclaim_uninit2 (struct hblk *hbp, hdr *hhdr, ptr_t list, GC_bool abort_if_found)
ptr_t GC_reclaim_uninit4 (struct hblk *hbp, hdr *hhdr, ptr_t list, GC_bool abort_if_found)
ptr_t GC_reclaim1 (struct hblk *hbp, hdr *hhdr, ptr_t list, GC_bool abort_if_found)
void GC_reclaim_small_nonempty_block (struct hblk *hbp, int abort_if_found)
void GC_reclaim_block (struct hblk *hbp, word abort_if_found)
static int set_bits (word n)
int GC_n_set_marks (hdr *hhdr)
void GC_print_block_descr (struct hblk *h, word dummy)
void GC_print_block_list ()
void GC_start_reclaim (int abort_if_found)
void GC_continue_reclaim (word sz, int kind)
GC_bool GC_reclaim_all (GC_stop_func stop_func, GC_bool ignore_old)

Variables

signed_word GC_mem_found = 0
static size_t number_of_blocks
static size_t total_bytes

Define Documentation

#define DO_OBJ (   start_displ)
Value:
if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           p[start_displ+1] = 0; \
           INCR_WORDS(2); } \
       }
#define DO_OBJ (   start_displ)
Value:
if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           p[start_displ+1] = 0; \
           p[start_displ+2] = 0; \
           p[start_displ+3] = 0; \
           INCR_WORDS(4); \
           } \
       }
#define DO_OBJ (   start_displ)
Value:
if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           INCR_WORDS(2); \
           } \
       }
#define DO_OBJ (   start_displ)
Value:
if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           INCR_WORDS(4); \
           } \
       }
#define DO_OBJ (   start_displ)
Value:
if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           INCR_WORDS(1); \
           } \
       }
#define FOUND_FREE (   hblk,
  word_no 
)

Definition at line 55 of file reclaim.c.

#define INCR_WORDS (   sz)    n_words_found += (sz)

Definition at line 83 of file reclaim.c.


Function Documentation

GC_bool GC_block_empty ( hdr hhdr)

Definition at line 70 of file reclaim.c.

{
    register word *p = (word *)(&(hhdr -> hb_marks[0]));
    register word * plim =
                     (word *)(&(hhdr -> hb_marks[MARK_BITS_SZ]));
    while (p < plim) {
       if (*p++) return(FALSE);
    }
    return(TRUE);
}
void GC_continue_reclaim ( word  sz,
int  kind 
)

Definition at line 679 of file reclaim.c.

{
    register hdr * hhdr;
    register struct hblk * hbp;
    register struct obj_kind * ok = &(GC_obj_kinds[kind]);
    struct hblk ** rlh = ok -> ok_reclaim_list;
    ptr_t *flh = &(ok -> ok_freelist[sz]);
    
    if (rlh == 0) return;   /* No blocks of this kind.  */
    rlh += sz;
    while ((hbp = *rlh) != 0) {
        hhdr = HDR(hbp);
        *rlh = hhdr -> hb_next;
        GC_reclaim_small_nonempty_block(hbp, FALSE);
        if (*flh != 0) break;
    }
}

Here is the call graph for this function:

int GC_n_set_marks ( hdr hhdr)

Definition at line 590 of file reclaim.c.

{
    register int result = 0;
    register int i;
    
    for (i = 0; i < MARK_BITS_SZ; i++) {
        result += set_bits(hhdr -> hb_marks[i]);
    }
    return(result);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void GC_print_block_descr ( struct hblk h,
word  dummy 
)

Definition at line 603 of file reclaim.c.

{
    register hdr * hhdr = HDR(h);
    register size_t bytes = WORDS_TO_BYTES(hhdr -> hb_sz);
    
    GC_printf3("(%lu:%lu,%lu)", (unsigned long)(hhdr -> hb_obj_kind),
                             (unsigned long)bytes,
                             (unsigned long)(GC_n_set_marks(hhdr)));
    bytes += HDR_BYTES + HBLKSIZE-1;
    bytes &= ~(HBLKSIZE-1);
    total_bytes += bytes;
    number_of_blocks++;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 619 of file reclaim.c.

{
    GC_printf0("(kind(0=ptrfree,1=normal,2=unc.,3=stubborn):size_in_bytes, #_marks_set)\n");
    number_of_blocks = 0;
    total_bytes = 0;
    GC_apply_to_all_blocks(GC_print_block_descr, (word)0);
    GC_printf2("\nblocks = %lu, bytes = %lu\n",
              (unsigned long)number_of_blocks,
              (unsigned long)total_bytes);
}

Here is the call graph for this function:

Here is the caller graph for this function:

ptr_t GC_reclaim1 ( struct hblk hbp,
hdr hhdr,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 411 of file reclaim.c.

{
    register word * mark_word_addr = &(hhdr->hb_marks[divWORDSZ(HDR_WORDS)]);
    register word *p, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif
    register word mark_word;
    register int i;
#   define DO_OBJ(start_displ) \
       if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           INCR_WORDS(1); \
           } \
       }
    
    p = (word *)(hbp->hb_body);
    plim = (word *)(((word)hbp) + HBLKSIZE);

    /* go through all words in block */
       while( p < plim )  {
           mark_word = *mark_word_addr++;
           for (i = 0; i < WORDSZ; i += 4) {
              DO_OBJ(0);
              DO_OBJ(1);
              DO_OBJ(2);
              DO_OBJ(3);
              p += 4;
              mark_word >>= 4;
           }
       }              
#   ifdef GATHERSTATS
       GC_mem_found += n_words_found;
#   endif
    return(list);
#   undef DO_OBJ
}

Here is the caller graph for this function:

GC_bool GC_reclaim_all ( GC_stop_func  stop_func,
GC_bool  ignore_old 
)

Definition at line 708 of file reclaim.c.

{
    register word sz;
    register int kind;
    register hdr * hhdr;
    register struct hblk * hbp;
    register struct obj_kind * ok;
    struct hblk ** rlp;
    struct hblk ** rlh;
#   ifdef PRINTTIMES
       CLOCK_TYPE start_time;
       CLOCK_TYPE done_time;
       
       GET_TIME(start_time);
#   endif
    
    for (kind = 0; kind < GC_n_kinds; kind++) {
       ok = &(GC_obj_kinds[kind]);
       rlp = ok -> ok_reclaim_list;
       if (rlp == 0) continue;
       for (sz = 1; sz <= MAXOBJSZ; sz++) {
           rlh = rlp + sz;
           while ((hbp = *rlh) != 0) {
               if (stop_func != (GC_stop_func)0 && (*stop_func)()) {
                   return(FALSE);
               }
              hhdr = HDR(hbp);
              *rlh = hhdr -> hb_next;
              if (!ignore_old || hhdr -> hb_last_reclaimed == GC_gc_no - 1) {
                  /* It's likely we'll need it this time, too  */
                  /* It's been touched recently, so this       */
                  /* shouldn't trigger paging.          */
                  GC_reclaim_small_nonempty_block(hbp, FALSE);
              }
            }
        }
    }
#   ifdef PRINTTIMES
       GET_TIME(done_time);
       GC_printf1("Disposing of reclaim lists took %lu msecs\n",
                  MS_TIME_DIFF(done_time,start_time));
#   endif
    return(TRUE);
}

Here is the call graph for this function:

void GC_reclaim_block ( struct hblk hbp,
word  abort_if_found 
)

Definition at line 527 of file reclaim.c.

{
    register hdr * hhdr;
    register word sz;              /* size of objects in current block       */
    register struct obj_kind * ok;
    struct hblk ** rlh;

    hhdr = HDR(hbp);
    sz = hhdr -> hb_sz;
    ok = &GC_obj_kinds[hhdr -> hb_obj_kind];

    if( sz > MAXOBJSZ ) {  /* 1 big object */
        if( !mark_bit_from_hdr(hhdr, HDR_WORDS) ) {
           FOUND_FREE(hbp, HDR_WORDS);
           if (GC_root_size) {
#          ifdef GATHERSTATS
               GC_mem_found += sz;
#          endif
           GC_freehblk(hbp);
           }
       }
    } else {
        GC_bool empty = GC_block_empty(hhdr);
        if (abort_if_found) {
         GC_reclaim_small_nonempty_block(hbp, (int)abort_if_found);
        } else if (empty) {
#        ifdef GATHERSTATS
            GC_mem_found += BYTES_TO_WORDS(HBLKSIZE);
#        endif
          GC_freehblk(hbp);
        } else {
          /* group of smaller objects, enqueue the real work */
          rlh = &(ok -> ok_reclaim_list[sz]);
          hhdr -> hb_next = *rlh;
          *rlh = hbp;
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

ptr_t GC_reclaim_clear ( struct hblk hbp,
hdr hhdr,
word  sz,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 93 of file reclaim.c.

{
    register int word_no;
    register word *p, *q, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif        
    
    p = (word *)(hbp->hb_body);
    word_no = HDR_WORDS;
    plim = (word *)((((word)hbp) + HBLKSIZE)
                 - WORDS_TO_BYTES(sz));

    /* go through all words in block */
    while( p <= plim )  {
      if( mark_bit_from_hdr(hhdr, word_no) ) {
       p += sz;
      } else {
       FOUND_FREE(hbp, word_no);
       INCR_WORDS(sz);
#if !defined(FIND_LEAK) || 1
       if (GC_root_size) {
         /* object is available - put on list */
         obj_link(p) = list;
         list = ((ptr_t)p);
         /* Clear object, advance p to next object in the process */
         q = p + sz;
         p++; /* Skip link field */
         while (p < q) {
           *p++ = 0;
         }
       } else {
         /* roots gone, just advance. */
         p += sz;
       }
#else
       /* let leaks accumulate. */
       p += sz;
#endif
      }
      word_no += sz;
    }
#   ifdef GATHERSTATS
    GC_mem_found += n_words_found;
#   endif
    return(list);
}

Here is the call graph for this function:

Here is the caller graph for this function:

ptr_t GC_reclaim_clear2 ( struct hblk hbp,
hdr hhdr,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 152 of file reclaim.c.

{
    register word * mark_word_addr = &(hhdr->hb_marks[divWORDSZ(HDR_WORDS)]);
    register word *p, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif
    register word mark_word;
    register int i;
#   define DO_OBJ(start_displ) \
       if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           p[start_displ+1] = 0; \
           INCR_WORDS(2); } \
       }
    
    p = (word *)(hbp->hb_body);
    plim = (word *)(((word)hbp) + HBLKSIZE);

    /* go through all words in block */
       while( p < plim )  {
           mark_word = *mark_word_addr++;
           for (i = 0; i < WORDSZ; i += 8) {
              DO_OBJ(0);
              DO_OBJ(2);
              DO_OBJ(4);
              DO_OBJ(6);
              p += 8;
              mark_word >>= 8;
           }
       }              
#   ifdef GATHERSTATS
       GC_mem_found += n_words_found;
#   endif
    return(list);
#   undef DO_OBJ
}

Here is the caller graph for this function:

ptr_t GC_reclaim_clear4 ( struct hblk hbp,
hdr hhdr,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 200 of file reclaim.c.

{
    register word * mark_word_addr = &(hhdr->hb_marks[divWORDSZ(HDR_WORDS)]);
    register word *p, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif
    register word mark_word;
#   define DO_OBJ(start_displ) \
       if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           p[start_displ+1] = 0; \
           p[start_displ+2] = 0; \
           p[start_displ+3] = 0; \
           INCR_WORDS(4); \
           } \
       }
    
    p = (word *)(hbp->hb_body);
    plim = (word *)(((word)hbp) + HBLKSIZE);

    /* go through all words in block */
       while( p < plim )  {
           mark_word = *mark_word_addr++;
           DO_OBJ(0);
           DO_OBJ(4);
           DO_OBJ(8);
           DO_OBJ(12);
           DO_OBJ(16);
           DO_OBJ(20);
           DO_OBJ(24);
           DO_OBJ(28);
#          if CPP_WORDSZ == 64
             DO_OBJ(32);
             DO_OBJ(36);
             DO_OBJ(40);
             DO_OBJ(44);
             DO_OBJ(48);
             DO_OBJ(52);
             DO_OBJ(56);
             DO_OBJ(60);
#          endif
           p += WORDSZ;
       }              
#   ifdef GATHERSTATS
       GC_mem_found += n_words_found;
#   endif
    return(list);
#   undef DO_OBJ
}

Here is the caller graph for this function:

void GC_reclaim_small_nonempty_block ( struct hblk hbp,
int  abort_if_found 
)

Definition at line 464 of file reclaim.c.

{
    hdr * hhdr;
    register word sz;              /* size of objects in current block       */
    register struct obj_kind * ok;
    register ptr_t * flh;
    register int kind;
    
    hhdr = HDR(hbp);
    sz = hhdr -> hb_sz;
    hhdr -> hb_last_reclaimed = (unsigned short) GC_gc_no;
    kind = hhdr -> hb_obj_kind;
    ok = &GC_obj_kinds[kind];
    flh = &(ok -> ok_freelist[sz]);
    GC_write_hint(hbp);

    if (ok -> ok_init) {
      switch(sz) {
#      ifndef SMALL_CONFIG
        case 1:
            *flh = GC_reclaim1(hbp, hhdr, *flh, abort_if_found);
            break;
        case 2:
            *flh = GC_reclaim_clear2(hbp, hhdr, *flh, abort_if_found);
            break;
        case 4:
            *flh = GC_reclaim_clear4(hbp, hhdr, *flh, abort_if_found);
            break;
#      endif
        default:
            *flh = GC_reclaim_clear(hbp, hhdr, sz, *flh, abort_if_found);
            break;
      }
    } else {
      switch(sz) {
#      ifndef SMALL_CONFIG
        case 1:
            *flh = GC_reclaim1(hbp, hhdr, *flh, abort_if_found);
            break;
        case 2:
            *flh = GC_reclaim_uninit2(hbp, hhdr, *flh, abort_if_found);
            break;
        case 4:
            *flh = GC_reclaim_uninit4(hbp, hhdr, *flh, abort_if_found);
            break;
#      endif
        default:
            *flh = GC_reclaim_uninit(hbp, hhdr, sz, *flh, abort_if_found);
            break;
      }
    } 
    if (IS_UNCOLLECTABLE(kind)) GC_set_hdr_marks(hhdr);
}

Here is the call graph for this function:

Here is the caller graph for this function:

ptr_t GC_reclaim_uninit ( struct hblk hbp,
hdr hhdr,
word  sz,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 262 of file reclaim.c.

{
    register int word_no;
    register word *p, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif
    
    p = (word *)(hbp->hb_body);
    word_no = HDR_WORDS;
    plim = (word *)((((word)hbp) + HBLKSIZE)
                 - WORDS_TO_BYTES(sz));

    /* go through all words in block */
       while( p <= plim )  {
           if( !mark_bit_from_hdr(hhdr, word_no) ) {
            FOUND_FREE(hbp, word_no);
            INCR_WORDS(sz);
            if (GC_root_size) {
                /* object is available - put on list */
                obj_link(p) = list;
                list = ((ptr_t)p);
            }
           }
           p += sz;
           word_no += sz;
       }
#   ifdef GATHERSTATS
       GC_mem_found += n_words_found;
#   endif
    return(list);
}

Here is the call graph for this function:

Here is the caller graph for this function:

ptr_t GC_reclaim_uninit2 ( struct hblk hbp,
hdr hhdr,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 305 of file reclaim.c.

{
    register word * mark_word_addr = &(hhdr->hb_marks[divWORDSZ(HDR_WORDS)]);
    register word *p, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif
    register word mark_word;
    register int i;
#   define DO_OBJ(start_displ) \
       if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           INCR_WORDS(2); \
           } \
       }
    
    p = (word *)(hbp->hb_body);
    plim = (word *)(((word)hbp) + HBLKSIZE);

    /* go through all words in block */
       while( p < plim )  {
           mark_word = *mark_word_addr++;
           for (i = 0; i < WORDSZ; i += 8) {
              DO_OBJ(0);
              DO_OBJ(2);
              DO_OBJ(4);
              DO_OBJ(6);
              p += 8;
              mark_word >>= 8;
           }
       }              
#   ifdef GATHERSTATS
       GC_mem_found += n_words_found;
#   endif
    return(list);
#   undef DO_OBJ
}

Here is the caller graph for this function:

ptr_t GC_reclaim_uninit4 ( struct hblk hbp,
hdr hhdr,
ptr_t  list,
GC_bool  abort_if_found 
)

Definition at line 354 of file reclaim.c.

{
    register word * mark_word_addr = &(hhdr->hb_marks[divWORDSZ(HDR_WORDS)]);
    register word *p, *plim;
#   ifdef GATHERSTATS
        register int n_words_found = 0;
#   endif
    register word mark_word;
#   define DO_OBJ(start_displ) \
       if (!(mark_word & ((word)1 << start_displ))) { \
           FOUND_FREE(hbp, p - (word *)hbp + start_displ); \
           if (GC_root_size) { \
           p[start_displ] = (word)list; \
           list = (ptr_t)(p+start_displ); \
           INCR_WORDS(4); \
           } \
       }
    
    p = (word *)(hbp->hb_body);
    plim = (word *)(((word)hbp) + HBLKSIZE);

    /* go through all words in block */
       while( p < plim )  {
           mark_word = *mark_word_addr++;
           DO_OBJ(0);
           DO_OBJ(4);
           DO_OBJ(8);
           DO_OBJ(12);
           DO_OBJ(16);
           DO_OBJ(20);
           DO_OBJ(24);
           DO_OBJ(28);
#          if CPP_WORDSZ == 64
             DO_OBJ(32);
             DO_OBJ(36);
             DO_OBJ(40);
             DO_OBJ(44);
             DO_OBJ(48);
             DO_OBJ(52);
             DO_OBJ(56);
             DO_OBJ(60);
#          endif
           p += WORDSZ;
       }              
#   ifdef GATHERSTATS
       GC_mem_found += n_words_found;
#   endif
    return(list);
#   undef DO_OBJ
}

Here is the caller graph for this function:

void GC_start_reclaim ( int  abort_if_found)

Definition at line 636 of file reclaim.c.

{
    int kind;
    
    /* Clear reclaim- and free-lists */
      for (kind = 0; kind < GC_n_kinds; kind++) {
        register ptr_t *fop;
        register ptr_t *lim;
        register struct hblk ** rlp;
        register struct hblk ** rlim;
        register struct hblk ** rlist = GC_obj_kinds[kind].ok_reclaim_list;
        
        if (rlist == 0) continue;  /* This kind not used.      */
        if (!abort_if_found) {
            lim = &(GC_obj_kinds[kind].ok_freelist[MAXOBJSZ+1]);
           for( fop = GC_obj_kinds[kind].ok_freelist; fop < lim; fop++ ) {
             *fop = 0;
           }
       } /* otherwise free list objects are marked,     */
         /* and its safe to leave them                  */
       rlim = rlist + MAXOBJSZ+1;
       for( rlp = rlist; rlp < rlim; rlp++ ) {
           *rlp = 0;
       }
      }
    
#   ifdef PRINTBLOCKS
        GC_printf0("GC_reclaim: current block sizes:\n");
        GC_print_block_list();
#   endif

  /* Go through all heap blocks (in hblklist) and reclaim unmarked objects */
  /* or enqueue the block for later processing.                          */
    GC_apply_to_all_blocks(GC_reclaim_block, (word)abort_if_found);
    
}

Here is the call graph for this function:

static int set_bits ( word  n) [static]

Definition at line 576 of file reclaim.c.

{
    register word m = n;
    register int result = 0;
    
    while (m > 0) {
       if (m & 1) result++;
       m >>= 1;
    }
    return(result);
}

Here is the caller graph for this function:


Variable Documentation

Definition at line 19 of file reclaim.c.

size_t number_of_blocks [static]

Definition at line 572 of file reclaim.c.

size_t total_bytes [static]

Definition at line 573 of file reclaim.c.