Advertisement

DAG Covering

  • Gabriel Hjort BlindellEmail author
Chapter

Abstract

As we saw in Chapter 3, the principle of tree covering has two significant disadvantages. The first is that common subexpressions cannot be properly expressed in program trees, and the second is that many machine instruction characteristics—such as multi-output instructions—cannot be modeled as pattern trees. As these shortcomings are primarily due to the restricted use of trees, we can achieve a more powerful approach to instruction selection by extending tree covering to DAG covering.

Keywords

Directed Acyclic Graph Pattern Selection Horn Clause Integer Programming Model Register Allocation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Computer Systems Laboratory (CSL)Royal Institute of Technology (KTH)KistaSweden

Personalised recommendations