A superoptimizer analysis of multiway branch code generation

Proceedings of the GCC Developers' Summit 2008

Volumn , Issue , 2008, Pages 103-116

  Sayle, Roger Anthony ^a  

^a OpenEye Scientific Software ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE GENERATION; CODE SEQUENCES; CONDITIONAL BRANCH; DEGREE OF FREEDOM; HIGH LEVEL OF ABSTRACTION; OPTIMIZING COMPILERS; PARAMETERIZED; SIMPLE COST MODEL; WORST-CASE PERFORMANCE;

PROGRAM COMPILERS;

EID: 84857888750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Robert L. Bernstein, "Producing Good Code for the Case Statement," Software - Practice and Experience, Vol. 15, No. 10, pp. 1021-1024, October 1985.
2. Robert L. Bernstein, "Multiplication by Integer Constants," Software - Practice and Experience, Vol. 16, No. 7, pp. 641-652, July 1986.
3. DJ Delorie, "Case Clustering" gcc-patches:2004-07/msg01234, July 2004.
4. H.G. Dietz, "Coding Multiway Branches Using Customized Hash Functions," ECE Technical Report, School of Electrical Engineering, Purdue University, 1992.
5. Ulfar Erlingsson, Mukkai Krishnamoorthy and T.V. Raman, "Efficient Multiway Radix Search Trees," Information Processing Letters, Vol. 60, No. 3, pp. 115-120, November 1996.
6. Torbjön Granlund and Richard Kenner, "Eliminating Branches using a Superoptimizer and the GNU C Compiler," Proceedings of the Conference on Programming Language Design and Implementation (PLDI), ACM SIGPLAN Notices, Vol. 27, No. 7, pp. 341-352, July 1992.
7. J.L. Hennessy and N. Mendelsohn, "Compilation of the Pascal Case Statement," Software - Practice and Experience, Vol. 12, pp. 879-992, September 1982.
8. Vincent Lefèvre, "Multiplication by an Integer Constant," citeseer:491491.html, 2001.
9. Sampath Kannan and Todd A. Proebsting, "Correction to 'Producing Good Code for the Case Statement'," Software - Practice and Experience, Short Communication, Vol. 24, No. 2, pp. 233, February 1994.
10. Anton Korobeynikov, "Improved Switch Lowering for the LLVM Compiler Compiler System," Proceedings of the 2007 Spring Young Researchers Colloquium on Software Engineering (SYRCoSE'2007), Moscow, Russia, May 2007.
11. Henry Massalin, "Superoptimizer: A Look at the Smallest Program," ACM SIGPLAN Notices, Vol. 22, No. 10, pp. 122-126, October 1987.
12. Frank Mueller and David B. Whalley, "Avoiding Unconditional Jumps by Code Replication," Proceedings of the Conference on Programming Language Design and Implementation (PLDI), ACM SIGPLAN Notices, Vol. 27, No. 7, pp. 322-330, July 1992.
13. Arthur Sale, "The Implementation of Case Statements in Pascal," Software - Practice and Experience, Vol. 11, pp. 929-942, 1981.
14. Roger A. Sayle, "Optimize Tablejumps for Switch Statements," gcc-patches:2001-10/msg01234, October 2001.
15. Roger A. Sayle, "Implement Switch Statements with Bit Tests," gcc-patches: 2003-01/msg01733, January 2003.
16. Roger A. Sayle, "Tune Jump Tables for -Os," gcc-patches:2003-08/msg02054, August 2003.
17. David A. Spuler, "Compiler Code Generation for Multiway Branch Statements as a Static Search Problem," Technical Report, Department of Computer Science, James Cook University, Australia, January 1994.
18. Vivek Tiwari, Sharad Malik and Andrew Wolfe, "Power Analysis of Embedded Software: A First Step Towards Software Power Minimization," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 2, No. 4, pp. 437-445, 1994.
19. Henry S. Warren, Jr., "Hacker's Delight," Addison-Wesley Publishers, 2002.
20. R. Clint Whaley and Anthony M. Castaldo, "Achieving Accurate and Context-Sensitive Timing for Code Optimization," Software - Practice and Experience, Accepted for publication, 2008.
21. Edmar Wienskoski, "Switch Statement Case Reordering FDO," GCC Summit 2006, Ottawa, Canada, pp. 235-241, June 2006.