diogo
/
yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix infinite terms in DB 

git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@259 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
vsc 2002-01-03 06:26:15 +00:00
parent 698f6d2c04
commit 50128d8f6f
1 changed files with 6 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
C/dbase.c
View File

@ -626,6 +626,8 @@ static CELL *MkDBTerm(register CELL *pt0, register CELL *pt0_end,
ap2 = RepAppl(d0);
#ifdef RATIONAL_TREES
if (ap2 < (CELL *)((CELL)CodeMax-(CELL)tbase)) {
*lr++ = ToSmall((CELL)(StoPoint)-(CELL)(tbase));
check_trail(lr);
*StoPoint++ = d0;
++pt0;
continue;
@ -761,6 +763,8 @@ static CELL *MkDBTerm(register CELL *pt0, register CELL *pt0_end,
#ifdef RATIONAL_TREES
if (RepPair(d0) < (CELL *)((CELL)CodeMax-(CELL)tbase)) {
*StoPoint++ = d0;
*lr++ = ToSmall((CELL)(StoPoint)-(CELL)(tbase));
check_trail(lr);
++pt0;
continue;
}
@ -861,6 +865,8 @@ static CELL *MkDBTerm(register CELL *pt0, register CELL *pt0_end,
Term t[4];
int sz = to_visit-to_visit_base;
printf("visiting a constraint %p\n", ptd0);
H = (CELL *)to_visit;
/* store the constraint away for now */
t[0] = (CELL)ptd0;