Browse thread
OCaml and Boehm
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2009-04-13 (13:15) |
From: | Lukasz Stafiniak <lukstafi@g...> |
Subject: | Re: [Caml-list] OCaml and Boehm |
On Mon, Apr 13, 2009 at 11:42 AM, Christoph Bauer <c-bauer-olsbruecken@t-online.de> wrote: > Basile STARYNKEVITCH <basile@starynkevitch.net> writes: > >> My advice is always to avoid mixing several garbage collection >> techniques or implementations inside the same program. >> > > TCL uses refcounted Tcl_Objs. We use these Tcl_Objs in OCaml for a long > time. And it works excellent. > > So I guess, it's easier to use smart pointers. > I'll restate my question: is it the same deal with Boehm, or is it really more difficult with Boehm? I'm not talking about Boehm starting from Caml roots -- this would be too difficult I guess (?), although the only way to get back the full performance. Instead, just as with smart pointers: every wrapper would register a Boehm-GC root with GC_MALLOC_UNCOLLECTABLE, and a finalizer would deregister it with GC_FREE. A performance hit, but at least doesn't hit the C++ code. Thanks in advance. £ukasz