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
|
/*
* Copyright © 2016 Keith Packard <keithp@keithp.com>
*
* 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.
*/
#include "ao_lisp.h"
void
ao_lisp_builtin_print(ao_poly b)
{
(void) b;
printf("[builtin]");
}
enum math_op { math_plus, math_minus, math_times, math_divide, math_mod };
ao_poly
ao_lisp_car(struct ao_lisp_cons *cons)
{
if (!cons) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
if (!cons->car) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
if (ao_lisp_poly_type(cons->car) != AO_LISP_CONS) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
return ao_lisp_poly_cons(cons->car)->car;
}
ao_poly
ao_lisp_cdr(struct ao_lisp_cons *cons)
{
if (!cons) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
if (!cons->car) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
if (ao_lisp_poly_type(cons->car) != AO_LISP_CONS) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
return ao_lisp_poly_cons(cons->car)->cdr;
}
ao_poly
ao_lisp_cons(struct ao_lisp_cons *cons)
{
ao_poly car, cdr;
if (!cons) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
car = cons->car;
cdr = cons->cdr;
if (!car || !cdr) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
cdr = ao_lisp_poly_cons(cdr)->car;
if (ao_lisp_poly_type(cdr) != AO_LISP_CONS) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
return ao_lisp_cons_poly(ao_lisp_cons_cons(car, ao_lisp_poly_cons(cdr)));
}
ao_poly
ao_lisp_quote(struct ao_lisp_cons *cons)
{
if (!cons) {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
return cons->car;
}
ao_poly
ao_lisp_print(struct ao_lisp_cons *cons)
{
ao_poly val = AO_LISP_NIL;
while (cons) {
val = cons->car;
ao_lisp_poly_print(val);
cons = ao_lisp_poly_cons(cons->cdr);
}
return val;
}
ao_poly
ao_lisp_math(struct ao_lisp_cons *cons, enum math_op op)
{
ao_poly ret = AO_LISP_NIL;
while (cons) {
ao_poly car = cons->car;
uint8_t rt = ao_lisp_poly_type(ret);
uint8_t ct = ao_lisp_poly_type(car);
cons = ao_lisp_poly_cons(cons->cdr);
if (rt == AO_LISP_NIL)
ret = car;
else if (rt == AO_LISP_INT && ct == AO_LISP_INT) {
int r = ao_lisp_poly_int(ret);
int c = ao_lisp_poly_int(car);
switch(op) {
case math_plus:
r += c;
break;
case math_minus:
r -= c;
break;
case math_times:
r *= c;
break;
case math_divide:
if (c == 0) {
ao_lisp_exception |= AO_LISP_DIVIDE_BY_ZERO;
return AO_LISP_NIL;
}
r /= c;
break;
case math_mod:
if (c == 0) {
ao_lisp_exception |= AO_LISP_DIVIDE_BY_ZERO;
return AO_LISP_NIL;
}
r %= c;
break;
}
ret = ao_lisp_int_poly(r);
}
else if (rt == AO_LISP_STRING && ct == AO_LISP_STRING && op == math_plus)
ret = ao_lisp_string_poly(ao_lisp_string_cat(ao_lisp_poly_string(ret),
ao_lisp_poly_string(car)));
else {
ao_lisp_exception |= AO_LISP_INVALID;
return AO_LISP_NIL;
}
}
return ret;
}
ao_poly
ao_lisp_plus(struct ao_lisp_cons *cons)
{
return ao_lisp_math(cons, math_plus);
}
ao_poly
ao_lisp_minus(struct ao_lisp_cons *cons)
{
return ao_lisp_math(cons, math_minus);
}
ao_poly
ao_lisp_times(struct ao_lisp_cons *cons)
{
return ao_lisp_math(cons, math_times);
}
ao_poly
ao_lisp_divide(struct ao_lisp_cons *cons)
{
return ao_lisp_math(cons, math_divide);
}
ao_poly
ao_lisp_mod(struct ao_lisp_cons *cons)
{
return ao_lisp_math(cons, math_mod);
}
ao_lisp_func_t ao_lisp_builtins[] = {
[builtin_car] = ao_lisp_car,
[builtin_cdr] = ao_lisp_cdr,
[builtin_cons] = ao_lisp_cons,
[builtin_quote] = ao_lisp_quote,
[builtin_print] = ao_lisp_print,
[builtin_plus] = ao_lisp_plus,
[builtin_minus] = ao_lisp_minus,
[builtin_times] = ao_lisp_times,
[builtin_divide] = ao_lisp_divide,
[builtin_mod] = ao_lisp_mod
};
|
