Procedural Abstraction for ARM-Architectures

摘要: Goal of this diploma thesis was it to create program code for embedded systems as compact possible, because memory is one the limiting factor on theses systems. As there are often various procedure with same very similar fragments, compilers do not generate optimal in terms size. Most these fragments only differ ordering instructions or used registers. These can be abstracted own procedures which afterwards get called. Because modern optimize a module at time, they lack information optimizations. Some optimizations evolve after final register allocation and linking all modules libraries. we apply procedural abstraction theis statically linked binaries. In contrast already existing tools, search identical by textual comparison through so called suffix trees, new approach thesis. At first data dependencies among assembler computed flow graph constructed each basic block. On graphs mining tool ParMol identify fragment that extracted use abstraction. traditional aproaches where able save twice much average our based approach.