c1480cfd91
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1296 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
215 lines
5.6 KiB
C
215 lines
5.6 KiB
C
/*************************************************************************
|
|
* *
|
|
* YAP Prolog *
|
|
* *
|
|
* Yap Prolog was developed at NCCUP - Universidade do Porto *
|
|
* *
|
|
* Copyright L.Damas, V.S.Costa and Universidade do Porto 1985-1997 *
|
|
* *
|
|
**************************************************************************
|
|
* *
|
|
* File: heapgc.c *
|
|
* Last rev: *
|
|
* mods: *
|
|
* comments: Header for Global Stack garbage collector *
|
|
* *
|
|
*************************************************************************/
|
|
|
|
|
|
|
|
/* macros used by garbage collection */
|
|
|
|
#if TAG_64BITS
|
|
#if GC_NO_TAGS
|
|
#define MaskAdr (~0x7L)
|
|
#else
|
|
#define MaskAdr (~(MBIT|RBIT|0x7L))
|
|
#endif
|
|
#endif
|
|
|
|
/* return pointer from object pointed to by ptr (remove tag & mark) */
|
|
#ifdef TAGS_FAST_OPS
|
|
#define GET_NEXT(val) ((CELL *)(IsVarTerm((val)) ? \
|
|
(val) & MaskAdr : \
|
|
( IsPairTerm((val)) ? \
|
|
Unsigned(RepPair((val))) & MaskAdr : \
|
|
( IsApplTerm((val)) ? \
|
|
Unsigned(RepAppl((val))) & MaskAdr : \
|
|
(val) & MaskAdr \
|
|
) \
|
|
) \
|
|
) \
|
|
)
|
|
#else
|
|
#ifdef TAG_LOW_BITS_32
|
|
#if GC_NO_TAGS
|
|
#define GET_NEXT(val) ((CELL *) ((val) & ~LowTagBits))
|
|
#elif INVERT_RBIT
|
|
#define GET_NEXT(val) ((CELL *) (((val) & ~(LowTagBits|MBIT))|RBIT))
|
|
#else
|
|
#define GET_NEXT(val) ((CELL *) ((val) & ~(LowTagBits|MBIT|RBIT)))
|
|
#endif
|
|
#else
|
|
#define GET_NEXT(val) ((CELL *) ((val) & MaskAdr))
|
|
#endif
|
|
#endif
|
|
|
|
/* is ptr a pointer to the heap? */
|
|
#define ONHEAP(ptr) (CellPtr(ptr) >= H0 && CellPtr(ptr) < H)
|
|
|
|
/* is ptr a pointer to code space? */
|
|
#if USE_SYSTEM_MALLOC
|
|
#define ONCODE(ptr) (Addr(ptr) < Yap_GlobalBase || Addr(ptr) > Yap_TrailTop)
|
|
#else
|
|
#define ONCODE(ptr) (Addr(ptr) < HeapTop && Addr(ptr) >= Yap_HeapBase)
|
|
#endif
|
|
|
|
/* is val pointing to something bound to the heap? */
|
|
|
|
|
|
#define GCIsPrimitiveTerm(X) (!IsVarTerm(X) && IsAtomOrIntTerm(X))
|
|
|
|
/* Does X point to an object in the heap */
|
|
#define HEAP_PTR(val) (!GCIsPrimitiveTerm(val) && ONHEAP(GET_NEXT(val)))
|
|
|
|
/*
|
|
Heap_trail_entry must be very careful. We are looking at a valid
|
|
trail entry if: it was between H0 and HB or between B and LCLO
|
|
(that is, if it was covered by choicepoints at the time), and if it
|
|
was a heap pointer.
|
|
|
|
We can join the two conditions: (H0 =< val < HB || ((B < val < LCL0)
|
|
&& H0 <= *DETAG(val) < H))
|
|
*/
|
|
#define HEAP_TRAIL_ENTRY(val) ((IsVarTerm(val)) && \
|
|
((H0 <= CellPtr(val) && CellPtr(val)\
|
|
< cp_H) || \
|
|
(CellPtr(B) < CellPtr(val) && CellPtr(val) <= \
|
|
LCL0 && HEAP_PTR(val))))
|
|
|
|
#if GC_NO_TAGS
|
|
|
|
extern char *bp;
|
|
|
|
#define MARK_BIT 1
|
|
#define RMARK_BIT 2
|
|
|
|
#define mcell(X) bp[X-(CELL *)Yap_GlobalBase]
|
|
|
|
static inline Int
|
|
MARKED_PTR(CELL* ptr)
|
|
{
|
|
return mcell(ptr) & MARK_BIT;
|
|
}
|
|
|
|
static inline void
|
|
MARK(CELL* ptr)
|
|
{
|
|
mcell(ptr) = mcell(ptr) | MARK_BIT;
|
|
}
|
|
|
|
static inline void
|
|
UNMARK(CELL* ptr)
|
|
{
|
|
mcell(ptr) = mcell(ptr) & ~MARK_BIT;
|
|
}
|
|
|
|
#define UNMARK_CELL(X) (X)
|
|
|
|
static inline void
|
|
RMARK(CELL* ptr)
|
|
{
|
|
mcell(ptr) = mcell(ptr) | RMARK_BIT;
|
|
}
|
|
|
|
static inline void
|
|
UNRMARK(CELL* ptr)
|
|
{
|
|
mcell(ptr) = mcell(ptr) & ~RMARK_BIT;
|
|
}
|
|
|
|
static inline int
|
|
RMARKED(CELL* ptr)
|
|
{
|
|
CELL val = *ptr;
|
|
return !GCIsPrimitiveTerm(val) && (mcell(ptr) & RMARK_BIT);
|
|
}
|
|
|
|
#else
|
|
|
|
/* is the object pointed to by ptr marked? */
|
|
#ifdef TAGS_FAST_OPS
|
|
#define MARKED_VAR(val) ((val) & MBIT)
|
|
|
|
#define MARKED_COMP(val) (!((val) & MBIT))
|
|
|
|
#define MARKED(val) ((Int)(val) < 0 && (((val) & LowTagBits) != 2)\
|
|
? \
|
|
!((val) & MBIT) : ((val) & MBIT))
|
|
#else
|
|
#define MARKED(val) ((val) & MBIT)
|
|
#endif
|
|
|
|
|
|
|
|
#define MARK(ptr) (*(ptr) ^= MBIT) /* mark the object pointed to by ptr */
|
|
|
|
#define MARK_CELL(val) ((val) ^ MBIT) /* mark the object pointed to by ptr */
|
|
|
|
#define UNMARK(ptr) (*(ptr) ^= MBIT) /* unmark the object pointed to by ptr */
|
|
|
|
#define UNMARK_CELL(val) ((val) ^ MBIT) /* unmark the object pointed to by ptr */
|
|
|
|
#define MARKED_PTR(ptr) MARKED(*(ptr))
|
|
|
|
#ifdef TAGS_FAST_OPS
|
|
|
|
#define RMARKED(ptr) (!GCIsPrimitiveTerm(*(ptr)) && (IsVarTerm(*(ptr)) ?\
|
|
((*(ptr)) & RBIT) : !((*(ptr)) & RBIT)))
|
|
|
|
#define UNMARKED(val) ((Int)(val) < 0 && (((val) & LowTagBits) != 2)\
|
|
? \
|
|
((val) | MBIT) : ((val) & ~MBIT))
|
|
#define ENSURE_MARKED(val) ((Int)(val) < 0 && (((val) & LowTagBits) != 2)\
|
|
? \
|
|
((val) & ~MBIT) : ((val) | MBIT))
|
|
#else
|
|
|
|
#if INVERT_RBIT
|
|
#define RMARKED(ptr) (!GCIsPrimitiveTerm(*(ptr)) && !((*(ptr)) & RBIT))
|
|
#else
|
|
#define RMARKED(ptr) (!GCIsPrimitiveTerm(*(ptr)) && ((*(ptr)) & RBIT))
|
|
#endif
|
|
|
|
#endif /* GC_NO_TAGS */
|
|
|
|
|
|
#endif
|
|
|
|
/* is the object pointed to by ptr marked as in a relocation chain? */
|
|
|
|
#if LONG_ADDRESSES
|
|
#ifdef TAG_LOW_BITS_32
|
|
#define TAG(X) ((X) & LowTagBits)
|
|
#else
|
|
#ifdef TAG_64BITS
|
|
#define TAG(X) ((X) & MKTAG(0x0,0x7))
|
|
#else
|
|
#define TAG(X) ((X) & 0x80000003L)
|
|
#endif
|
|
#endif
|
|
#else
|
|
#define TAG(X) ((X) & 0x98000000L)
|
|
#endif
|
|
|
|
typedef CELL *CELL_PTR;
|
|
|
|
#define ENVSIZE(E) EnvSize(((CELL *)E)[E_CP])
|
|
|
|
void STD_PROTO(Yap_mark_variable, (CELL *));
|
|
void STD_PROTO(Yap_mark_external_reference, (CELL *));
|
|
void STD_PROTO(Yap_inc_mark_variable, (void));
|
|
|
|
|
|
|