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
|
/*
* 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"
#define OFFSET(a) ((int) ((uint8_t *) (a) - ao_lisp_const))
#if 0
static int cons_depth;
#define DBG(...) do { int d; for (d = 0; d < cons_depth; d++) printf (" "); printf(__VA_ARGS__); } while(0)
#define DBG_IN() (cons_depth++)
#define DBG_OUT() (cons_depth--)
#define DBG_PR(c) ao_lisp_cons_print(ao_lisp_cons_poly(c))
#define DBG_PRP(p) ao_lisp_poly_print(p)
#else
#define DBG(...)
#define DBG_IN()
#define DBG_OUT()
#define DBG_PR(c)
#define DBG_PRP(p)
#endif
static void cons_mark(void *addr)
{
struct ao_lisp_cons *cons = addr;
for (;;) {
ao_lisp_poly_mark(cons->car);
cons = ao_lisp_poly_cons(cons->cdr);
if (!cons)
break;
if (ao_lisp_mark_memory(cons, sizeof (struct ao_lisp_cons)))
break;
}
}
static int cons_size(void *addr)
{
(void) addr;
return sizeof (struct ao_lisp_cons);
}
static void cons_move(void *addr)
{
struct ao_lisp_cons *cons = addr;
DBG_IN();
DBG("move cons start %d\n", OFFSET(cons));
for (;;) {
struct ao_lisp_cons *cdr;
ao_poly car;
car = ao_lisp_poly_move(cons->car);
DBG(" moved car %d -> %d\n", OFFSET(ao_lisp_ref(cons->car)), OFFSET(ao_lisp_ref(car)));
cons->car = car;
cdr = ao_lisp_poly_cons(cons->cdr);
cdr = ao_lisp_move_memory(cdr, sizeof (struct ao_lisp_cons));
if (!cdr)
break;
DBG(" moved cdr %d -> %d\n", OFFSET(ao_lisp_poly_cons(cons->cdr)), OFFSET(cdr));
cons->cdr = ao_lisp_cons_poly(cdr);
cons = cdr;
}
DBG("move cons end\n");
DBG_OUT();
}
const struct ao_lisp_type ao_lisp_cons_type = {
.mark = cons_mark,
.size = cons_size,
.move = cons_move,
};
struct ao_lisp_cons *
ao_lisp_cons_cons(ao_poly car, struct ao_lisp_cons *cdr)
{
struct ao_lisp_cons *cons = ao_lisp_alloc(sizeof (struct ao_lisp_cons));
if (!cons)
return NULL;
cons->car = car;
cons->cdr = ao_lisp_cons_poly(cdr);
return cons;
}
void
ao_lisp_cons_print(ao_poly c)
{
struct ao_lisp_cons *cons = ao_lisp_poly_cons(c);
int first = 1;
printf("(");
while (cons) {
if (!first)
printf(" ");
ao_lisp_poly_print(cons->car);
cons = ao_lisp_poly_cons(cons->cdr);
first = 0;
}
printf(")");
}
|
