Re: deadcode optimization

Bjorn De Sutter <Bjorn.DeSutter@rug.ac.be>
1 Mar 2001 14:17:49 -0500

          From comp.compilers

Related articles
deadcode optimization khoury@club-internet.fr (Elie Khoury) (2001-03-01)
Re: deadcode optimization fjh@cs.mu.OZ.AU (2001-03-01)
Re: deadcode optimization broeker@physik.rwth-aachen.de (Hans-Bernhard Broeker) (2001-03-01)
Re: deadcode optimization Bjorn.DeSutter@rug.ac.be (Bjorn De Sutter) (2001-03-01)
Re: deadcode optimization guerby@acm.org (Laurent Guerby) (2001-03-01)
Re: deadcode optimization stonybrk@fubar.com (Norman Black) (2001-03-04)
Re: deadcode optimization fjh@cs.mu.OZ.AU (2001-03-08)
Re: deadcode optimization tgi@netgem.com (2001-03-08)
Re: deadcode optimization rog@vitanuova.com (2001-03-08)
Re: deadcode optimization stonybrk@ix.netcom.com (Norman Black) (2001-03-10)
[9 later articles]
| List of all articles for this month |
From: Bjorn De Sutter <Bjorn.DeSutter@rug.ac.be>
Newsgroups: comp.compilers
Date: 1 Mar 2001 14:17:49 -0500
Organization: Universiteit Gent
References: 01-03-012
Keywords: linker, optimize
Posted-Date: 01 Mar 2001 14:17:49 EST

Elie Khoury wrote:
> Is there a way to improve "deadcode removal" = the way the linker
> removes unreferenced functions, in order to have smaller executables ?


Squeeze is a post-link-time optimizer that removes unreachable
code. It includes some very sophisticated analyses, but also some
simpler analyses that we have implemented in post-link-time tools that
take only some seconds and result in 20% code elimination. The system
is written for Alpha code, but is generally applicable. It achieves
roughly the same result on Compaq and gcc compiled code.


You'll find more information at the Squeeze site:


http://www.cs.arizona.edu/squeeze


--
# Bjorn De Sutter
# http://www.elis.rug.ac.be/~brdsutte
# tel: +32 (9) 264 33 67
#
# Department of Electronics and Information Systems (ELIS)
# University of Gent, Flanders


Post a followup to this message

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