Date: Thu, 2 Sep 1999 01:09:39 +0200
From: Jerome Vouillon <Jerome.Vouillon@inria.fr>
To: firstname.lastname@example.org, Jerome Vouillon <Jerome.Vouillon@inria.fr>
Subject: Re: Efficency in OCaml
In-Reply-To: <199909011840.OAA01846@bismarck.chet.org>; from email@example.com on Wed, Sep 01, 1999 at 02:40:21PM -0400
On Wed, Sep 01, 1999 at 02:40:21PM -0400, firstname.lastname@example.org wrote:
> Is there a description of the Ocaml object and
> "virtual-function-table" format?
I have not written any description but I can explain it rapidly here.
Objective Caml uses a scheme which is also used in the Gnu Objective C
Each object holds a table containing its methods (the table is shared
among all objets of a same class). A unique integer is assigned at
run-time to each method name of a program. This integer is used as an
index in this table to find the method. As the table is rather sparse,
it is implemented as a two-level array (an array of arrays of
functions). So, a method call
"object#m e1 ... en"
is compile in something that looks like
"object.(0).(idx mod N).(idx / N) objet e1 ... en"
where idx is the integer associated to the method name "m".
This scheme is very flexible and rather efficient. It would be hard to
improve it actually. Indeed, one will always need one indirection to
know what class the object belongs to and another indirection to
retrieve the method. So one could only gain one indirection (the
arithmetics is more or less free, as it can be done in parallel).
Actually, there is yet another indirection, not shown here, to
retrieve a pointer to the code from the method closure. This
indirection could probably be optimize a bit (by doing it in parallel
with the retrieval of the closure).
A great part of the cost of a method call also comes from the fact
that calling an unknown function is more expansive than calling a know
function : there is a check to see if the function is called with less
arguments than it needs, more arguments or exactly the right number of
arguments. The only way to optimize this would be to make a global
analyze of the program during the compilation. This analyze would
determine whether at a given method invocation location "x#m" all
methods that could possibly be called are called with the right number
of arguments, and would also check whether the method invocation could
be replaced by a function call (that is, whether only one method can
be called from this location). In order to provide more opportunities
for optimization, one would also probably need to do some partial
evaluation. Implementing all this would require a lot of work...
> Also, well, I think there's been some recent work on analyzing the
> path-length of O-O code, and the conclusion has been that in fact,
> methods do just "call one other" a lot.
> That is, while C code is characterized by lots of tests and longer
> path-lengths per function-body, C++ (and Java, *especially* -- geez,
> it seems like Java code is all method-calls!) code tends to be short
> code-bodies, with branches implemented effectively by calling virtual
OCaml is first a functional langage so I think (I hope) that people do
not use objects as heavily as in Java, and for instance use pattern
matching rather than only method calls for implementing branches.
This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:25 MET