2 * Copyright © 2017 Keith Packard <keithp@keithp.com>
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.
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.
15 #include "ao_scheme.h"
17 #ifdef AO_SCHEME_FEATURE_VECTOR
19 static void vector_mark(void *addr)
21 struct ao_scheme_vector *vector = addr;
24 for (i = 0; i < vector->length; i++) {
25 ao_poly v = vector->vals[i];
27 ao_scheme_poly_mark(v, 1);
31 static int vector_len_size(uint16_t length)
33 return sizeof (struct ao_scheme_vector) + length * sizeof (ao_poly);
36 static int vector_size(void *addr)
38 struct ao_scheme_vector *vector = addr;
40 return vector_len_size(vector->length);
43 static void vector_move(void *addr)
45 struct ao_scheme_vector *vector = addr;
48 for (i = 0; i < vector->length; i++)
49 (void) ao_scheme_poly_move(&vector->vals[i], 1);
52 const struct ao_scheme_type ao_scheme_vector_type = {
59 struct ao_scheme_vector *
60 ao_scheme_vector_alloc(uint16_t length, ao_poly fill)
62 struct ao_scheme_vector *vector;
65 vector = ao_scheme_alloc(vector_len_size(length));
68 vector->type = AO_SCHEME_VECTOR;
69 vector->length = length;
70 for (i = 0; i < length; i++)
71 vector->vals[i] = fill;
76 struct ao_scheme_vector *vector;
81 static unsigned int vd;
84 ao_scheme_vector_write(FILE *out, ao_poly v, bool write)
86 struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
92 for (ve = vl; ve; ve = ve->prev)
93 if (ve->vector == vector)
96 ve = malloc(sizeof (struct vl));
101 ao_scheme_print_start();
102 was_marked = ao_scheme_print_mark_addr(vector);
107 for (i = 0; i < vector->length; i++) {
110 ao_scheme_poly_write(out, vector->vals[i], write);
114 if (ao_scheme_print_stop() && !was_marked)
115 ao_scheme_print_clear_addr(vector);
123 struct ao_scheme_vector *
124 ao_scheme_list_to_vector(struct ao_scheme_cons *cons)
128 struct ao_scheme_vector *vector;
130 length = (uint16_t) ao_scheme_cons_length (cons);
131 if (ao_scheme_exception)
134 ao_scheme_cons_stash(cons);
135 vector = ao_scheme_vector_alloc(length, AO_SCHEME_NIL);
136 cons = ao_scheme_cons_fetch();
141 vector->vals[i++] = cons->car;
142 cons = ao_scheme_cons_cdr(cons);
147 struct ao_scheme_cons *
148 ao_scheme_vector_to_list(struct ao_scheme_vector *vector, int start, int end)
151 uint16_t length = vector->length;
152 struct ao_scheme_cons *cons = NULL;
160 for (i = end; i-- > start;) {
161 ao_scheme_vector_stash(vector);
162 cons = ao_scheme_cons_cons(vector->vals[i], ao_scheme_cons_poly(cons));
163 vector = ao_scheme_vector_fetch();
171 ao_scheme_do_vector(struct ao_scheme_cons *cons)
173 return ao_scheme_vector_poly(ao_scheme_list_to_vector(cons));
177 ao_scheme_do_make_vector(struct ao_scheme_cons *cons)
182 if (!ao_scheme_parse_args(_ao_scheme_atom_make2dvector, cons,
184 AO_SCHEME_POLY|AO_SCHEME_ARG_OPTIONAL, _ao_scheme_bool_false, &val,
186 return AO_SCHEME_NIL;
187 return ao_scheme_vector_poly(ao_scheme_vector_alloc(len, val));
191 ao_scheme_check_vector(ao_poly proc, struct ao_scheme_vector *vector, int32_t offset)
193 if (offset < 0 || vector->length <= offset) {
194 (void) ao_scheme_error(AO_SCHEME_INVALID, "%v: vector index %d out of range (max %d)",
196 offset, vector->length);
203 ao_scheme_do_vector_ref(struct ao_scheme_cons *cons)
205 struct ao_scheme_vector *vector;
208 if (!ao_scheme_parse_args(_ao_scheme_atom_vector2dref, cons,
209 AO_SCHEME_VECTOR, &vector,
210 AO_SCHEME_INT, &offset,
212 return AO_SCHEME_NIL;
213 if (!ao_scheme_check_vector(_ao_scheme_atom_vector2dref, vector, offset))
214 return AO_SCHEME_NIL;
215 return vector->vals[offset];
219 ao_scheme_do_vector_set(struct ao_scheme_cons *cons)
221 struct ao_scheme_vector *vector;
225 if (!ao_scheme_parse_args(_ao_scheme_atom_vector2dset21, cons,
226 AO_SCHEME_VECTOR, &vector,
227 AO_SCHEME_INT, &offset,
228 AO_SCHEME_POLY, &val,
230 return AO_SCHEME_NIL;
231 if (!ao_scheme_check_vector(_ao_scheme_atom_vector2dset21, vector, offset))
232 return AO_SCHEME_NIL;
233 vector->vals[offset] = val;
238 ao_scheme_do_list_to_vector(struct ao_scheme_cons *cons)
240 struct ao_scheme_cons *pair;
242 if (!ao_scheme_parse_args(_ao_scheme_atom_list2d3evector, cons,
243 AO_SCHEME_CONS|AO_SCHEME_ARG_NIL_OK, &pair,
245 return AO_SCHEME_NIL;
246 return ao_scheme_vector_poly(ao_scheme_list_to_vector(pair));
250 ao_scheme_do_vector_to_list(struct ao_scheme_cons *cons)
252 struct ao_scheme_vector *vector;
255 if (!ao_scheme_parse_args(_ao_scheme_atom_vector2d3elist, cons,
256 AO_SCHEME_VECTOR, &vector,
257 AO_SCHEME_INT|AO_SCHEME_ARG_OPTIONAL, ao_scheme_int_poly(0), &start,
258 AO_SCHEME_INT|AO_SCHEME_ARG_OPTIONAL, ao_scheme_int_poly(-1), &end,
260 return AO_SCHEME_NIL;
262 end = vector->length;
263 return ao_scheme_cons_poly(ao_scheme_vector_to_list(vector, start, end));
267 ao_scheme_do_vector_length(struct ao_scheme_cons *cons)
269 struct ao_scheme_vector *vector;
271 if (!ao_scheme_parse_args(_ao_scheme_atom_vector2d3elist, cons,
272 AO_SCHEME_VECTOR, &vector,
274 return AO_SCHEME_NIL;
275 return ao_scheme_integer_poly(vector->length);
279 ao_scheme_do_vectorp(struct ao_scheme_cons *cons)
281 return ao_scheme_do_typep(_ao_scheme_atom_vector3f, AO_SCHEME_VECTOR, cons);
284 #endif /* AO_SCHEME_FEATURE_VECTOR */