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
|
#include "atom.h"
#include "env.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
struct atom true_atom;
struct atom false_atom;
struct atom nil_atom;
__attribute__((constructor))
static void setup_builtin_atoms()
{
nil_atom.list = calloc(1, sizeof(*nil_atom.list));
LIST_INIT(nil_atom.list);
true_atom.type = ATOM_TRUE;
false_atom.type = ATOM_FALSE;
nil_atom.type = ATOM_NIL;
}
struct atom *atom_new(char type)
{
struct atom *atom = calloc(1, sizeof(*atom));
atom->type = type;
return atom;
}
struct atom *atom_new_int(long l)
{
struct atom *atom = atom_new(ATOM_INT);
atom->l = l;
return atom;
}
struct atom *atom_new_str(const char *str, int len)
{
struct atom *atom = atom_new(ATOM_STR);
atom->str.str = strndup(str, len);
atom->str.len = len;
return atom;
}
struct atom *atom_new_sym(const char *sym, int len)
{
struct atom *atom = atom_new_str(sym, len);
atom->type = ATOM_SYMBOL;
return atom;
}
struct atom *atom_new_list(struct list *list)
{
struct atom *atom = atom_new(ATOM_LIST);
atom->list = list;
return atom;
}
struct atom *atom_new_list_empty()
{
struct list *list = calloc(1, sizeof(*list));
LIST_INIT(list);
return atom_new_list(list);
}
struct atom *atom_new_closure(struct atom *params, struct atom *body,
struct env *env)
{
struct atom *atom = atom_new(ATOM_CLOSURE);
atom->closure.params = params;
atom->closure.body = body;
atom->closure.env = env;
return atom;
}
struct atom *atom_clone(struct atom *atom)
{
switch (atom->type)
{
case ATOM_NIL:
case ATOM_TRUE:
case ATOM_FALSE:
return atom;
case ATOM_INT:
return atom_new_int(atom->l);
case ATOM_STR:
return atom_new_str(atom->str.str, atom->str.len);
case ATOM_SYMBOL:
return atom_new_sym(atom->str.str, atom->str.len);
case ATOM_LIST:
{
struct atom *elem, *last;
struct list *list_clone = calloc(1, sizeof(*list_clone));
LIST_INIT(list_clone);
LIST_FOREACH(elem, atom->list, entries)
{
struct atom *a_clone = atom_clone(elem);
if (LIST_EMPTY(list_clone))
LIST_INSERT_HEAD(list_clone, a_clone, entries);
else
LIST_INSERT_AFTER(last, a_clone, entries);
last = a_clone;
}
return atom_new_list(list_clone);
}
case ATOM_CLOSURE:
// TODO: should we clone the env or what? If it is just plainly
// cloned, it leads to a infinite loop when we have a closure
// bound to a name in the env.
return atom_new_closure(atom_clone(atom->closure.params),
atom_clone(atom->closure.body),
atom->closure.env);
break;
}
return NULL;
}
void print_atom(struct atom *atom, int level)
{
switch (ATOM_TYPE(atom))
{
case ATOM_TRUE: printf("#t"); break;
case ATOM_FALSE: printf("#f"); break;
case ATOM_NIL: printf("nil"); break;
case ATOM_SYMBOL:
printf("%.*s", atom->str.len, atom->str.str);
break;
case ATOM_STR:
printf("\"%.*s\"", atom->str.len, atom->str.str);
break;
case ATOM_INT:
printf("%ld", atom->l);
break;
case ATOM_LIST:
{
printf("(");
struct atom *elem;
LIST_FOREACH(elem, atom->list, entries)
{
print_atom(elem, level+1);
if (LIST_NEXT(elem, entries))
printf(" ");
}
printf(")");
break;
}
case ATOM_CLOSURE:
printf("<closure@%p>", atom);
break;
}
if (level == 0)
printf("\n");
}
struct atom *atom_list_append(struct atom *list, int count, ...)
{
va_list ap;
struct atom *atom = NULL;
struct atom *last;
LIST_FOREACH(last, list->list, entries)
{
if (!LIST_NEXT(last, entries))
break;
}
va_start(ap, count);
do
{
atom = va_arg(ap, struct atom *);
if (LIST_EMPTY(list->list))
LIST_INSERT_HEAD(list->list, atom, entries);
else
LIST_INSERT_AFTER(last, atom, entries);
last = atom;
} while (--count);
va_end(ap);
return list;
}
int atom_list_length(struct atom *list)
{
struct atom *atom;
int length = 0;
if (IS_NIL(list))
return 0;
LIST_FOREACH(atom, list->list, entries)
{
++length;
}
return length;
}
#ifdef BUILD_TEST
#include "test_util.h"
TEST(atom_new)
{
struct atom *atom = atom_new(ATOM_STR);
ASSERT_TRUE(atom != NULL);
ASSERT_EQ(ATOM_STR, atom->type);
}
TEST(atom_new_int)
{
struct atom *atom = atom_new_int(42);
ASSERT_TRUE(atom != NULL);
ASSERT_EQ(42, atom->l);
}
TEST(atom_new_str)
{
struct atom *atom = atom_new_str("foobar", 6);
ASSERT_TRUE(atom != NULL);
ASSERT_STREQ("foobar", atom->str.str);
atom = atom_new_str("foobar", 3);
ASSERT_TRUE(atom != NULL);
ASSERT_STREQ("foo", atom->str.str);
ASSERT_EQ(ATOM_STR, atom->type);
}
TEST(atom_new_sym)
{
struct atom *atom = atom_new_sym("foobar", 6);
ASSERT_TRUE(atom != NULL);
ASSERT_STREQ("foobar", atom->str.str);
atom = atom_new_sym("foobar", 3);
ASSERT_TRUE(atom != NULL);
ASSERT_STREQ("foo", atom->str.str);
ASSERT_EQ(ATOM_SYMBOL, atom->type);
}
TEST(atom_new_list)
{
struct list list;
struct atom *atom = atom_new_list(&list);
ASSERT_TRUE(atom != NULL);
ASSERT_EQ(&list, atom->list);
ASSERT_EQ(ATOM_LIST, atom->type);
}
#endif
|
