aboutsummaryrefslogtreecommitdiff
path: root/engines/glk/frotz/processor_table.cpp
blob: bb163899af362b16849f516d72b7a88a8af94ce2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
/* ScummVM - Graphic Adventure Engine
 *
 * ScummVM is the legal property of its developers, whose names
 * are too numerous to list here. Please refer to the COPYRIGHT
 * file distributed with this source distribution.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 */

#include "glk/frotz/processor.h"

namespace Gargoyle {
namespace Frotz {

void Processor::z_copy_table() {
    zword addr;
    zword size = zargs[2];
    zbyte value;
    int i;

    if (zargs[1] == 0)      				/* zero table */

	for (i = 0; i < size; i++)
	    storeb((zword) (zargs[0] + i), 0);

    else if ((short) size < 0 || zargs[0] > zargs[1])	/* copy forwards */

	for (i = 0; i < (((short) size < 0) ? - (short) size : size); i++) {
	    addr = zargs[0] + i;
		LOW_BYTE(addr, value);
	    storeb((zword) (zargs[1] + i), value);
	} else {
		// copy backwards
		for (i = size - 1; i >= 0; i--) {
			addr = zargs[0] + i;
			LOW_BYTE(addr, value);
			storeb((zword) (zargs[1] + i), value);
		}
	}
}

void Processor::z_loadb() {
    zword addr = zargs[0] + zargs[1];
    zbyte value;

	LOW_BYTE(addr, value);

    store(value);
}

void Processor::z_loadw() {
    zword addr = zargs[0] + 2 * zargs[1];
    zword value;

	LOW_WORD(addr, value);

    store(value);
}

void Processor::z_scan_table() {
    zword addr = zargs[1];
    int i;

    // Supply default arguments
    if (zargc < 4)
	zargs[3] = 0x82;

    // Scan byte or word array
    for (i = 0; i < zargs[2]; i++) {
		if (zargs[3] & 0x80) {
			// scan word array
			zword wvalue;

			LOW_WORD(addr, wvalue);

			if (wvalue == zargs[0])
				goto finished;
		} else {
			// scan byte array
			zbyte bvalue;

			LOW_BYTE(addr, bvalue);

			if (bvalue == zargs[0])
				goto finished;
		}

		addr += zargs[3] & 0x7f;
    }

    addr = 0;

finished:
    store(addr);
    branch(addr);
}

void Processor::z_storeb() {
    storeb((zword) (zargs[0] + zargs[1]), zargs[2]);
}

void Processor::z_storew() {
    storew((zword)(zargs[0] + 2 * zargs[1]), zargs[2]);
}

} // End of namespace Scott
} // End of namespace Gargoyle