Code instruction selection based on SSA-graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2826, Issue , 2003, Pages 49-65

  Eckstein, Erik ^a   König, Oliver ^a   Scholz, Bernhard ^b  

^a ATAIR Software GmbH   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); EMBEDDED SYSTEMS; FORMAL LANGUAGES; OPTIMIZATION; PATTERN MATCHING; PROGRAM COMPILERS; QUADRATIC PROGRAMMING;

EMBEDDED PROCESSORS; EMBEDDED SYSTEM ARCHITECTURES; INSTRUCTION SELECTION; INSTRUCTION SET; OPTIMAL SOLUTIONS; PATTERN MATCHING PROBLEMS; QUADRATIC OPTIMIZATION PROBLEMS; STATIC SINGLE ASSIGNMENTS;

GRAPH THEORY;

EID: 34548019422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39920-9_5     Document Type: Article

References (12)

1. S. Biswas A. Balachandran, and D.M. Dhamdhere. Efficient retargetable code generation using bottom-up tree pattern matching. Computer Languages, 15(3):127-140, 1990.
2. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In ACM, editor, POPL'89. Proceedings of the sixteenth annual ACM symposium on Principles of programming languages, January 11-13, 1989, Austin, TX, pages 25-35, New York, NY, USA, 1989. ACM Press.
3. E. Eckstein and B. Scholz. Address mode selection. In Proceedings of the International Symposium of Code Generation and Optimization (CGO 2003), San Francisco, March 2003. IEEE/ACM.
4. M. Anton Ertl. Optimal code selection in DAGs. In Principles of Programming Languages (POPL'99), 1999.
5. C. Fraser, R. Henry, and T. Proebsting. BURG - fast optimal instruction selection and tree parsing. ACM SIGPLAN Notices, 27(4):68-76, April 1992.
6. Christopher W. Fraser and David R. Hanson. A code generation interface for ANSI c. Software - Practice and Experience, 21(9):963-988, 1991.
7. Michael P. Gerlek, Eric Stoltz, and Michael Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems, 17(1):85-122, January 1995.
8. Rudolf Landwehr Helmut Emmelmann, Friedrich-Wilhelm Schröer. Beg - a generator for efficient back ends. SIGPLAN'99 Conference on Programming Language Design and Implementation, pages 227-237, 1989.
9. Rainer Leupers. Code generation for embedded processors. In ISSS, pages 173-179, 2000.
10. S. Liao, S. Devadas, K. Keutzer, and S. Tjiang. Instruction selection using binate covering for code size optimization. In International Conference on Computer Aided Design, pages 393-401, Los Alamitos, Ca., USA, November 1995. IEEE Computer Society Press.
11. Todd A. Proebsting. Least-cost instruction selection in dags is np-complete. http://research.microsoft.com/∼toddpro/papers/proof. htm.
12. B. Scholz and E. Eckstein. Register allocation for irregular architecture. In Proceedings of Languages, Compilers, and Tools for Embedded Systems (LCTES 2002) and Software and Compilers for Embedded Systems (SCOPES 2002), Berlin, June 2002. ACM.