Improving Switch Lowering for The LLVM Compiler System (2007)
by
Anton Korobeynikov
| Venue: | PROC. OF THE 2007 SPRING YOUNG RESEARCHERS COLLOQUIUM ON SOFTWARE ENGINEERING (SYRCOSE'2007) |
BibTeX
@MISC{Korobeynikov07improvingswitch,
author = {Anton Korobeynikov},
title = {Improving Switch Lowering for The LLVM Compiler System},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Switch-case statements (or switches) provide a natural way to express multiway branching control flow semantics. They are common in many applications including compilers, parsers, text processing programs, virtual machines. Various optimizations for switches has been studied for many years. This paper presents the description of switch lowering refactoring recently made for the LLVM Compiler System.
Citations
| 229 | LLVM: A compilation framework for lifelong program analysis & transformation - Lattner, Adve |
| 21 | Producing good code for the case statement - Bernstein - 1985 |
| 13 | Effectively exploiting indirect jumps - Uh, Whalley - 1999 |
| 11 | Heap Data Structure Analysis and Optimization - Lattner |
| 11 | Compiler code generation for multiway branch statements as a static search problem - Spuler - 1994 |
| 11 | Efficient and effective branch reordering using profile data - Yang, Uh, et al. |
| 6 | Efficient multiway radix search trees - Erlingsson, Krishnamoorthy, et al. - 1996 |
| 5 | Correction to Producing Good Code for the Case Statement - Kannan, Proebsting - 1994 |
| 3 | Feedback-directed switch-case statement optimization - Zhao, Amaral - 2004 |
