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 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
|
/*
array.c
This software is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This software 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this software; if not, write to the Free
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Original copyright notice follows:
Copyright, 1993, Brent Benson. All Rights Reserved.
0.4 & 0.5 Revisions Copyright 1994, Joseph N. Wilson. All Rights Reserved.
Permission to use, copy, and modify this software and its
documentation is hereby granted only under the following terms and
conditions. Both the above copyright notice and this permission
notice must appear in all copies of the software, derivative works
or modified version, and both notices must appear in supporting
documentation. Users of this software agree to the terms and
conditions set forth in this notice.
*/
#include "array.h"
#include "alloc.h"
#include "error.h"
#include "list.h"
#include "number.h"
#include "prim.h"
#include "symbol.h"
static Object array_size (Object arr);
static Object row_major_index (Object arr, Object indices);
static Object array_element (Object arr, Object index, Object default_ob);
static Object a_ref (Object arr, Object indices, Object default_ob);
static Object array_element_setter (Object arr, Object index, Object new_val);
static Object a_ref_setter (Object arr, Object indices, Object new_val);
static Object array_dimensions (Object arr);
static Object array_initial_state (Object arr);
static Object array_next_state (Object arr, Object state);
static Object array_current_element (Object arr, Object state);
static struct primitive array_prims[] =
{
{"%array-size", prim_1, array_size},
{"%array-ref", prim_3, a_ref},
{"%array-ref-setter", prim_3, a_ref_setter},
{"%array-element", prim_3, array_element},
{"%array-element-setter", prim_3, array_element_setter},
{"%array-dimensions", prim_1, array_dimensions},
{"%array-initial-state", prim_1, array_initial_state},
{"%array-next-state", prim_2, array_next_state},
{"%array-current-element", prim_2, array_current_element},
{"%array-row-major-index", prim_2, row_major_index},
};
void
init_array_prims (void)
{
int num = sizeof (array_prims) / sizeof (struct primitive);
init_prims (num, array_prims);
}
Object
make_array (Object dims, Object fill)
{
Object obj, dl, val;
unsigned int size, i;
obj = allocate_object (sizeof (struct array));
ARRTYPE (obj) = Array;
ARRDIMS (obj) = dims;
dl = dims;
size = 1;
while (!EMPTYLISTP (dl)) {
val = CAR (dl);
if (!INTEGERP (val)) {
error ("make: array dimensions must be integers", dims, NULL);
}
size *= INTVAL (val);
dl = CDR (dl);
}
ARRELS (obj) = (Object *) checking_malloc (sizeof (Object) * size);
ARRSIZE (obj) = size;
for (i = 0; i < size; ++i) {
ARRELS (obj)[i] = fill;
}
return (obj);
}
Object
make_array_driver (Object args)
{
Object dim_obj, fill_obj, res;
dim_obj = NULL;
fill_obj = NULL;
while (!EMPTYLISTP (args)) {
if (FIRST (args) == dim_keyword) {
dim_obj = SECOND (args);
} else if (FIRST (args) == fill_keyword) {
fill_obj = SECOND (args);
} else {
error ("make: unsupported keyword for <array> class",
FIRST (args), NULL);
}
args = CDR (CDR (args));
}
if (dim_obj) {
if (!LISTP (dim_obj)) {
error ("make: value of dimensions: argument must be a list of integers",
dim_obj, NULL);
}
} else {
error ("make: dimensions: must be specified for <array>", args, NULL);
}
if (!fill_obj) {
fill_obj = false_object;
}
/* actually fabricate the array */
res = make_array (dim_obj, fill_obj);
return (res);
}
/* static functions */
static Object
array_size (Object arr)
{
return make_integer (ARRSIZE (arr));
}
static int
index (Object arr, Object indices, Object default_ob)
{
Object dims, inds, ind, dim;
unsigned int offset, dim_val;
int ind_val;
unsigned int index_stride = 1;
dims = list_reverse (ARRDIMS (arr));
inds = list_reverse (indices);
offset = 0;
while (!EMPTYLISTP (dims) && !EMPTYLISTP (inds)) {
if (EMPTYLISTP (dims)) {
error ("element: too many indices for array", arr, indices, NULL);
}
if (EMPTYLISTP (inds)) {
error ("element: not enough indices given", arr, indices, NULL);
}
dim = CAR (dims);
ind = CAR (inds);
if (!INTEGERP (ind)) {
error ("element: array indices must be integers", ind, NULL);
}
dim_val = INTVAL (dim);
ind_val = INTVAL (ind);
if ((ind_val < 0) || (ind_val >= dim_val)) {
if (default_ob == default_object) {
error ("element: array indices out of range", indices,
ARRDIMS (arr), NULL);
} else {
return -1;
}
}
offset += (ind_val * index_stride);
index_stride *= dim_val;
dims = CDR (dims);
inds = CDR (inds);
}
if (!EMPTYLISTP (dims)) {
error ("element: not enough indices for array", arr, indices, NULL);
}
if (!EMPTYLISTP (inds)) {
error ("element: too many indices given", arr, indices, NULL);
}
return offset;
}
static Object
row_major_index (Object arr, Object indices)
{
return make_integer (index (arr, indices, default_object));
}
/*
* Note that the key of an array collection is the list of indices.
*/
static Object
array_element (Object arr, Object index, Object default_ob)
{
int ind_val = INTVAL (index);
if ((ind_val < 0) || (ind_val >= ARRSIZE (arr))) {
if (default_ob == default_object) {
return error ("element: array index out of range", index,
ARRDIMS (arr), NULL);
} else {
return default_ob;
}
} else {
return ARRELS (arr)[ind_val];
}
}
static Object
a_ref (Object arr, Object indices, Object default_ob)
{
return (ARRELS (arr)[index (arr, indices, default_ob)]);
}
static Object
array_element_setter (Object arr, Object index, Object new_val)
{
int ind_val = INTVAL (index);
if ((ind_val < 0) || (ind_val >= ARRSIZE (arr))) {
error ("element_setter: array index out of range", index,
ARRDIMS (arr), NULL);
}
ARRELS (arr)[ind_val] = new_val;
return (unspecified_object);
}
static Object
a_ref_setter (Object arr, Object indices, Object new_val)
{
ARRELS (arr)[index (arr, indices, default_object)] = new_val;
return (unspecified_object);
}
static Object
array_dimensions (Object arr)
{
return (ARRDIMS (arr));
}
static Object
array_initial_state (Object arr)
{
return (make_integer (0));
}
static Object
array_next_state (Object arr, Object state)
{
Object dims, dim;
unsigned int total_size, state_val;
total_size = 1;
dims = ARRDIMS (arr);
while (!EMPTYLISTP (dims)) {
dim = CAR (dims);
total_size *= INTVAL (dim);
dims = CDR (dims);
}
state_val = INTVAL (state);
state_val++;
if (state_val >= total_size) {
return (false_object);
} else {
return (make_integer (state_val));
}
}
static Object
array_current_element (Object arr, Object state)
{
return (ARRELS (arr)[INTVAL (state)]);
}
|