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
306
307
308
309
310
311
312
313
314
315
316
317
|
/* Copyright (C) 2025 Aryadev Chavali
* 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 Version 2 for
* details.
* You may distribute and modify this code under the terms of the GNU General
* Public License Version 2, which you should have received a copy of along with
* this program. If not, please go to <https://www.gnu.org/licenses/>.
* Created: 2025-04-06
* Description:
*/
#include "./lisp.h"
#include "./sv.h"
#include <stdio.h>
#include <string.h>
#include <wchar.h>
lisp_t *make_int(i64 integer)
{
return tag_int(integer);
}
lisp_t *make_sym(context_t *ctx, char *data, u64 size)
{
// Small symbol optimisation
if (size <= 7)
return tag_ssym(data, size);
// Make a cell with the data we need
cell_t *cell = context_alloc(ctx, sizeof(*cell) + size);
cell->size = size;
memcpy(cell->data, data, size);
return tag_sym(cell);
}
lisp_t *make_cons(context_t *ctx, lisp_t *car, lisp_t *cdr)
{
cons_t *cons = context_alloc(ctx, sizeof(*cons));
memset(cons, 0, sizeof(*cons));
cons->car = car;
cons->cdr = cdr;
return tag_cons(cons);
}
lisp_t *make_list(context_t *ctx, lisp_t **lisps, u64 size)
{
if (!lisps)
return NIL;
lisp_t *cur = NIL;
for (u64 i = size; i > 0; --i)
cur = make_cons(ctx, lisps[i - 1], cur);
return cur;
}
lisp_t *make_vec(context_t *ctx, u32 size)
{
// Make a vector with the content
lisp_t *container = NIL;
vec_t *vec = context_alloc(ctx, sizeof(*vec));
vec->size = 0;
vec->cap = size * sizeof(&container);
if (size == 0)
vec->data = NULL;
else
vec->data = context_alloc(ctx, vec->cap);
container = tag_vec(vec);
return container;
}
lisp_t *make_str(context_t *ctx, char *data, u64 size)
{
if (size == 0)
// No need to allocate unless necessary
return tag_str(NIL);
// Make a vector with the content
vec_t *vec = context_alloc(ctx, sizeof(*vec));
vec->data = context_alloc(ctx, sizeof(*vec->data) * size);
vec->cap = size;
vec->size = size;
memcpy(vec->data, data, size);
return tag_str(vec);
}
i64 as_int(lisp_t *obj)
{
assert(IS_TAG(obj, INT));
u64 p_obj = (u64)obj;
return UNTAG(p_obj, INT) | // Delete the tag
(NTH_BYTE(p_obj, 7) & 0x80) << 56 // duplicate the MSB (preserve sign)
;
}
cons_t *as_cons(lisp_t *obj)
{
assert(IS_TAG(obj, CONS));
return (cons_t *)UNTAG(obj, CONS);
}
u32 as_char(lisp_t *obj)
{
return (u32)UNTAG(obj, CHAR);
}
cell_t *as_sym(lisp_t *obj)
{
assert(IS_TAG(obj, SYM));
return (cell_t *)UNTAG(obj, SYM);
}
void as_ssym(lisp_t *obj, sv_t *container)
{
assert(IS_TAG(obj, SSYM));
u64 p_obj = (u64)obj;
container->size = NTH_BYTE(p_obj, 0) >> SHIFT_SSYM;
p_obj >>= 8;
memcpy(container->data, &p_obj, container->size);
}
bool as_bool(lisp_t *obj)
{
assert(IS_TAG(obj, BOOL));
return (bool)UNTAG(obj, BOOL);
}
vec_t *as_vec(lisp_t *obj)
{
assert(IS_TAG(obj, VEC));
return (vec_t *)UNTAG(obj, VEC);
}
vec_t *as_str(lisp_t *obj)
{
assert(IS_TAG(obj, STR));
return (vec_t *)UNTAG(obj, STR);
}
sv_t serialise(context_t *ctx, lisp_t *ptr)
{
enum Tag t = tag_get(ptr);
switch (t)
{
case TAG_NIL:
{
return SV("NIL", 3);
}
case TAG_INT:
{
i64 i = as_int(ptr);
sv_t s = sv_fmt(&ctx->scratch,
#if DEBUG > 1
"int["
#endif
"%ld"
#if DEBUG > 1
"]"
#endif
,
i);
return s;
}
case TAG_CHAR:
{
u32 codepoint = as_char(ptr);
return sv_fmt(&ctx->scratch,
#if DEBUG > 1
"char["
#endif
"%lc"
#if DEBUG > 1
"]"
#endif
,
codepoint);
}
case TAG_SYM:
{
cell_t *cell = as_sym(ptr);
sv_t s = sv_make(&ctx->scratch, (char *)cell->data, cell->size);
#if DEBUG > 1
s = sv_fmt(&ctx->scratch, "sym[" PR_SV "]", SV_FMT(s));
#endif
return s;
}
case TAG_SSYM:
{
char data[7];
sv_t rsym = SV(data, 0);
as_ssym(ptr, &rsym);
sv_t s = sv_copy(&ctx->scratch, rsym);
#if DEBUG > 1
s = sv_fmt(&ctx->scratch, "ssym[" PR_SV "]", SV_FMT(s));
#endif
return s;
}
case TAG_BOOL:
{
return sv_fmt(&ctx->scratch,
#if DEBUG > 1
"bool["
#endif
"%s"
#if DEBUG > 1
"]"
#endif
,
as_bool(ptr) ? "#t" : "#f");
}
case TAG_CONS:
{
if (!CAR(ptr) && !CDR(ptr))
#if DEBUG > 1
return SV("lst[NIL]", 8);
#else
return SV("NIL", 3);
#endif
sv_t s = {0};
for (lisp_t *lsp = ptr; lsp; lsp = IS_TAG(lsp, CONS) ? CDR(lsp) : NIL)
{
lisp_t *lmember = lsp;
if (IS_TAG(lsp, CONS))
lmember = CAR(lmember);
sv_t member = serialise(ctx, lmember);
s = sv_concat(&ctx->scratch, s, member);
if (IS_TAG(lsp, CONS) && !CDR(lsp))
continue;
else if (IS_TAG(CDR(lsp), CONS))
// normal list
s = sv_append(&ctx->scratch, s, " ", 1);
else
// dotted list
s = sv_append(&ctx->scratch, s, " . ", 3);
}
#if DEBUG > 1
s = sv_fmt(&ctx->scratch, "lst[" PR_SV "]", SV_FMT(s));
#else
s = sv_fmt(&ctx->scratch, "(" PR_SV ")", SV_FMT(s));
#endif
return s;
}
case TAG_VEC:
{
vec_t *vec = as_vec(ptr);
if (!vec)
#if DEBUG > 1
return SV("vec[NIL]", 8);
#else
return SV("#()", 3);
#endif
else if (vec->size < sizeof(&ptr))
#if DEBUG > 1
return SV("vec[0/0 #()]", 13);
#else
return SV("#()", 3);
#endif
sv_t s = {0};
for (u64 i = 0; i < vec->size / sizeof(&ptr); ++i)
{
lisp_t *lmember = ((lisp_t **)vec->data)[i];
sv_t member = serialise(ctx, lmember);
s = sv_concat(&ctx->scratch, s, member);
if (i == ((vec->size / sizeof(&ptr)) - 1))
continue;
s = sv_append(&ctx->scratch, s, " ", 1);
}
#if DEBUG > 1
s = sv_fmt(&ctx->scratch, "vec[%lu/%lu #(" PR_SV ")]", vec->size, vec->cap,
SV_FMT(s));
#else
s = sv_fmt(&ctx->scratch, "#(" PR_SV ")", SV_FMT(s));
#endif
return s;
break;
}
case TAG_STR:
{
vec_t *vec = as_str(ptr);
sv_t sv = {0};
if (vec)
sv = SV((char *)vec->data, vec->size);
else
sv = SV("", 0);
return sv_fmt(&ctx->scratch,
#if DEBUG > 1
"str["
#else
"\""
#endif
PR_SV
#if DEBUG > 1
"]"
#else
"\""
#endif
,
SV_FMT(sv));
}
case NUM_TAGS:
default:
assert(false && "serialise: unreachable");
return SV(0, 0);
}
}
|