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: | Luc Maranget <Luc.Maranget@i...> |
| Subject: | Re: [Caml-list] Does Caml have slow arithmetics ? |
> > + ocamlc does perform tail call elimation > > + ocamlopt does it less often. Namely, calls in tail position > > become real tail calls when all their arguments are passed in registers. > > (This does not apply to self-tail calls which are always optimized) > > > Oups sorry... In fact you need 7 arguments or more in the callee to trigger the unoptimized behavior on a pentium (just checked this time). > > What?! Is this true? This effectively means that I cannot count on > tail-call elimination in general? Do not take it that bad. In practice, it does not matter much I guess. I guess that any ocamlopt back-end passes at least the first six argument in registers (and six is a lot). Besides stack grow is a less severe issue in native code than it is in byte code. At least in Unix, the process stack may grow to important sizes. --Luc ------------------- 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