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

fix bug in processing overflows of expand_clauses.

Browse Source 
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1365 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
vsc 2005-08-17 18:48:35 +00:00
parent 996272db22
commit 101abc67d0
1 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
C/index.c
View File

@ -11,8 +11,11 @@
* File: index.c * * File: index.c *
* comments: Indexing a Prolog predicate * * comments: Indexing a Prolog predicate *
* * * *
* Last rev: $Date: 2005-08-02 03:09:50 $,$Author: vsc $ * * Last rev: $Date: 2005-08-17 18:48:35 $,$Author: vsc $ *
* $Log: not supported by cvs2svn $ * $Log: not supported by cvs2svn $
* Revision 1.143 2005/08/02 03:09:50 vsc
* fix debugger to do well nonsource predicates.
*
* Revision 1.142 2005/08/01 15:40:37 ricroc * Revision 1.142 2005/08/01 15:40:37 ricroc
* TABLING NEW: better support for incomplete tabling * TABLING NEW: better support for incomplete tabling
* *
@ -6652,10 +6655,13 @@ static yamop *
add_to_expand_clauses(path_stack_entry **spp, yamop *ipc, ClauseDef *cls, PredEntry *ap, int first) add_to_expand_clauses(path_stack_entry **spp, yamop *ipc, ClauseDef *cls, PredEntry *ap, int first)
{ {
path_stack_entry *sp = *spp; path_stack_entry *sp = *spp;
yamop **clar = (yamop **)NEXTOP(ipc,sp); yamop **clar;
if (first) { if (first) {
do { do {
clar = (yamop **)NEXTOP(ipc,sp);
if (*clar == NULL || clar[0] == cls->Code) { if (*clar == NULL || clar[0] == cls->Code) {
while (*clar == NULL) clar++; while (*clar == NULL) clar++;
if (clar[0] != cls->Code) { if (clar[0] != cls->Code) {
@ -6667,7 +6673,7 @@ add_to_expand_clauses(path_stack_entry **spp, yamop *ipc, ClauseDef *cls, PredEn
} while (compacta_expand_clauses(ipc)); } while (compacta_expand_clauses(ipc));
} else { } else {
do { do {
clar += ipc->u.sp.s1; clar = (yamop **)NEXTOP(ipc,sp) + ipc->u.sp.s1;
if (clar[-1] == NULL || clar[-1] == cls->Code) { if (clar[-1] == NULL || clar[-1] == cls->Code) {
while (*--clar == NULL); while (*--clar == NULL);
if (clar[0] != cls->Code) { if (clar[0] != cls->Code) {