02512e15f895ab36aa46a2dbf1ccb9aa56df4d7f
[fw/altos] / src / scheme / ao_scheme_cons.c
1 /*
2  * Copyright © 2016 Keith Packard <keithp@keithp.com>
3  *
4  * This program is free software; you can redistribute it and/or modify
5  * it under the terms of the GNU General Public License as published by
6  * the Free Software Foundation, either version 2 of the License, or
7  * (at your option) any later version.
8  *
9  * This program is distributed in the hope that it will be useful, but
10  * WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
12  * General Public License for more details.
13  */
14
15 #include "ao_scheme.h"
16
17 static void cons_mark(void *addr)
18 {
19         struct ao_scheme_cons   *cons = addr;
20
21         for (;;) {
22                 ao_poly cdr = cons->cdr;
23
24                 ao_scheme_poly_mark(cons->car, 1);
25                 if (!cdr)
26                         break;
27                 if (ao_scheme_poly_type(cdr) != AO_SCHEME_CONS) {
28                         ao_scheme_poly_mark(cdr, 1);
29                         break;
30                 }
31                 cons = ao_scheme_poly_cons(cdr);
32                 if (ao_scheme_mark_memory(&ao_scheme_cons_type, cons))
33                         break;
34         }
35 }
36
37 static int cons_size(void *addr)
38 {
39         (void) addr;
40         return sizeof (struct ao_scheme_cons);
41 }
42
43 static void cons_move(void *addr)
44 {
45         struct ao_scheme_cons   *cons = addr;
46
47         if (!cons)
48                 return;
49
50         for (;;) {
51                 ao_poly                 cdr;
52                 struct ao_scheme_cons   *c;
53                 int     ret;
54
55                 MDBG_MOVE("cons_move start %d (%d, %d)\n",
56                           MDBG_OFFSET(cons), MDBG_OFFSET(ao_scheme_ref(cons->car)), MDBG_OFFSET(ao_scheme_ref(cons->cdr)));
57                 (void) ao_scheme_poly_move(&cons->car, 1);
58                 cdr = cons->cdr;
59                 if (!cdr)
60                         break;
61                 if (ao_scheme_poly_base_type(cdr) != AO_SCHEME_CONS) {
62                         (void) ao_scheme_poly_move(&cons->cdr, 0);
63                         break;
64                 }
65                 c = ao_scheme_poly_cons(cdr);
66                 ret = ao_scheme_move_memory(&ao_scheme_cons_type, (void **) &c);
67                 if (c != ao_scheme_poly_cons(cons->cdr))
68                         cons->cdr = ao_scheme_cons_poly(c);
69                 MDBG_MOVE("cons_move end %d (%d, %d)\n",
70                           MDBG_OFFSET(cons), MDBG_OFFSET(ao_scheme_ref(cons->car)), MDBG_OFFSET(ao_scheme_ref(cons->cdr)));
71                 if (ret)
72                         break;
73                 cons = c;
74         }
75 }
76
77 const struct ao_scheme_type ao_scheme_cons_type = {
78         .mark = cons_mark,
79         .size = cons_size,
80         .move = cons_move,
81         .name = "cons",
82 };
83
84 struct ao_scheme_cons *ao_scheme_cons_free_list;
85
86 struct ao_scheme_cons *
87 ao_scheme_cons_cons(ao_poly car, ao_poly cdr)
88 {
89         struct ao_scheme_cons   *cons;
90
91         if (ao_scheme_cons_free_list) {
92                 cons = ao_scheme_cons_free_list;
93                 ao_scheme_cons_free_list = ao_scheme_poly_cons(cons->cdr);
94         } else {
95                 ao_scheme_poly_stash(0, car);
96                 ao_scheme_poly_stash(1, cdr);
97                 cons = ao_scheme_alloc(sizeof (struct ao_scheme_cons));
98                 cdr = ao_scheme_poly_fetch(1);
99                 car = ao_scheme_poly_fetch(0);
100                 if (!cons)
101                         return NULL;
102         }
103         cons->car = car;
104         cons->cdr = cdr;
105         return cons;
106 }
107
108 struct ao_scheme_cons *
109 ao_scheme_cons_cdr(struct ao_scheme_cons *cons)
110 {
111         ao_poly cdr = cons->cdr;
112         if (cdr == AO_SCHEME_NIL)
113                 return NULL;
114         if (ao_scheme_poly_type(cdr) != AO_SCHEME_CONS) {
115                 (void) ao_scheme_error(AO_SCHEME_INVALID, "improper cdr %v", cdr);
116                 return NULL;
117         }
118         return ao_scheme_poly_cons(cdr);
119 }
120
121 ao_poly
122 ao_scheme__cons(ao_poly car, ao_poly cdr)
123 {
124         return ao_scheme_cons_poly(ao_scheme_cons_cons(car, cdr));
125 }
126
127 struct ao_scheme_cons *
128 ao_scheme_cons_copy(struct ao_scheme_cons *cons)
129 {
130         struct ao_scheme_cons   *head = NULL;
131         struct ao_scheme_cons   *tail = NULL;
132
133         while (cons) {
134                 struct ao_scheme_cons   *new;
135                 ao_poly cdr;
136
137                 ao_scheme_cons_stash(0, cons);
138                 ao_scheme_cons_stash(1, head);
139                 ao_scheme_poly_stash(0, ao_scheme_cons_poly(tail));
140                 new = ao_scheme_alloc(sizeof (struct ao_scheme_cons));
141                 cons = ao_scheme_cons_fetch(0);
142                 head = ao_scheme_cons_fetch(1);
143                 tail = ao_scheme_poly_cons(ao_scheme_poly_fetch(0));
144                 if (!new)
145                         return AO_SCHEME_NIL;
146                 new->car = cons->car;
147                 new->cdr = AO_SCHEME_NIL;
148                 if (!head)
149                         head = new;
150                 else
151                         tail->cdr = ao_scheme_cons_poly(new);
152                 tail = new;
153                 cdr = cons->cdr;
154                 if (ao_scheme_poly_type(cdr) != AO_SCHEME_CONS) {
155                         tail->cdr = cdr;
156                         break;
157                 }
158                 cons = ao_scheme_poly_cons(cdr);
159         }
160         return head;
161 }
162
163 void
164 ao_scheme_cons_free(struct ao_scheme_cons *cons)
165 {
166 #if DBG_FREE_CONS
167         ao_scheme_cons_check(cons);
168 #endif
169         while (cons) {
170                 ao_poly cdr = cons->cdr;
171                 cons->cdr = ao_scheme_cons_poly(ao_scheme_cons_free_list);
172                 ao_scheme_cons_free_list = cons;
173                 cons = ao_scheme_poly_cons(cdr);
174         }
175 }
176
177 void
178 ao_scheme_cons_write(ao_poly c)
179 {
180         struct ao_scheme_cons   *cons = ao_scheme_poly_cons(c);
181         ao_poly                 cdr;
182         int                     first = 1;
183
184         printf("(");
185         while (cons) {
186                 if (!first)
187                         printf(" ");
188                 ao_scheme_poly_write(cons->car);
189                 cdr = cons->cdr;
190                 if (cdr == c) {
191                         printf(" ...");
192                         break;
193                 }
194                 if (ao_scheme_poly_type(cdr) == AO_SCHEME_CONS) {
195                         cons = ao_scheme_poly_cons(cdr);
196                         first = 0;
197                 } else {
198                         printf(" . ");
199                         ao_scheme_poly_write(cdr);
200                         cons = NULL;
201                 }
202         }
203         printf(")");
204 }
205
206 void
207 ao_scheme_cons_display(ao_poly c)
208 {
209         struct ao_scheme_cons   *cons = ao_scheme_poly_cons(c);
210         ao_poly                 cdr;
211
212         while (cons) {
213                 ao_scheme_poly_display(cons->car);
214                 cdr = cons->cdr;
215                 if (cdr == c) {
216                         printf("...");
217                         break;
218                 }
219                 if (ao_scheme_poly_type(cdr) == AO_SCHEME_CONS)
220                         cons = ao_scheme_poly_cons(cdr);
221                 else {
222                         ao_scheme_poly_display(cdr);
223                         cons = NULL;
224                 }
225         }
226 }
227
228 int
229 ao_scheme_cons_length(struct ao_scheme_cons *cons)
230 {
231         int     len = 0;
232         while (cons) {
233                 len++;
234                 cons = ao_scheme_cons_cdr(cons);
235         }
236         return len;
237 }