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
|
/***********************************************************************/
/* */
/* Caml Special Light */
/* */
/* Xavier Leroy and Damien Doligez, INRIA Rocquencourt */
/* */
/* Copyright 1995 Institut National de Recherche en Informatique et */
/* Automatique. Distributed only by permission. */
/* */
/***********************************************************************/
/* $Id$ */
/* 1. Allocation functions doing the same work as the macros in the
case where [Setup_for_gc] and [Restore_after_gc] are no-ops.
2. Convenience functions related to allocation.
*/
#include <string.h>
#include "alloc.h"
#include "major_gc.h"
#include "memory.h"
#include "mlvalues.h"
#include "stacks.h"
#define Setup_for_gc
#define Restore_after_gc
value alloc (wosize, tag)
mlsize_t wosize;
tag_t tag;
{
value result;
Assert (wosize > 0 && wosize <= Max_young_wosize);
Alloc_small (result, wosize, tag);
return result;
}
value alloc_tuple(n)
mlsize_t n;
{
return alloc(n, 0);
}
value alloc_string (len)
mlsize_t len;
{
value result;
mlsize_t offset_index;
mlsize_t wosize = (len + sizeof (value)) / sizeof (value);
if (wosize <= Max_young_wosize) {
Alloc_small (result, wosize, String_tag);
}else{
result = alloc_shr (wosize, String_tag);
}
Field (result, wosize - 1) = 0;
offset_index = Bsize_wsize (wosize) - 1;
Byte (result, offset_index) = offset_index - len;
return result;
}
value alloc_final (len, fun, mem, max)
mlsize_t len;
final_fun fun;
mlsize_t mem, max;
{
value result = alloc_shr (len, Final_tag);
Field (result, 0) = (value) fun;
adjust_gc_speed (mem, max);
return result;
}
value copy_string(s)
char * s;
{
int len;
value res;
len = strlen(s);
res = alloc_string(len);
bcopy(s, String_val(res), len);
return res;
}
value alloc_array(funct, arr)
value (*funct) P((char *));
char ** arr;
{
mlsize_t nbr, n;
value v;
nbr = 0;
while (arr[nbr] != 0) nbr++;
if (nbr == 0) {
return Atom(0);
} else {
Push_roots(r, 1);
r[0] = nbr < Max_young_wosize ? alloc(nbr, 0) : alloc_shr(nbr, 0);
for (n = 0; n < nbr; n++)
Field(r[0], n) = Val_int(0);
for (n = 0; n < nbr; n++) {
v = funct(arr[n]);
modify(&Field(r[0], n), v);
}
v = r[0];
Pop_roots();
return v;
}
}
value copy_string_array(arr)
char ** arr;
{
return alloc_array(copy_string, arr);
}
int convert_flag_list(list, flags)
value list;
int * flags;
{
int res;
res = 0;
while (list != Val_int(0)) {
res |= flags[Int_val(Field(list, 0))];
list = Field(list, 1);
}
return res;
}
|
