2016-02-18 07:11:59 -08:00
|
|
|
/**************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* OCaml */
|
|
|
|
/* */
|
|
|
|
/* Xavier Leroy, projet Cristal, 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. */
|
|
|
|
/* */
|
|
|
|
/**************************************************************************/
|
1995-08-09 08:06:35 -07:00
|
|
|
|
2016-07-04 10:00:57 -07:00
|
|
|
#define CAML_INTERNALS
|
|
|
|
|
1995-07-11 11:09:15 -07:00
|
|
|
/* Operations on objects */
|
|
|
|
|
2003-06-23 05:46:13 -07:00
|
|
|
#include <string.h>
|
2014-12-27 06:41:49 -08:00
|
|
|
#include "caml/alloc.h"
|
|
|
|
#include "caml/fail.h"
|
|
|
|
#include "caml/gc.h"
|
|
|
|
#include "caml/interp.h"
|
|
|
|
#include "caml/major_gc.h"
|
|
|
|
#include "caml/memory.h"
|
|
|
|
#include "caml/minor_gc.h"
|
|
|
|
#include "caml/misc.h"
|
|
|
|
#include "caml/mlvalues.h"
|
|
|
|
#include "caml/prims.h"
|
2019-10-09 11:18:44 -07:00
|
|
|
#include "caml/signals.h"
|
1995-07-11 11:09:15 -07:00
|
|
|
|
2004-01-01 08:42:43 -08:00
|
|
|
CAMLprim value caml_obj_tag(value arg)
|
1995-07-11 11:09:15 -07:00
|
|
|
{
|
2003-10-16 16:22:23 -07:00
|
|
|
if (Is_long (arg)){
|
2008-01-29 05:11:15 -08:00
|
|
|
return Val_int (1000); /* int_tag */
|
|
|
|
}else if ((long) arg & (sizeof (value) - 1)){
|
|
|
|
return Val_int (1002); /* unaligned_tag */
|
2008-01-03 01:37:10 -08:00
|
|
|
}else if (Is_in_value_area (arg)){
|
2003-10-16 16:22:23 -07:00
|
|
|
return Val_int(Tag_val(arg));
|
|
|
|
}else{
|
2008-01-29 05:11:15 -08:00
|
|
|
return Val_int (1001); /* out_of_heap_tag */
|
2003-10-16 16:22:23 -07:00
|
|
|
}
|
1995-07-11 11:09:15 -07:00
|
|
|
}
|
|
|
|
|
2004-01-01 08:42:43 -08:00
|
|
|
CAMLprim value caml_obj_set_tag (value arg, value new_tag)
|
2002-01-20 09:39:10 -08:00
|
|
|
{
|
|
|
|
Tag_val (arg) = Int_val (new_tag);
|
|
|
|
return Val_unit;
|
|
|
|
}
|
|
|
|
|
2020-06-08 10:32:17 -07:00
|
|
|
CAMLprim value caml_obj_raw_field(value arg, value pos)
|
|
|
|
{
|
|
|
|
/* Represent field contents as a native integer */
|
|
|
|
return caml_copy_nativeint((intnat) Field(arg, Long_val(pos)));
|
|
|
|
}
|
|
|
|
|
|
|
|
CAMLprim value caml_obj_set_raw_field(value arg, value pos, value bits)
|
|
|
|
{
|
|
|
|
Field(arg, Long_val(pos)) = (value) Nativeint_val(bits);
|
|
|
|
return Val_unit;
|
|
|
|
}
|
|
|
|
|
2019-02-12 03:12:59 -08:00
|
|
|
CAMLprim value caml_obj_make_forward (value blk, value fwd)
|
|
|
|
{
|
|
|
|
caml_modify(&Field(blk, 0), fwd);
|
|
|
|
Tag_val (blk) = Forward_tag;
|
|
|
|
return Val_unit;
|
|
|
|
}
|
|
|
|
|
2014-12-12 07:18:04 -08:00
|
|
|
/* [size] is a value encoding a number of blocks */
|
2004-01-01 08:42:43 -08:00
|
|
|
CAMLprim value caml_obj_block(value tag, value size)
|
1995-07-11 11:09:15 -07:00
|
|
|
{
|
|
|
|
value res;
|
2020-05-02 09:47:16 -07:00
|
|
|
mlsize_t sz;
|
1995-07-11 11:09:15 -07:00
|
|
|
tag_t tg;
|
|
|
|
|
|
|
|
sz = Long_val(size);
|
|
|
|
tg = Long_val(tag);
|
2020-05-02 09:47:16 -07:00
|
|
|
|
|
|
|
/* When [tg < No_scan_tag], [caml_alloc] returns an object whose fields are
|
|
|
|
* initialised to [Val_unit]. Otherwise, the fields are uninitialised. We aim
|
2020-06-19 08:41:08 -07:00
|
|
|
* to avoid inconsistent states in other cases, on a best-effort basis --
|
|
|
|
* by default there is no initialization. */
|
|
|
|
switch (tg) {
|
|
|
|
default: {
|
|
|
|
res = caml_alloc(sz, tg);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Abstract_tag:
|
|
|
|
case Double_tag:
|
|
|
|
case Double_array_tag: {
|
|
|
|
/* In these cases, the initial content is irrelevant,
|
|
|
|
no specific initialization needed. */
|
|
|
|
res = caml_alloc(sz, tg);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Closure_tag: {
|
|
|
|
/* [Closure_tag] is below [no_scan_tag], but closures have more
|
|
|
|
structure with in particular a "closure information" that
|
|
|
|
indicates where the environment starts. We initialize this to
|
|
|
|
a sane value, as it may be accessed by runtime functions. */
|
|
|
|
/* Closinfo_val is the second field, so we need size at least 2 */
|
|
|
|
if (sz < 2) caml_invalid_argument ("Obj.new_block");
|
|
|
|
res = caml_alloc(sz, tg);
|
|
|
|
Closinfo_val(res) = Make_closinfo(0, 2); /* does not allocate */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case String_tag: {
|
|
|
|
/* For [String_tag], the initial content does not matter. However,
|
|
|
|
the length of the string is encoded using the last byte of the
|
|
|
|
block. For this reason, the blocks with [String_tag] cannot be
|
|
|
|
of size [0]. We initialise the last byte to [0] such that the
|
|
|
|
length returned by [String.length] and [Bytes.length] is
|
|
|
|
a non-negative number. */
|
2020-05-02 09:47:16 -07:00
|
|
|
if (sz == 0) caml_invalid_argument ("Obj.new_block");
|
2020-06-19 08:41:08 -07:00
|
|
|
res = caml_alloc(sz, tg);
|
2020-05-02 09:47:16 -07:00
|
|
|
Field (res, sz - 1) = 0;
|
2020-06-19 08:41:08 -07:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
case Custom_tag: {
|
|
|
|
/* It is difficult to correctly use custom objects allocated
|
|
|
|
through [Obj.new_block], so we disallow it completely. The
|
|
|
|
first field of a custom object must contain a valid pointer to
|
|
|
|
a block of custom operations. Without initialisation, hashing,
|
|
|
|
finalising or serialising this custom object will lead to
|
|
|
|
crashes. See #9513 for more details. */
|
|
|
|
caml_invalid_argument ("Obj.new_block");
|
|
|
|
}
|
2020-05-02 09:47:16 -07:00
|
|
|
}
|
1995-07-11 11:09:15 -07:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2019-02-12 03:12:59 -08:00
|
|
|
CAMLprim value caml_obj_with_tag(value new_tag_v, value arg)
|
1998-06-24 12:22:26 -07:00
|
|
|
{
|
2019-02-12 03:12:59 -08:00
|
|
|
CAMLparam2 (new_tag_v, arg);
|
1999-11-29 11:03:05 -08:00
|
|
|
CAMLlocal1 (res);
|
1998-06-24 12:22:26 -07:00
|
|
|
mlsize_t sz, i;
|
|
|
|
tag_t tg;
|
|
|
|
|
|
|
|
sz = Wosize_val(arg);
|
2019-02-12 03:12:59 -08:00
|
|
|
tg = (tag_t)Long_val(new_tag_v);
|
2019-02-12 07:22:37 -08:00
|
|
|
if (sz == 0) CAMLreturn (Atom(tg));
|
2003-06-23 05:46:13 -07:00
|
|
|
if (tg >= No_scan_tag) {
|
2003-12-29 14:15:02 -08:00
|
|
|
res = caml_alloc(sz, tg);
|
2003-06-23 05:46:13 -07:00
|
|
|
memcpy(Bp_val(res), Bp_val(arg), sz * sizeof(value));
|
|
|
|
} else if (sz <= Max_young_wosize) {
|
2020-10-08 06:19:31 -07:00
|
|
|
res = caml_alloc_small(sz, tg);
|
2003-06-23 05:46:13 -07:00
|
|
|
for (i = 0; i < sz; i++) Field(res, i) = Field(arg, i);
|
|
|
|
} else {
|
2003-12-31 06:20:40 -08:00
|
|
|
res = caml_alloc_shr(sz, tg);
|
2020-06-17 07:03:51 -07:00
|
|
|
/* It is safe to use [caml_initialize] even if [tag == Closure_tag]
|
|
|
|
and some of the "values" being copied are actually code pointers.
|
|
|
|
That's because the new "value" does not point to the minor heap. */
|
2003-12-31 06:20:40 -08:00
|
|
|
for (i = 0; i < sz; i++) caml_initialize(&Field(res, i), Field(arg, i));
|
2020-06-17 07:03:51 -07:00
|
|
|
/* Give gc a chance to run, and run memprof callbacks */
|
2019-10-14 05:19:11 -07:00
|
|
|
caml_process_pending_actions();
|
2003-06-23 05:46:13 -07:00
|
|
|
}
|
1999-11-29 11:03:05 -08:00
|
|
|
CAMLreturn (res);
|
1998-06-24 12:22:26 -07:00
|
|
|
}
|
1998-08-27 05:11:51 -07:00
|
|
|
|
2019-02-12 03:12:59 -08:00
|
|
|
CAMLprim value caml_obj_dup(value arg)
|
|
|
|
{
|
|
|
|
return caml_obj_with_tag(Val_long(Tag_val(arg)), arg);
|
|
|
|
}
|
|
|
|
|
1998-08-27 05:11:51 -07:00
|
|
|
/* Shorten the given block to the given size and return void.
|
|
|
|
Raise Invalid_argument if the given size is less than or equal
|
|
|
|
to 0 or greater than the current size.
|
|
|
|
|
|
|
|
algorithm:
|
2015-11-20 08:54:26 -08:00
|
|
|
Change the length field of the header. Make up a black object
|
1998-08-27 05:11:51 -07:00
|
|
|
with the leftover part of the object: this is needed in the major
|
2015-11-20 08:54:26 -08:00
|
|
|
heap and harmless in the minor heap. The object cannot be white
|
|
|
|
because there may still be references to it in the ref table. By
|
|
|
|
using a black object we ensure that the ref table will be emptied
|
|
|
|
before the block is reallocated (since there must be a minor
|
|
|
|
collection within each major cycle).
|
2014-12-12 07:18:04 -08:00
|
|
|
|
2017-08-31 06:25:15 -07:00
|
|
|
[newsize] is a value encoding a number of fields (words, except
|
|
|
|
for float arrays on 32-bit architectures).
|
1998-08-27 05:11:51 -07:00
|
|
|
*/
|
2004-01-01 08:42:43 -08:00
|
|
|
CAMLprim value caml_obj_truncate (value v, value newsize)
|
1998-08-27 05:11:51 -07:00
|
|
|
{
|
|
|
|
mlsize_t new_wosize = Long_val (newsize);
|
|
|
|
header_t hd = Hd_val (v);
|
|
|
|
tag_t tag = Tag_hd (hd);
|
|
|
|
color_t color = Color_hd (hd);
|
2019-09-18 04:21:24 -07:00
|
|
|
color_t frag_color = Is_young(v) ? 0 : Caml_black;
|
1998-08-27 05:11:51 -07:00
|
|
|
mlsize_t wosize = Wosize_hd (hd);
|
2000-03-30 09:29:09 -08:00
|
|
|
mlsize_t i;
|
1998-08-27 05:11:51 -07:00
|
|
|
|
2019-03-18 02:42:23 -07:00
|
|
|
if (tag == Double_array_tag) new_wosize *= Double_wosize; /* PR#2520 */
|
2000-07-10 04:28:38 -07:00
|
|
|
|
2004-01-01 08:42:43 -08:00
|
|
|
if (new_wosize <= 0 || new_wosize > wosize){
|
|
|
|
caml_invalid_argument ("Obj.truncate");
|
|
|
|
}
|
1998-08-27 05:11:51 -07:00
|
|
|
if (new_wosize == wosize) return Val_unit;
|
2019-03-18 02:42:23 -07:00
|
|
|
/* PR#2400: since we're about to lose our references to the elements
|
2000-03-30 09:29:09 -08:00
|
|
|
beyond new_wosize in v, erase them explicitly so that the GC
|
|
|
|
can darken them as appropriate. */
|
2000-03-30 09:33:43 -08:00
|
|
|
if (tag < No_scan_tag) {
|
2000-04-03 01:34:22 -07:00
|
|
|
for (i = new_wosize; i < wosize; i++){
|
2003-12-31 06:20:40 -08:00
|
|
|
caml_modify(&Field(v, i), Val_unit);
|
2000-04-03 01:34:22 -07:00
|
|
|
#ifdef DEBUG
|
|
|
|
Field (v, i) = Debug_free_truncate;
|
|
|
|
#endif
|
|
|
|
}
|
2000-03-30 09:33:43 -08:00
|
|
|
}
|
2002-06-05 05:10:40 -07:00
|
|
|
/* We must use an odd tag for the header of the leftovers so it does not
|
|
|
|
look like a pointer because there may be some references to it in
|
|
|
|
ref_table. */
|
1998-08-27 05:11:51 -07:00
|
|
|
Field (v, new_wosize) =
|
2019-09-18 04:21:24 -07:00
|
|
|
Make_header (Wosize_whsize (wosize-new_wosize), Abstract_tag, frag_color);
|
2016-07-29 07:07:10 -07:00
|
|
|
Hd_val (v) =
|
|
|
|
Make_header_with_profinfo (new_wosize, tag, color, Profinfo_val(v));
|
1998-08-27 05:11:51 -07:00
|
|
|
return Val_unit;
|
|
|
|
}
|
2002-09-18 06:59:27 -07:00
|
|
|
|
2010-01-20 08:26:46 -08:00
|
|
|
CAMLprim value caml_obj_add_offset (value v, value offset)
|
|
|
|
{
|
2010-01-25 03:55:30 -08:00
|
|
|
return v + (unsigned long) Int32_val (offset);
|
2010-01-20 08:26:46 -08:00
|
|
|
}
|
2002-09-18 06:59:27 -07:00
|
|
|
|
2020-07-07 08:07:25 -07:00
|
|
|
/* The following function is used in stdlib/lazy.ml.
|
|
|
|
It is not written in OCaml because it must be atomic with respect
|
2002-09-18 06:59:27 -07:00
|
|
|
to the GC.
|
|
|
|
*/
|
|
|
|
|
2004-01-01 08:42:43 -08:00
|
|
|
CAMLprim value caml_lazy_make_forward (value v)
|
2003-10-16 16:22:23 -07:00
|
|
|
{
|
|
|
|
CAMLparam1 (v);
|
|
|
|
CAMLlocal1 (res);
|
|
|
|
|
2003-12-29 14:15:02 -08:00
|
|
|
res = caml_alloc_small (1, Forward_tag);
|
2011-12-30 08:29:14 -08:00
|
|
|
Field (res, 0) = v;
|
2003-10-16 16:22:23 -07:00
|
|
|
CAMLreturn (res);
|
|
|
|
}
|
2004-05-26 04:10:52 -07:00
|
|
|
|
2008-01-25 00:39:49 -08:00
|
|
|
/* For mlvalues.h and camlinternalOO.ml
|
2004-05-26 04:10:52 -07:00
|
|
|
See also GETPUBMET in interp.c
|
|
|
|
*/
|
|
|
|
|
|
|
|
CAMLprim value caml_get_public_method (value obj, value tag)
|
|
|
|
{
|
|
|
|
value meths = Field (obj, 0);
|
|
|
|
int li = 3, hi = Field(meths,0), mi;
|
|
|
|
while (li < hi) {
|
|
|
|
mi = ((li+hi) >> 1) | 1;
|
|
|
|
if (tag < Field(meths,mi)) hi = mi-2;
|
|
|
|
else li = mi;
|
|
|
|
}
|
2008-01-25 00:39:49 -08:00
|
|
|
/* return 0 if tag is not there */
|
|
|
|
return (tag == Field(meths,li) ? Field (meths, li-1) : 0);
|
2004-05-26 04:10:52 -07:00
|
|
|
}
|
|
|
|
|
2013-10-23 07:28:31 -07:00
|
|
|
static value oo_last_id = Val_int(0);
|
|
|
|
|
|
|
|
CAMLprim value caml_set_oo_id (value obj) {
|
|
|
|
Field(obj, 1) = oo_last_id;
|
|
|
|
oo_last_id += 2;
|
|
|
|
return obj;
|
|
|
|
}
|
2014-05-02 05:47:02 -07:00
|
|
|
|
2015-10-28 03:56:49 -07:00
|
|
|
CAMLprim value caml_fresh_oo_id (value v) {
|
|
|
|
v = oo_last_id;
|
|
|
|
oo_last_id += 2;
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
2014-05-02 05:47:02 -07:00
|
|
|
CAMLprim value caml_int_as_pointer (value n) {
|
|
|
|
return n - 1;
|
|
|
|
}
|
2016-04-25 09:27:38 -07:00
|
|
|
|
|
|
|
/* Compute how many words in the heap are occupied by blocks accessible
|
|
|
|
from a given value */
|
|
|
|
|
|
|
|
#define ENTRIES_PER_QUEUE_CHUNK 4096
|
|
|
|
struct queue_chunk {
|
|
|
|
struct queue_chunk *next;
|
|
|
|
value entries[ENTRIES_PER_QUEUE_CHUNK];
|
|
|
|
};
|