Automatic generation of compiler backends. (16th January 2012)

• Record Type: Journal Article
• Authors: Brandner, Florian; Pavlu, Viktor; Krall, Andreas
• Is Part Of: Software, practice & experience. Volume 43:Number 2(2013)
• Page Start: 207
• Page End: 240
• Publication Date: 2012-01-16
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2106
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2106-abs-0001"> <title>SUMMARY</title> <p id="spe2106-para-0001">Application‐specific instruction set processors have proven successful in meeting the various design constraints of modern embedded systems and often provide the only viable trade‐off between computing power and opposing metrics such as power consumption. A promising approach to facilitate the exploration of processor design alternatives are processor description languages, which capture the instruction set and hardware organization of a processor. With the use of those processor models, various design tasks, for example, the adaption of software development tools, the generation of hardware models, and various verification tasks, can be automatized. These languages thus allow effective shortening of development turnaround times. In this work, the novel xADL language is presented, which, in contrast to most contemporary processor description languages, focuses on a structural modeling of the processor's hardware organization. However, a behavioral model of the instruction set is automatically derived using instruction set extraction. This provides a tight coupling between the structural hardware view and the instruction set view of the processor and reduces the complexity of processor models in comparison with existing languages. The feasibility of our approach is demonstrated by a compiler backend generator based on tree pattern matching. An important property of our generator is its ability to automatically verify whether the resulting compiler is complete, that is, it can process all possible input programs. The generated compilers are competitive to handcrafted production compilers, showing speedups of up to 20<italic>%</italic> for certain benchmarks. On average, moderate slowdowns between 3<italic>%</italic> and 15<italic>%</italic> have been observed for several processor models while considerable reductions in code size have been measured. Copyright © 2012 John Wiley & Sons, Ltd.</p> </abstract>