rishi/scryer-prolog
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

unify structures from left to right (#1396)

Browse Source
This commit is contained in:
Mark Thom
2022-04-22 19:00:42 -06:00
parent b4ef7556da
commit 16137ace0e
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
src/machine/machine_state_impl.rs
View File

@@ -253,7 +253,7 @@ impl MachineState {
.get_name_and_arity(); .get_name_and_arity();
if n1 == n2 && a1 == a2 { if n1 == n2 && a1 == a2 {
for idx in 0..a1 { for idx in (0..a1).rev() {
self.pdl.push(heap_loc_as_cell!(s2+1+idx)); self.pdl.push(heap_loc_as_cell!(s2+1+idx));
self.pdl.push(heap_loc_as_cell!(s1+1+idx)); self.pdl.push(heap_loc_as_cell!(s1+1+idx));
} }
@@ -263,7 +263,7 @@ impl MachineState {
} }
(HeapCellValueTag::Lis, l2) => { (HeapCellValueTag::Lis, l2) => {
if a1 == 2 && n1 == atom!(".") { if a1 == 2 && n1 == atom!(".") {
for idx in 0..2 { for idx in (0..2).rev() {
self.pdl.push(heap_loc_as_cell!(l2+1+idx)); self.pdl.push(heap_loc_as_cell!(l2+1+idx));
self.pdl.push(heap_loc_as_cell!(s1+1+idx)); self.pdl.push(heap_loc_as_cell!(s1+1+idx));
} }
@@ -294,7 +294,7 @@ impl MachineState {
fn unify_list(&mut self, l1: usize, d2: HeapCellValue) { fn unify_list(&mut self, l1: usize, d2: HeapCellValue) {
read_heap_cell!(d2, read_heap_cell!(d2,
(HeapCellValueTag::Lis, l2) => { (HeapCellValueTag::Lis, l2) => {
for idx in 0..2 { for idx in (0..2).rev() {
self.pdl.push(heap_loc_as_cell!(l2 + idx)); self.pdl.push(heap_loc_as_cell!(l2 + idx));
self.pdl.push(heap_loc_as_cell!(l1 + idx)); self.pdl.push(heap_loc_as_cell!(l1 + idx));
} }
@@ -304,7 +304,7 @@ impl MachineState {
.get_name_and_arity(); .get_name_and_arity();
if a2 == 2 && n2 == atom!(".") { if a2 == 2 && n2 == atom!(".") {
for idx in 0..2 { for idx in (0..2).rev() {
self.pdl.push(heap_loc_as_cell!(s2+1+idx)); self.pdl.push(heap_loc_as_cell!(s2+1+idx));
self.pdl.push(heap_loc_as_cell!(l1+idx)); self.pdl.push(heap_loc_as_cell!(l1+idx));
} }
@@ -949,7 +949,7 @@ impl MachineState {
.get_name_and_arity(); .get_name_and_arity();
if n1 == n2 && a1 == a2 { if n1 == n2 && a1 == a2 {
for idx in 0..a1 { for idx in (0..a1).rev() {
self.pdl.push(heap_loc_as_cell!(s2+1+idx)); self.pdl.push(heap_loc_as_cell!(s2+1+idx));
self.pdl.push(heap_loc_as_cell!(s1+1+idx)); self.pdl.push(heap_loc_as_cell!(s1+1+idx));
} }
@@ -959,7 +959,7 @@ impl MachineState {
} }
(HeapCellValueTag::Lis, l2) => { (HeapCellValueTag::Lis, l2) => {
if a1 == 2 && n1 == atom!(".") { if a1 == 2 && n1 == atom!(".") {
for idx in 0..2 { for idx in (0..2).rev() {
self.pdl.push(heap_loc_as_cell!(l2+idx)); self.pdl.push(heap_loc_as_cell!(l2+idx));
self.pdl.push(heap_loc_as_cell!(s1+1+idx)); self.pdl.push(heap_loc_as_cell!(s1+1+idx));
} }
@@ -1201,7 +1201,7 @@ impl MachineState {
) { ) {
read_heap_cell!(d2, read_heap_cell!(d2,
(HeapCellValueTag::Lis, l2) => { (HeapCellValueTag::Lis, l2) => {
for idx in 0..2 { for idx in (0..2).rev() {
self.pdl.push(heap_loc_as_cell!(l2+idx)); self.pdl.push(heap_loc_as_cell!(l2+idx));
self.pdl.push(heap_loc_as_cell!(l1+idx)); self.pdl.push(heap_loc_as_cell!(l1+idx));
} }
@@ -1211,7 +1211,7 @@ impl MachineState {
.get_name_and_arity(); .get_name_and_arity();
if a2 == 2 && n2 == atom!(".") { if a2 == 2 && n2 == atom!(".") {
for idx in 0..2 { for idx in (0..2).rev() {
self.pdl.push(heap_loc_as_cell!(s2+1+idx)); self.pdl.push(heap_loc_as_cell!(s2+1+idx));
self.pdl.push(heap_loc_as_cell!(l1+idx)); self.pdl.push(heap_loc_as_cell!(l1+idx));
} }