ocaml/byterun/array.c

76 lines
2.1 KiB
C

/***********************************************************************/
/* */
/* Caml Special Light */
/* */
/* Xavier Leroy, projet Cristal, INRIA Rocquencourt */
/* */
/* Copyright 1995 Institut National de Recherche en Informatique et */
/* Automatique. Distributed only by permission. */
/* */
/***********************************************************************/
/* $Id$ */
/* Operations on arrays */
#include "alloc.h"
#include "fail.h"
#include "memory.h"
#include "misc.h"
#include "mlvalues.h"
value array_get(array, index) /* ML */
value array, index;
{
long idx = Long_val(index);
if (idx < 0 || idx >= Wosize_val(array)) invalid_argument("Array.get");
return Field(array, idx);
}
value array_set(array, index, newval) /* ML */
value array, index, newval;
{
long idx = Long_val(index);
if (idx < 0 || idx >= Wosize_val(array)) invalid_argument("Array.set");
Modify(&Field(array, idx), newval);
return Val_unit;
}
value make_vect(len, init) /* ML */
value len, init;
{
value res;
mlsize_t size, i;
Push_roots(root, 1);
size = Long_val(len);
if (size > Max_wosize) {
Pop_roots();
invalid_argument("Array.new");
}
if (size == 0) {
res = Atom(0);
}
else if (size < Max_young_wosize) {
root[0] = init;
res = alloc(size, 0);
init = root[0];
for (i = 0; i < size; i++) Field(res, i) = init;
}
else if (Is_block(init) && Is_young(init)) {
root[0] = init;
minor_collection();
res = alloc_shr(size, 0);
init = root[0];
for (i = 0; i < size; i++) Field(res, i) = init;
}
else {
root[0] = init;
res = alloc_shr(size, 0);
init = root[0];
for (i = 0; i < size; i++) initialize(&Field(res, i), init);
}
Pop_roots();
return res;
}