first steps to allow mavars with tabling
fix trailing for tabling with multiple get_cons git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1356 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
|
||||
Copyright: R. Rocha and NCC - University of Porto, Portugal
|
||||
File: opt.mavar.h
|
||||
version: $Id: opt.mavar.h,v 1.3 2005-05-31 08:24:24 ricroc Exp $
|
||||
version: $Id: opt.mavar.h,v 1.4 2005-08-05 14:55:03 vsc Exp $
|
||||
|
||||
**********************************************************************/
|
||||
|
||||
@@ -31,17 +31,17 @@ typedef struct {
|
||||
struct ma_h_entry val;
|
||||
} ma_hash_entry;
|
||||
|
||||
extern ma_hash_entry ma_hash_table[MAVARS_HASH_SIZE];
|
||||
extern ma_hash_entry Yap_ma_hash_table[MAVARS_HASH_SIZE];
|
||||
|
||||
extern UInt timestamp; /* an unsigned int */
|
||||
extern UInt Yap_timestamp; /* an unsigned int */
|
||||
|
||||
OPT_MAVAR_STATIC unsigned int MAVAR_HASH(CELL *);
|
||||
OPT_MAVAR_STATIC struct ma_h_entry *ALLOC_NEW_MASPACE(void);
|
||||
OPT_MAVAR_STATIC int lookup_ma_var(CELL *);
|
||||
OPT_MAVAR_STATIC UInt NEW_MAHASH(ma_h_inner_struct *);
|
||||
OPT_MAVAR_STATIC unsigned int Yap_MAVAR_HASH(CELL *);
|
||||
OPT_MAVAR_STATIC struct ma_h_entry *Yap_ALLOC_NEW_MASPACE(void);
|
||||
OPT_MAVAR_STATIC int Yap_lookup_ma_var(CELL *);
|
||||
OPT_MAVAR_STATIC UInt Yap_NEW_MAHASH(ma_h_inner_struct *);
|
||||
|
||||
OPT_MAVAR_STATIC unsigned int
|
||||
MAVAR_HASH(CELL *addr) {
|
||||
Yap_MAVAR_HASH(CELL *addr) {
|
||||
#if SIZEOF_INT_P==8
|
||||
return((((unsigned int)((CELL)(addr)))>>3)%MAVARS_HASH_SIZE);
|
||||
#else
|
||||
@@ -49,56 +49,56 @@ MAVAR_HASH(CELL *addr) {
|
||||
#endif
|
||||
}
|
||||
|
||||
extern ma_h_inner_struct *ma_h_top;
|
||||
extern ma_h_inner_struct *Yap_ma_h_top;
|
||||
|
||||
OPT_MAVAR_STATIC struct ma_h_entry *
|
||||
ALLOC_NEW_MASPACE(void)
|
||||
Yap_ALLOC_NEW_MASPACE(void)
|
||||
{
|
||||
ma_h_inner_struct *new = ma_h_top;
|
||||
ma_h_top++;
|
||||
return(new);
|
||||
ma_h_inner_struct *new = Yap_ma_h_top;
|
||||
Yap_ma_h_top++;
|
||||
return new;
|
||||
}
|
||||
|
||||
OPT_MAVAR_STATIC int
|
||||
lookup_ma_var(CELL *addr) {
|
||||
unsigned int i = MAVAR_HASH(addr);
|
||||
Yap_lookup_ma_var(CELL *addr) {
|
||||
unsigned int i = Yap_MAVAR_HASH(addr);
|
||||
struct ma_h_entry *nptr, *optr;
|
||||
|
||||
if (ma_hash_table[i].timestmp != timestamp) {
|
||||
ma_hash_table[i].timestmp = timestamp;
|
||||
ma_hash_table[i].val.addr = addr;
|
||||
ma_hash_table[i].val.next = NULL;
|
||||
return(FALSE);
|
||||
if (Yap_ma_hash_table[i].timestmp != Yap_timestamp) {
|
||||
Yap_ma_hash_table[i].timestmp = Yap_timestamp;
|
||||
Yap_ma_hash_table[i].val.addr = addr;
|
||||
Yap_ma_hash_table[i].val.next = NULL;
|
||||
return FALSE;
|
||||
}
|
||||
if (ma_hash_table[i].val.addr == addr)
|
||||
return(TRUE);
|
||||
optr = &(ma_hash_table[i].val);
|
||||
nptr = ma_hash_table[i].val.next;
|
||||
if (Yap_ma_hash_table[i].val.addr == addr)
|
||||
return TRUE;
|
||||
optr = &(Yap_ma_hash_table[i].val);
|
||||
nptr = Yap_ma_hash_table[i].val.next;
|
||||
while (nptr != NULL) {
|
||||
if (nptr->addr == addr) {
|
||||
return(TRUE);
|
||||
return TRUE;
|
||||
}
|
||||
optr = nptr;
|
||||
nptr = nptr->next;
|
||||
}
|
||||
nptr = ALLOC_NEW_MASPACE();
|
||||
nptr = Yap_ALLOC_NEW_MASPACE();
|
||||
nptr->addr = addr;
|
||||
nptr->next = optr;
|
||||
return(FALSE);
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
OPT_MAVAR_STATIC UInt
|
||||
NEW_MAHASH(ma_h_inner_struct *top) {
|
||||
UInt time = ++timestamp;
|
||||
Yap_NEW_MAHASH(ma_h_inner_struct *top) {
|
||||
UInt time = ++Yap_timestamp;
|
||||
if (time == 0) {
|
||||
unsigned int i;
|
||||
/* damn, we overflowed */
|
||||
for (i = 0; i < MAVARS_HASH_SIZE; i++)
|
||||
ma_hash_table[i].timestmp = 0;
|
||||
time = ++timestamp;
|
||||
Yap_ma_hash_table[i].timestmp = 0;
|
||||
time = ++Yap_timestamp;
|
||||
}
|
||||
ma_h_top = top;
|
||||
return(time);
|
||||
Yap_ma_h_top = top;
|
||||
return time;
|
||||
}
|
||||
|
||||
#endif /* MULTI_ASSIGNMENT_VARIABLES */
|
||||
|
Reference in New Issue
Block a user