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
|
/***********************************************************************/
/* */
/* Objective Caml */
/* */
/* Xavier Leroy, projet Cristal, INRIA Rocquencourt */
/* */
/* Copyright 1996 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(value array, value index) /* ML */
{
long idx = Long_val(index);
if (idx < 0 || idx >= Wosize_val(array)) invalid_argument("Array.get");
return Field(array, idx);
}
value array_set(value array, value index, value newval) /* ML */
{
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(value len, value init) /* ML */
{
value res;
mlsize_t size, i;
size = Long_val(len);
if (size > Max_wosize) invalid_argument("Array.make");
Begin_root(init);
if (size == 0) {
res = Atom(0);
}
else if (size < Max_young_wosize) {
res = alloc(size, 0);
for (i = 0; i < size; i++) Field(res, i) = init;
}
else if (Is_block(init) && Is_young(init)) {
minor_collection();
res = alloc_shr(size, 0);
for (i = 0; i < size; i++) Field(res, i) = init;
res = check_urgent_gc (res);
}
else {
res = alloc_shr(size, 0);
for (i = 0; i < size; i++) initialize(&Field(res, i), init);
res = check_urgent_gc (res);
}
End_roots();
return res;
}
|
