- LLVM Cookbook
- Table of Contents
- LLVM Cookbook
- Credits
- About the Authors
- About the Reviewers
- www.PacktPub.com
- Preface
- 1. LLVM Design and Use
- Introduction
- Understanding modular design
- Cross-compiling Clang/LLVM
- Converting a C source code to LLVM assembly
- Converting IR to LLVM bitcode
- Converting LLVM bitcode to target machine assembly
- Converting LLVM bitcode back to LLVM assembly
- Transforming LLVM IR
- Linking LLVM bitcode
- Executing LLVM bitcode
- Using the C frontend Clang
- Using the GO frontend
- Using DragonEgg
- 2. Steps in Writing a Frontend
- Introduction
- Defining a TOY language
- Implementing a lexer
- Defining Abstract Syntax Tree
- Implementing a parser
- Parsing simple expressions
- Parsing binary expressions
- Invoking a driver for parsing
- Running lexer and parser on our TOY language
- Defining IR code generation methods for each AST class
- Generating IR code for expressions
- Generating IR code for functions
- Adding IR optimization support
- 3. Extending the Frontend and Adding JIT Support
- 4. Preparing Optimizations
- 5. Implementing Optimizations
- 6. Target-independent Code Generator
- Introduction
- The life of an LLVM IR instruction
- Visualizing LLVM IR CFG using GraphViz
- Describing targets using TableGen
- Defining an instruction set
- Adding a machine code descriptor
- Implementing the MachineInstrBuilder class
- Implementing the MachineBasicBlock class
- Implementing the MachineFunction class
- Writing an instruction selector
- Legalizing SelectionDAG
- Optimizing SelectionDAG
- Selecting instruction from the DAG
- Scheduling instructions in SelectionDAG
- 7. Optimizing the Machine Code
- 8. Writing an LLVM Backend
- 9. Using LLVM for Various Useful Projects
- Index
In this chapter, we will cover the following recipes:
- Writing a dead code elimination pass
- Writing an inlining transformation pass
- Writing a pass for memory optimization
- Combining LLVM IR
- Transforming and optimizing loops
- Reassociating expressions
- Vectorizing IR
- Other optimization passes
In the previous chapter, we saw how to write a pass in LLVM. We also demonstrated writing a few analysis passes with an example of alias analysis. Those passes just read the source code and gave us information about it. In this chapter, we will go further and write transformation passes that will actually change the source code, trying to optimize it for the faster execution of code. In the first two recipes, we will show you how a transformation pass is written and how it changes the code. After that, we will see how we can make changes in the code of passes to tinker with the behavior of the passes.
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.