Correctness of Speculative Optimizations with Dynamic Deoptimization

• Published in: arXiv.org
• Main Authors: Flückiger, Olivier, Scherer, Gabriel, Ming-Ho, Yee, Goel, Aviral, Ahmed, Amal, Vitek, Jan
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 15.11.2017
• Subjects: Computer Science - Programming Languages; Optimization; Representations; Translating
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1711.03050

High-performance dynamic language implementations make heavy use of speculative optimizations to achieve speeds close to statically compiled languages. These optimizations are typically performed by a just-in-time compiler that generates code under a set of assumptions about the state of the program and its environment. In certain cases, a program may execute code compiled under assumptions that are no longer valid. The implementation must then deoptimize the program on-the-fly; this entails finding semantically equivalent code that does not rely on invalid assumptions, translating program state to that expected by the target code, and transferring control. This paper looks at the interaction between optimization and deoptimization, and shows that reasoning about speculation is surprisingly easy when assumptions are made explicit in the program representation. This insight is demonstrated on a compiler intermediate representation, named \sourir, modeled after the high-level representation for a dynamic language. Traditional compiler optimizations such constant folding, dead code elimination, and function inlining are shown to be correct in the presence of assumptions. Furthermore, the paper establishes the correctness of compiler transformations specific to deoptimization: namely unrestricted deoptimization, predicate hoisting, and assume composition.