Any further work on superoptimizer?

Henry Massalin published a paper on a superoptimizer in ASPLOS II, 1987
[1]. One important aspect of this work was the generation of *branchless*
run-time library routines for simple functions (e.g., absolute value, max)
that could be in-line substituted. Thus the overhead of procedure call
and the problem of branch stalls / delay slot scheduling were avoided.
Has there been other work in this vein for current processors? What is
the state of practice? Are current SPARC, MIPS, etc. compilers using this
technique for frequently-used library functions?


    [1] H. Massalin, "Superoptimizer: A look at the smallest program,"
            Proc. 2nd Intl. Conf. on Arch. Support for Prog. Langs. and
            Op. Sys., Palo Alto, October 1987, pp. 122-126.
--
Mark Smotherman, CS Dept., Clemson University, Clemson, SC 29634-1906
    (803) 656-5878, mark@cs.clemson.edu or mark@hubcap.clemson.edu
--

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