Browse thread
[Caml-list] Object-oriented access bottleneck
[
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: | malc <malc@p...> |
| Subject: | Re: [Caml-list] Object-oriented access bottleneck |
On Mon, 8 Dec 2003, Brian Hurt wrote: > Attached is some microbenchmarking code I just whomped together. It gives > both C and Ocaml timings on tight loops of functions calls. The results: > > My conclusions: > > - Despite my best efforts, ocaml inlined (and removed) the call to foo. > In general this is good, but it did defeat my efforts to time how long a > direct function call took. For some reason it didn't also eliminate the > for loops. If I had to guess, Ocaml's call to a known function is about > the same speed as C's. Make foo recursive (as in 'let rec foo' vs 'let foo'), OCaml will not inline it. -- mailto:malc@pulsesoft.com ------------------- 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