152 lines
4.6 KiB
C
152 lines
4.6 KiB
C
/***********************************************************************/
|
|
/* */
|
|
/* Objective Caml */
|
|
/* */
|
|
/* Damien Doligez, projet Para, INRIA Rocquencourt */
|
|
/* */
|
|
/* Copyright 1997 Institut National de Recherche en Informatique et */
|
|
/* en Automatique. All rights reserved. This file is distributed */
|
|
/* under the terms of the GNU Library General Public License, with */
|
|
/* the special exception on linking described in file ../LICENSE. */
|
|
/* */
|
|
/***********************************************************************/
|
|
|
|
/* $Id$ */
|
|
|
|
/* Operations on weak arrays */
|
|
|
|
#include <string.h>
|
|
|
|
#include "alloc.h"
|
|
#include "fail.h"
|
|
#include "major_gc.h"
|
|
#include "memory.h"
|
|
#include "mlvalues.h"
|
|
|
|
value caml_weak_list_head = 0;
|
|
|
|
static value weak_dummy = 0;
|
|
value caml_weak_none = (value) &weak_dummy;
|
|
|
|
CAMLprim value caml_weak_create (value len)
|
|
{
|
|
mlsize_t size, i;
|
|
value res;
|
|
|
|
size = Long_val (len) + 1;
|
|
if (size <= 0 || size > Max_wosize) caml_invalid_argument ("Weak.create");
|
|
res = caml_alloc_shr (size, Abstract_tag);
|
|
for (i = 1; i < size; i++) Field (res, i) = caml_weak_none;
|
|
Field (res, 0) = caml_weak_list_head;
|
|
caml_weak_list_head = res;
|
|
return res;
|
|
}
|
|
|
|
#define None_val (Val_int(0))
|
|
#define Some_tag 0
|
|
|
|
CAMLprim value caml_weak_set (value ar, value n, value el)
|
|
{
|
|
mlsize_t offset = Long_val (n) + 1;
|
|
Assert (Is_in_heap (ar));
|
|
if (offset < 1 || offset >= Wosize_val (ar)){
|
|
caml_invalid_argument ("Weak.set");
|
|
}
|
|
if (el != None_val){
|
|
value v; Assert (Wosize_val (el) == 1);
|
|
v = Field (el, 0);
|
|
if (Is_block (v) && Is_young (v)){
|
|
/* modified version of Modify */
|
|
value old = Field (ar, offset);
|
|
Field (ar, offset) = v;
|
|
if (!(Is_block (old) && Is_young (old))){
|
|
if (caml_weak_ref_table.ptr >= caml_weak_ref_table.limit){
|
|
CAMLassert (caml_weak_ref_table.ptr == caml_weak_ref_table.limit);
|
|
caml_realloc_ref_table (&caml_weak_ref_table);
|
|
}
|
|
*caml_weak_ref_table.ptr++ = &Field (ar, offset);
|
|
}
|
|
}else{
|
|
Field (ar, offset) = v;
|
|
}
|
|
}
|
|
return Val_unit;
|
|
}
|
|
|
|
#define Setup_for_gc
|
|
#define Restore_after_gc
|
|
|
|
CAMLprim value caml_weak_get (value ar, value n)
|
|
{
|
|
CAMLparam2 (ar, n);
|
|
mlsize_t offset = Long_val (n) + 1;
|
|
CAMLlocal2 (res, elt);
|
|
Assert (Is_in_heap (ar));
|
|
if (offset < 1 || offset >= Wosize_val (ar)){
|
|
caml_invalid_argument ("Weak.get");
|
|
}
|
|
if (Field (ar, offset) == caml_weak_none){
|
|
res = None_val;
|
|
}else{
|
|
elt = Field (ar, offset);
|
|
if (caml_gc_phase == Phase_mark && Is_block (elt) && Is_in_heap (elt)){
|
|
caml_darken (elt, NULL);
|
|
}
|
|
res = caml_alloc_small (1, Some_tag);
|
|
Field (res, 0) = elt;
|
|
}
|
|
CAMLreturn (res);
|
|
}
|
|
|
|
#undef Setup_for_gc
|
|
#undef Restore_after_gc
|
|
|
|
CAMLprim value caml_weak_get_copy (value ar, value n)
|
|
{
|
|
CAMLparam2 (ar, n);
|
|
mlsize_t offset = Long_val (n) + 1;
|
|
CAMLlocal2 (res, elt);
|
|
value v; /* Caution: this is NOT a local root. */
|
|
Assert (Is_in_heap (ar));
|
|
if (offset < 1 || offset >= Wosize_val (ar)){
|
|
caml_invalid_argument ("Weak.get");
|
|
}
|
|
|
|
v = Field (ar, offset);
|
|
if (v == caml_weak_none) CAMLreturn (None_val);
|
|
if (Is_block (v) && Is_in_heap_or_young(v)) {
|
|
elt = caml_alloc (Wosize_val (v), Tag_val (v));
|
|
/* The GC may erase or move v during this call to caml_alloc. */
|
|
v = Field (ar, offset);
|
|
if (v == caml_weak_none) CAMLreturn (None_val);
|
|
if (Tag_val (v) < No_scan_tag){
|
|
mlsize_t i;
|
|
for (i = 0; i < Wosize_val (v); i++){
|
|
value f = Field (v, i);
|
|
if (caml_gc_phase == Phase_mark && Is_block (f) && Is_in_heap (f)){
|
|
caml_darken (f, NULL);
|
|
}
|
|
Modify (&Field (elt, i), f);
|
|
}
|
|
}else{
|
|
memmove (Bp_val (elt), Bp_val (v), Bosize_val (v));
|
|
}
|
|
}else{
|
|
elt = v;
|
|
}
|
|
res = caml_alloc_small (1, Some_tag);
|
|
Field (res, 0) = elt;
|
|
|
|
CAMLreturn (res);
|
|
}
|
|
|
|
CAMLprim value caml_weak_check (value ar, value n)
|
|
{
|
|
mlsize_t offset = Long_val (n) + 1;
|
|
Assert (Is_in_heap (ar));
|
|
if (offset < 1 || offset >= Wosize_val (ar)){
|
|
caml_invalid_argument ("Weak.get");
|
|
}
|
|
return Val_bool (Field (ar, offset) != caml_weak_none);
|
|
}
|