research-article

CAnDL: a domain specific language for compiler analysis

Authors:

Philip Ginsbach,

Lewis Crawford, and

Michael F. P. O'BoyleAuthors Info & Claims

CC 2018: Proceedings of the 27th International Conference on Compiler Construction

February 2018

Pages 151 - 162

https://doi.org/10.1145/3178372.3179515

Published: 24 February 2018 Publication History

Abstract

Optimizing compilers require sophisticated program analysis and transformations to exploit modern hardware. Implementing the appropriate analysis for a compiler optimization is a time consuming activity. For example, in LLVM, tens of thousands of lines of code are required to detect appropriate places to apply peephole optimizations. It is a barrier to the rapid prototyping and evaluation of new optimizations.

In this paper we present the Compiler Analysis Description Language (CAnDL), a domain specific language for compiler analysis. CAnDL is a constraint based language that operates over LLVM's intermediate representation. The compiler developer writes a CAnDL program, which is then compiled by the CAnDL compiler into a C++ LLVM pass. It provides a uniform manner in which to describe compiler analysis and can be applied to a range of compiler analysis problems, reducing code length and complexity.

We implemented and evaluated CAnDL on a number of real world use cases: eliminating redundant operations; graphics code optimization; identifying static control flow regions. In all cases were we able to express the analysis more briefly than competing approaches.

References

[1]

Alexander Aiken. Introduction to set constraint-based program analysis. Sci. Comput. Program., 35(2-3):79-111, November 1999.

Digital Library

[2]

Martin Alt, Uwe Aßmann, and Hans van Someren. Cosy compiler phase embedding with the CoSy compiler model, pages 278-293. Springer Berlin Heidelberg, Berlin, Heidelberg, 1994.

Digital Library

[3]

Uwe Aßmann. How to uniformly specify program analysis and transformation with graph rewrite systems, pages 121-135. Springer Berlin Heidelberg, Berlin, Heidelberg, 1996.

Digital Library

[4]

Uwe Assmann. Optimix - a tool for rewriting and optimizing programs. In Handbook of Graph Grammars and Computing by Graph Transformation. Volume 2: Applications, Languages and Tools, pages 307-318. World Scientific, 1998.

Digital Library

[5]

Muthu Manikandan Baskaran, J. Ramanujam, and P. Sadayappan. Automatic c-to-cuda code generation for affine programs. In Proceedings of the 19th Joint European Conference on Theory and Practice of Software, International Conference on Compiler Construction, CC'10/ETAPS'10, pages 244-263, Berlin, Heidelberg, 2010. Springer-Verlag.

Digital Library

[6]

Michael Kruse Chandan Reddy and Albert Cohen. Reduction drawing: Language constructs and polyhedral compilation for reductions on gpus. In Proceedings of the 25rd International Conference on Parallel Architectures and Compilation, PACT '16, 2016.

Digital Library

[7]

Philip Ginsbach and Michael F. P. O'Boyle. Discovery and exploitation of general reductions: A constraint based approach. In Proceedings of the 2017 International Symposium on Code Generation and Optimization, CGO '17, pages 269-280, Piscataway, NJ, USA, 2017. IEEE Press.

Digital Library

[8]

Tobias Grosser, Armin Größlinger, and Christian Lengauer. Polly - performing polyhedral optimizations on a low-level intermediate representation. Parallel Processing Letters, 22(4), 2012.

[9]

Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Program analysis as constraint solving. In Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '08, pages 281-292, New York, NY, USA, 2008. ACM.

Digital Library

[10]

Sudipta Kundu, Zachary Tatlock, and Sorin Lerner. Proving optimizations correct using parameterized program equivalence. SIGPLAN Not., 44(6):327-337, June 2009.

Digital Library

[11]

Sorin Lerner, Todd Millstein, Erika Rice, and Craig Chambers. Automated soundness proofs for dataflow analyses and transformations via local rules. In Proceedings of the 32Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '05, pages 364-377, New York, NY, USA, 2005. ACM.

Digital Library

[12]

