LARA

Lecture 14: Procedures, Memory, SSA, Instruction Selection

Continuing from Lecture 13

Compiling Advanced forms of Procedures

Stack Frames and Procedure Calls

Simple Nested Procedures

Global Function Pointers

Higher-Order Functions

Dispatched Procedures

References

Explicit Dynamic Memory Management

How to implement heap where data lives longer than procedures in which it is created?

Malloc and Free

Scala code:

Free Lists by Size

References

  • Donald Knuth. Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.5: Dynamic Storage Allocation, pp.435–456.
  • Tiger book, Chapter 13

Static Single Assignment form of Programs

SSA Form and Its Advantages

Translating Basic Blocks to SSA Form

Phi Functions in SSA Form

Recovering Expression Trees from SSA Form

References

Instruction Selection

Instruction Selection

Tree Tiling of xyz Example

Instruction Selection Using Tree Grammars

References

Further EPFL Courses