2001-04-09 20:54:03 +01:00
|
|
|
/* ----------------------------------------------- **
|
|
|
|
|
** Trie instructions: stack organization **
|
|
|
|
|
** ----------------------------------------------- */
|
|
|
|
|
/*
|
|
|
|
|
** -------------------
|
|
|
|
|
** | ha = heap_arity |
|
|
|
|
|
** ------------------- --
|
|
|
|
|
** | heap ptr 1 | |
|
|
|
|
|
** ------------------- |
|
|
|
|
|
** | ... | -- heap_arity
|
|
|
|
|
** ------------------- |
|
|
|
|
|
** | heap ptr ha | |
|
|
|
|
|
** ------------------- --
|
|
|
|
|
** | va = vars_arity |
|
|
|
|
|
** -------------------
|
|
|
|
|
** | sa = subs_arity |
|
|
|
|
|
** ------------------- --
|
|
|
|
|
** | subs ptr sa | |
|
|
|
|
|
** ------------------- |
|
|
|
|
|
** | ... | -- subs_arity
|
|
|
|
|
** ------------------- |
|
|
|
|
|
** | subs ptr 1 | |
|
|
|
|
|
** ------------------- --
|
|
|
|
|
** | var ptr va | |
|
|
|
|
|
** ------------------- |
|
|
|
|
|
** | ... | -- vars_arity
|
|
|
|
|
** ------------------- |
|
|
|
|
|
** | var ptr 1 | |
|
|
|
|
|
** ------------------- --
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* --------------------------------------------- **
|
|
|
|
|
** Trie instructions: auxiliary macros **
|
|
|
|
|
** --------------------------------------------- */
|
|
|
|
|
|
|
|
|
|
#define next_trie_instruction(NODE) \
|
|
|
|
|
PREG = (yamop *) TrNode_child(NODE); \
|
|
|
|
|
PREFETCH_OP(PREG); \
|
|
|
|
|
GONext()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define next_instruction(CONDITION, NODE) \
|
|
|
|
|
if (CONDITION) { \
|
|
|
|
|
PREG = (yamop *) TrNode_child(NODE); \
|
|
|
|
|
} else { \
|
|
|
|
|
/* procceed */ \
|
|
|
|
|
PREG = (yamop *) CPREG; \
|
|
|
|
|
Y = ENV; \
|
|
|
|
|
} \
|
|
|
|
|
PREFETCH_OP(PREG); \
|
|
|
|
|
GONext()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* -------------------------------------------------------------- **
|
|
|
|
|
** the 'store_trie_choice_point', 'restore_trie_choice_point' and **
|
|
|
|
|
** 'pop_trie_choice_point' macros do not include the 'set_cut' **
|
|
|
|
|
** macro because there are no cuts in trie instructions. **
|
|
|
|
|
** -------------------------------------------------------------- */
|
|
|
|
|
|
|
|
|
|
#define store_trie_choice_point(PTR, AP) \
|
|
|
|
|
{ register choiceptr cp; \
|
|
|
|
|
cp = --NORM_CP(PTR); \
|
|
|
|
|
HBREG = H; \
|
|
|
|
|
cp->cp_tr = TR; \
|
|
|
|
|
cp->cp_h = H; \
|
|
|
|
|
cp->cp_b = B; \
|
|
|
|
|
cp->cp_cp = CPREG; \
|
|
|
|
|
cp->cp_ap = (yamop *) AP; \
|
|
|
|
|
cp->cp_env= ENV; \
|
|
|
|
|
B = cp; \
|
|
|
|
|
YAPOR_SET_LOAD(B); \
|
|
|
|
|
SET_BB(B); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define restore_trie_choice_point(AP) \
|
|
|
|
|
H = HBREG = PROTECT_FROZEN_H(B); \
|
|
|
|
|
CPREG = B->cp_cp; \
|
|
|
|
|
ENV = B->cp_env; \
|
|
|
|
|
YAPOR_update_alternative(PREG, (yamop *) AP) \
|
|
|
|
|
B->cp_ap = (yamop *) AP; \
|
|
|
|
|
Y = (CELL *) PROTECT_FROZEN_B(B); \
|
|
|
|
|
SET_BB(NORM_CP(Y))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define pop_trie_choice_point() \
|
|
|
|
|
Y = (CELL *) PROTECT_FROZEN_B((B+1)); \
|
|
|
|
|
H = PROTECT_FROZEN_H(B); \
|
|
|
|
|
CPREG = B->cp_cp; \
|
|
|
|
|
TABLING_close_alt(B); \
|
|
|
|
|
ENV = B->cp_env; \
|
|
|
|
|
B = B->cp_b; \
|
|
|
|
|
HBREG = PROTECT_FROZEN_H(B); \
|
|
|
|
|
SET_BB(PROTECT_FROZEN_B(B))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define no_cp_trie_var_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
*aux_ptr = heap_arity - 1; \
|
|
|
|
|
var_ptr = *++aux_ptr; \
|
|
|
|
|
*((CELL *) var_ptr) = var_ptr; \
|
2002-05-03 16:30:36 +01:00
|
|
|
for (i = 0; i < heap_arity - 1; i++) { \
|
|
|
|
|
*aux_ptr = *(aux_ptr + 1); \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
} \
|
2001-04-09 20:54:03 +01:00
|
|
|
*aux_ptr++ = vars_arity + 1; \
|
|
|
|
|
*aux_ptr++ = subs_arity; \
|
2002-05-03 16:30:36 +01:00
|
|
|
for (i = 0; i < subs_arity; i++) { \
|
|
|
|
|
*aux_ptr = *(aux_ptr + 1); \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
} \
|
2001-04-09 20:54:03 +01:00
|
|
|
*aux_ptr = var_ptr; \
|
|
|
|
|
next_instruction(--heap_arity || subs_arity, node); \
|
|
|
|
|
} else { \
|
|
|
|
|
*++aux_ptr = vars_arity + 1; \
|
|
|
|
|
*++aux_ptr = subs_arity - 1; \
|
|
|
|
|
/* var_ptr = *(aux_ptr + subs_arity); */ \
|
|
|
|
|
/* Bind((CELL *) var_ptr, var_ptr); */ \
|
|
|
|
|
next_instruction(--subs_arity, node); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define cp_trie_var_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
var_ptr = *++aux_ptr; \
|
|
|
|
|
*((CELL *) var_ptr) = var_ptr; \
|
|
|
|
|
aux_ptr += heap_arity + subs_arity + vars_arity + 1; \
|
|
|
|
|
for (i = 0; i < vars_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
*--Y = var_ptr; \
|
|
|
|
|
for (i = 0; i < subs_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
*--Y = subs_arity; \
|
|
|
|
|
*--Y = vars_arity + 1; \
|
|
|
|
|
aux_ptr--; \
|
|
|
|
|
for (i = 1; i < heap_arity; i++) \
|
|
|
|
|
*--Y = *--aux_ptr; \
|
|
|
|
|
*--Y = heap_arity - 1; \
|
|
|
|
|
next_instruction(--heap_arity || subs_arity, node); \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2 + subs_arity; \
|
|
|
|
|
/* var_ptr = *aux_ptr; */ \
|
|
|
|
|
/* Bind((CELL *) var_ptr, var_ptr); */ \
|
|
|
|
|
aux_ptr += vars_arity; \
|
|
|
|
|
for (i = 0; i < subs_arity + vars_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
*--Y = subs_arity - 1; \
|
|
|
|
|
*--Y = vars_arity + 1; \
|
|
|
|
|
*--Y = 0; \
|
|
|
|
|
next_instruction(--subs_arity, node); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define no_cp_trie_val_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
Y = ++aux_ptr; \
|
|
|
|
|
subs_ptr = aux_ptr + heap_arity + 1 + subs_arity + vars_arity - var_index; \
|
|
|
|
|
aux = *aux_ptr; \
|
|
|
|
|
subs = *subs_ptr; \
|
|
|
|
|
if (aux > subs) { \
|
|
|
|
|
*((CELL *) aux) = subs; \
|
|
|
|
|
} else { \
|
|
|
|
|
*((CELL *) aux) = aux; \
|
|
|
|
|
Bind_Local((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} \
|
|
|
|
|
*aux_ptr = heap_arity - 1; \
|
|
|
|
|
next_instruction(--heap_arity || subs_arity, node); \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2; \
|
|
|
|
|
*aux_ptr = subs_arity - 1; \
|
|
|
|
|
aux_ptr += subs_arity; \
|
|
|
|
|
subs_ptr = aux_ptr + vars_arity - var_index; \
|
|
|
|
|
aux = *aux_ptr; \
|
|
|
|
|
subs = *subs_ptr; \
|
|
|
|
|
if (aux > subs) { \
|
|
|
|
|
if ((CELL *) aux <= H) { \
|
|
|
|
|
Bind_Global((CELL *) aux, subs); \
|
|
|
|
|
} else if ((CELL *) subs <= H) { \
|
|
|
|
|
Bind_Local((CELL *) aux, subs); \
|
|
|
|
|
} else { \
|
|
|
|
|
Bind_Local((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} \
|
|
|
|
|
} else { \
|
|
|
|
|
if ((CELL *) subs <= H) { \
|
|
|
|
|
Bind_Global((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} else if ((CELL *) aux <= H) { \
|
|
|
|
|
Bind_Local((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} else { \
|
|
|
|
|
Bind_Local((CELL *) aux, subs); \
|
|
|
|
|
} \
|
|
|
|
|
} \
|
2002-05-03 16:30:36 +01:00
|
|
|
for (i = 0; i < vars_arity; i++) { \
|
|
|
|
|
*aux_ptr = *(aux_ptr + 1); \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
} \
|
2001-04-09 20:54:03 +01:00
|
|
|
next_instruction(--subs_arity, node); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define cp_trie_val_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
subs_ptr = aux_ptr + heap_arity + 1 + subs_arity + vars_arity - var_index; \
|
|
|
|
|
aux = *aux_ptr; \
|
|
|
|
|
subs = *subs_ptr; \
|
|
|
|
|
if (aux > subs) { \
|
|
|
|
|
*((CELL *) aux) = subs; \
|
|
|
|
|
} else { \
|
|
|
|
|
*((CELL *) aux) = aux; \
|
|
|
|
|
Bind_Local((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} \
|
|
|
|
|
aux_ptr += heap_arity + subs_arity + vars_arity + 1; \
|
|
|
|
|
for (i = 0; i < heap_arity + subs_arity + vars_arity + 1; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
*--Y = heap_arity - 1; \
|
|
|
|
|
next_instruction(--heap_arity || subs_arity, node); \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2 + subs_arity; \
|
|
|
|
|
subs_ptr = aux_ptr + vars_arity - var_index; \
|
|
|
|
|
aux = *aux_ptr; \
|
|
|
|
|
subs = *subs_ptr; \
|
|
|
|
|
if (aux > subs) { \
|
|
|
|
|
if ((CELL *) aux <= H) { \
|
|
|
|
|
Bind_Global((CELL *) aux, subs); \
|
|
|
|
|
} else if ((CELL *) subs <= H) { \
|
|
|
|
|
Bind_Local((CELL *) aux, subs); \
|
|
|
|
|
} else { \
|
|
|
|
|
Bind_Local((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} \
|
|
|
|
|
} else { \
|
|
|
|
|
if ((CELL *) subs <= H) { \
|
|
|
|
|
Bind_Global((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} else if ((CELL *) aux <= H) { \
|
|
|
|
|
Bind_Local((CELL *) subs, aux); \
|
|
|
|
|
*subs_ptr = aux; \
|
|
|
|
|
} else { \
|
|
|
|
|
Bind_Local((CELL *) aux, subs); \
|
|
|
|
|
} \
|
|
|
|
|
} \
|
|
|
|
|
aux_ptr += vars_arity; \
|
|
|
|
|
for (i = 0; i < vars_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
for (i = 1; i < subs_arity; i++) \
|
|
|
|
|
*--Y = *--aux_ptr; \
|
|
|
|
|
*--Y = subs_arity - 1; \
|
|
|
|
|
*--Y = vars_arity; \
|
|
|
|
|
*--Y = 0; \
|
|
|
|
|
next_instruction(--subs_arity, node); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define no_cp_trie_atom_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
Y = ++aux_ptr; \
|
|
|
|
|
/* *((CELL *) *aux_ptr) = TrNode_entry(node); */ \
|
|
|
|
|
Bind_Global((CELL *) *aux_ptr, TrNode_entry(node)); \
|
|
|
|
|
*aux_ptr = heap_arity - 1; \
|
|
|
|
|
next_instruction(--heap_arity || subs_arity, node); \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2; \
|
|
|
|
|
*aux_ptr = subs_arity - 1; \
|
|
|
|
|
aux_ptr += subs_arity; \
|
|
|
|
|
Bind((CELL *) *aux_ptr, TrNode_entry(node)); \
|
2002-05-03 16:30:36 +01:00
|
|
|
for (i = 0; i < vars_arity; i++) { \
|
|
|
|
|
*aux_ptr = *(aux_ptr + 1); \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
} \
|
2001-04-09 20:54:03 +01:00
|
|
|
next_instruction(--subs_arity, node); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define cp_trie_atom_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
/* *((CELL *) *aux_ptr) = TrNode_entry(node); */ \
|
|
|
|
|
Bind_Global((CELL *) *aux_ptr, TrNode_entry(node)); \
|
|
|
|
|
aux_ptr += heap_arity + subs_arity + vars_arity + 1; \
|
|
|
|
|
for (i = 0; i < heap_arity + subs_arity + vars_arity + 1; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
*--Y = heap_arity - 1; \
|
|
|
|
|
next_instruction(--heap_arity || subs_arity, node); \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2 + subs_arity; \
|
|
|
|
|
Bind((CELL *) *aux_ptr, TrNode_entry(node)); \
|
|
|
|
|
aux_ptr += vars_arity; \
|
|
|
|
|
for (i = 0; i < vars_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
for (i = 1; i < subs_arity; i++) \
|
|
|
|
|
*--Y = *--aux_ptr; \
|
|
|
|
|
*--Y = subs_arity - 1; \
|
|
|
|
|
*--Y = vars_arity; \
|
|
|
|
|
*--Y = 0; \
|
|
|
|
|
next_instruction(--subs_arity, node); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define no_cp_trie_list_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
/* *((CELL *) *aux_ptr) = AbsPair(H); */ \
|
|
|
|
|
Bind_Global((CELL *) *aux_ptr, AbsPair(H)); \
|
|
|
|
|
H += 2; \
|
|
|
|
|
*aux_ptr-- = (CELL) (H - 1); \
|
|
|
|
|
*aux_ptr-- = (CELL) (H - 2); \
|
|
|
|
|
*aux_ptr = heap_arity - 1 + 2; \
|
|
|
|
|
Y = aux_ptr; \
|
|
|
|
|
} else { \
|
|
|
|
|
H += 2; \
|
|
|
|
|
*aux_ptr-- = (CELL) (H - 1); \
|
|
|
|
|
*aux_ptr-- = (CELL) (H - 2); \
|
|
|
|
|
*aux_ptr = 2; \
|
|
|
|
|
Y = aux_ptr; \
|
|
|
|
|
aux_ptr += 2 + 2; \
|
|
|
|
|
*aux_ptr = subs_arity - 1; \
|
|
|
|
|
aux_ptr += subs_arity; \
|
|
|
|
|
Bind((CELL *) *aux_ptr, AbsPair(H - 2)); \
|
2002-05-03 16:30:36 +01:00
|
|
|
for (i = 0; i < vars_arity; i++) { \
|
|
|
|
|
*aux_ptr = *(aux_ptr + 1); \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
} \
|
2001-04-09 20:54:03 +01:00
|
|
|
} \
|
|
|
|
|
next_trie_instruction(node)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define cp_trie_list_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
/* *((CELL *) *aux_ptr) = AbsPair(H); */ \
|
|
|
|
|
Bind_Global((CELL *) *aux_ptr, AbsPair(H)); \
|
|
|
|
|
aux_ptr += heap_arity + subs_arity + vars_arity + 1; \
|
|
|
|
|
for (i = 0; i < vars_arity + subs_arity + heap_arity + 1; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
H += 2; \
|
|
|
|
|
*--Y = (CELL) (H - 1); \
|
|
|
|
|
*--Y = (CELL) (H - 2); \
|
|
|
|
|
*--Y = heap_arity + 1; \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2 + subs_arity; \
|
|
|
|
|
Bind((CELL *) *aux_ptr, AbsPair(H)); \
|
|
|
|
|
aux_ptr += vars_arity; \
|
|
|
|
|
for (i = 0; i < vars_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
for (i = 1; i < subs_arity; i++) \
|
|
|
|
|
*--Y = *--aux_ptr; \
|
|
|
|
|
*--Y = subs_arity - 1; \
|
|
|
|
|
*--Y = vars_arity; \
|
|
|
|
|
H += 2; \
|
|
|
|
|
*--Y = (CELL) (H - 1); \
|
|
|
|
|
*--Y = (CELL) (H - 2); \
|
|
|
|
|
*--Y = 2; \
|
|
|
|
|
} \
|
|
|
|
|
next_trie_instruction(node)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define no_cp_trie_struct_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
/* *((CELL *) *aux_ptr) = AbsAppl(H); */ \
|
|
|
|
|
Bind_Global((CELL *) *aux_ptr, AbsAppl(H)); \
|
|
|
|
|
*H++ = (CELL) func; \
|
|
|
|
|
H += func_arity; \
|
|
|
|
|
for (i = 1; i <= func_arity; i++) \
|
|
|
|
|
*aux_ptr-- = (CELL) (H - i); \
|
|
|
|
|
*aux_ptr = heap_arity - 1 + func_arity; \
|
|
|
|
|
Y = aux_ptr; \
|
|
|
|
|
} else { \
|
|
|
|
|
*H++ = (CELL) func; \
|
|
|
|
|
H += func_arity; \
|
|
|
|
|
for (i = 1; i <= func_arity; i++) \
|
|
|
|
|
*aux_ptr-- = (CELL) (H - i); \
|
|
|
|
|
*aux_ptr = func_arity; \
|
|
|
|
|
Y = aux_ptr; \
|
|
|
|
|
aux_ptr += func_arity + 2; \
|
|
|
|
|
*aux_ptr = subs_arity - 1; \
|
|
|
|
|
aux_ptr += subs_arity; \
|
|
|
|
|
Bind((CELL *) *aux_ptr, AbsAppl(H - func_arity - 1)); \
|
2002-05-03 16:30:36 +01:00
|
|
|
for (i = 0; i < vars_arity; i++) { \
|
|
|
|
|
*aux_ptr = *(aux_ptr + 1); \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
} \
|
2001-04-09 20:54:03 +01:00
|
|
|
} \
|
|
|
|
|
next_trie_instruction(node)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define cp_trie_struct_instr() \
|
|
|
|
|
if (heap_arity) { \
|
|
|
|
|
aux_ptr++; \
|
|
|
|
|
/* *((CELL *) *aux_ptr) = AbsAppl(H); */ \
|
|
|
|
|
Bind_Global((CELL *) *aux_ptr, AbsAppl(H)); \
|
|
|
|
|
aux_ptr += heap_arity + subs_arity + vars_arity + 1; \
|
|
|
|
|
for (i = 0; i < vars_arity + subs_arity + heap_arity + 1; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
*H++ = (CELL) func; \
|
|
|
|
|
H += func_arity; \
|
|
|
|
|
for (i = 1; i <= func_arity; i++) \
|
|
|
|
|
*--Y = (CELL) (H - i); \
|
|
|
|
|
*--Y = heap_arity + func_arity - 1; \
|
|
|
|
|
} else { \
|
|
|
|
|
aux_ptr += 2 + subs_arity; \
|
|
|
|
|
Bind((CELL *) *aux_ptr, AbsAppl(H)); \
|
|
|
|
|
aux_ptr += vars_arity; \
|
|
|
|
|
for (i = 0; i < vars_arity; i++) \
|
|
|
|
|
*--Y = *aux_ptr--; \
|
|
|
|
|
for (i = 1; i < subs_arity; i++) \
|
|
|
|
|
*--Y = *--aux_ptr; \
|
|
|
|
|
*--Y = subs_arity - 1; \
|
|
|
|
|
*--Y = vars_arity; \
|
|
|
|
|
*H++ = (CELL) func; \
|
|
|
|
|
H += func_arity; \
|
|
|
|
|
for (i = 1; i <= func_arity; i++) \
|
|
|
|
|
*--Y = (CELL) (H - i); \
|
|
|
|
|
*--Y = func_arity; \
|
|
|
|
|
} \
|
|
|
|
|
next_trie_instruction(node)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* --------------------------- **
|
|
|
|
|
** Trie instructions **
|
|
|
|
|
** --------------------------- */
|
|
|
|
|
|
|
|
|
|
PBOp(trie_do_var, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
register CELL var_ptr;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
no_cp_trie_var_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_try_var, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
register CELL var_ptr;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
store_trie_choice_point(Y, TrNode_next(node));
|
|
|
|
|
cp_trie_var_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_retry_var, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
register CELL var_ptr;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
restore_trie_choice_point(TrNode_next(node));
|
|
|
|
|
cp_trie_var_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_trust_var, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
register CELL var_ptr;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
#ifdef YAPOR
|
|
|
|
|
if (SCH_top_shared_cp(B)) {
|
|
|
|
|
restore_trie_choice_point(NULL);
|
|
|
|
|
cp_trie_var_instr();
|
|
|
|
|
} else
|
|
|
|
|
#endif /* YAPOR */
|
|
|
|
|
{
|
|
|
|
|
pop_trie_choice_point();
|
|
|
|
|
if ((choiceptr) Y == B_FZ) {
|
|
|
|
|
cp_trie_var_instr();
|
|
|
|
|
} else {
|
|
|
|
|
no_cp_trie_var_instr();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_do_val, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y, *subs_ptr;
|
|
|
|
|
register CELL aux, subs;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int var_index = VarIndexOfTableTerm(TrNode_entry(node));
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
no_cp_trie_val_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_try_val, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y, *subs_ptr;
|
|
|
|
|
register CELL aux, subs;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int var_index = VarIndexOfTableTerm(TrNode_entry(node));
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
store_trie_choice_point(Y, TrNode_next(node));
|
|
|
|
|
cp_trie_val_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_retry_val, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1), *subs_ptr;
|
|
|
|
|
register CELL aux, subs;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int var_index = VarIndexOfTableTerm(TrNode_entry(node));
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
restore_trie_choice_point(TrNode_next(node));
|
|
|
|
|
cp_trie_val_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_trust_val, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1), *subs_ptr;
|
|
|
|
|
register CELL aux, subs;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int var_index = VarIndexOfTableTerm(TrNode_entry(node));
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
#ifdef YAPOR
|
|
|
|
|
if (SCH_top_shared_cp(B)) {
|
|
|
|
|
restore_trie_choice_point(NULL);
|
|
|
|
|
cp_trie_val_instr();
|
|
|
|
|
} else
|
|
|
|
|
#endif /* YAPOR */
|
|
|
|
|
{
|
|
|
|
|
pop_trie_choice_point();
|
|
|
|
|
if ((choiceptr) Y == B_FZ) {
|
|
|
|
|
cp_trie_val_instr();
|
|
|
|
|
} else {
|
|
|
|
|
no_cp_trie_val_instr();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_do_atom, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
no_cp_trie_atom_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_try_atom, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
store_trie_choice_point(Y, TrNode_next(node));
|
|
|
|
|
cp_trie_atom_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_retry_atom, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
restore_trie_choice_point(TrNode_next(node));
|
|
|
|
|
cp_trie_atom_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_trust_atom, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
#ifdef YAPOR
|
|
|
|
|
if (SCH_top_shared_cp(B)) {
|
|
|
|
|
restore_trie_choice_point(NULL);
|
|
|
|
|
cp_trie_atom_instr();
|
|
|
|
|
} else
|
|
|
|
|
#endif /* YAPOR */
|
|
|
|
|
{
|
|
|
|
|
pop_trie_choice_point();
|
|
|
|
|
if ((choiceptr) Y == B_FZ) {
|
|
|
|
|
cp_trie_atom_instr();
|
|
|
|
|
} else {
|
|
|
|
|
no_cp_trie_atom_instr();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_do_list, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
no_cp_trie_list_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_try_list, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
store_trie_choice_point(Y, TrNode_next(node));
|
|
|
|
|
cp_trie_list_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_retry_list, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
restore_trie_choice_point(TrNode_next(node));
|
|
|
|
|
cp_trie_list_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_trust_list, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
#ifdef YAPOR
|
|
|
|
|
if (SCH_top_shared_cp(B)) {
|
|
|
|
|
restore_trie_choice_point(NULL);
|
|
|
|
|
cp_trie_list_instr();
|
|
|
|
|
} else
|
|
|
|
|
#endif /* YAPOR */
|
|
|
|
|
{
|
|
|
|
|
pop_trie_choice_point();
|
|
|
|
|
if ((choiceptr) Y == B_FZ) {
|
|
|
|
|
cp_trie_list_instr();
|
|
|
|
|
} else {
|
|
|
|
|
no_cp_trie_list_instr();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_do_struct, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
Functor func = (Functor) NonTagPart(TrNode_entry(node));
|
|
|
|
|
int func_arity = ArityOfFunctor(func);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
no_cp_trie_struct_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_try_struct, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = Y;
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
Functor func = (Functor) NonTagPart(TrNode_entry(node));
|
|
|
|
|
int func_arity = ArityOfFunctor(func);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
store_trie_choice_point(Y, TrNode_next(node));
|
|
|
|
|
cp_trie_struct_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_retry_struct, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
Functor func = (Functor) NonTagPart(TrNode_entry(node));
|
|
|
|
|
int func_arity = ArityOfFunctor(func);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
restore_trie_choice_point(TrNode_next(node));
|
|
|
|
|
cp_trie_struct_instr();
|
|
|
|
|
ENDPBOp();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
PBOp(trie_trust_struct, e)
|
|
|
|
|
register ans_node_ptr node = (ans_node_ptr) PREG;
|
|
|
|
|
register CELL *aux_ptr = (CELL *) (B + 1);
|
|
|
|
|
int heap_arity = *aux_ptr;
|
|
|
|
|
int vars_arity = *(aux_ptr + heap_arity + 1);
|
|
|
|
|
int subs_arity = *(aux_ptr + heap_arity + 2);
|
|
|
|
|
Functor func = (Functor) NonTagPart(TrNode_entry(node));
|
|
|
|
|
int func_arity = ArityOfFunctor(func);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
#ifdef YAPOR
|
|
|
|
|
if (SCH_top_shared_cp(B)) {
|
|
|
|
|
restore_trie_choice_point(NULL);
|
|
|
|
|
cp_trie_struct_instr();
|
|
|
|
|
} else
|
|
|
|
|
#endif /* YAPOR */
|
|
|
|
|
{
|
|
|
|
|
pop_trie_choice_point();
|
|
|
|
|
if ((choiceptr) Y == B_FZ) {
|
|
|
|
|
cp_trie_struct_instr();
|
|
|
|
|
} else {
|
|
|
|
|
no_cp_trie_struct_instr();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
ENDPBOp();
|
