Browse thread
[Caml-list] Does Caml have slow arithmetics ?
-
Diego Olivier Fernandez Pons
- Richard Jones
-
Basile Starynkevitch [local]
- Diego Olivier Fernandez Pons
-
Evgeny Chukreev
-
Xavier Leroy
- Evgeny Chukreev
-
skaller
- David Brown
- Alex Baretta
- Jon Harrop
-
Xavier Leroy
[
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: | -- (:) |
| From: | Olivier_Pérès <olivier.peres@l...> |
| Subject: | Re: [Caml-list] Does Caml have slow arithmetics ? |
David Brown wrote:
> No. Aligned C pointers look like pointers to the GC. It uses a bitmap
> to distinguish between C pointers and ocaml heap managed pointers.
> Misaligned pointers are the ones that will look like integers to the GC.
Once again, you are not talking about the same thing as I am. In the
suggested new system, aligned C pointers would look like (0-tagged) Caml
integers and thus the GC would not even consider collecting them, which
is good. However, the check whether a (1-tagged) pointer was allocated
by Caml would remain necessary, because C pointers can have their LSB
set, even if it is seldom so. Therefore I wonder whether this would be
useful at all. It was not my intention to say this three times, so I'm
stopping there so as not to pollute the list.
Olivier.
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners