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 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392
|
/**************************************************************************/
/* */
/* OCaml */
/* */
/* Xavier Leroy and Damien Doligez, INRIA Rocquencourt */
/* */
/* Copyright 1996 Institut National de Recherche en Informatique et */
/* en Automatique. */
/* */
/* All rights reserved. This file is distributed under the terms of */
/* the GNU Lesser General Public License version 2.1, with the */
/* special exception on linking described in the file LICENSE. */
/* */
/**************************************************************************/
#define CAML_INTERNALS
/* 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 <stdarg.h>
#include "caml/alloc.h"
#include "caml/custom.h"
#include "caml/major_gc.h"
#include "caml/memory.h"
#include "caml/mlvalues.h"
#include "caml/fiber.h"
#include "caml/domain.h"
CAMLexport value caml_alloc (mlsize_t wosize, tag_t tag)
{
value result;
CAMLassert (tag < 256);
CAMLassert (tag != Infix_tag);
if (wosize <= Max_young_wosize){
if (wosize == 0){
result = Atom (tag);
}else{
Caml_check_caml_state();
Alloc_small (result, wosize, tag, Alloc_small_enter_GC);
if (tag < No_scan_tag){
for (mlsize_t i = 0; i < wosize; i++) Field (result, i) = Val_unit;
}
}
} else {
result = caml_alloc_shr (wosize, tag);
if (tag < No_scan_tag) {
for (mlsize_t i = 0; i < wosize; i++) Field (result, i) = Val_unit;
}
result = caml_check_urgent_gc (result);
}
return result;
}
/* This is used by the native compiler for large block allocations.
The resulting block can be filled with [caml_modify], or [caml_initialize],
or direct writes for integer values and code pointers.
If [tag == Closure_tag], no GC must take place until field 1
of the block has been set to the correct "arity & start of environment"
information (issue #11482). */
#ifdef NATIVE_CODE
CAMLexport value caml_alloc_shr_check_gc (mlsize_t wosize, tag_t tag)
{
CAMLassert(tag < No_scan_tag);
caml_check_urgent_gc (Val_unit);
value result = caml_alloc_shr (wosize, tag);
for (mlsize_t i = 0; i < wosize; i++) Field (result, i) = Val_unit;
return result;
}
#endif
/* Copy the values to be preserved to a different array.
The original vals array never escapes, generating better code in
the fast path. */
#define Enter_gc_preserve_vals(dom_st, wosize) do { \
CAMLparam0(); \
CAMLlocalN(vals_copy, (wosize)); \
for (mlsize_t j = 0; j < (wosize); j++) vals_copy[j] = vals[j]; \
Alloc_small_enter_GC(dom_st, wosize); \
for (mlsize_t j = 0; j < (wosize); j++) vals[j] = vals_copy[j]; \
CAMLdrop; \
} while (0)
/* This has to be done with a macro, rather than an inline function, since
otherwise the wosize parameter to CAMLlocalN expands to be a VLA, which
breaks MSVC. */
#define Do_alloc_small(wosize, tag, ...) \
{ \
Caml_check_caml_state(); \
value v; \
value vals[wosize] = {__VA_ARGS__}; \
CAMLassert ((tag) < 256); \
\
Alloc_small(v, wosize, tag, Enter_gc_preserve_vals); \
for (mlsize_t j = 0; j < (wosize); j++) { \
Field(v, j) = vals[j]; \
} \
return v; \
}
CAMLexport value caml_alloc_1 (tag_t tag, value a)
{
Do_alloc_small(1, tag, a);
}
CAMLexport value caml_alloc_2 (tag_t tag, value a, value b)
{
Do_alloc_small(2, tag, a, b);
}
CAMLexport value caml_alloc_3 (tag_t tag, value a, value b, value c)
{
Do_alloc_small(3, tag, a, b, c);
}
CAMLexport value caml_alloc_4 (tag_t tag, value a, value b, value c, value d)
{
Do_alloc_small(4, tag, a, b, c, d);
}
CAMLexport value caml_alloc_5 (tag_t tag, value a, value b, value c, value d,
value e)
{
Do_alloc_small(5, tag, a, b, c, d, e);
}
CAMLexport value caml_alloc_6 (tag_t tag, value a, value b, value c, value d,
value e, value f)
{
Do_alloc_small(6, tag, a, b, c, d, e, f);
}
CAMLexport value caml_alloc_7 (tag_t tag, value a, value b, value c, value d,
value e, value f, value g)
{
Do_alloc_small(7, tag, a, b, c, d, e, f, g);
}
CAMLexport value caml_alloc_8 (tag_t tag, value a, value b, value c, value d,
value e, value f, value g, value h)
{
Do_alloc_small(8, tag, a, b, c, d, e, f, g, h);
}
CAMLexport value caml_alloc_9 (tag_t tag, value a, value b, value c, value d,
value e, value f, value g, value h, value i)
{
Do_alloc_small(9, tag, a, b, c, d, e, f, g, h, i);
}
CAMLexport value caml_alloc_small (mlsize_t wosize, tag_t tag)
{
value result;
CAMLassert (wosize > 0);
CAMLassert (wosize <= Max_young_wosize);
CAMLassert (tag < 256);
CAMLassert (tag != Infix_tag);
Alloc_small (result, wosize, tag, Alloc_small_enter_GC);
return result;
}
/* [n] is a number of words (fields) */
CAMLexport value caml_alloc_tuple(mlsize_t n)
{
return caml_alloc(n, 0);
}
/* [len] is a number of bytes (chars) */
CAMLexport value caml_alloc_string (mlsize_t len)
{
value result;
mlsize_t offset_index;
mlsize_t wosize = (len + sizeof (value)) / sizeof (value);
if (wosize <= Max_young_wosize) {
Caml_check_caml_state();
Alloc_small (result, wosize, String_tag, Alloc_small_enter_GC);
}else{
result = caml_alloc_shr (wosize, String_tag);
result = caml_check_urgent_gc (result);
}
Field (result, wosize - 1) = 0;
offset_index = Bsize_wsize (wosize) - 1;
Byte (result, offset_index) = offset_index - len;
return result;
}
/* [len] is a number of bytes (chars) */
CAMLexport value caml_alloc_initialized_string (mlsize_t len, const char *p)
{
value result = caml_alloc_string (len);
memcpy((char *)String_val(result), p, len);
return result;
}
/* [len] is a number of words.
[mem] and [max] are relative (without unit).
*/
CAMLexport value caml_alloc_final (mlsize_t len, final_fun fun,
mlsize_t mem, mlsize_t max)
{
return caml_alloc_custom(caml_final_custom_operations(fun),
len * sizeof(value), mem, max);
}
CAMLexport value caml_copy_string(char const *s)
{
mlsize_t len;
value res;
len = strlen(s);
res = caml_alloc_initialized_string(len, s);
return res;
}
CAMLexport value caml_alloc_array(value (*funct)(char const *),
char const * const* arr)
{
CAMLparam0 ();
mlsize_t nbr;
CAMLlocal2 (v, result);
nbr = 0;
while (arr[nbr] != 0) nbr++;
result = caml_alloc (nbr, 0);
for (mlsize_t n = 0; n < nbr; n++) {
/* The two statements below must be separate because of evaluation
order (don't take the address &Field(result, n) before
calling funct, which may cause a GC and move result). */
v = funct(arr[n]);
caml_modify(&Field(result, n), v);
}
CAMLreturn (result);
}
/* [len] is a number of floats */
value caml_alloc_float_array(mlsize_t len)
{
#ifdef FLAT_FLOAT_ARRAY
Caml_check_caml_state();
mlsize_t wosize = len * Double_wosize;
value result;
/* For consistency with [caml_array_make], which can't tell whether it should
create a float array or not when the size is zero, the tag is set to
zero when the size is zero. */
if (wosize <= Max_young_wosize){
if (wosize == 0)
return Atom(0);
else
Alloc_small (result, wosize, Double_array_tag, Alloc_small_enter_GC);
} else {
result = caml_alloc_shr (wosize, Double_array_tag);
result = caml_check_urgent_gc (result);
}
return result;
#else
return caml_alloc (len, 0);
#endif
}
CAMLexport value caml_copy_string_array(char const * const * arr)
{
return caml_alloc_array(caml_copy_string, arr);
}
CAMLexport int caml_convert_flag_list(value list, const int *flags)
{
int res = 0;
for (/*nothing*/; list != Val_emptylist; list = Field(list, 1))
res |= flags[Int_val(Field(list, 0))];
return res;
}
/* For compiling let rec over values */
/* [size] is a [value] representing number of words (fields) */
CAMLprim value caml_alloc_dummy(value size)
{
mlsize_t wosize = Long_val(size);
return caml_alloc (wosize, 0);
}
/* [size] is a [value] representing number of words (fields) */
CAMLprim value caml_alloc_dummy_function(value size,value arity)
{
/* the arity argument is used by the js_of_ocaml runtime */
return caml_alloc_dummy(size);
}
/* [size] is a [value] representing number of floats. */
CAMLprim value caml_alloc_dummy_float (value size)
{
mlsize_t wosize = Long_val(size) * Double_wosize;
return caml_alloc (wosize, 0);
}
CAMLprim value caml_alloc_dummy_infix(value vsize, value voffset)
{
mlsize_t wosize = Long_val(vsize), offset = Long_val(voffset);
value v = caml_alloc(wosize, Closure_tag);
/* The following choice of closure info causes the GC to skip
the whole block contents. This is correct since the dummy
block contains no pointers into the heap. However, the block
cannot be marshaled or hashed, because not all closinfo fields
and infix header fields are correctly initialized. */
Closinfo_val(v) = Make_closinfo(0, wosize);
if (offset > 0) {
v += Bsize_wsize(offset);
(((header_t *) (v)) [-1]) = Make_header(offset, Infix_tag, 0);
}
return v;
}
CAMLprim value caml_update_dummy(value dummy, value newval)
{
mlsize_t size;
tag_t tag;
tag = Tag_val (newval);
if (Wosize_val(dummy) == 0) {
/* Size-0 blocks are statically-allocated atoms. We cannot
mutate them, but there is no need:
- All atoms used in the runtime to represent OCaml values
have tag 0 --- including empty flat float arrays, or other
types that use a non-0 tag for non-atom blocks.
- The dummy was already created with tag 0.
So doing nothing suffices. */
CAMLassert(Wosize_val(newval) == 0);
CAMLassert(Tag_val(dummy) == Tag_val(newval));
} else if (tag == Double_array_tag){
CAMLassert (Wosize_val(newval) == Wosize_val(dummy));
CAMLassert (Tag_val(dummy) != Infix_tag);
Unsafe_store_tag_val(dummy, Double_array_tag);
size = Wosize_val (newval) / Double_wosize;
for (mlsize_t i = 0; i < size; i++) {
Store_double_flat_field (dummy, i, Double_flat_field (newval, i));
}
} else if (tag == Infix_tag) {
value clos = newval - Infix_offset_hd(Hd_val(newval));
CAMLassert (Tag_val(clos) == Closure_tag);
CAMLassert (Tag_val(dummy) == Infix_tag);
CAMLassert (Infix_offset_val(dummy) == Infix_offset_val(newval));
dummy = dummy - Infix_offset_val(dummy);
size = Wosize_val(clos);
CAMLassert (size == Wosize_val(dummy));
/* It is safe to use [caml_modify] to copy code pointers
from [clos] to [dummy], because the value being overwritten is
an integer, and the new "value" is a pointer outside the minor
heap. */
for (mlsize_t i = 0; i < size; i++) {
caml_modify (&Field(dummy, i), Field(clos, i));
}
} else {
CAMLassert (tag < No_scan_tag);
CAMLassert (Tag_val(dummy) != Infix_tag);
Unsafe_store_tag_val(dummy, tag);
size = Wosize_val(newval);
CAMLassert (size == Wosize_val(dummy));
/* See comment above why this is safe even if [tag == Closure_tag]
and some of the "values" being copied are actually code pointers. */
for (mlsize_t i = 0; i < size; i++){
caml_modify (&Field(dummy, i), Field(newval, i));
}
}
return Val_unit;
}
CAMLexport value caml_alloc_some(value v)
{
CAMLparam1(v);
value some = caml_alloc_small(1, Tag_some);
Field(some, 0) = v;
CAMLreturn(some);
}
CAMLprim value caml_atomic_make_contended(value v)
{
CAMLparam1(v);
const mlsize_t sz = Wosize_bhsize(Cache_line_bsize);
value res = caml_alloc_shr(sz, 0);
caml_initialize(&Field(res, 0), v);
for (mlsize_t i = 1; i < sz; i++) Field(res, i) = Val_unit;
CAMLreturn(res);
}
|