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.

Published:

"Improving Switch Lowering for The LLVM Compiler System"
Anton Korobeynikov
Proc. of the 2007 Spring Young Researchers Colloquium on Software Engineering (SYRCoSE'2007), Moscow, Russia, May, 2007.

Download:

Paper:

• Improving Switch Lowering for The LLVM Compiler System (PDF)

BibTeX Entry:

  @InProceedings{SYRCoSE:SwitchLowering,
    author    = {Anton Korobeynikov},
    title     = "{Improving Switch Lowering for The LLVM Compiler System}",
    booktitle = "{Proceedings of the 2007 Spring Young Researchers Colloquium on Software Engineering (SYRCoSE'2007)}",
    address   = {Moscow, Russia},
    month     = {May},
    year      = {2007}
  }