2
* Copyright 1992 by Jutta Degener and Carsten Bormann, Technische
3
* Universitaet Berlin. See the accompanying file "COPYRIGHT" for
4
* details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS SOFTWARE.
7
/* $Header: /tmp_amd/presto/export/kbs/jutta/src/gsm/RCS/add_test.c,v 1.2 1994/05/10 20:18:17 jutta Exp $ */
15
#include "../src/add.c"
20
longword L_op1, L_op2, L_expect;
21
word op1, op2, expect;
24
word M_gsm_add P((word op1, word op2));
25
word M_gsm_sub P((word op1, word op2));
26
word M_gsm_mult P((word op1, word op2));
27
word M_gsm_mult_r P((word op1, word op2));
28
word M_gsm_abs P((word op1));
29
longword M_gsm_L_mult P((word op1, word op2));
30
longword M_gsm_L_add P((longword op1, longword op2));
34
puts( " add a b sub a b mult a b div a b" );
35
puts( "L_add A B L_sub A B L_mult A B mult_r a b" );
37
puts( "abs a norm a >> a b << a b" );
38
puts( " L_>> A B L_<< A B" );
42
char * strtek P2((str, sep), char * str, char * sep) {
44
static char * S = (char *)0;
49
if (!S || !*S) return (char *)0;
54
for (c = sep; *c && *c != *S; c++) ;
61
/* Skip non-delimiters.
63
for (base = S; *S; S++) {
65
for (c = sep; *c; c++)
72
return base == S ? (char *)0 : base;
75
long value P1((s), char * s)
78
case '-': switch (s[1]) {
79
case '\0': return MIN_WORD;
80
case '-': return MIN_LONGWORD;
85
case '+': switch (s[1]) {
86
case '\0': return MAX_WORD;
87
case '+': return MAX_LONGWORD;
93
return strtol(s, (char **)0, 0);
96
char * parse P1((buf), char * buf)
101
if (a = strchr(buf, '=')) *a++ = 0;
103
opname = s = strtek(buf, " \t(");
104
if (!s) return (char *)0;
106
op1 = op2 = L_op1 = L_op2 = 0;
108
if (s = strtek( (char *)0, "( \t,")) {
109
op1 = L_op1 = value(s);
110
if (s = strtek( (char *)0, ", \t)")) op2 = L_op2 = value(s);
115
while (*a == ' ' || *a == '\t') a++;
116
expect = L_expect = value(a);
122
void fprint_word P2((f, w), FILE * f, word w)
124
if (!w) putc('0', f);
125
else fprintf(f, "0x%4.4x (%d%s)",
128
w == MIN_WORD? "/-" : (w == MAX_WORD ? "/+" : ""));
131
void print_word P1((w), word w)
133
fprint_word( stdout, w );
136
void fprint_longword P2((f, w), FILE * f, longword w)
138
if (!w) putc('0', f);
139
else fprintf(f, "0x%8.8x (%ld%s)",
140
w, w, w == MIN_WORD ? "/-"
141
: (w == MAX_WORD ? "/+"
142
: (w == MIN_LONGWORD ? "/--"
143
: (w == MAX_LONGWORD ? "/++" : ""))));
146
void print_longword P1((w),longword w)
148
fprint_longword(stdout, w);
151
void do_longword P1((w), longword w)
153
if (interactive) print_longword(w);
156
if (!interactive) fprint_longword(stderr, w);
157
fprintf(stderr, " != %s (%ld, %ld) -- expected ",
158
opname, L_op1, L_op2 );
159
fprint_longword(stderr, L_expect);
160
putc( '\n', stderr );
162
} else if (interactive) putchar('\n');
165
void do_word P1((w), word w )
167
if (interactive) print_word(w);
170
if (!interactive) fprint_word(stderr, w);
171
fprintf(stderr, " != %s (%ld, %ld) -- expected ",
172
opname, L_op1, L_op2 );
173
fprint_word(stderr, expect);
176
} else if (interactive) putchar('\n');
179
int main(ac, av) char ** av;
186
fprintf(stderr, "Usage: %s [filename]\n", av[0]);
194
if (ac < 2) in = stdin;
195
else if (!(in = fopen(av[1], "r"))) {
197
fprintf(stderr, "%s: cannot open file \"%s\" for reading\n",
202
interactive = isatty(fileno(in));
205
if (interactive) fprintf(stderr, "? ");
207
if (!fgets(buf, sizeof(buf), in)) exit(0);
208
if (c = strchr(buf, '\n')) *c = 0;
210
if (*buf == ';' || *buf == '#') continue;
216
fprintf(stderr, "%s\n", buf + 1);
223
if (!strcmp(c, "add")) {
224
do_word( gsm_add( op1, op2 ));
227
if (!strcmp(c, "M_add")) {
228
do_word( M_gsm_add( op1, op2 ));
231
if (!strcmp(c, "sub")) {
232
do_word( gsm_sub( op1, op2 ));
235
if (!strcmp(c, "M_sub")) {
236
do_word( M_gsm_sub( op1, op2 ));
239
if (!strcmp(c, "mult")) {
240
do_word( gsm_mult( op1, op2 ));
243
if (!strcmp(c, "M_mult")) {
244
do_word( M_gsm_mult( op1, op2 ));
247
if (!strcmp(c, "mult_r")) {
248
do_word( gsm_mult_r(op1, op2));
251
if (!strcmp(c, "M_mult_r")) {
252
do_word( M_gsm_mult_r(op1, op2));
255
if (!strcmp(c, "abs" )) {
256
do_word( gsm_abs(op1) );
259
if (!strcmp(c, "M_abs" )) {
260
do_word( M_gsm_abs(op1) );
263
if (!strcmp(c, "div" )) {
264
do_word( gsm_div( op1, op2 ));
267
if (!strcmp(c, "norm" )) {
268
do_word( gsm_norm(L_op1));
271
if (!strcmp(c, "<<" )) {
272
do_word( gsm_asl( op1, op2));
275
if (!strcmp(c, ">>" )) {
276
do_word( gsm_asr( op1, op2 ));
279
if (!strcmp(c, "L_mult")) {
280
do_longword( gsm_L_mult( op1, op2 ));
283
if (!strcmp(c, "M_L_mult")) {
284
do_longword( M_gsm_L_mult( op1, op2 ));
287
if (!strcmp(c, "L_add" )) {
288
do_longword( gsm_L_add( L_op1, L_op2 ));
291
if (!strcmp(c, "M_L_add" )) {
292
do_longword( M_gsm_L_add( L_op1, L_op2 ));
295
if (!strcmp(c, "L_sub" )) {
296
do_longword( gsm_L_sub( L_op1, L_op2 ));
299
if (!strcmp(c, "L_<<" )) {
300
do_longword( gsm_L_asl( L_op1, L_op2 ));
303
if (!strcmp(c, "L_>>")) {
304
do_longword( gsm_L_asr( L_op1, L_op2 ));
314
* Function stubs for macro implementations of commonly used
317
word M_gsm_add P2((op1, op2),word op1, word op2)
320
return GSM_ADD(op1, op2);
323
word M_gsm_sub P2((op1, op2), word op1, word op2)
326
return GSM_SUB(op1, op2);
329
word M_gsm_mult P2((op1, op2), word op1, word op2)
331
return GSM_MULT(op1, op2);
334
word M_gsm_mult_r P2((op1, op2), word op1, word op2)
336
return GSM_MULT_R(op1, op2);
339
word M_gsm_abs P1((op1), word op1)
344
longword M_gsm_L_mult P2((op1, op2), word op1, word op2)
346
return GSM_L_MULT(op1, op2);
349
longword M_gsm_L_add P2((op1, op2), longword op1, longword op2)
352
return GSM_L_ADD(op1, op2);