One compiler: deoptimization to optimized code

Citations Over TimeTop 14% of 2017 papers

Abstract

A multi-tier virtual machine (VM) deoptimizes and transfers last-tier execution to the first-tier execution when a speculative optimization is invalidated. The first-tier target of deoptimization is either an interpreter or code compiled by a baseline compiler. Because such a first-tier execution uses a fixed stack frame layout, this complicates all VM components that need to walk the stack. We propose to use the optimizing compiler also to compile deoptimization target code, i.e., the non-speculative first-tier code where execution continues after a deoptimization. Deoptimization entry points are described with the same scope descriptors used to describe the origin of the deoptimization, i.e., deoptimization is a two-way matching of two scope descriptors describing the same abstract frame at the same virtual program counter. We evaluate this deoptimization approach in a high-performance JavaScript VM. It strictly uses a one-compiler approach, i.e., all frames on the stack originate from the same compiler.

Related Papers

• → A dynamic optimization framework for a Java just-in-time compiler(2001)138 cited
• → Partial method compilation using dynamic profile information(2001)78 cited
• → The verified CakeML compiler backend(2019)47 cited
• → A dynamic optimization framework for a Java just-in-time compiler(2001)22 cited
• → Partial method compilation using dynamic profile information(2001)10 cited