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
|
/*
* 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))
static void cons_mark(void *addr)
{
struct ao_lisp_cons *cons = addr;
for (;;) {
ao_lisp_poly_mark(cons->car, 1);
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;
if (!cons)
return;
for (;;) {
struct ao_lisp_cons *cdr;
int ret;
(void) ao_lisp_poly_move(&cons->car, 1);
cdr = ao_lisp_poly_cons(cons->cdr);
if (!cdr)
break;
ret = ao_lisp_move_memory((void **) &cdr, sizeof (struct ao_lisp_cons));
if (cdr != ao_lisp_poly_cons(cons->cdr))
cons->cdr = ao_lisp_cons_poly(cdr);
if (ret)
break;
cons = cdr;
}
}
const struct ao_lisp_type ao_lisp_cons_type = {
.mark = cons_mark,
.size = cons_size,
.move = cons_move,
};
static ao_poly cons_car;
static struct ao_lisp_cons *cons_cdr;
static int been_here;
struct ao_lisp_cons *
ao_lisp_cons_cons(ao_poly car, struct ao_lisp_cons *cdr)
{
struct ao_lisp_cons *cons;
if (!been_here) {
ao_lisp_root_add(&ao_lisp_cons_type, &cons_cdr);
ao_lisp_root_poly_add(&cons_car);
been_here = 1;
}
cons_car = car;
cons_cdr = cdr;
cons = ao_lisp_alloc(sizeof (struct ao_lisp_cons));
if (!cons)
return NULL;
cons->car = cons_car;
cons->cdr = ao_lisp_cons_poly(cons_cdr);
cons_car = AO_LISP_NIL;
cons_cdr = NULL;
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(")");
}
void
ao_lisp_cons_patom(ao_poly c)
{
struct ao_lisp_cons *cons = ao_lisp_poly_cons(c);
while (cons) {
ao_lisp_poly_patom(cons->car);
cons = ao_lisp_poly_cons(cons->cdr);
}
}
int
ao_lisp_cons_length(struct ao_lisp_cons *cons)
{
int len = 0;
while (cons) {
len++;
cons = ao_lisp_poly_cons(cons->cdr);
}
return len;
}
|
