Abstract
As we saw in Chapter 2, the main limitation of most instruction selectors based on macro expansion is that the scope of expansion is restricted to a single AST or IR node. Hence exploitation of many instructions is excluded, resulting in low code quality. Another problem is that macro-expanding instruction selectors typically combine pattern matching and pattern selection into a single step, thus making it very difficult to consider combinations of instructions and then pick the one that yields the "best" assembly code. These problems can be solved by employing another principle of instruction selection called tree covering, which is also the most common principle of techniques found in the current literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hjort Blindell, G. (2016). Tree Covering. In: Instruction Selection. Springer, Cham. https://doi.org/10.1007/978-3-319-34019-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-34019-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-34017-3
Online ISBN: 978-3-319-34019-7
eBook Packages: Computer ScienceComputer Science (R0)