Optimizing Code Size through Procedural Abstraction

Autor:	Johan Runeson, Sven-Olof Nyström, Jan Sjödin
Rok vydání:	2001
Předmět:	Threaded code Dead code Object code Computer science Programming language Loop-invariant code motion Code generation Parallel computing Unreachable code computer.software_genre Code bloat computer Dead code elimination
Zdroj:	Lecture Notes in Computer Science ISBN: 9783540417811 LCTES
DOI:	10.1007/3-540-45245-1_14
Popis:	Memory size is an important economic factor in the development of embedded systems. It is therefore desirable to find compiler optimization techniques that reduce the size of the generated code. One such technique is procedural abstraction, where repeated occurrences of equivalent code fragments are factored out into new subroutines. Previously, procedural abstraction has been applied at the machine code level in optimizing linkers or binary rewriting tools. We investigate the prospects of applying procedural abstraction at the intermediate code level of a whole-program optimizing C compiler. Placing the optimization before register allocation makes it target indepentdent, and will allow us to take full advantage of powerful code selection, register allocation and code scheduling techniques.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::0229b59750faff825bd5817b5aaabfb8 https://doi.org/10.1007/3-540-45245-1_14 Zobrazit plný text záznamu