论文信息 - Code Instruction Selection Based on SSA-Graphs

Code Instruction Selection Based on SSA-Graphs

Instruction selection for embedded processors is a challenging problem. Embedded system architectures feature highly irregular instruction sets and complex data paths. Traditional code generation techniques have difficulties to fully utilize the features of such architectures and typically result in inefficient code.

[1] Helmut Emmelmann,et al. BEG: a generator for efficient back ends , 1989, PLDI '89.

[2] Mark N. Wegman,et al. An efficient method of computing static single assignment form , 1989, POPL '89.

[3] Dhananjay M. Dhamdhere,et al. Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching , 1990, Comput. Lang..

[4] Christopher W. Fraser,et al. A code generation interface for ANSI C , 1991, Softw. Pract. Exp..

[5] Christopher W. Fraser,et al. BURG: fast optimal instruction selection and tree parsing , 1992, SIGP.

[6] Kurt Keutzer,et al. Instruction selection using binate covering for code size optimization , 1995, ICCAD.

[7] Gert Goossens,et al. Code Generation for Embedded Processors , 1995 .

[8] Michael Wolfe,et al. Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form , 1995, TOPL.

[9] M. Anton Ertl. Optimal code selection in DAGs , 1999, POPL '99.

[10] Rainer Leupers,et al. Code generation for embedded processors , 2000, Proceedings 13th International Symposium on System Synthesis.

[11] Bernhard Scholz,et al. Register allocation for irregular architectures , 2002, LCTES/SCOPES '02.