Rompf, TiarkSujeeth, Arvind K.Amin, NadaBrown, Kevin J.Jovanovic, VojinLee, HyoukjoongJonnalagedda, ManoharOlukotun, KunleOdersky, MartinOptimizing Data Structures in High-Level Programs New Directions for Extensible Compilers based on StagingAcm Sigplan NoticesAcm Sigplan NoticesAcm Sigplan NoticesAcm Sigplan Notices14497-510481DesignLanguagesPerformanceStagingCode GenerationData StructuresExtensible Compilers20132013High level data structures are a cornerstone of modern programming and at the same time stand in the way of compiler optimizations. In order to reason about user or library-defined data structures, compilers need to be extensible. Common mechanisms to extend compilers fall into two categories. Frontend macros, staging or partial evaluation systems can be used to programmatically remove abstraction and specialize programs before they enter the compiler. Alternatively, some compilers allow extending the internal workings by adding new transformation passes at different points in the compile chain or adding new intermediate representation (IR) types. None of these mechanisms alone is sufficient to handle the challenges posed by high level data structures. This paper shows a novel way to combine them to yield benefits that are greater than the sum of the parts. Instead of using staging merely as a front end, we implement internal compiler passes using staging as well. These internal passes delegate back to program execution to construct the transformed IR. Staging is known to simplify program generation, and in the same way it can simplify program transformation. Defining a transformation as a staged IR interpreter is simpler than implementing a low-level IR to IR transformer. With custom IR nodes, many optimizations that are expressed as rewritings from IR nodes to staged program fragments can be combined into a single pass, mitigating phase ordering problems. Speculative rewriting can preserve optimistic assumptions around loops. We demonstrate several powerful program optimizations using this architecture that are particularly geared towards data structures: a novel loop fusion and deforestation algorithm, array of struct to struct of array conversion, object flattening and code generation for heterogeneous parallel devices. We validate our approach using several non trivial case studies that exhibit order of magnitude speedups in experiments.Assoc Computing Machinery0362-1340Acm Sigplan NoticesJournal Articles10.1145/2480359.2429128