Peter Lipps, Ulrich Möncke, and Reinhard Wilhelm. OPTRAN - A language/system for the specification of program transformations: System overview and experiences, pages 52-65. Springer Berlin Heidelberg, Berlin, Heidelberg, 1989.

Digital Library

[13]

Nuno P. Lopes, David Menendez, Santosh Nagarakatte, and John Regehr. Provably correct peephole optimizations with alive. In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '15, pages 22-32, New York, NY, USA, 2015. ACM.

Digital Library

[14]

Florian Martin. Pag - an efficient program analyzer generator. International Journal on Software Tools for Technology Transfer, 2(1):46-67, Nov 1998.

[15]

David Menendez and Santosh Nagarakatte. Alive-infer: Data-driven precondition inference for peephole optimizations in llvm. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, pages 49-63, New York, NY, USA, 2017. ACM.

Digital Library

[16]

David Menendez, Santosh Nagarakatte, and Aarti Gupta. Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM, pages 317-337. Springer Berlin Heidelberg, Berlin, Heidelberg, 2016.

[17]

Eric Mullen, Daryl Zuniga, Zachary Tatlock, and Dan Grossman. Verified peephole optimizations for compcert. In Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '16, pages 448-461, New York, NY, USA, 2016. ACM.

Digital Library

[18]

Andres Nötzli and Fraser Brown. Lifejacket: Verifying precise floating-point optimizations in llvm. In Proceedings of the 5th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis, SOAP 2016, pages 24-29, New York, NY, USA, 2016. ACM.

Digital Library

[19]

Karina Olmos and Eelco Visser. Composing source-to-source dataflow transformations with rewriting strategies and dependent dynamic rewrite rules. In Proceedings of the 14th International Conference on Compiler Construction, CC'05, pages 204-220, Berlin, Heidelberg, 2005. Springer-Verlag.

Digital Library

[20]

Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. From program verification to program synthesis. SIGPLAN Not., 45(1):313-326, January 2010.

Digital Library

[21]

Ross Tate, Michael Stepp, and Sorin Lerner. Generating compiler optimizations from proofs. In Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '10, pages 389-402, New York, NY, USA, 2010. ACM.

Digital Library

[22]

Sven Verdoolaege, Juan Carlos Juega, Albert Cohen, José Ignacio Gómez, Christian Tenllado, and Francky Catthoor. Polyhedral parallel code generation for cuda. ACM Trans. Archit. Code Optim., 9(4):54:1-54:23, January 2013.

Digital Library

[23]

Deborah L. Whitfield and Mary Lou Soffa. An approach for exploring code improving transformations. ACM Trans. Program. Lang. Syst., 19(6):1053-1084, November 1997.

Digital Library

[24]

Jeremiah James Willcock, Andrew Lumsdaine, and Daniel J. Quinlan. Reusable, generic program analyses and transformations. In Proceedings of the Eighth International Conference on Generative Programming and Component Engineering, GPCE '09, pages 5-14, New York, NY, USA, 2009. ACM.

Digital Library

[25]

Vanya Yaneva, Ajitha Rajan, and Christophe Dubach. Compiler-Assisted Test Acceleration on GPUs for Embedded Software, pages 35-45. ACM, 7 2017.

Digital Library

[26]

Xuejun Yang, Yang Chen, Eric Eide, and John Regehr. Finding and understanding bugs in c compilers. SIGPLAN Not., 46(6):283-294, June 2011.

Digital Library

[27]

Eric Yuan. Towards ontology-based software architecture representations. In Proceedings of the 1st International Workshop on Establishing the Community-Wide Infrastructure for Architecture-Based Software Engineering, ECASE '17, pages 21-27, Piscataway, NJ, USA, 2017. IEEE Press.

Digital Library

[28]

Jianzhou Zhao, Santosh Nagarakatte, Milo M.K. Martin, and Steve Zdancewic. Formalizing the llvm intermediate representation for verified program transformations. In Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '12, pages 427-440, New York, NY, USA, 2012. ACM.

Digital Library

Cited By

