|
|
C Compiler for AVR32 Microprocesor
Nagy, Michal ; Husár, Adam (referee) ; Hruška, Tomáš (advisor)
This bachelor's thesis deals with creation of an AVR32 backend for the LLVM compiler framework. The core of this work consists of explaining the way of architecture description in LLVM and of my own implementation of the AVR32 backend. Furthermore, several problems encountered during the implementation are discussed along with their possible solutions. As the result of this work functional backend, with a few constraints discussed in the conclusion chapter, was created.
|
|
|
Instruction Set Completness Detection for Retargetable C Compiler Generation
Nagy, Michal ; Dolíhal, Luděk (referee) ; Hruška, Tomáš (advisor)
This thesis concerns the issue of completness detection of instruction set description for the LLVM compiler, or the ability of a compiler to generate target program for every valid source program in the appropriate high-level programming language. On the basis of regular tree grammar theory and several scietific theses that also concern this issue, formal tool for inclusion checking of two grammars. Furthermore a method for automatic extraction of the two grammars from the instruction set description has been devised, as a result of which the tool can be used for checking completeness of instruction selection. In combination with checking completeness of the legalization process of the LLVM compiler, which preceeds the instruction selection, it should be feaseable to check completeness of most compiler parts dependent on the target architecture.
|
|
|
C Compiler for AVR32 Microprocesor
Nagy, Michal ; Husár, Adam (referee) ; Hruška, Tomáš (advisor)
This bachelor's thesis deals with creation of an AVR32 backend for the LLVM compiler framework. The core of this work consists of explaining the way of architecture description in LLVM and of my own implementation of the AVR32 backend. Furthermore, several problems encountered during the implementation are discussed along with their possible solutions. As the result of this work functional backend, with a few constraints discussed in the conclusion chapter, was created.
|
|
|
Instruction Set Completness Detection for Retargetable C Compiler Generation
Nagy, Michal ; Dolíhal, Luděk (referee) ; Hruška, Tomáš (advisor)
This thesis concerns the issue of completness detection of instruction set description for the LLVM compiler, or the ability of a compiler to generate target program for every valid source program in the appropriate high-level programming language. On the basis of regular tree grammar theory and several scietific theses that also concern this issue, formal tool for inclusion checking of two grammars. Furthermore a method for automatic extraction of the two grammars from the instruction set description has been devised, as a result of which the tool can be used for checking completeness of instruction selection. In combination with checking completeness of the legalization process of the LLVM compiler, which preceeds the instruction selection, it should be feaseable to check completeness of most compiler parts dependent on the target architecture.
|
guest ::
RSS feed.