Code generation based on trellis diagrams

In this chapter, the task of code generation is considered as a search problem for optimal weighted paths in trellis trees. These trees are made up of trellis diagrams containing information about the target machine’s instructions along with the required registers. An algorithm is discussed which integrates the highly interdependent tasks of scheduling, register allocation, and instruction selection. The trellis diagram concept is particularly useful when generating code for heterogeneous register set machines. It has been successfully applied to implement compilers for general purpose digital signal processors.