Zang ZThimmaiah AGligoric MRoychoudhury APaiva AAbreu RStorey M(2024)JOG: Java JIT Peephole Optimizations and Tests from PatternsProceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings10.1145/3639478.3640040(11-15)Online publication date: 14-Apr-2024
https://dl.acm.org/doi/10.1145/3639478.3640040
Zang ZThimmaiah AGligoric MJust RFraser G(2023)Pattern-Based Peephole Optimizations with Java JIT TestsProceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3597926.3598038(64-75)Online publication date: 12-Jul-2023
https://dl.acm.org/doi/10.1145/3597926.3598038
You XYang HLei KLuan ZQian DAamodt TJerger NSwift M(2023)VClinic: A Portable and Efficient Framework for Fine-Grained Value ProfilersProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3576934(892-904)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3576934
Show More Cited By

Index Terms

CAnDL: a domain specific language for compiler analysis
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Constraint and logic languages
    2. System description languages
      1. Specification languages

Recommendations

Metacasanova: an optimized meta-compiler for domain-specific languages
SLE 2017: Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering

Domain-Specific Languages (DSL's) offer language-level abstractions that General-Purpose Languages do not offer, thus speeding up the implementation of the solution of problems within a specific domain. Developers have the choice of developing a DSL by ...
Read More
Declaratively defining domain-specific language debuggers
GCPE '11

Tool support is vital to the effectiveness of domain-specific languages. With language workbenches, domain-specific languages and their tool support can be generated from a combined, high-level specification. This paper shows how such a specification ...
Read More
Teaching compiler construction using a domain specific language

Building a compiler for a domain specific language (a language designed for a specific problem domain) can engage students more than traditional compiler course projects. Most students feel that compiler courses are irrelevant because they are not ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CC 2018: Proceedings of the 27th International Conference on Compiler Construction

February 2018

206 pages

ISBN:9781450356442

DOI:10.1145/3178372

General Chair:
Christophe Dubach
University of Edinburgh, UK
,
Program Chair:
Jingling Xue
University of New South Wales, Australia

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

In-Cooperation

IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 February 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

EPSRC

Conference

CGO '18

Sponsor:

CGO '18: 16th Annual IEEE/ACM International Symposium on Code Generation and Optimization

February 24 - 25, 2018

Vienna, Austria

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
485
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)1

Other Metrics

View Author Metrics

Citations

Cited By

Zang ZThimmaiah AGligoric MRoychoudhury APaiva AAbreu RStorey M(2024)JOG: Java JIT Peephole Optimizations and Tests from PatternsProceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings10.1145/3639478.3640040(11-15)Online publication date: 14-Apr-2024
https://dl.acm.org/doi/10.1145/3639478.3640040
Zang ZThimmaiah AGligoric MJust RFraser G(2023)Pattern-Based Peephole Optimizations with Java JIT TestsProceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3597926.3598038(64-75)Online publication date: 12-Jul-2023
https://dl.acm.org/doi/10.1145/3597926.3598038
You XYang HLei KLuan ZQian DAamodt TJerger NSwift M(2023)VClinic: A Portable and Efficient Framework for Fine-Grained Value ProfilersProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3576934(892-904)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3576934
Collie BO'Boyle M(2021)Program Lifting using Gray-Box Behavior2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT52795.2021.00012(60-74)Online publication date: Sep-2021
https://doi.org/10.1109/PACT52795.2021.00012
Arif MZhou RHo HJones TLee J(2021)CinnamonProceedings of the 2021 IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO51591.2021.9370313(103-114)Online publication date: 27-Feb-2021
https://dl.acm.org/doi/10.1109/CGO51591.2021.9370313
Collie BGinsbach PWoodruff JRajan AO'Boyle MGrundy JLe Goues CLo D(2020)M3Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering10.1145/3324884.3416618(90-102)Online publication date: 21-Dec-2020
https://dl.acm.org/doi/10.1145/3324884.3416618
Collie BGinsbach PO'Boyle M(2019)Type-Directed Program Synthesis and Constraint Generation for Library Portability2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT.2019.00013(55-67)Online publication date: Sep-2019
https://doi.org/10.1109/PACT.2019.00013

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents