Hi SBCL developers,
My colleague Mr. Abe is writing a paper about compiler optimization
strategies used in Allegro/SBCL/Lispworks.
There are two questions about SBCL he would like to ask. It would be
really appreciated, if you can give some information on these.
1. The scheme of the instruction selector
What scheme the instruction selector uses to achieve
optimal or optimum instruction selection ?
Is it, for example, dynamic-programming based,
or Graham and Glanville approaches ?
2. Coalescing method in the register allocator
What method the register allocator uses to coalesce registers ?
Is it aggressive, iterated, or based on another criteria ?
Mathematical Systems, Inc.
Tel: 03-3358-1809 (ext: 1155)