Machine code optimization without time constraints

Eden izmed najpomembnejših korakov v postopku prevajanja je optimizacija, s pomočjo katere prevajalnik proizvede hitrejšo in učinkovitejšo strojno kodo. Prevajalniki morajo optimizacijo izvajati hitro, saj programer ne želi dolgo čakati na prevod svojega programa. V magistrskem delu želimo ugotoviti, če lahko s tem, da se ne oziramo na čas, izboljšamo že prevedene programe. Za odgovor na to vprašanje razvijemo optimizator za optimizacijo MMIX-ove strojne kode. Optimizator preizkusimo na množici testnih programov in analiziramo dobljene rezultate. Ugotovimo, da je optimizacija strojne kode veliko bolj odvisna od vrste in kvalitete optimizacij, ki jih izvajamo, kot pa od časa, ki ji ga namenimo. Kljub temu uspemo razviti optimizator, ki zmanjša tako dolžino programa kot tudi število izvedenih ukazov programa med njegovim izvajanjem.One of the most important steps in the process of compilation is optimization, with which compiler outputs quicker and more efficient machine code. Compilers have to optimize quickly, since programmers do not want to wait long to get compiled programs. In master thesis we want to find out if we can improve already compiled programs when we are not constrained with time. In order to find the answer to this question we have developed an optimizer that optimizes MMIX machine code. We test the optimizer on the set of test programs and analyse the results. We find out that machine code optimization is not constrained with time, but with the quality of designed optimizations. Despite that, we develop an optimizer, that successfully reduces the length of the program and the number of instructions during execution of the program