LLVM Cookbook

Book Image

LLVM Cookbook

Book Image

LLVM Cookbook

Overview of this book

LLVM Cookbook

Credits

About the Authors

About the Authors

About the Reviewers

About the Reviewers

www.PacktPub.com

www.PacktPub.com

Preface

Free Chapter

LLVM Design and Use

LLVM Design and Use

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

Steps in Writing a Frontend

Steps in Writing a Frontend

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

Extending the Frontend and Adding JIT Support

Extending the Frontend and Adding JIT Support

Handling decision making paradigms – if/then/else constructs

Generating code for loops

Handling user-defined operators – binary operators

Handling user-defined operators – unary operators

Adding JIT support

Preparing Optimizations

Preparing Optimizations

Various levels of optimization

Writing your own LLVM pass

Running your own pass with the opt tool

Using another pass in a new pass

Registering a pass with pass manager

Writing an analysis pass

Writing an alias analysis pass

Using other analysis passes

Implementing Optimizations

Implementing Optimizations

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

Other optimization passes

Target-independent Code Generator

Target-independent Code Generator

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

Optimizing the Machine Code

Optimizing the Machine Code

Eliminating common subexpression from machine code

Analyzing live intervals

Allocating registers

Inserting the prologue-epilogue code

Tail call optimization

Sibling call optimisation

Writing an LLVM Backend

Writing an LLVM Backend

Defining registers and registers sets

Defining the calling convention

Defining the instruction set

Implementing frame lowering

Printing an instruction

Selecting an instruction

Adding instruction encoding

Supporting a subtarget

Lowering to multiple instructions

Registering a target

Using LLVM for Various Useful Projects

Using LLVM for Various Useful Projects

Exception handling in LLVM

Using sanitizers

Writing the garbage collector with LLVM

Converting LLVM IR to JavaScript

Using the Clang Static Analyzer

Using LLVM utility passes

Index

Customer Reviews

5 star

0

4 star

0

3 star

0

2 star

0

1 star

0

Running lexer and parser on our TOY language

Now that a full-fledged lexer and parser for our TOY language grammar are defined, it's time to run it on example TOY language.

Getting ready

To do this, you should have understanding of TOY language grammar and all the previous recipes of this chapter.

How to do it…

Run and test the Lexer and Parser on TOY Language, as shown in the following:

First step is to compile the toy.cpp program into an executable:
```
$ clang++ toy.cpp  -O3 -o toy
```
The toy executable is our TOY compiler frontend. The toy language to be parsed is in a file called example:
```
$ cat example
def foo(x , y)
x + y * 16
```
This file is passed as argument to be processed by the toy compiler:
```
$ ./toy example
```

How it works…

The TOY compiler will open the example file in read mode. Then, it will tokenize the stream of words. It will come across the def keyword and return DEF_TOKEN. Then, the HandleDefn() function will be called, which will store the function name and the argument. It will recursively...