Re: Dynamic Binding

  "Rodrigo Augusto B. Ferreira" <raugfer@uol.com.br> writes:
>I was wondering if using dynamic type resolution, by compiling a
>lookup switch statement for each virtual call, would be valuable to
>increase the possibility of optimization.


@InProceedings{zendra+97,
    author = "Olivier Zendra and Dominique Colnet and Suzanne Collin",
    title = "Efficient Dynamic Dispatch without Virtual Function
Tables. The {SmallEiffel} Compiler.",
    crossref = "oopsla97",
    pages = "125--141",
    annote = "The SmallEiffel Compiler does not use virtual
function tables. Instead, it represents types with
integers and uses binary search (coded as an
if-tree) to find the right method for a
selector. The compiler uses type analysis to
determine the possible receiver types at each call
site. The compiler generates a dispatch function for
each (used) set of receiver types for a
selector. The compiler recompiles the whole program
every time, but is fast enough (5000 lines/s
Eiffel-to-C on a Pentium Pro 200) to make this
practical; the C compiler then recompiles only the
changed parts. The paper presents some empirical
results that show that the binary search outperforms
the VFT approach for an unpredictable trimorphic
call, and still performs better on some machines for
a megamorphic (50 types) call."
}


@Proceedings{oopsla97,
    title = "Conference on Object-Oriented Programming Systems,
Languages \& Applications (OOPSLA '97)",
    booktitle = "Conference on Object-Oriented Programming Systems,
Languages \& Applications (OOPSLA '97)",
    year = "1997",
    key = "OOPSLA '97",
}


- anton
--
M. Anton Ertl Some things have to be seen to be believed
anton@mips.complang.tuwien.ac.at Most things have to be believed to be seen
http://www.complang.tuwien.ac.at/anton/home.html

Return to the comp.compilers page.
Search the comp.compilers archives again.