Optimizing Code Size Through Procedural Abstraction

Johan Runeson
Uppsala University and IAR systems AB

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 code compression technique is procedural abstractions, where repeated occurances of equivalent code fragments are factored out into new subroutines. Previously, procedural abstractions has been applied at the machine code level in optimizing linkers or binary rewriting tools. We have 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 independent, and will allow us to take advantage of powerful code selection, register allocation and code scheduling techniques.

ASTEC seminar
November 24, 2000, 13:15

Place: Information technology, Uppsala University
Room: 1510
Time: 13.15

Room 1510 is in Building 1, Floor 5, room 10 (in the southern part of the building).

Help on how get here and MIC campus drawing.

There will be an extended period for discussions after the seminar.

Speakers are encouraged to give an short (5 min) introduction to the subject at the begining of the talk.
Listeners are excused if they have to leave after 15.00.

Updated 10-Nov-2000 08:59 by Roland Grönroos
e-mail: info -at-    Location: