-
Notifications
You must be signed in to change notification settings - Fork 0
/
math.c
305 lines (262 loc) · 4.61 KB
/
math.c
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
/* $Id: math.c,v 1.3 2000/07/05 15:20:34 jholder Exp $
* --------------------------------------------------------------------
* see doc/License.txt for License Information
* --------------------------------------------------------------------
*
* File name: $Id: math.c,v 1.3 2000/07/05 15:20:34 jholder Exp $
*
* Description:
*
* Modification history:
* $Log: math.c,v $
* Revision 1.3 2000/07/05 15:20:34 jholder
* Updated code to remove warnings.
*
* Revision 1.2 2000/05/25 22:28:56 jholder
* changes routine names to reflect zmachine opcode names per spec 1.0
*
* Revision 1.1.1.1 2000/05/10 14:21:34 jholder
*
* imported
*
*
* --------------------------------------------------------------------
*/
/*
* math.c
*
* Arithmetic, compare and logical instructions
*
*/
#include "ztypes.h"
/*
* z_add
*
* Add two operands
*
*/
void z_add( zword_t a, zword_t b )
{
store_operand( (zword_t)(a + b) );
}
/*
* z_sub
*
* Subtract two operands
*
*/
void z_sub( zword_t a, zword_t b )
{
store_operand( (zword_t)(a - b) );
}
/*
* mul
*
* Multiply two operands
*
*/
void z_mul( zword_t a, zword_t b )
{
store_operand( (zword_t)(( ZINT16 ) a * ( ZINT16 ) b) );
}
/*
* z_div
*
* Divide two operands
*
*/
void z_div( zword_t a, zword_t b )
{
/* The magic rule is: round towards zero. */
ZINT16 sa = ( ZINT16 ) a;
ZINT16 sb = ( ZINT16 ) b;
ZINT16 res;
if ( sb < 0 )
{
sa = -sa;
sb = -sb;
}
if ( sb == 0 )
{
#ifdef STRICTZ
report_strictz_error( STRZERR_DIV_ZERO,
"@div attempted with a divisor of zero. Result set to 32767 (0x7fff)." );
#endif
res = 32767;
}
else if ( sa >= 0 )
{
res = sa / sb;
}
else
{
res = -( ( -sa ) / ( sb ) );
}
store_operand( res );
}
/*
* z_mod
*
* Modulus divide two operands
*
*/
void z_mod( zword_t a, zword_t b )
{
/* The magic rule is: be consistent with divide, because
* (a/b)*a + (a%b) == a. So (a%b) has the same sign as a. */
ZINT16 sa = ( ZINT16 ) a;
ZINT16 sb = ( ZINT16 ) b;
ZINT16 res;
if ( sb < 0 )
{
sb = -sb;
}
if ( sb == 0 )
{
#ifdef STRICTZ
report_strictz_error( STRZERR_DIV_ZERO,
"@mod attempted with a divisor of zero. Result set to 0." );
#endif
res = 0;
}
if ( sa >= 0 )
{
res = sa % sb;
}
else
{
res = -( ( -sa ) % ( sb ) );
}
store_operand( res );
}
/*
* z_log_shift
*
* Shift +/- n bits
*
*/
void z_log_shift( zword_t a, zword_t b )
{
if ( ( ZINT16 ) b > 0 )
store_operand( (zword_t)( a << ( ZINT16 ) b ) );
else
store_operand( (zword_t)( a >> -( ( ZINT16 ) b ) ) );
}
/*
* z_art_shift
*
* Aritmetic shift +/- n bits
*
*/
void z_art_shift( zword_t a, zword_t b )
{
if ( ( ZINT16 ) b > 0 )
store_operand( ( zword_t ) ( ( ZINT16 ) a << ( ZINT16 ) b ) );
else
store_operand( ( zword_t ) ( ( ZINT16 ) a >> -( ( ZINT16 ) b ) ) );
}
/*
* z_or
*
* Logical OR
*
*/
void z_or( zword_t a, zword_t b )
{
store_operand( (zword_t)(a | b) );
}
/*
* z_not
*
* Logical NOT
*
*/
void z_not( zword_t a )
{
store_operand( (zword_t)(~a) );
}
/*
* z_and
*
* Logical AND
*
*/
void z_and( zword_t a, zword_t b )
{
store_operand( (zword_t)(a & b) );
}
/*
* z_random
*
* Return random number between 1 and operand
*
*/
void z_random( zword_t a )
{
if ( a == 0 )
store_operand( 0 );
else if ( a & 0x8000 )
{ /* (a < 0) - used to set seed with #RANDOM */
SRANDOM_FUNC( ( unsigned int ) abs( a ) );
store_operand( 0 );
}
else /* (a > 0) */
store_operand( (zword_t)(( RANDOM_FUNC( ) % a ) + 1) );
}
/*
* z_test
*
* Jump if operand 2 bit mask not set in operand 1
*
*/
void z_test( zword_t a, zword_t b )
{
conditional_jump( ( ( ~a ) & b ) == 0 );
}
/*
* z_jz
*
* Compare operand against zero
*
*/
void z_jz( zword_t a )
{
conditional_jump( a == 0 );
}
/*
* z_je
*
* Jump if operand 1 is equal to any other operand
*
*/
void z_je( int count, zword_t * operand )
{
int i;
for ( i = 1; i < count; i++ )
if ( operand[0] == operand[i] )
{
conditional_jump( TRUE );
return;
}
conditional_jump( FALSE );
}
/*
* z_jl
*
* Jump if operand 1 is less than operand 2
*
*/
void z_jl( zword_t a, zword_t b )
{
conditional_jump( ( ZINT16 ) a < ( ZINT16 ) b );
}
/*
* z_jg
*
* Jump if operand 1 is greater than operand 2
*
*/
void z_jg( zword_t a, zword_t b )
{
conditional_jump( ( ZINT16 ) a > ( ZINT16 ) b );
}