Abstract
This chapter deals with the register allocation problem in DSP code generation. Since DSP data paths typically show special-purpose registers, register allocation for such architectures has to be performed carefully in order to achieve high code quality. In particular, this holds if code is generated for data flow graphs, which are a widespread internal representation of program blocks. Such data flow graphs are composed of data flow trees, for which satisfactory code generation techniques have already been developed. In the following, we will extend this work by an algorithm that allocates registers for common subexpressions in data flow graphs, which can be considered as the interfaces between the data flow trees in the graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Leupers, R. (2000). Register Allocation for DSP Data Paths. In: Code Optimization Techniques for Embedded Processors. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3169-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3169-9_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5010-9
Online ISBN: 978-1-4757-3169-9
eBook Packages: Springer Book Archive