Loading...
Please wait, while we are loading the content...
Similar Documents
IRM — A Graph-Based Intermediate Representation
| Content Provider | Semantic Scholar |
|---|---|
| Author | Braun, Matthias Buchwald, Zwinkau |
| Copyright Year | 2011 |
| Abstract | We present our compiler intermediate representation FIRM. Programs are always in SSA-form enabling a concise graph-based representation. We argue that this naturally encodes context information simplifying many analyses and optimizations. Instructions are connected by dependency edges relaxing the total to a partial order inside a basic block. For example alias analysis results can be directly encoded in the graph structure. The paper gives an overview of the representation and focuses on its construction. We present a simple construction algorithm which does not depend on dominance frontiers or a dominance tree. We prove that for reducible programs it produces a program in pruned and minimal SSA-form. The algorithm works incrementally so optimizations like copy propagation and constant folding can be performed on-the-fly during the construction. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://beza1e1.tuxen.de/pdfs/braun11wir.pdf |
| Alternate Webpage(s) | http://pp.ipd.kit.edu/uploads/publikationen/braun11wir.pdf |
| Alternate Webpage(s) | http://www.researchgate.net/profile/Matthias_Braun3/publication/237005802_Firm---A_Graph-Based_Intermediate_Representation/links/0c96051ad9547bb0a1000000.pdf |
| Alternate Webpage(s) | https://www.researchgate.net/profile/Matthias_Braun3/publication/237005802_Firm---A_Graph-Based_Intermediate_Representation/links/0c96051ad9547bb0a1000000.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
