diogo/yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
This repository has been archived on 2023-08-20. You can view files and clone it, but cannot push or open issues or pull requests.
17d1f11b5c
yap-6.3/H/findclause.h

1536 lines
37 KiB
C
Raw Normal View History

use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
/* This file was generated automatically by "yap -L misc/buildops"
please do not update */
while (TRUE) {
op_numbers op = Yap_op_from_opcode(cl->opc);
switch (op) {
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
case _write_dbterm:
cl = NEXTOP(cl,D);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
case _alloc_for_logical_pred:
cl = NEXTOP(cl,L);
break;
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
case _write_bigint:
cl = NEXTOP(cl,N);
break;
make sure we have enough room before we enter a clause.
2010-08-02 18:20:03 +01:00
case _ensure_space:
first step for quick loader, and fix an instruction format.
2011-07-30 00:07:35 +01:00
cl = NEXTOP(cl,Osbpa);
make sure we have enough room before we enter a clause.
2010-08-02 18:20:03 +01:00
break;
more patches to support Anderson's JIT.
2009-04-08 00:32:36 +01:00
case _native_me:
cl = NEXTOP(cl,aFlp);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
case _write_atom:
cl = NEXTOP(cl,c);
break;
case _get_2atoms:
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(1))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cc.c1)) {
CELL *pt = RepAppl(cl->u.cc.c1);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cc.c1;
} else
clause->Tag = cl->u.cc.c1;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(2))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cc.c2)) {
CELL *pt = RepAppl(cl->u.cc.c2);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cc.c2;
} else
clause->Tag = cl->u.cc.c2;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
cl = NEXTOP(cl,cc);
break;
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
case _get_3atoms:
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(1))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccc.c1)) {
CELL *pt = RepAppl(cl->u.ccc.c1);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccc.c1;
} else
clause->Tag = cl->u.ccc.c1;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(2))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccc.c2)) {
CELL *pt = RepAppl(cl->u.ccc.c2);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccc.c2;
} else
clause->Tag = cl->u.ccc.c2;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(3))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccc.c3)) {
CELL *pt = RepAppl(cl->u.ccc.c3);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccc.c3;
} else
clause->Tag = cl->u.ccc.c3;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
cl = NEXTOP(cl,ccc);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
case _get_4atoms:
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(1))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccc.c1)) {
CELL *pt = RepAppl(cl->u.cccc.c1);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccc.c1;
} else
clause->Tag = cl->u.cccc.c1;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(2))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccc.c2)) {
CELL *pt = RepAppl(cl->u.cccc.c2);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccc.c2;
} else
clause->Tag = cl->u.cccc.c2;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(3))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccc.c3)) {
CELL *pt = RepAppl(cl->u.cccc.c3);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccc.c3;
} else
clause->Tag = cl->u.cccc.c3;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(4))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccc.c4)) {
CELL *pt = RepAppl(cl->u.cccc.c4);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccc.c4;
} else
clause->Tag = cl->u.cccc.c4;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
cl = NEXTOP(cl,cccc);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
case _get_5atoms:
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(1))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccccc.c1)) {
CELL *pt = RepAppl(cl->u.ccccc.c1);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccccc.c1;
} else
clause->Tag = cl->u.ccccc.c1;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(2))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccccc.c2)) {
CELL *pt = RepAppl(cl->u.ccccc.c2);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccccc.c2;
} else
clause->Tag = cl->u.ccccc.c2;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(3))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccccc.c3)) {
CELL *pt = RepAppl(cl->u.ccccc.c3);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccccc.c3;
} else
clause->Tag = cl->u.ccccc.c3;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(4))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccccc.c4)) {
CELL *pt = RepAppl(cl->u.ccccc.c4);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccccc.c4;
} else
clause->Tag = cl->u.ccccc.c4;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(5))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.ccccc.c5)) {
CELL *pt = RepAppl(cl->u.ccccc.c5);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.ccccc.c5;
} else
clause->Tag = cl->u.ccccc.c5;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
cl = NEXTOP(cl,ccccc);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
case _get_6atoms:
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(1))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccccc.c1)) {
CELL *pt = RepAppl(cl->u.cccccc.c1);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccccc.c1;
} else
clause->Tag = cl->u.cccccc.c1;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(2))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccccc.c2)) {
CELL *pt = RepAppl(cl->u.cccccc.c2);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccccc.c2;
} else
clause->Tag = cl->u.cccccc.c2;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(3))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccccc.c3)) {
CELL *pt = RepAppl(cl->u.cccccc.c3);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccccc.c3;
} else
clause->Tag = cl->u.cccccc.c3;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(4))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccccc.c4)) {
CELL *pt = RepAppl(cl->u.cccccc.c4);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccccc.c4;
} else
clause->Tag = cl->u.cccccc.c4;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(5))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccccc.c5)) {
CELL *pt = RepAppl(cl->u.cccccc.c5);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccccc.c5;
} else
clause->Tag = cl->u.cccccc.c5;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
if (is_regcopy(myregs, nofregs, Yap_regnotoreg(6))) {
fix indexing of dbrefs (obs from Nicola di Mauro).
2010-02-12 15:51:31 +00:00
if (IsApplTerm(cl->u.cccccc.c6)) {
CELL *pt = RepAppl(cl->u.cccccc.c6);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.cccccc.c6;
} else
clause->Tag = cl->u.cccccc.c6;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
cl = NEXTOP(cl,cccccc);
break;
case _write_float:
cl = NEXTOP(cl,d);
break;
case _allocate:
cl = NEXTOP(cl,e);
break;
case _copy_idb_term:
if (regno == 2) {
LogUpdClause *lcl = ClauseCodeToLogUpdClause(cl);
line numbers for clauses and clause properties
2013-11-05 17:59:19 +00:00
Term t = lcl->lusl.ClSource->Entry;
if (!(lcl->ClFlags & FactMask)) {
if (IsVarTerm(t)) {
clause->Tag = (CELL)NULL;
} else if (IsApplTerm(t)) {
CELL *pt = RepAppl(t);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
line numbers for clauses and clause properties
2013-11-05 17:59:19 +00:00
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.c_sreg = pt;
} else if (IsPairTerm(t)) {
CELL *pt = RepPair(t);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
line numbers for clauses and clause properties
2013-11-05 17:59:19 +00:00
clause->Tag = AbsPair(NULL);
clause->u.c_sreg = pt-1;
} else {
clause->Tag = t;
}
}
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
} else {
clause->Tag = (CELL)NULL;
}
return;
cl = NEXTOP(cl,e);
break;
case _pop:
cl = NEXTOP(cl,e);
break;
#ifdef BEAM
case _retry_eam:
#endif
cl = NEXTOP(cl,e);
break;
case _unify_idb_term:
if (regno == 2) {
LogUpdClause *lcl = ClauseCodeToLogUpdClause(cl);
line numbers for clauses and clause properties
2013-11-05 17:59:19 +00:00
Term t = lcl->lusl.ClSource->Entry;
if (!(lcl->ClFlags & FactMask)) {
if (IsVarTerm(t)) {
clause->Tag = (CELL)NULL;
} else if (IsApplTerm(t)) {
CELL *pt = RepAppl(t);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
line numbers for clauses and clause properties
2013-11-05 17:59:19 +00:00
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.c_sreg = pt;
} else if (IsPairTerm(t)) {
CELL *pt = RepPair(t);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
line numbers for clauses and clause properties
2013-11-05 17:59:19 +00:00
clause->Tag = AbsPair(NULL);
clause->u.c_sreg = pt-1;
} else {
clause->Tag = t;
}
}
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
} else {
clause->Tag = (CELL)NULL;
}
return;
cl = NEXTOP(cl,e);
break;
case _write_l_list:
cl = NEXTOP(cl,e);
break;
case _write_list:
cl = NEXTOP(cl,e);
break;
case _write_void:
cl = NEXTOP(cl,e);
break;
fix bad indexing (obs from Jos)
2012-12-07 23:43:00 +00:00
case _write_l_struc:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
cl = NEXTOP(cl,fa);
break;
case _write_longint:
cl = NEXTOP(cl,i);
break;
case _unify_l_list:
cl = NEXTOP(cl,o);
break;
case _unify_l_list_write:
cl = NEXTOP(cl,o);
break;
case _unify_l_void:
cl = NEXTOP(cl,o);
break;
case _unify_l_void_write:
cl = NEXTOP(cl,o);
break;
case _unify_list:
cl = NEXTOP(cl,o);
break;
case _unify_list_write:
cl = NEXTOP(cl,o);
break;
case _unify_void:
cl = NEXTOP(cl,o);
break;
case _unify_void_write:
cl = NEXTOP(cl,o);
break;
case _unify_dbterm:
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
cl = NEXTOP(cl,oD);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _unify_l_dbterm:
cl = NEXTOP(cl,oD);
break;
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
case _unify_bigint:
cl = NEXTOP(cl,oN);
break;
case _unify_l_bigint:
cl = NEXTOP(cl,oN);
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _unify_atom:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
cl = NEXTOP(cl,oc);
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _unify_atom_write:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
cl = NEXTOP(cl,oc);
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _unify_l_atom:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
cl = NEXTOP(cl,oc);
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _unify_l_atom_write:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
cl = NEXTOP(cl,oc);
break;
case _unify_float:
cl = NEXTOP(cl,od);
break;
case _unify_float_write:
cl = NEXTOP(cl,od);
break;
case _unify_l_float:
cl = NEXTOP(cl,od);
break;
case _unify_l_float_write:
cl = NEXTOP(cl,od);
break;
fix bad indexing (obs from Jos)
2012-12-07 23:43:00 +00:00
case _unify_l_struc:
cl = NEXTOP(cl,ofa);
break;
case _unify_l_struc_write:
cl = NEXTOP(cl,ofa);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
case _unify_struct:
cl = NEXTOP(cl,ofa);
break;
case _unify_struct_write:
cl = NEXTOP(cl,ofa);
break;
case _unify_l_longint:
cl = NEXTOP(cl,oi);
break;
case _unify_l_longint_write:
cl = NEXTOP(cl,oi);
break;
case _unify_longint:
cl = NEXTOP(cl,oi);
break;
case _unify_longint_write:
cl = NEXTOP(cl,oi);
break;
#ifdef BEAM
case _run_eam:
#endif
cl = NEXTOP(cl,os);
break;
case _unify_l_n_voids:
cl = NEXTOP(cl,os);
break;
case _unify_l_n_voids_write:
cl = NEXTOP(cl,os);
break;
case _unify_n_voids:
cl = NEXTOP(cl,os);
break;
case _unify_n_voids_write:
cl = NEXTOP(cl,os);
break;
case _unify_n_atoms:
cl = NEXTOP(cl,osc);
break;
case _unify_n_atoms_write:
cl = NEXTOP(cl,osc);
break;
new text conversion and string code (big changes, take care please)
2013-12-02 14:49:41 +00:00
case _unify_l_string:
cl = NEXTOP(cl,ou);
break;
case _unify_string:
cl = NEXTOP(cl,ou);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
case _save_appl_x:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _save_appl_x_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _save_pair_x:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _save_pair_x_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_loc:
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_loc_write:
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_val:
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_val_write:
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_var_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _unify_x_loc:
cl = NEXTOP(cl,ox);
break;
case _unify_x_loc_write:
cl = NEXTOP(cl,ox);
break;
case _unify_x_val:
cl = NEXTOP(cl,ox);
break;
case _unify_x_val_write:
cl = NEXTOP(cl,ox);
break;
case _unify_x_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _unify_x_var_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.ox.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,ox);
break;
case _unify_l_x_var2:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xl))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oxx);
break;
case _unify_l_x_var2_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xl))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oxx);
break;
case _unify_x_var2:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xl))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oxx);
break;
case _unify_x_var2_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xl))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oxx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oxx);
break;
case _save_appl_y:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _save_appl_y_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _save_pair_y:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _save_pair_y_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _unify_l_y_loc:
cl = NEXTOP(cl,oy);
break;
case _unify_l_y_loc_write:
cl = NEXTOP(cl,oy);
break;
case _unify_l_y_val:
cl = NEXTOP(cl,oy);
break;
case _unify_l_y_val_write:
cl = NEXTOP(cl,oy);
break;
case _unify_l_y_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _unify_l_y_var_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _unify_y_loc:
cl = NEXTOP(cl,oy);
break;
case _unify_y_loc_write:
cl = NEXTOP(cl,oy);
break;
case _unify_y_val:
cl = NEXTOP(cl,oy);
break;
case _unify_y_val_write:
cl = NEXTOP(cl,oy);
break;
case _unify_y_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _unify_y_var_write:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.oy.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,oy);
break;
case _deallocate:
cl = NEXTOP(cl,p);
break;
case _lock_lu:
cl = NEXTOP(cl,p);
break;
case _call_bfunc_xx:
cl = NEXTOP(cl,plxxs);
break;
case _call_bfunc_xy:
cl = NEXTOP(cl,plxys);
break;
case _call_bfunc_yx:
cl = NEXTOP(cl,plxys);
break;
case _call_bfunc_yy:
cl = NEXTOP(cl,plyys);
break;
case _pop_n:
cl = NEXTOP(cl,s);
break;
case _write_n_voids:
cl = NEXTOP(cl,s);
break;
case _write_n_atoms:
cl = NEXTOP(cl,sc);
break;
case _get_list:
if (is_regcopy(myregs, nofregs, cl->u.x.x)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = NEXTOP(cl,x);
return;
}
cl = NEXTOP(cl,x);
break;
case _put_list:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.x.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,x);
break;
case _save_b_x:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.x.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,x);
break;
case _write_x_loc:
cl = NEXTOP(cl,x);
break;
case _write_x_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.x.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,x);
break;
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
case _put_dbterm:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xD.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xD);
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _get_bigint:
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
if (is_regcopy(myregs, nofregs, cl->u.xN.x)) {
fix big int indexing
2011-11-02 00:25:59 +00:00
clause->Tag = AbsAppl((CELL *)FunctorBigInt);
clause->u.t_ptr = (CELL)NULL;
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
return;
}
cl = NEXTOP(cl,xN);
break;
case _put_bigint:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xN.x))) {
clause->Tag = (CELL)NULL;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
more bigint and dbterm fixes.
2010-12-16 22:21:46 +00:00
cl = NEXTOP(cl,xN);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
fix restore of instructions that manipulate bigints or db terms.
2010-12-16 20:39:53 +00:00
case _get_atom:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (is_regcopy(myregs, nofregs, cl->u.xc.x)) {
fix indexing of bignums (obs from Jos de Roo).
2010-05-14 12:42:30 +01:00
if (IsApplTerm(cl->u.xc.c)) {
CELL *pt = RepAppl(cl->u.xc.c);
clause->Tag = AbsAppl((CELL *)pt[0]);
clause->u.t_ptr = cl->u.xc.c;
} else
clause->Tag = cl->u.xc.c;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
return;
}
cl = NEXTOP(cl,xc);
break;
case _put_atom:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xc.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xc);
break;
case _get_float:
if (is_regcopy(myregs, nofregs, cl->u.xd.x)) {
clause->Tag = AbsAppl((CELL *)FunctorDouble);
clause->u.t_ptr = AbsAppl(cl->u.xd.d);
return;
}
cl = NEXTOP(cl,xd);
break;
case _put_float:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xd.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xd);
break;
case _get_struct:
if (is_regcopy(myregs, nofregs, cl->u.xfa.x)) {
clause->Tag = AbsAppl((CELL *)cl->u.xfa.f);
clause->u.WorkPC = NEXTOP(cl,xfa);
return;
}
cl = NEXTOP(cl,xfa);
break;
case _put_struct:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xfa.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xfa);
break;
case _get_longint:
if (is_regcopy(myregs, nofregs, cl->u.xi.x)) {
clause->Tag = AbsAppl((CELL *)FunctorLongInt);
clause->u.t_ptr = AbsAppl(cl->u.xi.i);
return;
}
cl = NEXTOP(cl,xi);
break;
case _put_longint:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xi.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xi);
break;
case _p_atom_x:
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_atom+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_atomic_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_atomic+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_compound_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_compound+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_db_ref_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = AbsAppl((CELL *)FunctorDBRef);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_float_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = AbsAppl((CELL *)FunctorDouble);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_integer_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_integer+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xl);
break;
case _p_nonvar_x:
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xl);
break;
case _p_number_x:
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_number+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_primitive_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_primitive+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,xl);
break;
case _p_var_x:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.xl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.xl.x)) {
clause->Tag = (_var+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xl);
break;
new text conversion and string code (big changes, take care please)
2013-12-02 14:49:41 +00:00
case _get_string:
if (is_regcopy(myregs, nofregs, cl->u.xu.x)) {
clause->Tag = AbsAppl((CELL *)FunctorString);
clause->u.t_ptr = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xu);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
case _get_x_val:
if (!(nofregs = link_regcopies(myregs, nofregs, cl->u.xx.xl, cl->u.xx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xx);
break;
case _get_x_var:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.xx.xr, cl->u.xx.xl))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xx);
break;
case _gl_void_valx:
if (is_regcopy(myregs, nofregs, cl->u.xx.xl)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = cl;
return;
}
cl = NEXTOP(cl,xx);
break;
case _gl_void_varx:
if (is_regcopy(myregs, nofregs, cl->u.xx.xl)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = cl;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xx);
break;
case _glist_valx:
if (is_regcopy(myregs, nofregs, cl->u.xx.xl)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = cl;
return;
}
cl = NEXTOP(cl,xx);
break;
case _put_x_val:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.xx.xl, cl->u.xx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xx);
break;
case _put_x_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xx.xl))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xx.xr))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xx);
break;
define Optype for xxc, for instructions whose constant argument is a term, like functor(a,X,T).
2009-12-06 00:37:48 +00:00
case _p_func2s_cv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxc.x))) {
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
clause->Tag = (CELL)NULL;
return;
}
define Optype for xxc, for instructions whose constant argument is a term, like functor(a,X,T).
2009-12-06 00:37:48 +00:00
cl = NEXTOP(cl,xxc);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
define Optype for xxc, for instructions whose constant argument is a term, like functor(a,X,T).
2009-12-06 00:37:48 +00:00
case _p_and_vc:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
define Optype for xxc, for instructions whose constant argument is a term, like functor(a,X,T).
2009-12-06 00:37:48 +00:00
case _p_arg_cv:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
define Optype for xxc, for instructions whose constant argument is a term, like functor(a,X,T).
2009-12-06 00:37:48 +00:00
case _p_div_cv:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
define Optype for xxc, for instructions whose constant argument is a term, like functor(a,X,T).
2009-12-06 00:37:48 +00:00
case _p_div_vc:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_func2s_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_or_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_plus_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_sll_cv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_sll_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_slr_cv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_slr_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_times_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxn.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxn);
break;
case _p_and_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_arg_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_div_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_func2f_xx:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_func2s_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_minus_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_or_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_plus_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_sll_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_slr_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _p_times_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxx);
break;
case _put_xx_val:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.xxxx.xl1, cl->u.xxxx.xr1))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.xxxx.xl2, cl->u.xxxx.xr2))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxxx);
break;
case _p_func2f_xy:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.xxy.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,xxy);
break;
case _save_b_y:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.y.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,y);
break;
case _write_y_loc:
cl = NEXTOP(cl,y);
break;
case _write_y_val:
cl = NEXTOP(cl,y);
break;
case _write_y_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.y.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,y);
break;
case _p_atom_y:
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_atom+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_atomic_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_atomic+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_compound_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_compound+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_db_ref_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = AbsAppl((CELL *)FunctorDBRef);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_float_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = AbsAppl((CELL *)FunctorDouble);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_integer_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_integer+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yl);
break;
case _p_nonvar_y:
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yl);
break;
case _p_number_y:
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_number+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_primitive_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_primitive+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
fix bad ordering in tests
2009-04-23 16:36:11 +01:00
cl = NEXTOP(cl,yl);
break;
case _p_var_y:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (cl->u.yl.F != FAILCODE) {
clause->Tag = (CELL)NULL;
return;
}
if (is_regcopy(myregs, nofregs, cl->u.yl.y)) {
clause->Tag = (_var+1)*sizeof(CELL);
clause->u.t_ptr = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yl);
break;
case _get_y_val:
if (!(nofregs = link_regcopies(myregs, nofregs, cl->u.yx.x, cl->u.yx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yx);
break;
case _get_y_var:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.yx.x, cl->u.yx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yx);
break;
improve substantially handling of soft disjunctions.
2009-03-05 16:12:21 +00:00
case _gl_void_valy:
if (is_regcopy(myregs, nofregs, cl->u.yx.y)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = cl;
return;
}
cl = NEXTOP(cl,yx);
break;
case _gl_void_vary:
if (is_regcopy(myregs, nofregs, cl->u.yx.y)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = cl;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yx);
break;
case _glist_valy:
if (is_regcopy(myregs, nofregs, cl->u.yx.x)) {
clause->Tag = AbsPair(NULL);
clause->u.WorkPC = cl;
return;
}
cl = NEXTOP(cl,yx);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
case _put_unsafe:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.yx.y, cl->u.yx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yx);
break;
case _put_y_val:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.yx.y, cl->u.yx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yx);
break;
case _put_y_var:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yx.x))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yx);
break;
fix bad instruction format
2013-11-01 08:26:06 +00:00
case _p_func2s_y_cv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxc.y))) {
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
clause->Tag = (CELL)NULL;
return;
}
fix bad instruction format
2013-11-01 08:26:06 +00:00
cl = NEXTOP(cl,yxc);
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
break;
fix bad instruction format
2013-11-01 08:26:06 +00:00
case _p_and_y_vc:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
fix bad instruction format
2013-11-01 08:26:06 +00:00
case _p_arg_y_cv:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
fix bad instruction format
2013-11-01 08:26:06 +00:00
case _p_div_y_cv:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
fix bad instruction format
2013-11-01 08:26:06 +00:00
case _p_div_y_vc:
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_func2s_y_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_or_y_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_plus_y_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_sll_y_cv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_sll_y_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_slr_y_cv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_slr_y_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_times_y_vc:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxn.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxn);
break;
case _p_and_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_arg_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_div_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_func2f_yx:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_func2s_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_minus_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_or_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_plus_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_sll_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_slr_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_times_y_vv:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yxx.y))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yxx);
break;
case _p_func2f_yy:
if (!(nofregs = delete_regcopy(myregs, nofregs, cl->u.yyx.x))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yyx);
break;
new merged instructions and small changes to the emulator.
2009-03-03 10:04:13 +00:00
case _get_yy_var:
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.yyxx.x1, cl->u.yyxx.y1))) {
clause->Tag = (CELL)NULL;
return;
}
if (!(nofregs = add_regcopy(myregs, nofregs, cl->u.yyxx.x2, cl->u.yyxx.y2))) {
clause->Tag = (CELL)NULL;
return;
}
cl = NEXTOP(cl,yyxx);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
#ifdef YAPOR
#endif
#ifdef TABLING
indexing code was not looking at tabled code.
2009-02-09 23:34:12 +00:00
case _table_try_single:
cl = NEXTOP(cl,Otapl);
break;
use automatucally generate code to find indexing information.
2008-12-29 00:14:47 +00:00
#endif
default:
clause->Tag = (CELL)NULL;
return;
}
}
Reference in New Issue Copy Permalink