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 ao_scheme_vector_write(ao_poly v)
78 struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
81 ao_scheme_print_start();
82 if (ao_scheme_print_mark_addr(vector))
86 for (i = 0; i < vector->length; i++) {
89 ao_scheme_poly_write(vector->vals[i]);
93 ao_scheme_print_stop();
97 ao_scheme_vector_display(ao_poly v)
99 struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
102 ao_scheme_print_start();
103 if (ao_scheme_print_mark_addr(vector))
106 for (i = 0; i < vector->length; i++)
107 ao_scheme_poly_display(vector->vals[i]);
112 ao_scheme_vector_offset(struct ao_scheme_vector *vector, ao_poly i)
115 int32_t offset = ao_scheme_poly_integer(i, &fail);
118 ao_scheme_error(AO_SCHEME_INVALID, "vector index %v not integer", i);
119 if (offset < 0 || vector->length <= offset) {
120 ao_scheme_error(AO_SCHEME_INVALID, "vector index %v out of range (max %d)",
128 ao_scheme_vector_get(ao_poly v, ao_poly i)
130 struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
131 int32_t offset = ao_scheme_vector_offset(vector, i);
134 return AO_SCHEME_NIL;
135 return vector->vals[offset];
139 ao_scheme_vector_set(ao_poly v, ao_poly i, ao_poly p)
141 struct ao_scheme_vector *vector = ao_scheme_poly_vector(v);
142 int32_t offset = ao_scheme_vector_offset(vector, i);
145 return AO_SCHEME_NIL;
146 return vector->vals[offset] = p;
149 struct ao_scheme_vector *
150 ao_scheme_list_to_vector(struct ao_scheme_cons *cons)
154 struct ao_scheme_vector *vector;
156 length = (uint16_t) ao_scheme_cons_length (cons);
157 if (ao_scheme_exception)
160 ao_scheme_cons_stash(0, cons);
161 vector = ao_scheme_vector_alloc(length, AO_SCHEME_NIL);
162 cons = ao_scheme_cons_fetch(0);
167 vector->vals[i++] = cons->car;
168 cons = ao_scheme_cons_cdr(cons);
173 struct ao_scheme_cons *
174 ao_scheme_vector_to_list(struct ao_scheme_vector *vector)
177 uint16_t length = vector->length;
178 struct ao_scheme_cons *cons = NULL;
180 for (i = length; i-- > 0;) {
181 ao_scheme_poly_stash(2, ao_scheme_vector_poly(vector));
182 cons = ao_scheme_cons_cons(vector->vals[i], ao_scheme_cons_poly(cons));
183 vector = ao_scheme_poly_vector(ao_scheme_poly_fetch(2));
190 #endif /* AO_SCHEME_FEATURE_VECTOR */