Compiler techniques for code compaction (2000) [65 citations — 11 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Debray00compilertechniques,author = {Saumya Debray and William Evans and Robert Muth and Bjorn De Sutter},
title = {Compiler techniques for code compaction},
journal = {ACM Transactions on Programming Languages and Systems},
year = {2000},
volume = {22},
pages = {378--415}
}
Years of Citing Articles
Abstract:
In recent years there has been an increasing trend towards the incorporation of computers into a variety of devices where the amount of memory available is limited. This makes it desirable to try to reduce the size of applications where possible. This paper explores the use of compiler techniques to accomplish code compaction to yield smaller executables. The main contribution of this paper is to show that careful, aggressive, interprocedural optimization, together with procedural abstraction of repeated code fragments, can yield signicantly better reductions in code size than previous approaches, which have generally focused on abstraction of repeated instruction sequences. We also show how \equivalent " code fragments can be detected and factored out using conventional compiler techniques, and without having to resort to purely linear treatments of code sequences as in sux-tree-based approaches, thereby setting up a framework for code compaction that can be more exible in its treatment of what code fragments are considered equivalent. Our ideas have been implemented in the form of a binary-rewriting tool that reduces the size of executables by about 30 % on the average.
