Propagating Information Using SSA | SpringerLink
Skip to main content

Propagating Information Using SSA

  • Chapter
  • First Online:
SSA-based Compiler Design
  • 1179 Accesses

Abstract

This chapter provides a gentle introduction to classical data-flow analysis and explains how SSA form improves both performance and expressiveness. In the first part, classical data-flow analysis is discussed by introducing the fundamentals of monotone frameworks on control-flow graphs. In the following part, the chapter introduces a simple and elegant data-flow engine that exploits SSA form. The engine relies on SSA form in order to efficiently propagate information on the values of variables on a so-called SSA graph, while at the same time taking into account control dependencies that emerge from the classical control-flow graph. The engine’s operation is explained through several examples based on constant and copy propagation, which illustrate the advantages of jointly processing the program’s data and control flow.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 9151
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 11439
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 15729
Price includes VAT (Japan)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Hecht, M. S., & Ullman, J. D. (1973). Analysis of a simple algorithm for global data flow problems. In Proceedings of the Symposium on Principles of Programming Languages. POPL ’73 (pp. 207–217).

    Google Scholar 

  2. Kam, J. B., & Ullman, J. D. (1976). Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1), 158–171.

    Article  MathSciNet  MATH  Google Scholar 

  3. Nielson, F., Nielson, H. R., & Hankin, C. (2005). Principles of program analysis. New York: Springer.

    MATH  Google Scholar 

  4. Novillo, D. (2005). A propagation engine for GCC. In Proceedings of the GCC Developers Summit (pp. 175–184).

    Google Scholar 

  5. Wegman, M. N., & Kenneth Zadeck, F. (1991). Constant propagation with conditional branches. ACM Transactions on Programming Language and Systems, 13(2), 181–210.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florian Brandner .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Brandner, F., Novillo, D. (2022). Propagating Information Using SSA. In: Rastello, F., Bouchez Tichadou, F. (eds) SSA-based Compiler Design. Springer, Cham. https://doi.org/10.1007/978-3-030-80515-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-80515-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-80514-2

  • Online ISBN: 978-3-030-80515-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics