Affiliation:
1. Department of Computer Science and Engineering, University of Washington
Abstract
We present the design of a dynamic compilation system for C. Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a binding time analysis computes the set of run-time constants at each program point in each annotated procedure's control flow graph; the analysis supports program-point-specific polyvariant division and specialization. The analysis results guide the construction of a specialized run-time specializer for each dynamically compiled region; the specializer supports various caching strategies for managing dynamically generated code and supports mixes of speculative and demand-driven specialization of dynamic branch successors. Most of the key cost/benefit trade-offs in the binding time analysis and the run-time specialize are open to user control through declarative policy annotations. Our design is being implemented in the context of art existing optimizing compiler.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference22 articles.
1. L.O. Andersen. Self-Applicable C Program Specialization. pages 54-61 June 1992. L.O. Andersen. Self-Applicable C Program Specialization. pages 54-61 June 1992.
2. L.O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis 1994. DIKU Research Report 94/19. L.O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis 1994. DIKU Research Report 94/19.
3. Fast, effective dynamic compilation
4. A general approach for run-time specialization and its application to C
5. C. Consel. A Tour of Schism: A Partial Evaluation System for Higher-Order Applicative Languages. pages 145-154 1993. 10.1145/154630.154645 C. Consel. A Tour of Schism: A Partial Evaluation System for Higher-Order Applicative Languages. pages 145-154 1993. 10.1145/154630.154645
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献