Status
Everything works. State corresponds to the Chapter 7 of the original tutorial (i.e. mutable variables implemented).
LLVM tutorial in the Rust language.
This tutorial is a work in progress and at the moment I'm working on getting it fully working with the latest Rust and on improvinvg the way it uses LLVM.
Table of Contents
- Chapter 0. Introduction
- Chapter 1. Parser and AST implementation
- Chapter 2. LLVM IR code generation
- Chapter 3. Optimizer and JIT support
- Chapter 4. Extending Kaleidoscope: control flow
- Chapter 5. Extending Kaleidoscope: user-defined operators
- Chapter 6. Extending Kaleidoscope: mutable variables
Chapter 0. Introduction
This tutorial shows how to implement a simple programming language using LLVM and Rust. Its first goal is to show how to use LLVM to create a simple REPL, so some knowledge of Rust is assumed. To be honest, author himself is a very beginner both in Rust and LLVM, so any feedback is highly appreciated.
The code in the repository corresponds to the state of your program at the end of the last chapter and serves as a starting point for further experiments.
If you want to look at code that corresponds to a given chapter, see chapters directory. Link to relevant code is attached to every chapter (work in progress).
To experiment with the code in this repo you need:
-
the latest Rust compiler
-
Cargo Rust package manager
-
LLVM (I have used ver. 3.6)
To build the code just clone the repo and execute
cargo build
Then you will find an executable named iron-kaleidoscope in the target directory.
Basic variant of the Kaleidoscope language
In this tutorial we will use a simple functional language named Kaleidoscope. In this chapter its basic variant will be presented. New features will be added in the next chapters step by step.
The language has only one type: 64-bit floating point numbers (f64 in the Rust terminology).
The first variant of the language is very limited and even not Turing complete. It includes only function defenitions (or declarations) and function invocations together with some simple arithmetic operators. Examples follow.
Arithmetic expression:
1 + 2 * (3 - 4);
Function definition:
def plus(x, y)
x + y
Function invocation:
plus(1 2)
Extern function declaration and invocation:
extern sin(x);
sin(1)
Every statement except of definitions and declarations in Kaleidoscope is an expression and has the corresponding value. Quite similar to Rust. Function body is just an expression, its value is returned. No explicit return operator is used.
To show the end of an expression or definition (declaration) we use ';' character. ',' character in function prototypes/calls is equivalent to the space character. Comments are started by '#' and last until the end of the line.
Names of variables start with an alphabetical character and contain any number of alphanumerical characters. Reserved words at the moment include def and extern. Any non-alphanumerical non-whitespace character different from '(', ')', ';' and ',' is treated as an operator.
A number literal is a nonempty sequence of decimal digits, possibly containing a decimal point character.
The project structure
To create a REPL we will need (corresponding source files are shown in parenthesis):
-
the lexer (lexer.rs)
-
the parser (parser.rs)
-
the IR builder (builder.rs)
-
the JIT compiler (jitter.rs)
-
the driver (driver.rs)
We'll use Cargo as a build system for this project. All sources will live in the src directory. Project will have two crates: library and binary. All real functionality will be implemented in the library, and the binary will just parse command line arguments and invoke the driver.
Cargo.toml file is quite straightforward.
The lexer
To implement the lexer we'll use regular expressions. We have the next types of tokens (and corresponding regexes given in the notation used by the Rust regex library):
-
def and extern keywords (
def|extern) -
identifier (
\p{Alphabetic}\w*) -
number literal (
\d+\.?\d*) -
semicolon (
;) -
opening and closing parenthesis (
\(|\)) -
comma (
,) -
operator (
\S)
The corresponding enumeration looks like this:
#[derive(PartialEq, Clone, Debug)]
pub enum Token {
Def,
Extern,
Delimiter, //';' character
OpeningParenthesis,
ClosingParenthesis,
Comma,
Ident(String),
Number(f64),
Operator(String)
}
Note, that to use enumeration members without scopes as we later do, you need to add some uses at the beginning of your module (it is needed since changing enums to be scoped in Rust):
pub use self::Token::{
Def,
Extern,
Delimiter,
OpeningParenthesis,
ClosingParenthesis,
Comma,
Ident,
Number,
Operator
};
We do not mention those uses explicitly in the following.
Our parser function will accept a string with input characters and produce a vector of tokens. It will look like this:
pub fn tokenize(input: &str) -> Vec{ // regex for commentaries (start with #, end with the line end) let comment_re = regex!( r"(?m)#.*\n"); // remove commentaries from the input stream let preprocessed = comment_re. replace_all(input, "\n"); let mut result = Vec :: new(); // regex for token, just union of straightforward regexes for different token types // operators are parsed the same way as identifier and separated later let token_re = regex!( concat!( r"(?P \p{Alphabetic}\w*)|" , r"(?P\d+\.?\d*)|" , r"(?P;)|" , r"(?P\()|" , r"(?P\))|" , r"(?P,)|" , r"(?P\S)" )); for cap in token_re. captures_iter(preprocessed. as_str()) { let token = if cap. name( "ident"). is_some() { match cap. name( "ident"). unwrap() { "def" => Def, "extern" => Extern, ident => Ident(ident. to_string()) } } else if cap. name( "number"). is_some() { match cap. name( "number"). unwrap(). parse() { Ok(number) => Number(number), Err(_) => panic!( "Lexer failed trying to parse number") } } else if cap. name( "delimiter"). is_some() { Delimiter } else if cap. name( "oppar"). is_some() { OpeningParenthesis } else if cap. name( "clpar"). is_some() { ClosingParenthesis } else if cap. name( "comma"). is_some() { Comma } else { Operator(cap. name( "operator"). unwrap(). to_string()) }; result. push(token) } result }
Quite simple function. About regex in Rust you can read here.
Some comments: we create regex with different groups matching to different types of tokens. Then we match it on the input string and iterate over captures, looking what token we have matched. Identifiers are matched in the same regex with keywords, as they have the same microsyntax. They are separated later with the additional match.
To experiment with this lexer you can create a simple main function that reads lines from the input one by one and shows the recognized tokens. Full code for this chapter is available, but is a little bit more complex then needed as it is autogenerated from the full code.
Chapter 1. AST and parser implementation
In this chapter we will build a parser for the Kaleidoscope language. First we need to define its grammar and how to represent the parsing results. Then we can use Recursive Descent Parsing and Operator-Precedence Parsing to produce the Abstract Syntax Tree from the stream of tokens recognized by the lexer.
The grammar
This grammar description uses the dialect of Extended Backus-Naur Form (EBNF) described in the Rust reference. Identifiers that start with the lowercase name non-terminals. Identifiers that start with the uppercase name terminals and correspond to the names in the Token enum defined in the lexer.
program : [[statement | expression] Delimiter ? ]*;
statement : [declaration | definition];
declaration : Extern prototype;
definition : Def prototype expression;
prototype : Ident OpeningParenthesis [Ident Comma ?]* ClosingParenthesis;
expression : [primary_expr (Op primary_expr)*];
primary_expr : [Ident | Number | call_expr | parenthesis_expr];
call_expr : Ident OpeningParenthesis [expression Comma ?]* ClosingParenthesis;
parenthesis_expr : OpeningParenthesis expression ClosingParenthesis;
The Abstract Syntax Tree (AST)
Now we'll create data types corresponding to every item in the Kaleidoscope grammar.
program : [[statement | expression] Delimiter ? ]*;
Program is a sequence of statements and expressions. To make life easier in the future we will close every expression in an anonymous function (we'll use this during JIT compilation). So, there are two types of items in the program after such a closure: declarations and definitions. Declarations are just function prototypes, when definitions are function prototypes combined with a function body.
The data type corresponding to the programm will be:
Vec<ASTNode>
where ASTNode is defined as
#[derive(PartialEq, Clone, Debug)]
pub enum ASTNode {
ExternNode(Prototype),
FunctionNode(Function)
}
ExternNode corresponds to the declaration item in the grammar and FunctionNode corresponds to the definition item.
We define Prototype and Function according to the grammar:
definition : Def prototype expression;
prototype : Ident OpeningParenthesis [Ident Comma ?]* ClosingParenthesis;
#[derive(PartialEq, Clone, Debug)]
pub struct Function {
pub prototype: Prototype,
pub body: Expression
}
#[derive(PartialEq, Clone, Debug)]
pub struct Prototype {
pub name: String,
pub args: Vec<String>
}
Functions are typed only by the number of arguments, as the onliest type in the Kaleidoscope language is an f64 number.
The only thing left to define is the data type that corresponds to the expression item. This one is the most complicated and difficult to parse, as it includes binary expressions with operator precedence.
expression : [primary_expr (Op primary_expr)*];
primary_expr : [Ident | Number | call_expr | parenthesis_expr];
call_expr : Ident OpeningParenthesis [expression Comma ?]* ClosingParenthesis;
parenthesis_expr : OpeningParenthesis expression ClosingParenthesis;
Expression data type will be an enum with entries corresponding to every possible expression type:
#[derive(PartialEq, Clone, Debug)]
pub enum Expression {
LiteralExpr(f64),
VariableExpr(String),
BinaryExpr(String, Box<Expression>, Box<Expression>),
CallExpr(String, Vec<Expression>)
}
LiteralExpr is a number (Number token). VariableExpr is a variable name (Ident token). So far we have only one type of variables: function parameters. BinaryExpr has information about operator name and subexpressions. And CallExpr fully corresponds to its definition in the grammar.
We did not need a representation for the parenthesis_expr item, as the precedence of evaluation is encoded in the tree formed by BinaryExpr, so parenthesis are used only during parsing. Also, note that Expression definition not fully corresponds to the grammar (grammar has a sequence of primary expressions devided by operators, when here we have a binary tree of binary expressions), we will speak about it later in the section about binary expressions parsing.
Now we can proceed with parsing, as both our input format (the sequence of tokens) and the AST we want to have as the result of parsing are known.
Parser implementation: introduction
Before starting parser implementation we should think about one general question: how will REPL receive the input and how should it work with it. Basically, REPL should allow user to type statements line by line, parsing every line as it is entered. If the line contains not finished statement, REPL should consume line by line until it has something finished that can be interpreted (either declaration/definition or free expression).
As an input we can accept two variables: already parsed AST and tokens that we still need to parse:
tokens : &[Token], parsed_tree : &[ASTNode]
As a result we will have again pair of a parsed AST and tokens that were not parsed because they form nothing finished. Also we need some kind of error handling. It will be achieved by the usage of Result with an error message:
pub type ParsingResult = Result<(Vec
,
Vec
),
String>;
The function prototype for the parsing function looks like this:
pub fn parse(tokens : &[Token], parsed_tree : &[ASTNode], settings : &mut ParserSettings) -> ParsingResult
pub fn parse(tokens : &[Token], parsed_tree : &[ASTNode], settings : &mut ParserSettings) -> ParsingResult;
At the moment ParserSettings can be just an empty enum, in the nearest future we will use them for handling binary expressions (they will contain information about operator precedence). They are mutable because later on we may want to add some dynamically defined constructions to the language that will need additional information to be stored in the parser settings.
Top level parse function
The majority of the parsing will be done by the recursive descent parser. This kind of parsers is easy for understanding and implementation. Every production rule in the grammar has a corresponding function, these functions call each other according to the production rules.
We will need to handle input tokens efficiently, being able to pick them one by one, or return back to the input vector, this can be easily achieved if we reverse this vector. Adding and removing elements at the end of a vector is quite efficient.
Helper parsing functions will accept unparsed tokens as their input. They will have three possible results:
- AST node was parsed, pair of parsed piece of AST and consumed tokens that correspond to it should be returned
- input token sequence in not complete, no tokens from the input should be consumed
- an error happend, error message should be returned
Corresponding result data type looks like this:
enum PartParsingResult
{
Good(T,
Vec
<Token
>),
NotComplete,
Bad(
String)
}
We will need a helper function for error generation:
fn error
(message :
&
str) -> PartParsingResult
{
Bad(message.
to_string())
}
This function and data type are generic as we will need to return objects of different types depending on what we are parsing (prototype, expression, etc.) Top level parsing functions will return ASTNode which can be directly inserted into Vec
that represents the AST.
We can implement first production rules in the topmost parsing function now:
program : [[statement | expression] Delimiter ? ]*;
statement : [declaration | definition];
declaration : Extern prototype;
definition : Def prototype expression;
As one can see from this piece of grammar, we have 3 top level items. Parser will decide which one it handles at the moment based on the token it sees:
Deftoken means we have definitionExterntoken means declarationDelimitertoken can be just ignored- any other token can be interpreted as the beginning of an expression (as there is no other possibility)
With these points in mind we can implement the parse function this way:
pub fn parse(tokens : &[Token], parsed_tree : &[ASTNode], settings : &mut ParserSettings) -> ParsingResult
{
let mut rest = tokens.to_vec();
// we read tokens from the end of the vector
// using it as a stack
rest.reverse();
// we will add new AST nodes to already parsed ones
let mut ast = parsed_tree.to_vec();
loop {
// look at the current token and determine what to parse
// based on its value
let cur_token =
match rest.last() {
Some(token) => token.clone(),
None => break
};
let result = match cur_token {
Def => parse_function(&mut rest, settings),
Extern => parse_extern(&mut rest, settings),
Delimiter => {rest.pop(); continue},
_ => parse_expression(&mut rest, settings)
};
match result {
Good(ast_node, _) => ast.push(ast_node),
NotComplete => break,
Bad(message) => return Err(message)
}
}
// unparsed tokens
rest.reverse();
Ok((ast, rest))
}
Helper macros for work with tokens
As was mentioned before we can have as input both complete and non-complete language sentences. We need to consume all the tokens that correspond to the complete sentences and leave the rest untouched. To make life easier we will use macros to work with tokens and parsing results.
We will maintain a list of tokens that correspond to the sentence being parsed now in every parsing functions. If input tokens are exhausted before we have parsed the whole item, we will insert them back. If parsing is successful, we will return both parsed item and tokens that correspond to it. If parsing has failed, that we will inform caller about this failure.
First macros we need will handle calling of other parsing functions. The parsing function signature looks like this:
fn parse_binary_expr(tokens : &mut Vec
, settings :
&
mut ParserSettings, ...) -> PartParsingResult
;
where ... means additional parameters.
The calling macro looks like this:
macro_rules! parse_try(
($function:ident, $tokens:ident, $settings:ident, $parsed_tokens:ident) => (
parse_try!($function, $tokens, $settings, $parsed_tokens,)
);
($function:ident, $tokens:ident, $settings:ident, $parsed_tokens:ident, $($arg:expr),*) => (
match $function($tokens, $settings, $($arg),*) {
Good(ast, toks) => {
$parsed_tokens.extend(toks.into_iter());
ast
},
NotComplete => {
$parsed_tokens.reverse();
$tokens.extend($parsed_tokens.into_iter());
return NotComplete;
},
Bad(message) => return Bad(message)
}
)
);
It declares two variants: with and without additional parameters. The first one calls the second one with zero additional parameters.
The macro calls the parsing function and looks at the results. If results are good, we extend already parsed tokens with those returned from the parsing function and have the parsed AST as value of the macro. If called function returned NotComplete, we insert parsed tokens back into the input and also return NotComplete. Note, that our temporary parsed_tokens are stored in the direct way, when the input was stored in the reversed way, so we need to reverse it before inserting back. If called function failed, we also return a failure.
Next macro we need is a macro that works directly with input tokens. It will look at the current token and try to match it. We need two variants. One tries to match with different provided alternatives, if no one matches, it failes with error. Other also tries to match with different alternatives, but if no one is matched, it just executes the action given as a parameter. In the last case no tokens from the input should be consumed by the macro itself.
macro_rules! expect_token (
([ $($token:pat, $value:expr, $result:stmt);+ ] <= $tokens:ident, $parsed_tokens:ident, $error:expr) => (
match $tokens.pop() {
$(
Some($token) => {
$parsed_tokens.push($value);
$result
},
)+
None => {
$parsed_tokens.reverse();
$tokens.extend($parsed_tokens.into_iter());
return NotComplete;
},
_ => return error($error)
}
);
([ $($token:pat, $value:expr, $result:stmt);+ ] else $not_matched:block <= $tokens:ident, $parsed_tokens:ident) => (
match $tokens.last().map(|i| {i.clone()}) {
$(
Some($token) => {
$tokens.pop();
$parsed_tokens.push($value);
$result
},
)+
_ => {$not_matched}
}
)
);
This macro automatically handles inserting tokens into the parsed tokens vector and returning of NotComplete (together with inserting of tokens back into the input vector) or error in the appropriate cases.
Parsing of statements and top level expressions
We have two kinds of statements in the Kaleidoscope language: function declarations and function definitions:
statement : [declaration | definition];
declaration : Extern prototype;
definition : Def prototype expression;
Let's start from the easier one: function declarations. The function is really straightforward:
fn parse_extern(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
// eat Extern token
tokens.
pop();
let
mut parsed_tokens
=
vec![Extern];
let prototype
=
parse_try!(parse_prototype, tokens, settings, parsed_tokens);
Good(
ExternNode(prototype), parsed_tokens)
}
We eat Extern token and parse the function prototype. That's all.
Function definition is not very complicated also:
fn parse_function(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
// eat Def token
tokens.
pop();
let
mut parsed_tokens
=
vec!(Def);
let prototype
=
parse_try!(parse_prototype, tokens, settings, parsed_tokens);
let body
=
parse_try!(parse_expr, tokens, settings, parsed_tokens);
Good(
FunctionNode(Function{prototype: prototype, body: body}), parsed_tokens)
}
Again, we eat Def token, we parse prototype and function body. That's all.
So far we just called another parsing functions and matched some tokens (like Def or Extern). That's time for some real parsing now.
prototype : Ident OpeningParenthesis [Ident Comma ?]* ClosingParenthesis;
fn parse_prototype(tokens : &mut Vec
, _settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let name
=
expect_token!([
Ident(name),
Ident(name.
clone()), name
]
<= tokens, parsed_tokens,
"expected function name in prototype");
expect_token!(
[OpeningParenthesis, OpeningParenthesis, ()]
<= tokens,
parsed_tokens,
"expected '(' in prototype");
let
mut args
=
Vec
::
new();
loop {
expect_token!([
Ident(arg),
Ident(arg.
clone()), args.
push(arg.
clone());
Comma, Comma,
continue;
ClosingParenthesis, ClosingParenthesis,
break
]
<= tokens, parsed_tokens,
"expected ')' in prototype");
}
Good(Prototype{name: name, args: args}, parsed_tokens)
}
Function prototype starts with the function name. Then opening parenthesis goes. After opening parenthesis we have a list of function parameters (Ident tokens). Note, that we ignore Comma tokens, so they are equivalent to whitspaces. If we find a closing parenthesis, prototype parsing is done. If we find any other token we emit an error.
The only top level item still left are top level expressions. To make further work with them easier, we close them in an anonymous function.
fn parse_expression(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let expression
=
parse_try!(parse_expr, tokens, settings, parsed_tokens);
let prototype
= Prototype{name:
"".
to_string(), args:
vec![]};
let lambda
= Function{prototype: prototype, body: expression};
Good(
FunctionNode(lambda), parsed_tokens)
}
Now, when we have code that handles parsing of all top level items, we can proceed with parsing of the main part of Kaleidoscope language -- expressions.
Parsing of primary expressions
We will start from easier topic: parsing of primary expressions. Then we will use primary expressions parsing functions to parse operands of binary operators.
primary_expr : [Ident | Number | call_expr | parenthesis_expr];
call_expr : Ident OpeningParenthesis [expression Comma ?]* ClosingParenthesis;
parenthesis_expr : OpeningParenthesis expression ClosingParenthesis;
fn parse_primary_expr(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
match tokens.
last() {
Some(
&
Ident(_))
=>
parse_ident_expr(tokens, settings),
Some(
&
Number(_))
=>
parse_literal_expr(tokens, settings),
Some(
&OpeningParenthesis)
=>
parse_parenthesis_expr(tokens, settings),
None
=>
return NotComplete,
_
=>
error(
"unknow token when expecting an expression")
}
}
To start parsing of a primary expression we just look at the next token and decide which kind of expression we are working with. Such a look ahead one or more tokens is a common idea in parsers, we already have seen it before in the top level parse function.
We start with parsing of identifier and call expressions. We use the same parsing function for them, as they both start from the Ident token.
fn parse_ident_expr(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let name
=
expect_token!(
[
Ident(name),
Ident(name.
clone()), name]
<= tokens,
parsed_tokens,
"identificator expected");
expect_token!(
[OpeningParenthesis, OpeningParenthesis, ()]
else {
return
Good(
VariableExpr(name), parsed_tokens)}
<= tokens, parsed_tokens);
let
mut args
=
Vec
::
new();
loop {
expect_token!(
[ClosingParenthesis, ClosingParenthesis,
break;
Comma, Comma,
continue]
else {
args.
push(
parse_try!(parse_expr, tokens, settings, parsed_tokens));
}
<= tokens, parsed_tokens);
}
Good(
CallExpr(name, args), parsed_tokens)
}
First, we parse the name (it will be the name of a variable or function to call). Then we look at the next token. If it is an opening parenthesis, then we have a function call. If it is any other token, then we have a variable referenced and we can return a VariableExpr already.
Next (as we have a call expression) we parse a list of arguments to the function. It is done the same way as in prototype. The only difference is that arguments are not identifiers, but expressions now.
Parsing of literal expressions is very straightforward:
fn parse_literal_expr(tokens : &mut Vec
, _settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let value
=
expect_token!(
[
Number(val),
Number(val), val]
<= tokens,
parsed_tokens,
"literal expected");
Good(
LiteralExpr(value), parsed_tokens)
}
Parenthesis expressions are also easy to parse:
fn parse_parenthesis_expr(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
// eat the opening parenthesis
tokens.
pop();
let
mut parsed_tokens
=
vec![OpeningParenthesis];
let expr
=
parse_try!(parse_expr, tokens, settings, parsed_tokens);
expect_token!(
[ClosingParenthesis, ClosingParenthesis, ()]
<= tokens,
parsed_tokens,
"')' expected");
Good(expr, parsed_tokens)
}
Now, when we can parse primary expressions, it is the time for more complicated ones.
Parsing of binary expressions
Our grammar for expressions looked like this:
expression : [primary_expr (Op primary_expr)*];
The problem with this grammar is that it really does not reveal the semantics of binary expressions. It is the correct generative grammar. Note however, that we want not just check expressions syntactic correctness, but have some structure that can be used for code generation (binary tree in this case) that includes information about operators precedence, so we can not use this grammar for parsing.
Basically speaking, we could take an information about operator precedence and reformulate our grammar, so it reveals semantic correctly and try to use it to create a parser similar to that we already have for other types of items. But we will use an operator precedence parser instead as it is much faster for such kind of things. Real compilers also frequently use it for parsing of expressions. If they are not Lisp language compilers, of course.
We will keep information about operator precedence in a map. That's where our settings structure is needed:
pub struct ParserSettings {
operator_precedence: HashMap<String, i32>
}
Let's create a function that fills this map with some operators:
pub fn default_parser_settings() -> ParserSettings {
let mut operator_precedence = HashMap::new();
operator_precedence.insert("<".to_string(), 10);
operator_precedence.insert("+".to_string(), 20);
operator_precedence.insert("-".to_string(), 20);
operator_precedence.insert("*".to_string(), 40);
ParserSettings{operator_precedence: operator_precedence}
}
A binary expression is a primary expression followed by zero or more (operator, primary expression) pairs. The expression parsing function looks like this:
fn parse_expr(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let lhs
=
parse_try!(parse_primary_expr, tokens, settings, parsed_tokens);
let expr
=
parse_try!(parse_binary_expr, tokens, settings, parsed_tokens,
0,
&lhs);
Good(expr, parsed_tokens)
}
parse_binary_expr will return LHS if there are no (operator, primary expression) pairs or parse the whole expression.
To parse a binary expression we will use the following algorithm. Its input is:
-
LHS of an expression
-
input tokens
-
the minimal allowed operator precedence
We will build the resulting value starting from LHS. We will eat operators with the precedence bigger than the minimal allowed precedence one by one, constructing the RHS value. RHS construction we will start from the primary expression. To group operators correctly, we will call parse_binary_expr on the operators with the precedence bigger than the precedence of the current operator to make it parse the whole RHS. Then we will construct the resulting value and use it as the new LHS. We will continue until the current token is not an operator, or it is an operator with the precedence lesser than the minimal allowed one.
fn parse_binary_expr(tokens : &mut Vec
, settings :
&
mut ParserSettings, expr_precedence :
i32, lhs :
&Expression) -> PartParsingResult
{
// start with LHS value
let
mut result
= lhs.
clone();
let
mut parsed_tokens
=
Vec
::
new();
loop {
// continue until the current token is not an operator
// or it is an operator with precedence lesser than expr_precedence
let (operator, precedence)
=
match tokens.
last() {
Some(
&
Operator(
ref op))
=>
match settings.operator_precedence.
get(op) {
Some(pr)
if
*pr
>= expr_precedence
=> (op.
clone(),
*pr),
None
=>
return
error(
"unknown operator found"),
_
=>
break
},
_
=>
break
};
tokens.
pop();
parsed_tokens.
push(
Operator(operator.
clone()));
// parse primary RHS expression
let
mut rhs
=
parse_try!(parse_primary_expr, tokens, settings, parsed_tokens);
// parse all the RHS operators until their precedence is
// bigger than the current one
loop {
let binary_rhs
=
match tokens.
last().
map(
|i
| {i.
clone()}) {
Some(
Operator(
ref op))
=>
match settings.operator_precedence.
get(op).
map(
|i
| {
*i}) {
Some(pr)
if pr
> precedence
=> {
parse_try!(parse_binary_expr, tokens, settings, parsed_tokens, pr,
&rhs)
},
None
=>
return
error(
"unknown operator found"),
_
=>
break
},
_
=>
break
};
rhs
= binary_rhs;
}
// merge LHS and RHS
result
=
BinaryExpr(operator,
box result,
box rhs);
}
Good(result, parsed_tokens)
}
That's how parsing of binary expressions looks like.
TODO: add an example.
The driver
It is time to construct a working program from already defined functions. Our simple REPL will read input line by line. It will write the parsed AST back to the user when it has some finished expression(s). Until this it will ask user to write additional lines to the current expression. On error it will display an error message.
Additionally we will add possibility to call only the lexer. Let's start from command line options parsing. We will use docopt library for this:
use docopt::Docopt;
const USAGE: &'static str = "
Usage: iron_kaleidoscope [(-l | -p | -i)]
Options:
-l Run only lexer and show its output.
-p Run only parser and show its output.
-i Run only IR builder and show its output.
";
#[derive(Debug, RustcDecodable)]
struct Args {
flag_l: bool,
flag_p: bool,
flag_i: bool
}
fn main() {
let args: Args = Docopt::new(USAGE)
.and_then(|d| d.decode())
.unwrap_or_else(|e| e.exit());
let stage = if args.flag_l {
Tokens
} else {
AST
};
main_loop(stage);
}
The Stage enum is defined in the driver:
#[derive(PartialEq, Clone, Debug)]
pub enum Stage {
AST,
Tokens
}
Driver itself looks like this:
pub fn main_loop(stage: Stage) {
let stdin = io::stdin();
let mut stdout = io::stdout();
let mut input = String::new();
let mut parser_settings = default_parser_settings();
'main: loop {
print!("> ");
stdout.flush().unwrap();
input.clear();
stdin.read_line(&mut input).ok().expect("Failed to read line");
if input.as_str() == ".quit\n" {
break;
}
// the constructed AST
let mut ast = Vec::new();
// tokens left from the previous lines
let mut prev = Vec::new();
loop {
let tokens = tokenize(input.as_str());
if stage == Tokens {
println!("{:?}", tokens);
continue 'main
}
prev.extend(tokens.into_iter());
let parsing_result = parse(prev.as_slice(), ast.as_slice(), &mut parser_settings);
match parsing_result {
Ok((parsed_ast, rest)) => {
ast.extend(parsed_ast.into_iter());
if rest.is_empty() {
// we have parsed a full expression
break
} else {
prev = rest;
}
},
Err(message) => {
println!("Error occured: {}", message);
continue 'main
}
}
print!(". ");
stdout.flush().unwrap();
input.clear();
stdin.read_line(&mut input).ok().expect("Failed to read line");
}
if stage == AST {
println!("{:?}", ast);
continue
}
}
}
Chapter 2. LLVM IR code generation
Before it we have used nothing from LLVM libraries. The described lexer and parser have nothing LLVM specific. It is a time to start a real LLVM tutorial now.
To represent intermediate results of code generation and to make it possible to easily do different transformations on the generated code, LLVM uses a special representation: LLVM intermediate representation.
IR is a universal representation used in every component of LLVM. It has three different forms: an in-memory compiler IR, an on-disk bitcode representation and a human-readable assembly language representation.
We want to generate IR from the AST that we have built in the previous chapter. It is surprisingly simple, as we will see in a moment.
Code generation setup
LLVM has two interfaces: C++ interface and a stable C interface. Apart from it LLVM has a number of bindings, usually based on the C interface.
Before or during reading this chapter of tutorial you can read an appropriate section in the LLVM Programmer's Manual.
We'll use my Rust LLVM bindings in this tutorial (which serves as first documentation for them). These bindings are work in progress, but I have plans to fully cover LLVM C API and as much as possible of usefull features available only in C++ API. iron-llvm aims to be safe and rust idiomatic, it is built on top of existing full unsafe bindings.
Using it is as simple as adding
[dependencies]
llvm-sys = "*"
[dependencies.iron_llvm]
git = "https://github.com/jauhien/iron-llvm.git"
to Cargo.toml file and importing necessary crates
extern crate iron_llvm;
extern crate llvm_sys;
iron-llvm is still not published on crates.io, this is why we use github dependency. Also after I rework what is exports (mainly basic LLVM types), explicit use of llvm-sys will be not necessary.
To generate IR we'll need these objects:
- Context
- Module where generated IR will be stored
- IR builder that will do real generation work
Module is a compilation unit of LLVM IR. It contains functions and other high-level items. Functions are usual functions well-know from every programming language. They have some type, defined by parameters and return value. Functions are built up from basic blocks. Basic block is an instruction sequence that has no control flow instructions inside. It ends with terminator instruction that passes control to other basic blocks.
Also we'll need a map of named values (function parameters in our first version) and a reference to double type.
We'll pack context, IR builder, named values map and double type reference in a simple struct:
use std::collections::HashMap;
use llvm_sys::prelude::LLVMValueRef;
use iron_llvm::core;
use iron_llvm::core::types::{RealTypeCtor, RealTypeRef};
use iron_llvm::{LLVMRef, LLVMRefCtor};
pub struct Context {
context: core::Context,
builder: core::Builder,
named_values: HashMap<String, LLVMValueRef>,
ty: RealTypeRef
}
impl Context {
pub fn new() -> Context {
let context = core::Context::get_global();
let builder = core::Builder::new();
let named_values = HashMap::new();
let ty = RealTypeRef::get_double();
Context { context: context,
builder: builder,
named_values: named_values,
ty: ty
}
}
}
For code genertion we will use one module. But we'll create for it a trait ModuleProvider as it will simplify adding a JIT-compiler later (not showing uses this time):
pub trait ModuleProvider {
fn dump(&self);
fn get_module(&mut self) -> &mut core::Module;
fn get_function(&mut self, name: &str) -> Option<(FunctionRef, bool)>;
}
pub struct SimpleModuleProvider {
module: core::Module
}
impl SimpleModuleProvider {
pub fn new(name: &str) -> SimpleModuleProvider {
let module = core::Module::new(name);
SimpleModuleProvider {
module: module
}
}
}
impl ModuleProvider for SimpleModuleProvider {
fn dump(&self) {
self.module.dump();
}
fn get_module(&mut self) -> &mut core::Module {
&mut self.module
}
fn get_function(&mut self, name: &str) -> Option<(FunctionRef, bool)> {
match self.module.get_function_by_name(name) {
Some(f) => Some((f, f.count_basic_blocks() > 0)),
None => None
}
}
}
Functions defined in this trait do the following:
dumpdumps all the module content to the standard outputget_modulegives reference to the moduleget_functiongives generated function by name (if there is any), second element of pair tells whether this is prototype (function without body, containing no basic blocks) or definition.
Now when we have everything prepared, there is a time to add code generation functions to every AST element. The result of these functions will be LLVMValueRef. This type represents a Static Single Assignment value. Near everything you have in IR is an SSA value. Every such value has its type. In our simple language there will be only double typed values and functions.
AST elements will implement a trait for code generation:
pub type IRBuildingResult = Result<(LLVMValueRef, bool), String>;
fn error(message : &str) -> IRBuildingResult {
Err(message.to_string())
}
pub trait IRBuilder {
fn codegen(&self, context: &mut Context, module_provider: &mut ModuleProvider) -> IRBuildingResult;
}
We return a pair here with second element showing if the value we generated was an anonymous function. This will be useful later when we'll want to execute such functions (as you probably remember we've packed top-level expressions into anonymous functions).
Top level code generation
Let's implement IRBuilder trait for top level data structures. For ParsingResults, AST tree and ASTNode it is really trivial:
impl IRBuilder for parser::ParsingResult {
fn codegen(&self, context: &mut Context, module_provider: &mut ModuleProvider) -> IRBuildingResult {
match self {
&Ok((ref ast, _)) => ast.codegen(context, module_provider),
&Err(ref message) => Err(message.clone())
}
}
}
impl IRBuilder for Vec
{
fn
codegen(
&
self, context:
&
mut Context, module_provider:
&
mut ModuleProvider) -> IRBuildingResult {
let
mut result
=
error(
"empty AST");
for node
in
self.
iter() {
result
=
Ok(
try
!(node.
codegen(context, module_provider)));
}
result
}
}
impl
IRBuilder
for
parser::
ASTNode {
fn
codegen(
&
self, context:
&
mut Context, module_provider:
&
mut ModuleProvider) -> IRBuildingResult {
match
self {
&parser
::
ExternNode(
ref prototype)
=> prototype.
codegen(context, module_provider),
&parser
::
FunctionNode(
ref function)
=> function.
codegen(context, module_provider)
}
}
}
We just call codegen function for underlying elements and return its results. For AST tree (in our case, rather AST list) we return value of the last AST node.
Prototypes and functions are more complicated, as we need to do some real work there including handling of named function parameters.
Code generation for prototypes looks like this:
impl IRBuilder for parser::Prototype { fn codegen(&self, context: &mut Context, module_provider: &mut ModuleProvider) -> IRBuildingResult { // check if declaration with this name was already done let function = match module_provider.get_function(&self.name) { Some((prev_definition, redefinition)) => { // we do not allow to redeclare functions with // other signatures if prev_definition.count_params() as usize != self.args.len() { return error("redefinition of function with different number of args") } // we do not allow to redefine/redeclare already // defined functions (those that have the body) if redefinition { return error("redefinition of function"); } prev_definition }, None => { // function type is defined by number and types of // the arguments let mut param_types = iter::repeat(context.ty.to_ref()).take(self.args.len()).collect::<Vec<_>>(); let fty = FunctionTypeRef::get(&context.ty, param_types.as_mut_slice(), false); FunctionRef::new(&mut module_provider.get_module(), &self.name, &fty) } }; // set correct parameters names for (param, arg) in function.params_iter().zip(&self.args) { param.set_name(arg); } Ok((function.to_ref(), false)) } }
First we look if a function was already declared. If it was declared with the same signature but was not defined, we allow redeclaration (it is useful for e.g. forward function declarations). If the function was not declared previously, we create a new function with the type we need. Function type is determined by types and number of arguments. In our case function type effectively is defined only by number of arguments, as all of them have the same f64 type. At the end we iterate through the parameters setting correct names for them.
Function code generation looks like this:
impl IRBuilder for parser::Function {
fn codegen(&self, context: &mut Context, module_provider: &mut ModuleProvider) -> IRBuildingResult {
// we have no global variables, so we can clear all the
// previously defined named values as they come from other functions
context.named_values.clear();
let (function, _) = try!(self.prototype.codegen(context, module_provider));
let mut function = unsafe {FunctionRef::from_ref(function)};
// basic block that will contain generated instructions
let mut bb = function.append_basic_block_in_context(&mut context.context, "entry");
context.builder.position_at_end(&mut bb);
// set function parameters
for (param, arg) in function.params_iter().zip(&self.prototype.args) {
context.named_values.insert(arg.clone(), param.to_ref());
}
// emit function body
// if error occured, remove the function, so user can
// redefine it
let body = match self.body.codegen(context, module_provider) {
Ok((value, _)) => value,
Err(message) => {
unsafe {LLVMDeleteFunction(function.to_ref())};
return Err(message);
}
};
// the last instruction should be return
context.builder.build_ret(&body);
function.verify(LLVMAbortProcessAction);
// clear local variables
context.named_values.clear();
Ok((function.to_ref(), self.prototype.name.as_str() == ""))
}
}
First we call codegen for prototype that returns function reference. After it we insert a basic block into our function. A basic block is a container for a sequence of instructions. It contains a linear instructions sequence without branching and should end with a terminator instruction. When the entry basic block is appended we position the builder on it, so all the following instructions will be generated into this basic block. Then we add function parameters to the named_values map. After it we call codegen function for a body. If it fails, we completely remove the function that we are working with, so user can try to redefine it. Then we add a return instruction at the end of the function, clear local variables and return the generated value.
That's all with code generation for functions. We can proceed with expressions code generation now, as builder is setted up and has a place where it can emit instructions. Also we have local variables added to the named_values map, so they can be used from inside function bodies. Also, remember, that we have closed top level expressions into anonymous functions, we detect this by checking prototype name.
Expression code generation
As everything apart from function declarations/definitions is expression in kaleidoscope, we will have a big match on an Expression AST node in branches of which we will generate IR for appropriate language constructions. Here is the full function for reference, comments will follow:
impl IRBuilder for parser::Expression {
fn codegen(&self, context: &mut Context, module_provider: &mut ModuleProvider) -> IRBuildingResult {
match self {
&parser::LiteralExpr(ref value) => {
Ok((RealConstRef::get(&context.ty, *value).to_ref(), false))
},
&parser::VariableExpr(ref name) => {
match context.named_values.get(name) {
Some(value) => {
Ok((*value, false))
},
None => error("unknown variable name")
}
},
&parser::BinaryExpr(ref name, ref lhs, ref rhs) => {
let (lhs_value, _) = try!(lhs.codegen(context, module_provider));
let (rhs_value, _) = try!(rhs.codegen(context, module_provider));
match name.as_str() {
"+" => Ok((context.builder.build_fadd(lhs_value,
rhs_value,
"addtmp"),
false)),
"-" => Ok((context.builder.build_fsub(lhs_value,
rhs_value,
"subtmp"),
false)),
"*" => Ok((context.builder.build_fmul(lhs_value,
rhs_value,
"multmp"),
false)),
"<" => {
let cmp = context.builder.build_fcmp(LLVMRealOLT,
lhs_value,
rhs_value,
"cmptmp");
// convert boolean to double 0.0 or 1.0
Ok((context.builder.build_ui_to_fp(cmp,
context.ty.to_ref(),
"booltmp"),
false))
},
_ => error("invalid binary operator")
}
},
&parser::CallExpr(ref name, ref args) => {
let (function, _) = match module_provider.get_function(name) {
Some(function) => function,
None => return error("unknown function referenced")
};
if function.count_params() as usize != args.len() {
return error("incorrect number of arguments passed")
}
let mut args_value = Vec::new();
for arg in args.iter() {
let (arg_value, _) = try!(arg.codegen(context, module_provider));
args_value.push(arg_value);
}
Ok((context.builder.build_call(function.to_ref(),
args_value.as_mut_slice(),
"calltmp"),
false))
}
}
}
}
Let's have a look at match branches one by one.
For Literal expression we just return a real constant with the appropriate value:
&parser::LiteralExpr(ref value) => {
Ok((RealConstRef::get(&context.ty, *value).to_ref(), false))
},
For variables we look in the named_values map and if there is such a variable there (a value that corresponds to the function argument), we return the value or emit an error otherwise:
&parser::VariableExpr(ref name) => {
match context.named_values.get(name) {
Some(value) => {
Ok((*value, false))
},
None => error("unknown variable name")
}
},
For binary expressions we do some real instructions generation. Remember, that LLVM uses SSA, so value, instruction and variable are the same. They are identified by a value reference that code generation functions return. Names that we give to those functions are just hints to LLVM and will be changed to be different for every instruction. We give them to make reading of generated IR easier.
LLVM IR is a typed language, so when we receive a boolean result of comparison, we need to convert it to double (as Kaleidoscope has only double values).
First we generate values for LHS and RHS. Then we generate an instruction based on the value of operator. For comparison we do additional type conversion as mentioned.
&parser::BinaryExpr(ref name, ref lhs, ref rhs) => {
let (lhs_value, _) = try!(lhs.codegen(context, module_provider));
let (rhs_value, _) = try!(rhs.codegen(context, module_provider));
match name.as_str() {
"+" => Ok((context.builder.build_fadd(lhs_value,
rhs_value,
"addtmp"),
false)),
"-" => Ok((context.builder.build_fsub(lhs_value,
rhs_value,
"subtmp"),
false)),
"*" => Ok((context.builder.build_fmul(lhs_value,
rhs_value,
"multmp"),
false)),
"<" => {
let cmp = context.builder.build_fcmp(LLVMRealOLT,
lhs_value,
rhs_value,
"cmptmp");
// convert boolean to double 0.0 or 1.0
Ok((context.builder.build_ui_to_fp(cmp,
context.ty.to_ref(),
"booltmp"),
false))
},
_ => error("invalid binary operator")
}
},
For call code generation we do function name lookup in the LLVM Module's symbol table first. Then we compare the number of arguments in call AST node and in the function defined in the LLVM Module. After it we generate a value for every argument and create the arguments vector.
&parser::CallExpr(ref name, ref args) => {
let (function, _) = match module_provider.get_function(name) {
Some(function) => function,
None => return error("unknown function referenced")
};
if function.count_params() as usize != args.len() {
return error("incorrect number of arguments passed")
}
let mut args_value = Vec::new();
for arg in args.iter() {
let (arg_value, _) = try!(arg.codegen(context, module_provider));
args_value.push(arg_value);
}
Ok((context.builder.build_call(function.to_ref(),
args_value.as_mut_slice(),
"calltmp"),
false))
}
That's all for code generation. You can easily add new operators to Kaleidoscope with this implementation. For a list of instructions look in the LLVM language reference.
Full code for this chapter (including changes in driver, where we dump values as they are generate and the whole module before exiting) is available here.
We can experiment with LLVM IR building now:
> 2+2
define double @0() {
entry:
ret double 4.000000e+00
}
We didn't add any optimization, but LLVM already knows, that it can fold constants. Also, note how top level expressions are enclosed in anonymous functions.
> def f(a) a*a + a*a
define double @f(double %a) {
entry:
%multmp = fmul double %a, %a
%multmp1 = fmul double %a, %a
%addtmp = fadd double %multmp, %multmp1
ret double %addtmp
}
But more complicated cases are not handled. We will add optimization in the next chapter. Here you also can see how did LLVM use our names hints.
> extern cos(x)
declare double @cos(double)
> cos(1)
define double @1() {
entry:
%calltmp = call double @cos(double 1.000000e+00)
ret double %calltmp
}
LLVM can generate a call to extern function. We will see that we really can call standard functions this way later.
> .quit
; ModuleID = 'main'
define double @0() {
entry:
ret double 4.000000e+00
}
define double @f(double %a) {
entry:
%multmp = fmul double %a, %a
%multmp1 = fmul double %a, %a
%addtmp = fadd double %multmp, %multmp1
ret double %addtmp
}
declare double @cos(double)
define double @1() {
entry:
%calltmp = call double @cos(double 1.000000e+00)
ret double %calltmp
}
On exit our REPL dumps all the produced LLVM IR.
Chapter 3. Optimizer and JIT support
That's time to run our generated code. But before it we'll optimize it a little bit.
LLVM Optimization Passes
Even without adding any optimization passes IRBuilder does some obvious optimization that it can handle based on the local analysis. One of examples is constant folding:
> def text(x) 1+2+x;
define double @text(double %x) {
entry:
%addtmp = fadd double 3.000000e+00, %x
ret double %addtmp
}
Without ability of IRBuilder to do simple optimizations this IR would look like
define double @test(double %x) {
entry:
%addtmp = fadd double 2.000000e+00, 1.000000e+00
%addtmp1 = fadd double %addtmp, %x
ret double %addtmp1
}
This is very usefull feature as you do not need to handle constant folding yourself in the frontend.
However IRBuilder is unable do any optimizations that demand more then local analysis:
> def test(x) (1+2+x)*(x+(1+2));
define double @test(double %x) {
entry:
%addtmp = fadd double 3.000000e+00, %x
%addtmp1 = fadd double %x, 3.000000e+00
%multmp = fmul double %addtmp, %addtmp1
ret double %multmp
}
Here we would like to have RHS and LHS of multiplication to be computed only once.
LLVM provides a general framework for optimization -- LLVM optimization passes. Pass is analysis or transformation applied to IR. LLVM has two different pass scopes (and two pass managers) -- function passes and whole module passes. Function passmanager runs passes that operate on a single function at a time (global optimization passes), module pass manager runs passes that have the whole module as their input (interprocedural optimization passes). For more information see howto and list of implemented passes.
We'll use function pass manager to run some optimizations on our functions when they are completely generated. We'll create pass manager together with module and apply its passes when function generation is complete.
Function pass manager initialization is straightforward:
pub fn new_module(name: &str) -> (core::Module, core::FunctionPassManager) {
let module = core::Module::new(name);
let mut function_passmanager = core::FunctionPassManager::new(&module);
function_passmanager.add_basic_alias_analysis_pass();
function_passmanager.add_instruction_combining_pass();
function_passmanager.add_reassociate_pass();
function_passmanager.add_GVN_pass();
function_passmanager.add_CFG_simplification_pass();
function_passmanager.initialize();
(module, function_passmanager)
}
We create module and function pass manager associated with it. Then we add a series of passes. The first one is analysis the other four are transformation. These passes should reasonably cleanup and reorganize generated IR.
We'll store function pass manager togerther with module in our SimpleModuleProvider (also we'll change the ModuleProvider trait):
pub trait ModuleProvider {
fn dump(&self);
fn get_module(&mut self) -> &mut core::Module;
fn get_function(&mut self, name: &str) -> Option<(FunctionRef, bool)>;
fn get_pass_manager(&mut self) -> &mut core::FunctionPassManager;
}
pub struct SimpleModuleProvider {
function_passmanager: core::FunctionPassManager,
module: core::Module
}
impl SimpleModuleProvider {
pub fn new(name: &str) -> SimpleModuleProvider {
let (module, function_passmanager) = new_module(name);
SimpleModuleProvider {
function_passmanager: function_passmanager,
module: module
}
}
}
impl ModuleProvider for SimpleModuleProvider {
fn dump(&self) {
self.module.dump();
}
fn get_module(&mut self) -> &mut core::Module {
&mut self.module
}
fn get_function(&mut self, name: &str) -> Option<(FunctionRef, bool)> {
match self.module.get_function_by_name(name) {
Some(f) => Some((f, f.count_basic_blocks() > 0)),
None => None
}
}
fn get_pass_manager(&mut self) -> &mut core::FunctionPassManager {
&mut self.function_passmanager
}
}
Now we run our passes on every created function before return it:
// emit function body
// if error occured, remove the function, so user can
// redefine it
let body = match self.body.codegen(context, module_provider) {
Ok((value, _)) => value,
Err(message) => {
unsafe {LLVMDeleteFunction(function.to_ref())};
return Err(message);
}
};
// the last instruction should be return
context.builder.build_ret(&body);
function.verify(LLVMAbortProcessAction);
module_provider.get_pass_manager().run(&mut function);
// clear local variables
context.named_values.clear();
Ok((function.to_ref(), self.prototype.name.as_str() == ""))
}
}
We can try to run our example again and see if optimization helps:
> def test(x) (1+2+x)*(x+(1+2));
define double @test(double %x) {
entry:
%addtmp = fadd double %x, 3.000000e+00
%multmp = fmul double %addtmp, %addtmp
ret double %multmp
}
Nice, it works and does what we'd expected.
You can experiment with different passes using opt command line tool.
MCJIT based JIT-compiler
Now as we have reasonable IR generated it is time to compile and run it. As we are implementing REPL, we'll use JIT-compiler for compilation. There are two JIT-compiler infrastructures in LLVM: MCJIT and ORC. The second one is newer and nicer, but it lacks C bindings and Rust bindings so far (I'm working on fixing it though). In this chapter we will use MCJIT as a base for our JIT-compiler.
First of all we'll think about what do we need. That's quite simple: we want to generate IR for every entered entity and run top-level expressions (anonymous functions).
Let's define a simple trait for JIT compiler (note, that our compiler will own all the modules that we will have):
pub trait JITter : builder::ModuleProvider {
// TODO: fix https://github.com/rust-lang/rust/issues/5665
fn get_module_provider(&mut self) -> &mut builder::ModuleProvider;
fn run_function(&mut self, f: LLVMValueRef) -> f64;
}
For IR generation we need a module, so our jit-compiler will be a module provider (the get_module_provider method was added because of an annoying rustc bug: you cannot coerce to supertraits). Also we want to run some of generated functions, the method run_function will do this.
The main object that we'll need is an execution engine. It has all the methods for code generation/function running and can use both interpreter and jit-compiler. When it compiles module, it should be frozen and no longer touched. We'll need a collection of modules and corresponding execution engines. We will compile and close current module when we encounter a top-level expression.
So the plan is simple. Create a module. Fill it with IR. When user enters an expression, close the module. Create execution engine. Compile it and evalute the expression, showing result to user. Remember module and execution engine and repeat this in a loop.
Everything is fine and looks simple. But there is one problem: intermodular symbol resolution. By default LLVM resolves symbols only in current module (plus loaded libraries). If we will try to call function defined in some of previous modules, it will fail to do so. We will solve this issue with custom names resolver. Also we need to add some code that will generate prototypes for functions defined in other modules, so they can be called.
Let's define a container for execution engines and frozen modules first:
struct ModulesContainer {
execution_engines: Vec<ExecutionEngine>,
modules: Vec<FrozenModule>
}
Now we will define a method for looking for function addresses in already compiled modules (if nothing found we are returning zero):
impl ModulesContainer {
fn get_function_address(&self, name: &str) -> u64 {
for ee in &self.execution_engines {
let addr = ee.get_function_address(name);
if addr != 0 {
return addr;
}
}
0
}
}
JIT-compiler itself will contain current open module, associated function pass manager and container with already compiled stuff:
pub struct MCJITter {
module_name: String,
current_module: core::Module,
function_passmanager: core::FunctionPassManager,
container: Rc<RefCell<ModulesContainer>>
}
There is one tricky moment with the container: we make it be internally mutable reference counted pointer. We need to do this because we need to provide reference to the container to our symbol resolver, which itself will be owned by execution engine. This leads to problems with borrow checker that can be solved in the shown way. If you are not familiar with mentioned concepts, you can read appropriate chapter in the Rust book or consult with detailed documentation.
Now we are going to implement MCJITter internal methods. Constructor is trivial:
pub fn new(name: &str) -> MCJITter {
let (current_module, function_passmanager) = builder::new_module(name);
MCJITter {
module_name: String::from(name),
current_module: current_module,
function_passmanager: function_passmanager,
container: Rc::new(RefCell::new(ModulesContainer {
execution_engines: vec![],
modules: vec![]
}))
}
}
The method for closing current module is where the magic of execution engine creation happens:
fn close_current_module(& mut self) {
let (new_module, new_function_passmanager) = builder::new_module(&self.module_name);
self.function_passmanager = new_function_passmanager;
let current_module = std::mem::replace(&mut self.current_module, new_module);
let container = self.container.clone();
let memory_manager = BindingSectionMemoryManagerBuilder::new()
.set_get_symbol_address(move |mut parent_mm, name| {
let addr = parent_mm.get_symbol_address(name);
if addr != 0 {
return addr;
}
container.borrow().get_function_address(name)
})
.create();
let (execution_engine, module) = match MCJITBuilder::new()
.set_mcjit_memory_manager(Box::new(memory_manager))
.create(current_module) {
Ok((ee, module)) => (ee, module),
Err(msg) => panic!(msg)
};
self.container.borrow_mut().execution_engines.push(execution_engine);
self.container.borrow_mut().modules.push(module);
}
We create new module and pass manager first. Note the use of std::mem::replace, so we can move only from one record field.
let (new_module, new_function_passmanager) = builder::new_module(&self.module_name);
self.function_passmanager = new_function_passmanager;
let current_module = std::mem::replace(&mut self.current_module, new_module);
Then we create a custom memory manager for our execution engine. The symbol resolution is just a closure that owns a reference to our modules container. It asks default memory manager first, than it looks in already compiled modules:
let container = self.container.clone();
let memory_manager = BindingSectionMemoryManagerBuilder::new()
.set_get_symbol_address(move |mut parent_mm, name| {
let addr = parent_mm.get_symbol_address(name);
if addr != 0 {
return addr;
}
container.borrow().get_function_address(name)
})
.create();
Now we can create the execution engine for the current module:
let (execution_engine, module) = match MCJITBuilder::new()
.set_mcjit_memory_manager(Box::new(memory_manager))
.create(current_module) {
Ok((ee, module)) => (ee, module),
Err(msg) => panic!(msg)
};
create method returns execution engine and a frozen module.
Finally we update our modules and execution engines container:
self.container.borrow_mut().execution_engines.push(execution_engine);
self.container.borrow_mut().modules.push(module);
Now, as we have a method for execution engine creation on module closing and know how will our module organization look like, we can proceed with implementation of ModuleProvider and JITter traits.
dump, get_module and get_pass_manager are really simple:
fn dump(&self) {
for module in self.container.borrow().modules.iter() {
module.get().dump()
}
self.current_module.dump();
}
fn get_module(&mut self) -> &mut core::Module {
&mut self.current_module
}
fn get_pass_manager(&mut self) -> &mut core::FunctionPassManager {
&mut self.function_passmanager
}
Note, that we dump already compiled modules first and then our currently open module.
get_function is a little bit more complicated as we need to look in already compiled modules first. If we find already declared/defined function in one of the old modules, we look for a prototype in the current module. If we find not a prototype, but a definition (and we have one definition already), we have some error, as it should not be possible to redefine functions across modules. If prototype exists, we can return it. Our symbol resolution code will handle linking correctly.
If no prototype in the current module is available, we need to create one. To create it we need the function type. Note, that get_type on function returns type () -> F, where F is our real function type, so we need to call get_return_type on the returned value. Also these methods are not especially friendly in my current bindings, so we need to change reference type by hand (I hope to fix this).
If we've found or created only prototypes (in old module in the current one) we continue loop, as we want to find the definition if it exists.
If no function in previous modules is found, we look in the current one as we did in previous chapter (in SimpleModuleProvider). It also will handle the case when only prototypes were found, as one will be created in the current module.
Code for get_function follows:
fn get_function(&mut self, name: &str) -> Option<(FunctionRef, bool)> {
for module in &self.container.borrow().modules {
let funct = match module.get().get_function_by_name(name) {
Some(f) => {
f
},
None => continue
};
let proto = match self.current_module.get_function_by_name(name) {
Some(f) => {
if funct.count_basic_blocks() != 0 && f.count_basic_blocks() != 0 {
panic!("redefinition of function across modules")
}
f
},
None => {
// TODO: fix iron-llvm get_type
let fty = unsafe { FunctionTypeRef::from_ref(funct.get_type().to_ref()) };
let fty = unsafe { FunctionTypeRef::from_ref(fty.get_return_type().to_ref()) };
FunctionRef::new(&mut self.current_module, name, &fty)
}
};
if funct.count_basic_blocks() > 0 {
return Some((proto, true))
}
}
match self.current_module.get_function_by_name(name) {
Some(f) => Some((f, f.count_basic_blocks() > 0)),
None => None
}
}
Implementation of the JITter trait is straightforward. For run_function we close the current module and run the function using the lates execution engine (as the function lives in the just closed module). That's all. Run function method of execution engine compiles code automatically. Already written pieces of code ensures that we have all the necessary prototypes and correct symbol resolution.
impl JITter for MCJITter {
fn get_module_provider(&mut self) -> &mut builder::ModuleProvider {
self
}
fn run_function(&mut self, f: LLVMValueRef) -> f64 {
self.close_current_module();
let f = unsafe {FunctionRef::from_ref(f)};
let mut args = vec![];
let res = self.container.borrow()
.execution_engines.last().expect("MCJITter went crazy")
.run_function(&f, args.as_mut_slice());
let ty = RealTypeRef::get_double();
res.to_float(&ty)
}
}
Changes in the driver and 'built-in' functions
We will make our driver work both with SimpleModuleProvider (when only generating IR) and with MCJITter (when having REPL with jit-compiling). To make it easier, we will implement JITter trait for SimpleModuleProvider:
impl JITter for builder::SimpleModuleProvider {
fn get_module_provider(&mut self) -> &mut builder::ModuleProvider {
self
}
fn run_function(&mut self, _f: LLVMValueRef) -> f64 {
panic!("not implemented (and will not be)")
}
}
Now we will use an appropriate ir-container in the driver and depending on the stage and type of expression that user has entered we will dump IR or compile and execute it. Also we need to initialize native target for JIT-compiler.
use std::io;
use std::io::Write;
use iron_llvm::core::value::Value;
use iron_llvm::target;
use builder;
use builder::{IRBuilder, ModuleProvider};
use jitter;
use jitter::JITter;
use lexer::*;
use parser::*;
pub use self::Stage::{
Exec,
IR,
AST,
Tokens
};
#[derive(PartialEq, Clone, Debug)]
pub enum Stage {
Exec,
IR,
AST,
Tokens
}
pub fn main_loop(stage: Stage) {
let stdin = io::stdin();
let mut stdout = io::stdout();
let mut input = String::new();
let mut parser_settings = default_parser_settings();
let mut ir_container : Box<JITter> = if stage == Exec {
target::initilalize_native_target();
target::initilalize_native_asm_printer();
jitter::init();
Box::new(
jitter::MCJITter::new("main")
)
} else {
Box::new(
builder::SimpleModuleProvider::new("main")
)
};
let mut builder_context = builder::Context::new();
'main: loop {
print!("> ");
stdout.flush().unwrap();
input.clear();
stdin.read_line(&mut input).ok().expect("Failed to read line");
if input.as_str() == ".quit\n" {
break;
}
// the constructed AST
let mut ast = Vec::new();
// tokens left from the previous lines
let mut prev = Vec::new();
loop {
let tokens = tokenize(input.as_str());
if stage == Tokens {
println!("{:?}", tokens);
continue 'main
}
prev.extend(tokens.into_iter());
let parsing_result = parse(prev.as_slice(), ast.as_slice(), &mut parser_settings);
match parsing_result {
Ok((parsed_ast, rest)) => {
ast.extend(parsed_ast.into_iter());
if rest.is_empty() {
// we have parsed a full expression
break
} else {
prev = rest;
}
},
Err(message) => {
println!("Error occured: {}", message);
continue 'main
}
}
print!(". ");
stdout.flush().unwrap();
input.clear();
stdin.read_line(&mut input).ok().expect("Failed to read line");
}
if stage == AST {
println!("{:?}", ast);
continue
}
match ast.codegen(&mut builder_context,
ir_container.get_module_provider()) {
Ok((value, runnable)) =>
if runnable && stage == Exec {
println!("=> {}", ir_container.run_function(value));
} else {
value.dump();
},
Err(message) => println!("Error occured: {}", message)
}
}
if stage == IR || stage == Exec {
ir_container.dump();
}
}
You can see also call of the init function that will be explained in a moment, just ignore it for a while.
Now we modify the main function appropriately, so it calls the main loop for the Exec stage by default.
extern crate rustc_serialize;
extern crate docopt;
extern crate iron_kaleidoscope;
use iron_kaleidoscope::driver::{main_loop,
Exec,
IR,
AST,
Tokens
};
use docopt::Docopt;
const USAGE: &'static str = "
Usage: iron_kaleidoscope [(-l | -p | -i)]
Options:
-l Run only lexer and show its output.
-p Run only parser and show its output.
-i Run only IR builder and show its output.
";
#[derive(Debug, RustcDecodable)]
struct Args {
flag_l: bool,
flag_p: bool,
flag_i: bool
}
fn main() {
let args: Args = Docopt::new(USAGE)
.and_then(|d| d.decode())
.unwrap_or_else(|e| e.exit());
let stage = if args.flag_l {
Tokens
} else if args.flag_p {
AST
} else if args.flag_i {
IR
} else {
Exec
};
main_loop(stage);
}
Let's see how does it work now:
> 2+2
=> 4
> def a(x) x*x+x*x
define double @a(double %x) {
entry:
%multmp = fmul double %x, %x
%addtmp = fadd double %multmp, %multmp
ret double %addtmp
}
> a(4)
=> 32
> a(3)
=> 18
> extern sin(x)
declare double @sin(double)
> sin(1)
=> 0.8414709848078965
> sin(0)
=> 0
> .quit
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
define double @0() #0 {
entry:
ret double 4.000000e+00
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
define double @a(double %x) #0 {
entry:
%multmp = fmul double %x, %x
%addtmp = fadd double %multmp, %multmp
ret double %addtmp
}
define double @0() #0 {
entry:
%calltmp = call double @a(double 4.000000e+00)
ret double %calltmp
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
define double @0() #0 {
entry:
%calltmp = call double @a(double 3.000000e+00)
ret double %calltmp
}
declare double @a(double) #0
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
declare double @sin(double) #0
define double @0() #0 {
entry:
ret double 0x3FEAED548F090CEE
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
define double @0() #0 {
entry:
ret double 0.000000e+00
}
declare double @sin(double) #0
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
Everything works as great as we expected. Additionaly you can see that we are able to use functions from libraries such as sin. What more, we can define our own 'built-in' functions. To this aim we just create normal rust functions and register their addresses in LLVM with add_symbol function:
pub extern fn printd(x: f64) -> f64 {
println!("> {} <", x);
x
}
pub extern fn putchard(x: f64) -> f64 {
print!("{}", x as u8 as char);
x
}
pub fn init() {
unsafe {
add_symbol("printd", printd as *const ());
add_symbol("putchard", putchard as *const ());
}
}
That's all, we are able to call rust functions now:
> extern printd(x)
declare double @printd(double)
> printd(10)
> 10 <
=> 10
> extern putchard(x)
declare double @putchard(double)
> putchard(120)
x=> 120
> .quit
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
declare double @printd(double) #0
define double @0() #0 {
entry:
%calltmp = call double @printd(double 1.000000e+01)
ret double %calltmp
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
declare double @putchard(double) #0
define double @0() #0 {
entry:
%calltmp = call double @putchard(double 1.200000e+02)
ret double %calltmp
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
Full code for this chapter is available here.
Chapter 4. Extending Kaleidoscope: control flow
We have created a general framework for simple REPL based language implementation. It's time to add some Turing completeness to our language now.
If/Then/Else
Let's see how easy it is to extend our implementation. The first thing that we'll add is conditional branching. If/then/else construct will be an expression (like everything in the Kaleidoscope language) with value corresponding to the taken branch. We will consider 0.0 as false and any other value as true.
What we finally want to have is something like
def fib(x)
if x < 3 then
1
else
fib(x-1)+fib(x-2);
We will evaluate only one branch (this is important, as we can have side effects in our code).
Lexer and parser changes for /if/then/else
Let's start from formal grammar definition (only the relevant part of the grammar is shown):
primary_expr : [Ident | Number | call_expr | parenthesis_expr | conditional_expr];
conditional_expr : If expression Then expression Else expression;
where If, Then, Else are new tokens that we're going to add to the lexer:
#[derive(PartialEq, Clone, Debug)] pub enum Token { Def, Extern, If, Then, Else, Delimiter, //';' character OpeningParenthesis, ClosingParenthesis, Comma, Ident(String), Number(f64), Operator(String) } pub fn tokenize(input: &str) -> Vec{ // regex for commentaries (start with #, end with the line end) let comment_re = regex!( r"(?m)#.*\n"); // remove commentaries from the input stream let preprocessed = comment_re. replace_all(input, "\n"); let mut result = Vec :: new(); // regex for token, just union of straightforward regexes for different token types // operators are parsed the same way as identifier and separated later let token_re = regex!( concat!( r"(?P \p{Alphabetic}\w*)|" , r"(?P\d+\.?\d*)|" , r"(?P;)|" , r"(?P\()|" , r"(?P\))|" , r"(?P,)|" , r"(?P\S)" )); for cap in token_re. captures_iter(preprocessed. as_str()) { let token = if cap. name( "ident"). is_some() { match cap. name( "ident"). unwrap() { "def" => Def, "extern" => Extern, "if" => If, "then" => Then, "else" => Else, ident => Ident(ident. to_string()) } } else if cap. name( "number"). is_some() { match cap. name( "number"). unwrap(). parse() { Ok(number) => Number(number), Err(_) => panic!( "Lexer failed trying to parse number") } } else if cap. name( "delimiter"). is_some() { Delimiter } else if cap. name( "oppar"). is_some() { OpeningParenthesis } else if cap. name( "clpar"). is_some() { ClosingParenthesis } else if cap. name( "comma"). is_some() { Comma } else { Operator(cap. name( "operator"). unwrap(). to_string()) }; result. push(token) } result }
Lexer extension is completely staightforward, parser is not much more complicated:
#[derive(PartialEq, Clone, Debug)] pub enum Expression { LiteralExpr(f64), VariableExpr(String), BinaryExpr(String, Box<Expression>, Box<Expression>), ConditionalExpr{cond_expr: Box<Expression>, then_expr: Box<Expression>, else_expr: Box<Expression>}, CallExpr(String, Vec<Expression>) } fn parse_primary_expr(tokens : &mut Vec, settings : & mut ParserSettings) -> PartParsingResult { match tokens. last() { Some( & Ident(_)) => parse_ident_expr(tokens, settings), Some( & Number(_)) => parse_literal_expr(tokens, settings), Some( &If) => parse_conditional_expr(tokens, settings), Some( &OpeningParenthesis) => parse_parenthesis_expr(tokens, settings), None => return NotComplete, _ => error( "unknow token when expecting an expression") } } fn parse_conditional_expr(tokens : & mut Vec , settings : & mut ParserSettings) -> PartParsingResult { tokens. pop(); let mut parsed_tokens = vec![If]; let cond_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); expect_token!( [Then, Then, ()] <= tokens, parsed_tokens, "expected then"); let then_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); expect_token!( [Else, Else, ()] <= tokens, parsed_tokens, "expected else"); let else_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); Good(ConditionalExpr{cond_expr: box cond_expr, then_expr: box then_expr, else_expr: box else_expr}, parsed_tokens) }
First we extend our AST. Then we extend primary expression parsing with the call to conditional expression parsing if we see the If token. In this newly added function we parse the condition, look for Then token, parse 'then' branch, look for Else token and parse 'else' branch.
That's all, we have AST for if/then/else generated.
IR generation for if/then/else
Parser changes introduced no new concepts. Now the interesting part of implementation starts. Control flow for our if/then/else construct will look something like this:
A
^
/ \
/ \
B C
\ /
\ /
\ /
V
D
Execution goes in the top-down direction. Depending on the value calculated in the basic block A we execute either basic block B or C. In the basic block D we assign value to the result of the if/then/else expression. This value is one of values calculated in B or C.
We have code in SSA form. To construct a single variable that can be assigned one or other value we need to use the phi-operation (read the wikipedia article if you do not know what is it). Our case is really simple as we know exactly how the control flows and what value corresponds to which incoming branch. Because of this we're going to build the phi-operation by hand here. In the future when we'll define mutable variables, we will use some kind of available LLVM magic to generate SSA automatically as the case of mutable variables is more complicated.
So far as the result of IR code generation for if/then/else we want to have something that looks like this:
<=== Kaleidoscope input ===>
extern foo();
extern bar();
def baz(x) if x then foo() else bar();
<=========== IR ===========>
declare double @foo()
declare double @bar()
define double @baz(double %x) {
entry:
%ifcond = fcmp one double %x, 0.000000e+00
br i1 %ifcond, label %then, label %else
then: ; preds = %entry
%calltmp = call double @foo()
br label %ifcont
else: ; preds = %entry
%calltmp1 = call double @bar()
br label %ifcont
ifcont: ; preds = %else, %then
%iftmp = phi double [ %calltmp, %then ], [ %calltmp1, %else ]
ret double %iftmp
}
The IR does this:
- entry: evaluate the condition and compare it with zero. Branch to appropriate basic block depending on the evaluated value.
- then: evaluate
thenbranch and branch toifcont. - else: evaluate
elsebranch and branch toifcont. - ifcont: build the phi operation that assigns resulting value depending on the branch from which it received control. Return the result.
You see what do we want, let's add the necessary part to our IR builder:
&parser::ConditionalExpr{ref cond_expr, ref then_expr, ref else_expr} => {
let (cond_value, _) = try!(cond_expr.codegen(context, module_provider));
let zero = RealConstRef::get(&context.ty, 0.0);
let ifcond = context.builder.build_fcmp(LLVMRealONE, cond_value, zero.to_ref(), "ifcond");
let block = context.builder.get_insert_block();
let mut function = block.get_parent();
let mut then_block = function.append_basic_block_in_context(&mut context.context, "then");
let mut else_block = function.append_basic_block_in_context(&mut context.context, "else");
let mut merge_block = function.append_basic_block_in_context(&mut context.context, "ifcont");
context.builder.build_cond_br(ifcond, &then_block, &else_block);
context.builder.position_at_end(&mut then_block);
let (then_value, _) = try!(then_expr.codegen(context, module_provider));
context.builder.build_br(&merge_block);
let then_end_block = context.builder.get_insert_block();
context.builder.position_at_end(&mut else_block);
let (else_value, _) = try!(else_expr.codegen(context, module_provider));
context.builder.build_br(&merge_block);
let else_end_block = context.builder.get_insert_block();
context.builder.position_at_end(&mut merge_block);
// TODO: fix builder methods, so they generate the
// right instruction
let mut phi = unsafe {
PHINodeRef::from_ref(context.builder.build_phi(context.ty.to_ref(), "ifphi"))
};
phi.add_incoming(vec![then_value].as_mut_slice(), vec![then_end_block].as_mut_slice());
phi.add_incoming(vec![else_value].as_mut_slice(), vec![else_end_block].as_mut_slice());
Ok((phi.to_ref(), false))
},
Quite straightforward implementation of the described algorithm. Let's look at it line by line.
let (cond_value, _) = try!(cond_expr.codegen(context, module_provider));
let zero = RealConstRef::get(&context.ty, 0.0);
let ifcond = context.builder.build_fcmp(LLVMRealONE, cond_value, zero.to_ref(), "ifcond");
Here we evaluate condition and compare it with zero.
let block = context.builder.get_insert_block();
let mut function = block.get_parent();
let mut then_block = function.append_basic_block_in_context(&mut context.context, "then");
let mut else_block = function.append_basic_block_in_context(&mut context.context, "else");
let mut merge_block = function.append_basic_block_in_context(&mut context.context, "ifcont");
context.builder.build_cond_br(ifcond, &then_block, &else_block);
Generate a bunch of basic blocks and conditionally branch to then or else one.
context.builder.position_at_end(&mut then_block);
let (then_value, _) = try!(then_expr.codegen(context, module_provider));
context.builder.build_br(&merge_block);
let then_end_block = context.builder.get_insert_block();
context.builder.position_at_end(&mut else_block);
let (else_value, _) = try!(else_expr.codegen(context, module_provider));
context.builder.build_br(&merge_block);
let else_end_block = context.builder.get_insert_block();
Position at the branch block, evaluate its value and branch to the merge basic block. Note, that we remember the end block of then and else branches as it can be different from their starting blocks.
context.builder.position_at_end(&mut merge_block);
// TODO: fix builder methods, so they generate the
// right instruction
let mut phi = unsafe {
PHINodeRef::from_ref(context.builder.build_phi(context.ty.to_ref(), "ifphi"))
};
phi.add_incoming(vec![then_value].as_mut_slice(), vec![then_end_block].as_mut_slice());
phi.add_incoming(vec![else_value].as_mut_slice(), vec![else_end_block].as_mut_slice());
Ok((phi.to_ref(), false))
Build phi operation and add incoming values to it. Return its value as the result. Unsafe block is here due to slight inconsistency of my bindings (they are going to be fixed).
That's all. Let's try if our Fibonacci function works:
> def fib(x)
. if x < 3 then
. 1
. else
. fib(x-1)+fib(x-2);
define double @fib(double %x) {
entry:
%cmptmp = fcmp olt double %x, 3.000000e+00
%booltmp = uitofp i1 %cmptmp to double
%ifcond = fcmp one double %booltmp, 0.000000e+00
br i1 %ifcond, label %then, label %else
then: ; preds = %entry
br label %ifcont
else: ; preds = %entry
%subtmp = fsub double %x, 1.000000e+00
%calltmp = call double @fib(double %subtmp)
%subtmp1 = fsub double %x, 2.000000e+00
%calltmp2 = call double @fib(double %subtmp1)
%addtmp = fadd double %calltmp, %calltmp2
br label %ifcont
ifcont: ; preds = %else, %then
%ifphi = phi double [ 1.000000e+00, %then ], [ %addtmp, %else ]
ret double %ifphi
}
> fib(15)
=> 610
> .quit
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
define double @fib(double %x) #0 {
entry:
%cmptmp = fcmp olt double %x, 3.000000e+00
%booltmp = uitofp i1 %cmptmp to double
%ifcond = fcmp one double %booltmp, 0.000000e+00
br i1 %ifcond, label %then, label %else
then: ; preds = %entry
br label %ifcont
else: ; preds = %entry
%subtmp = fsub double %x, 1.000000e+00
%calltmp = call double @fib(double %subtmp)
%subtmp1 = fsub double %x, 2.000000e+00
%calltmp2 = call double @fib(double %subtmp1)
%addtmp = fadd double %calltmp, %calltmp2
br label %ifcont
ifcont: ; preds = %else, %then
%ifphi = phi double [ 1.000000e+00, %then ], [ %addtmp, %else ]
ret double %ifphi
}
define double @0() #0 {
entry:
%calltmp = call double @fib(double 1.500000e+01)
ret double %calltmp
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
'For' loop
Let's add a loop construct to our language. This will allow us to e.g output a line from stars (it was possible already with recursion, but some people think loops are easier):
extern putchard(char)
def printstar(n)
for i = 1, i < n, 1.0 in
putchard(42); # ascii 42 = '*'
# print 100 '*' characters
printstar(100);
Our loop defines new variable (i in this case) that iterates from starting value (1) while condition (i < n) is true. The variable is incremented by an optional step (1.0). If it is not supplied, it defaults to 1. We return zero as the result of the whole loop. When we'll add mutable variables there will be a possibility to write code that computes some values using loops.
Lexer and parser changes for the 'for' loop
Let's start from the grammar again:
primary_expr : [Ident | Number | call_expr | parenthesis_expr | conditional_expr | loop_expr];
loop_expr : For Ident Op= expression Comma expression [Comma expression]? In expression;
We are going to add For and In tokens to our parser. Op= means operator token with value =.
#[derive(PartialEq, Clone, Debug)] pub enum Token { Def, Extern, If, Then, Else, For, In, Delimiter, //';' character OpeningParenthesis, ClosingParenthesis, Comma, Ident(String), Number(f64), Operator(String) } pub fn tokenize(input: &str) -> Vec{ // regex for commentaries (start with #, end with the line end) let comment_re = regex!( r"(?m)#.*\n"); // remove commentaries from the input stream let preprocessed = comment_re. replace_all(input, "\n"); let mut result = Vec :: new(); // regex for token, just union of straightforward regexes for different token types // operators are parsed the same way as identifier and separated later let token_re = regex!( concat!( r"(?P \p{Alphabetic}\w*)|" , r"(?P\d+\.?\d*)|" , r"(?P;)|" , r"(?P\()|" , r"(?P\))|" , r"(?P,)|" , r"(?P\S)" )); for cap in token_re. captures_iter(preprocessed. as_str()) { let token = if cap. name( "ident"). is_some() { match cap. name( "ident"). unwrap() { "def" => Def, "extern" => Extern, "if" => If, "then" => Then, "else" => Else, "for" => For, "in" => In, ident => Ident(ident. to_string()) } } else if cap. name( "number"). is_some() { match cap. name( "number"). unwrap(). parse() { Ok(number) => Number(number), Err(_) => panic!( "Lexer failed trying to parse number") } } else if cap. name( "delimiter"). is_some() { Delimiter } else if cap. name( "oppar"). is_some() { OpeningParenthesis } else if cap. name( "clpar"). is_some() { ClosingParenthesis } else if cap. name( "comma"). is_some() { Comma } else { Operator(cap. name( "operator"). unwrap(). to_string()) }; result. push(token) } result }
Parser is also quite simple with one thing to note about handling of the optional part of the grammar:
#[derive(PartialEq, Clone, Debug)] pub enum Expression { LiteralExpr(f64), VariableExpr(String), BinaryExpr(String, Box<Expression>, Box<Expression>), ConditionalExpr{cond_expr: Box<Expression>, then_expr: Box<Expression>, else_expr: Box<Expression>}, LoopExpr{var_name: String, start_expr: Box<Expression>, end_expr: Box<Expression>, step_expr: Box<Expression>, body_expr: Box<Expression>}, CallExpr(String, Vec<Expression>) } fn parse_primary_expr(tokens : &mut Vec, settings : & mut ParserSettings) -> PartParsingResult { match tokens. last() { Some( & Ident(_)) => parse_ident_expr(tokens, settings), Some( & Number(_)) => parse_literal_expr(tokens, settings), Some( &If) => parse_conditional_expr(tokens, settings), Some( &For) => parse_loop_expr(tokens, settings), Some( &OpeningParenthesis) => parse_parenthesis_expr(tokens, settings), None => return NotComplete, _ => error( "unknow token when expecting an expression") } } fn parse_loop_expr(tokens : & mut Vec , settings : & mut ParserSettings) -> PartParsingResult { tokens. pop(); let mut parsed_tokens = vec![For]; let var_name = expect_token!( [ Ident(name), Ident(name. clone()), name] <= tokens, parsed_tokens, "expected identifier after for"); expect_token!( [ Operator(op), Operator(op. clone()), { if op. as_str() != "=" { return error( "expected '=' after for") } }] <= tokens, parsed_tokens, "expected '=' after for"); let start_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); expect_token!( [Comma, Comma, ()] <= tokens, parsed_tokens, "expected ',' after for start value"); let end_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); let step_expr = expect_token!( [Comma, Comma, parse_try!(parse_expr, tokens, settings, parsed_tokens)] else { LiteralExpr( 1.0)} <= tokens, parsed_tokens); expect_token!( [In, In, ()] <= tokens, parsed_tokens, "expected 'in' after for"); let body_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); Good(LoopExpr{var_name: var_name, start_expr: box start_expr, end_expr: box end_expr, step_expr: box step_expr, body_expr: box body_expr}, parsed_tokens) }
If we do not encounter Comma that should go before the optional step value, we return its default value (1.0) and continue parsing of the for loop expression. Other parsing code is completely straightforward and well-known from the previous chapters. Due to already implemented macros it corresponds to our grammar closely and contains nearly no boilerplate.
IR generation for the 'for' loop
IR generated for our short loop example without optimizations should look like
declare double @putchard(double)
define double @printstar(double %n) {
entry:
; initial value = 1.0 (inlined into phi)
br label %loop
loop: ; preds = %loop, %entry
%i = phi double [ 1.000000e+00, %entry ], [ %nextvar, %loop ]
; body
%calltmp = call double @putchard(double 4.200000e+01)
; increment
%nextvar = fadd double %i, 1.000000e+00
; termination test
%cmptmp = fcmp ult double %i, %n
%booltmp = uitofp i1 %cmptmp to double
%loopcond = fcmp one double %booltmp, 0.000000e+00
br i1 %loopcond, label %loop, label %afterloop
afterloop: ; preds = %loop
; loop always returns 0.0
ret double 0.000000e+00
}
All the concepts that we see here are familiar (phi expression, branches, basic blocks etc).
We will generate similar code.
&parser::LoopExpr{ref var_name, ref start_expr, ref end_expr, ref step_expr, ref body_expr} => {
let (start_value, _) = try!(start_expr.codegen(context, module_provider));
let preheader_block = context.builder.get_insert_block();
let mut function = preheader_block.get_parent();
let mut preloop_block = function.append_basic_block_in_context(&mut context.context, "preloop");
context.builder.build_br(&preloop_block);
context.builder.position_at_end(&mut preloop_block);
let mut variable = unsafe {
PHINodeRef::from_ref(context.builder.build_phi(context.ty.to_ref(), var_name))
};
variable.add_incoming(vec![start_value].as_mut_slice(), vec![preheader_block].as_mut_slice());
let old_value = context.named_values.remove(var_name);
context.named_values.insert(var_name.clone(), variable.to_ref());
let (end_value, _) = try!(end_expr.codegen(context, module_provider));
let zero = RealConstRef::get(&context.ty, 0.0);
let end_cond = context.builder.build_fcmp(LLVMRealONE, end_value, zero.to_ref(), "loopcond");
let mut after_block = function.append_basic_block_in_context(&mut context.context, "afterloop");
let mut loop_block = function.append_basic_block_in_context(&mut context.context, "loop");
context.builder.build_cond_br(end_cond, &loop_block, &after_block);
context.builder.position_at_end(&mut loop_block);
try!(body_expr.codegen(context, module_provider));
let (step_value, _) = try!(step_expr.codegen(context, module_provider));
let next_value = context.builder.build_fadd(variable.to_ref(), step_value, "nextvar");
let loop_end_block = context.builder.get_insert_block();
variable.add_incoming(vec![next_value].as_mut_slice(), vec![loop_end_block].as_mut_slice());
context.builder.build_br(&preloop_block);
context.builder.position_at_end(&mut after_block);
context.named_values.remove(var_name);
match old_value {
Some(value) => {context.named_values.insert(var_name.clone(), value);},
None => ()
};
Ok((zero.to_ref(), false))
}
This code should contain nothing new (familiar phi, branches and other machinery) apart from manipulations with named_values table. We create local loop variable and add it to the table. If there existed any variable with the same name, we hide it and remember the old value. On exit from loop we restore this all value back. From other interesting things, note, that we are adding incoming values to our phi node as soon as we have them. Also note, that we add the value for branch incoming from the end block of the loop body (similar as for conditional expression loop body can have a number of basic blocks).
Let's see how do our loops work:
> extern putchard(char)
declare double @putchard(double)
> def printstar(n)
. for i = 1, i < n, 1.0 in
. putchard(42);
define double @printstar(double %n) {
entry:
br label %preloop
preloop: ; preds = %loop, %entry
%i = phi double [ 1.000000e+00, %entry ], [ %nextvar, %loop ]
%cmptmp = fcmp olt double %i, %n
%booltmp = uitofp i1 %cmptmp to double
%loopcond = fcmp one double %booltmp, 0.000000e+00
br i1 %loopcond, label %loop, label %afterloop
afterloop: ; preds = %preloop
ret double 0.000000e+00
loop: ; preds = %preloop
%calltmp = call double @putchard(double 4.200000e+01)
%nextvar = fadd double %i, 1.000000e+00
br label %preloop
}
> printstar(100);
***************************************************************************************************=> 0
> .quit
; ModuleID = 'main'
target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128"
declare double @putchard(double) #0
define double @printstar(double %n) #0 {
entry:
br label %preloop
preloop: ; preds = %loop, %entry
%i = phi double [ 1.000000e+00, %entry ], [ %nextvar, %loop ]
%cmptmp = fcmp olt double %i, %n
%booltmp = uitofp i1 %cmptmp to double
%loopcond = fcmp one double %booltmp, 0.000000e+00
br i1 %loopcond, label %loop, label %afterloop
afterloop: ; preds = %preloop
ret double 0.000000e+00
loop: ; preds = %preloop
%calltmp = call double @putchard(double 4.200000e+01)
%nextvar = fadd double %i, 1.000000e+00
br label %preloop
}
define double @0() #0 {
entry:
%calltmp = call double @printstar(double 1.000000e+02)
ret double %calltmp
}
attributes #0 = { "no-frame-pointer-elim"="false" }
; ModuleID = 'main'
Full code for this chapter is as always available.
Chapter 5. Extending Kaleidoscope: user-defined operators
Our language is quite full at this moment, but we still lack some really important things. E.g. we have no division, logical negation, operation sequencing etc. We could implement necessary operators at the compiler level, but it is boring and shows us no new ideas. We choose to add the possibility to implement user-defined binary and unary operators instead and then implement all the necessary stuff in the Kaleidoscope language itself. At the end of this chapter we will be able to render the Mandelbrot set with some simple Kaleidoscope functions.
We're going to implement a mechanism for user-defined operators that is more general than e.g. one found in C++. We will be able to define completely new operators with their precedences. This is possible because we have easy to extend hand-written parser. One of the key features that makes this extension easy is using of operator precedence parsing for binary expressions. This allows us to dynamically change grammar during execution.
Here are some examples of the features (user-defined unary and binary operators) we're going to implement:
# Logical unary not.
def unary!(v)
if v then
0
else
1;
# Define > with the same precedence as <.
def binary> 10 (LHS RHS)
RHS < LHS;
# Binary "logical or", (note that it does not "short circuit")
def binary| 5 (LHS RHS)
if LHS then
1
else if RHS then
1
else
0;
# Define = with slightly lower precedence than relationals.
def binary= 9 (LHS RHS)
!(LHS < RHS | LHS > RHS);
You see that at the end of this chapter we'll be able to implement a fair amount of things that can be considered significant part of the language itself.
User-defined binary operators
We need to change our grammar for prototypes to reflect the possibility to have binary operators definitions:
prototype : [Ident | Binary Op Number ?] OpeningParenthesis [Ident Comma ?]* ClosingParenthesis;
Note that we do not change grammar for expressions. Anyway we do not use it to parse expressions (as you remember that grammar correctly generates binary expressions from the point of view of syntax, but doesn't express their semantics).
Implementation as usually starts with changing the lexer. We only add the Binary keyword there, so I'll not even show this change as it is completely trivial. Also note, that we do not need to change lexer to tokenize user-defined operator usage, as it already treats any unknown ASCII character as an operator.
Changes in the parser are much more interesting. BinaryExpr node of AST already contains string that represents operator as the corresponding ASCII character, so here we need no changes.
Where the changes start is function definition. We want to be able to parse definitions starting from something like def binary| 5. Let's extend our function AST nodes with additional information that shows that this given function is an operator. To this aim let's add a function type field to the prototype:
#[derive(PartialEq, Clone, Debug)]
pub struct Prototype {
pub name: String,
pub ftype: FunctionType,
pub args: Vec<String>
}
#[derive(PartialEq, Clone, Debug)]
pub enum FunctionType {
Normal,
BinaryOp(String, i32)
}
For normal functions we hold no additional information, for binary operators we store operator's name and precedence.
In a moment we'll change code for prototype parsing, but let's see first how we'll change code for function parsing if prototype parsing already works:
fn parse_function(tokens : &mut Vec
, settings :
&
mut ParserSettings) -> PartParsingResult
{
// eat Def token
tokens.
pop();
let
mut parsed_tokens
=
vec!(Def);
let prototype
=
parse_try!(parse_prototype, tokens, settings, parsed_tokens);
match prototype.ftype {
BinaryOp(
ref symbol, precedence)
=> {
settings.operator_precedence.
insert(symbol.
clone(), precedence);
},
_
=> ()
};
let body
=
parse_try!(parse_expr, tokens, settings, parsed_tokens);
Good(
FunctionNode(Function{prototype: prototype, body: body}), parsed_tokens)
}
The only thing we've added here is a match on the function type. If we are dealing with a binary operator, we add it to the operator precedence table. Because we use operator precedence parsing for binary expressions that's all we need to be able to dynamically change grammar. Note, that we change the operator precedence table before function body is parsed. In this way we allow recursion in binary operators.
Now the changes for prototype parsing come:
fn parse_prototype(tokens : &mut Vec
, _settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let (name, ftype)
=
expect_token!([
Ident(name),
Ident(name.
clone()), (name, Normal);
Binary, Binary, {
let op
=
expect_token!([
Operator(op),
Operator(op.
clone()), op
]
<= tokens, parsed_tokens,
"expected binary operator");
let precedence
=
expect_token!(
[
Number(value),
Number(value), value
as
i32]
else {
30}
<= tokens, parsed_tokens);
if precedence
<
1
|| precedence
>
100 {
return
error(
"invalid precedecnce: must be 1..100");
}
(
"binary".
to_string()
+
&op,
BinaryOp(op, precedence))
}
]
<= tokens, parsed_tokens,
"expected function name in prototype");
expect_token!(
[OpeningParenthesis, OpeningParenthesis, ()]
<= tokens,
parsed_tokens,
"expected '(' in prototype");
let
mut args
=
Vec
::
new();
loop {
expect_token!([
Ident(arg),
Ident(arg.
clone()), args.
push(arg.
clone());
Comma, Comma,
continue;
ClosingParenthesis, ClosingParenthesis,
break
]
<= tokens, parsed_tokens,
"expected ')' in prototype");
}
match ftype {
BinaryOp(_, _)
=>
if args.
len()
!=
2 {
return
error(
"invalid number of operands for binary operator")
},
_
=> ()
};
Good(Prototype{name: name, args: args, ftype: ftype}, parsed_tokens)
}
Here we literally implement changes in our grammar and make parsing code return function type in addition to its name. Precedence value is optional and defaults to 30 if not supplied. Also we ensure that it is in the [1..100] interval. We name our function binary@ where @ is the operator character. That's ok as LLVM allows any characters in function names.
At the end we check that exactly two arguments were declared for binary operators. That's all with parsing, let's switch to IR generation which is even simpler.
&parser::BinaryExpr(ref name, ref lhs, ref rhs) => {
let (lhs_value, _) = try!(lhs.codegen(context, module_provider));
let (rhs_value, _) = try!(rhs.codegen(context, module_provider));
match name.as_str() {
"+" => Ok((context.builder.build_fadd(lhs_value,
rhs_value,
"addtmp"),
false)),
"-" => Ok((context.builder.build_fsub(lhs_value,
rhs_value,
"subtmp"),
false)),
"*" => Ok((context.builder.build_fmul(lhs_value,
rhs_value,
"multmp"),
false)),
"<" => {
let cmp = context.builder.build_fcmp(LLVMRealOLT,
lhs_value,
rhs_value,
"cmptmp");
// convert boolean to double 0.0 or 1.0
Ok((context.builder.build_ui_to_fp(cmp,
context.ty.to_ref(),
"booltmp"),
false))
},
op => {
let name = "binary".to_string() + op;
let (function, _) = match module_provider.get_function(&name) {
Some(function) => function,
None => return error("binary operator not found")
};
let mut args_value = vec![lhs_value, rhs_value];
Ok((context.builder.build_call(function.to_ref(),
args_value.as_mut_slice(),
"binop"),
false))
}
}
},
We just change here the default branch of the match on the operator name the way that it doesn't generate error, but looks for binary operator function declaration. If it finds one, it generates call, otherwise it returns error.
That's all with binary operators. We can define our own items that play with other parts of expression just like language native ones.
User-defined unary operators
We had a framework necessary for user-defined binary operators already implemented in previous chapters. For unary operators we need to add some more pieces. But let's start from the grammar:
prototype : [Ident | Binary Op Number ? | Unary Op] OpeningParenthesis [Ident Comma ?]* ClosingParenthesis;
primary_expr : [Ident | Number | call_expr | parenthesis_expr | conditional_expr | loop_expr | unary_expr];
unary_expr: : Op primary_expr;
We add new type of prototype and new primary expression.
Implementing starts from the lexer where we add Unary token.
Then we add new AST node to the parser:
UnaryExpr(String, Box<Expression>),
and new function type:
#[derive(PartialEq, Clone, Debug)]
pub enum FunctionType {
Normal,
UnaryOp(String),
BinaryOp(String, i32)
}
Function parsing stays the same. Prototype parsing changes according to the grammar:
fn parse_prototype(tokens : &mut Vec
, _settings :
&
mut ParserSettings) -> PartParsingResult
{
let
mut parsed_tokens
=
Vec
::
new();
let (name, ftype)
=
expect_token!([
Ident(name),
Ident(name.
clone()), (name, Normal);
Unary, Unary, {
let op
=
expect_token!([
Operator(op),
Operator(op.
clone()), op
]
<= tokens, parsed_tokens,
"expected unary operator");
(
"unary".
to_string()
+
&op,
UnaryOp(op))
};
Binary, Binary, {
let op
=
expect_token!([
Operator(op),
Operator(op.
clone()), op
]
<= tokens, parsed_tokens,
"expected binary operator");
let precedence
=
expect_token!(
[
Number(value),
Number(value), value
as
i32]
else {
30}
<= tokens, parsed_tokens);
if precedence
<
1
|| precedence
>
100 {
return
error(
"invalid precedecnce: must be 1..100");
}
(
"binary".
to_string()
+
&op,
BinaryOp(op, precedence))
}
]
<= tokens, parsed_tokens,
"expected function name in prototype");
expect_token!(
[OpeningParenthesis, OpeningParenthesis, ()]
<= tokens,
parsed_tokens,
"expected '(' in prototype");
let
mut args
=
Vec
::
new();
loop {
expect_token!([
Ident(arg),
Ident(arg.
clone()), args.
push(arg.
clone());
Comma, Comma,
continue;
ClosingParenthesis, ClosingParenthesis,
break
]
<= tokens, parsed_tokens,
"expected ')' in prototype");
}
match ftype {
UnaryOp(_)
=>
if args.
len()
!=
1 {
return
error(
"invalid number of operands for unary operator")
},
BinaryOp(_, _)
=>
if args.
len()
!=
2 {
return
error(
"invalid number of operands for binary operator")
},
_
=> ()
};
Good(Prototype{name: name, args: args, ftype: ftype}, parsed_tokens)
}
We name functions for unary operators unary@ similar to the binary case and ensure that they accept exactly one argument.
Then we add parsing of unary expressions:
fn parse_primary_expr(tokens : &mut Vec, settings : & mut ParserSettings) -> PartParsingResult { match tokens. last() { Some( & Ident(_)) => parse_ident_expr(tokens, settings), Some( & Number(_)) => parse_literal_expr(tokens, settings), Some( &If) => parse_conditional_expr(tokens, settings), Some( &For) => parse_loop_expr(tokens, settings), Some( & Operator(_)) => parse_unary_expr(tokens, settings), Some( &OpeningParenthesis) => parse_parenthesis_expr(tokens, settings), None => return NotComplete, _ => error( "unknow token when expecting an expression") } } fn parse_unary_expr(tokens : & mut Vec , settings : & mut ParserSettings) -> PartParsingResult { let mut parsed_tokens = Vec :: new(); let name = expect_token!( [ Operator(name), Operator(name. clone()), name] <= tokens, parsed_tokens, "unary operator expected"); let operand = parse_try!(parse_primary_expr, tokens, settings, parsed_tokens); Good( UnaryExpr(name, box operand), parsed_tokens) }
IR building for unary expressions is also simple (just a call to appropriate function):
&parser::UnaryExpr(ref operator, ref operand) => {
let (operand, _) = try!(operand.codegen(context, module_provider));
let name = "unary".to_string() + operator;
let (function, _) = match module_provider.get_function(name.as_str()) {
Some(function) => function,
None => return error("unary operator not found")
};
let mut args_value = vec![operand];
Ok((context.builder.build_call(function.to_ref(),
args_value.as_mut_slice(),
"unop"),
false))
},
Painting the Mandelbrot set
So we have a really powerful language now. Let's start to program great things with it.
First a bunch of primitive operations:
> def unary!(v)
. if v then
. 0
. else
. 1;
define double @"unary!"(double %v) {
entry:
%ifcond = fcmp ueq double %v, 0.000000e+00
%. = select i1 %ifcond, double 1.000000e+00, double 0.000000e+00
ret double %.
}
> def unary-(v)
. 0-v;
define double @unary-(double %v) {
entry:
%subtmp = fsub double 0.000000e+00, %v
ret double %subtmp
}
> def binary> 10 (LHS RHS)
. RHS < LHS;
define double @"binary>"(double %LHS, double %RHS) {
entry:
%cmptmp = fcmp olt double %RHS, %LHS
%booltmp = uitofp i1 %cmptmp to double
ret double %booltmp
}
> def binary| 5 (LHS RHS)
. if LHS then
. 1
. else if RHS then
. 1
. else
. 0;
define double @"binary|"(double %LHS, double %RHS) {
entry:
%ifcond = fcmp ueq double %LHS, 0.000000e+00
%ifcond1 = fcmp ueq double %RHS, 0.000000e+00
%. = select i1 %ifcond1, double 0.000000e+00, double 1.000000e+00
%ifphi5 = select i1 %ifcond, double %., double 1.000000e+00
ret double %ifphi5
}
> def binary& 6 (LHS RHS)
. if !LHS then
. 0
. else
. !!RHS;
define double @"binary&"(double %LHS, double %RHS) {
entry:
%unop = call double @"unary!"(double %LHS)
%ifcond = fcmp ueq double %unop, 0.000000e+00
br i1 %ifcond, label %else, label %ifcont
else: ; preds = %entry
%unop1 = call double @"unary!"(double %RHS)
%unop2 = call double @"unary!"(double %unop1)
br label %ifcont
ifcont: ; preds = %entry, %else
%ifphi = phi double [ %unop2, %else ], [ 0.000000e+00, %entry ]
ret double %ifphi
}
> def binary = 9 (LHS RHS)
. !(LHS < RHS | LHS > RHS);
define double @"binary="(double %LHS, double %RHS) {
entry:
%cmptmp = fcmp olt double %LHS, %RHS
%booltmp = uitofp i1 %cmptmp to double
%binop = call double @"binary>"(double %LHS, double %RHS)
%binop1 = call double @"binary|"(double %booltmp, double %binop)
%unop = call double @"unary!"(double %binop1)
ret double %unop
}
> def binary : 1 (x y) y;
define double @"binary:"(double %x, double %y) {
entry:
ret double %y
}
The last one (:) is a simple precedence operator:
> extern printd(x);
declare double @printd(double)
> printd(123) : printd(456) : printd(789);
> 123 <
> 456 <
> 789 <
=> 789
Now we can define some funny I/O stuff. E.g. this function prints out a character whose “density” reflects the value passed in:
> extern putchard(char)
declare double @putchard(double)
> def printdensity(d)
. if d > 8 then
. putchard(32) # ' '
. else if d > 4 then
. putchard(46) # '.'
. else if d > 2 then
. putchard(43) # '+'
. else
. putchard(42); # '*'
define double @printdensity(double %d) {
entry:
%binop = call double @"binary>"(double %d, double 8.000000e+00)
%ifcond = fcmp ueq double %binop, 0.000000e+00
br i1 %ifcond, label %else, label %then
then: ; preds = %entry
%calltmp = call double @putchard(double 3.200000e+01)
br label %ifcont
else: ; preds = %entry
%binop1 = call double @"binary>"(double %d, double 4.000000e+00)
%ifcond2 = fcmp ueq double %binop1, 0.000000e+00
br i1 %ifcond2, label %else4, label %then3
ifcont: ; preds = %then9, %else10, %then3, %then
%ifphi15 = phi double [ %calltmp, %then ], [ %calltmp6, %then3 ], [ %calltmp12, %then9 ], [ %calltmp13, %else10 ]
ret double %ifphi15
then3: ; preds = %else
%calltmp6 = call double @putchard(double 4.600000e+01)
br label %ifcont
else4: ; preds = %else
%binop7 = call double @"binary>"(double %d, double 2.000000e+00)
%ifcond8 = fcmp ueq double %binop7, 0.000000e+00
br i1 %ifcond8, label %else10, label %then9
then9: ; preds = %else4
%calltmp12 = call double @putchard(double 4.300000e+01)
br label %ifcont
else10: ; preds = %else4
%calltmp13 = call double @putchard(double 4.200000e+01)
br label %ifcont
}
> printdensity(1): printdensity(2): printdensity(3):
. printdensity(4): printdensity(5): printdensity(9):
. putchard(10);
**++.
=> 10
Now we can do something more complex. Let's define a function that calculates the number of iterations that it takes for a complex orbit to escape, saturating to 255 (see Mandelbrot set).
> def mandleconverger(real imag iters creal cimag)
. if iters > 255 | (real*real + imag*imag > 4) then
. iters
. else
. mandleconverger(real*real - imag*imag + creal,
. 2*real*imag + cimag,
. iters+1, creal, cimag);
define double @mandleconverger(double %real, double %imag, double %iters, double %creal, double %cimag) {
entry:
%binop = call double @"binary>"(double %iters, double 2.550000e+02)
%multmp = fmul double %real, %real
%multmp1 = fmul double %imag, %imag
%addtmp = fadd double %multmp, %multmp1
%binop2 = call double @"binary>"(double %addtmp, double 4.000000e+00)
%binop3 = call double @"binary|"(double %binop, double %binop2)
%ifcond = fcmp ueq double %binop3, 0.000000e+00
br i1 %ifcond, label %else, label %ifcont
else: ; preds = %entry
%subtmp = fsub double %multmp, %multmp1
%addtmp6 = fadd double %subtmp, %creal
%multmp7 = fmul double %real, 2.000000e+00
%multmp8 = fmul double %multmp7, %imag
%addtmp9 = fadd double %multmp8, %cimag
%addtmp10 = fadd double %iters, 1.000000e+00
%calltmp = call double @mandleconverger(double %addtmp6, double %addtmp9, double %addtmp10, double %creal, double %cimag)
br label %ifcont
ifcont: ; preds = %entry, %else
%ifphi = phi double [ %calltmp, %else ], [ %iters, %entry ]
ret double %ifphi
}
> def mandleconverge(real imag)
. mandleconverger(real, imag, 0, real, imag);
define double @mandleconverge(double %real, double %imag) {
entry:
%calltmp = call double @mandleconverger(double %real, double %imag, double 0.000000e+00, double %real, double %imag)
ret double %calltmp
}
Yes, we work with complex numbers using our simple language. Now we are ready to paint some nice pictures.
> def mandelhelp(xmin xmax xstep ymin ymax ystep)
. for y = ymin, y < ymax, ystep in (
. (for x = xmin, x < xmax, xstep in
. printdensity(mandleconverge(x,y)))
. : putchard(10)
. )
define double @mandelhelp(double %xmin, double %xmax, double %xstep, double %ymin, double %ymax, double %ystep) {
entry:
br label %preloop
preloop: ; preds = %afterloop5, %entry
%y = phi double [ %ymin, %entry ], [ %nextvar9, %afterloop5 ]
%cmptmp = fcmp olt double %y, %ymax
br i1 %cmptmp, label %preloop1, label %afterloop
afterloop: ; preds = %preloop
ret double 0.000000e+00
preloop1: ; preds = %preloop, %loop6
%x = phi double [ %nextvar, %loop6 ], [ %xmin, %preloop ]
%cmptmp2 = fcmp olt double %x, %xmax
br i1 %cmptmp2, label %loop6, label %afterloop5
afterloop5: ; preds = %preloop1
%calltmp8 = call double @putchard(double 1.000000e+01)
%binop = call double @"binary:"(double 0.000000e+00, double %calltmp8)
%nextvar9 = fadd double %ystep, %y
br label %preloop
loop6: ; preds = %preloop1
%calltmp = call double @mandleconverge(double %x, double %y)
%calltmp7 = call double @printdensity(double %calltmp)
%nextvar = fadd double %xstep, %x
br label %preloop1
}
> def mandel(realstart imagstart realmag imagmag)
. mandelhelp(realstart, realstart+realmag*78, realmag,
. imagstart, imagstart+imagmag*40, imagmag);
define double @mandel(double %realstart, double %imagstart, double %realmag, double %imagmag) {
entry:
%multmp = fmul double %realmag, 7.800000e+01
%addtmp = fadd double %realstart, %multmp
%multmp1 = fmul double %imagmag, 4.000000e+01
%addtmp2 = fadd double %imagstart, %multmp1
%calltmp = call double @mandelhelp(double %realstart, double %addtmp, double %realmag, double %imagstart, double %addtmp2, double %imagmag)
ret double %calltmp
}
> mandel(-2.3, -1.3, 0.05, 0.07);
******************************************************************************
******************************************************************************
****************************************++++++********************************
************************************+++++...++++++****************************
*********************************++++++++.. ...+++++**************************
*******************************++++++++++.. ..+++++*************************
******************************++++++++++. ..++++++************************
****************************+++++++++.... ..++++++***********************
**************************++++++++....... .....++++**********************
*************************++++++++. . ... .++*********************
***********************++++++++... ++*********************
*********************+++++++++.... .+++********************
******************+++..+++++.... ..+++*******************
**************++++++. .......... +++*******************
***********++++++++.. .. .++*******************
*********++++++++++... .++++******************
********++++++++++.. .++++******************
*******++++++..... ..++++******************
*******+........ ...++++******************
*******+... .... ...++++******************
*******+++++...... ..++++******************
*******++++++++++... .++++******************
*********++++++++++... ++++******************
**********+++++++++.. .. ..++*******************
*************++++++.. .......... +++*******************
******************+++...+++..... ..+++*******************
*********************+++++++++.... ..++********************
***********************++++++++... +++********************
*************************+++++++.. . ... .++*********************
**************************++++++++....... ......+++**********************
****************************+++++++++.... ..++++++***********************
*****************************++++++++++.. ..++++++************************
*******************************++++++++++.. ...+++++*************************
*********************************++++++++.. ...+++++**************************
***********************************++++++....+++++****************************
***************************************++++++++*******************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
=> 0
> mandel(-2, -1, 0.02, 0.04);
******************************************************************++++++++++++
****************************************************************++++++++++++++
*************************************************************+++++++++++++++++
***********************************************************+++++++++++++++++++
********************************************************++++++++++++++++++++++
******************************************************++++++++++++++++++++++..
***************************************************+++++++++++++++++++++......
*************************************************++++++++++++++++++++.........
***********************************************+++++++++++++++++++... ..
********************************************++++++++++++++++++++......
******************************************++++++++++++++++++++.......
***************************************+++++++++++++++++++++..........
************************************++++++++++++++++++++++...........
********************************++++++++++++++++++++++++.........
***************************++++++++...........+++++..............
*********************++++++++++++.... .........................
***************+++++++++++++++++.... ......... ............
***********+++++++++++++++++++++..... ......
********+++++++++++++++++++++++.......
******+++++++++++++++++++++++++........
****+++++++++++++++++++++++++.......
***+++++++++++++++++++++++.........
**++++++++++++++++...........
*++++++++++++................
*++++....................
*++++....................
*++++++++++++................
**++++++++++++++++...........
***+++++++++++++++++++++++.........
****+++++++++++++++++++++++++.......
******+++++++++++++++++++++++++........
********+++++++++++++++++++++++.......
***********+++++++++++++++++++++..... ......
***************+++++++++++++++++.... ......... ............
*********************++++++++++++.... .........................
***************************++++++++...........+++++..............
********************************++++++++++++++++++++++++.........
************************************++++++++++++++++++++++...........
***************************************+++++++++++++++++++++..........
=> 0
> mandel(-0.9, -1.4, 0.02, 0.03);
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
******************************************************************************
****************************+++++++++++++++++*********************************
***********************+++++++++++...++++++++++++*****************************
********************+++++++++++++.. . .++++++++++++++*************************
*****************++++++++++++++++... ......++++++++++++***********************
**************+++++++++++++++++++... .......+++++++++++*********************
************++++++++++++++++++++.... .... ..++++++++++++*******************
**********++++++++++++++++++++++...... ...++++++++++++******************
********+++++++++++++++++++++++....... .....++++++++++++++****************
******++++++++++++++++++++++++....... .....+++++++++++++++***************
****+++++++++++++++++++++++++.... . .....+++++++++++++++**************
**+++++++++++++++++++++++++.... ...++++++++++++++++************
*+++++++++++++++++++++++....... ....++++++++++++++++***********
+++++++++++++++++++++.......... .....++++++++++++++++**********
++++++++++++++++++............. .......+++++++++++++++*********
+++++++++++++++................ ............++++++++++*********
+++++++++++++................. .................+++++********
+++++++++++... .... .......... .+++++*******
++++++++++..... ........ ...+++++******
++++++++...... ..++++++*****
+++++++........ ..+++++*****
+++++.......... ..++++++****
++++.......... ....++++++****
++.......... ....+++++++***
.......... ......+++++++**
.......... .....+++++++**
.......... .....++++++**
......... .+++++++*
........ .+++++++*
...... ...+++++++
. ....++++++++
...++++++++
..++++++++
=> 0
So we see that Kaleidoscope has grown to a real and powerful language.
As usually you can experiment with the full code for this chapter.
Chapter 6. Extending Kaleidoscope: mutable variables
At the moment our Kaleidoscope is a kind of a functional programming language. We've learnt quite a lot building it, but because of Kaleidoscope having no mutable variables and being functional we had no problems with building LLVM IR directly in SSA form.
Now it's time to go to the land of imperative pain and start generating SSA form for expressions with mutable variables. To understand why it's not so simple, you can look in the original guide or read any book about compilers (e.g. "Engineering a Compiler" by Keith Cooper and Linda Torczon).
The good news are that LLVM has pretty good and easy to use mechanism to generate SSA form. All LLVM IR must be in the SSA form, but this applies only to register values. Values in memory are not a subject of this rule. Futher, you have analysis/transform passes in LLVM, that can transform IR operating on memory values to IR in SSA form operating on register values.
So what we need to implement mutable variables is:
- store variables in memory (using stack allocation in our case)
- encode usage of variables as load/store operations
- run analysis/transform passes that will generate SSA form for us.
To learn more about memory in LLVM see appropriate part of the original tutorial.
Mutable variables in Kaleidoscope
At the moment we have only these kinds of variables: function arguments and loop induction variables. We'll add the possibility to mutate them and also we'll allow user to define new variables that also will be mutable.
In order to mutate variables we'll add new = operator and in order to define new ones we'll add new syntactic construction:
primary_expr : [Ident | Number | call_expr | parenthesis_expr | conditional_expr | loop_expr | unary_expr | var_expr];
var_expr : Var Ident [Op= expression]? [Comma Ident [Op= expression]?]* In expression;
Here is a small example of what we'll be able to do with these new possibilities:
# Define ':' for sequencing: as a low-precedence operator that ignores operands
# and just returns the RHS.
def binary : 1 (x y) y;
# Recursive fib, we could do this before.
def fib(x)
if (x < 3) then
1
else
fib(x-1)+fib(x-2);
# Iterative fib.
def fibi(x)
var a = 1, b = 1, c in
(for i = 3, i < x in
c = a + b :
a = b :
b = c) :
b;
# Call it.
fibi(10);
Adjusting variables for mutation
As a first step we'll refactor our code generation so the variables are presented as memory locations and then are converted to register values.
At the moment our named_values map from the Context holds values themselves, we'll change code working with it so it uses memory locations instead.
First we'll need to create memory allocas:
fn create_entry_block_alloca(context: &mut Context, function: &FunctionRef, var_name: &str) -> LLVMValueRef {
let mut builder = core::Builder::new();
let mut bb = function.get_entry();
let fi = bb.get_first_instruction();
builder.position(&mut bb, &fi);
builder.build_alloca(context.ty.to_ref(), var_name)
}
This code creates a new builder, positions it at the beginning of the function and builds an alloca for one variable.
We have two types of variables now: function parameters and loop variables. Let's create alloca's for them when they are defined:
// set function parameters
for (param, arg) in function.params_iter().zip(&self.prototype.args) {
let arg_alloca = create_entry_block_alloca(context, &function, arg);
context.builder.build_store(param.to_ref(), arg_alloca);
context.named_values.insert(arg.clone(), arg_alloca);
}
This code replaces old one in functions codegeneration. We create an alloca, store parameter value to it and insert memory location for variable in context.
In a loop expression we just create an alloca and store value in it in place of explicit phi node generation:
let variable = create_entry_block_alloca(context, &function, var_name);
context.builder.build_store(start_value, variable);
Now we are going to change variables usage. There are two places where we need to do so. First the loop expression (again, no manual phi node manipulation now):
let cur_value = context.builder.build_load(variable, var_name);
let next_value = context.builder.build_fadd(cur_value, step_value, "nextvar");
context.builder.build_store(next_value, variable);
We load current value here, calculate the next one and store it.
The other place we change is the variable expression:
&parser::VariableExpr(ref name) => {
match context.named_values.get(name) {
Some(value) => {
let var = context.builder.build_load(*value, name);
Ok((var, false))
},
None => error("unknown variable name")
}
},
Let's see what IR will be generated now:
> def fib(x)
. if (x < 3) then
. 1
. else
. fib(x-1)+fib(x-2);
define double @fib(double %x) {
entry:
%x1 = alloca double
store double %x, double* %x1
%cmptmp = fcmp olt double %x, 3.000000e+00
br i1 %cmptmp, label %ifcont, label %else
else: ; preds = %entry
%subtmp = fadd double %x, -1.000000e+00
%calltmp = call double @fib(double %subtmp)
%subtmp5 = fadd double %x, -2.000000e+00
%calltmp6 = call double @fib(double %subtmp5)
%addtmp = fadd double %calltmp, %calltmp6
br label %ifcont
ifcont: ; preds = %entry, %else
%ifphi = phi double [ %addtmp, %else ], [ 1.000000e+00, %entry ]
ret double %ifphi
}
We are ready to generate SSA form now. It is surprisingly easy, just add one pass:
function_passmanager.add_promote_memory_to_register_pass();
Kaleidoscope REPL starts to generate what we want:
> def fib(x)
. if (x < 3) then
. 1
. else
. fib(x-1)+fib(x-2);
define double @fib(double %x) {
entry:
%cmptmp = fcmp olt double %x, 3.000000e+00
br i1 %cmptmp, label %ifcont, label %else
else: ; preds = %entry
%subtmp = fadd double %x, -1.000000e+00
%calltmp = call double @fib(double %subtmp)
%subtmp5 = fadd double %x, -2.000000e+00
%calltmp6 = call double @fib(double %subtmp5)
%addtmp = fadd double %calltmp, %calltmp6
br label %ifcont
ifcont: ; preds = %entry, %else
%ifphi = phi double [ %addtmp, %else ], [ 1.000000e+00, %entry ]
ret double %ifphi
}
It is interesting to see how did this IR look when we generated phi nodes by hand:
> def fib(x)
. if (x < 3) then
. 1
. else
. fib(x-1)+fib(x-2);
define double @fib(double %x) {
entry:
%cmptmp = fcmp olt double %x, 3.000000e+00
br i1 %cmptmp, label %ifcont, label %else
else: ; preds = %entry
%subtmp = fadd double %x, -1.000000e+00
%calltmp = call double @fib(double %subtmp)
%subtmp1 = fadd double %x, -2.000000e+00
%calltmp2 = call double @fib(double %subtmp1)
%addtmp = fadd double %calltmp, %calltmp2
br label %ifcont
ifcont: ; preds = %entry, %else
%ifphi = phi double [ %addtmp, %else ], [ 1.000000e+00, %entry ]
ret double %ifphi
}
Ok, it looks the same apart from automatically generated names. Now we can implement our assignment operator.
Assignmnet operator
Implementing assignment operator is completely straightforward. First we add it into the table of predefined operators:
pub fn default_parser_settings() -> ParserSettings {
let mut operator_precedence = HashMap::new();
operator_precedence.insert("=".to_string(), 2);
operator_precedence.insert("<".to_string(), 10);
operator_precedence.insert("+".to_string(), 20);
operator_precedence.insert("-".to_string(), 20);
operator_precedence.insert("*".to_string(), 40);
ParserSettings{operator_precedence: operator_precedence}
}
Then we implement codegen for it:
if name.as_str() == "=" {
let var_name = match **lhs {
parser::VariableExpr(ref nm) => nm,
_ => return error("destination of '=' must be a variable")
};
let (value, _) = try!(rhs.codegen(context, module_provider));
let variable = match context.named_values.get(var_name) {
Some(vl) => *vl,
None => return error("unknown variable name")
};
context.builder.build_store(value, variable);
return Ok((value, false))
}
We codegen differently comparing to other binary operators. First we check that destination is a variable. Then we generate RHS and store it in the variable if it is found.
We can run something like this now:
# Function to print a double.
extern printd(x);
# Define ':' for sequencing: as a low-precedence operator that ignores operands
# and just returns the RHS.
def binary : 1 (x y) y;
def test(x)
printd(x) :
x = 4 :
printd(x);
test(123);
This will first print 123 and then 4 showing that our assignment operator really works.
User-defined local variables
Introduction of local variables starts like every change in syntax from the lexer (grammar was already defined above):
#[derive(PartialEq, Clone, Debug)] pub enum Token { Def, Extern, If, Then, Else, For, In, Binary, Unary, Var, Delimiter, //';' character OpeningParenthesis, ClosingParenthesis, Comma, Ident(String), Number(f64), Operator(String) } pub fn tokenize(input: &str) -> Vec{ // regex for commentaries (start with #, end with the line end) let comment_re = regex!( r"(?m)#.*\n"); // remove commentaries from the input stream let preprocessed = comment_re. replace_all(input, "\n"); let mut result = Vec :: new(); // regex for token, just union of straightforward regexes for different token types // operators are parsed the same way as identifier and separated later let token_re = regex!( concat!( r"(?P \p{Alphabetic}\w*)|" , r"(?P\d+\.?\d*)|" , r"(?P;)|" , r"(?P\()|" , r"(?P\))|" , r"(?P,)|" , r"(?P\S)" )); for cap in token_re. captures_iter(preprocessed. as_str()) { let token = if cap. name( "ident"). is_some() { match cap. name( "ident"). unwrap() { "def" => Def, "extern" => Extern, "if" => If, "then" => Then, "else" => Else, "for" => For, "in" => In, "binary" => Binary, "unary" => Unary, "var" => Var, ident => Ident(ident. to_string()) } } else if cap. name( "number"). is_some() { match cap. name( "number"). unwrap(). parse() { Ok(number) => Number(number), Err(_) => panic!( "Lexer failed trying to parse number") } } else if cap. name( "delimiter"). is_some() { Delimiter } else if cap. name( "oppar"). is_some() { OpeningParenthesis } else if cap. name( "clpar"). is_some() { ClosingParenthesis } else if cap. name( "comma"). is_some() { Comma } else { Operator(cap. name( "operator"). unwrap(). to_string()) }; result. push(token) } result }
We just add new keyword var here.
Than we change parser:
#[derive(PartialEq, Clone, Debug)] pub enum Expression { LiteralExpr(f64), VariableExpr(String), UnaryExpr(String, Box<Expression>), BinaryExpr(String, Box<Expression>, Box<Expression>), ConditionalExpr{cond_expr: Box<Expression>, then_expr: Box<Expression>, else_expr: Box<Expression>}, LoopExpr{var_name: String, start_expr: Box<Expression>, end_expr: Box<Expression>, step_expr: Box<Expression>, body_expr: Box<Expression>}, VarExpr{vars: Vec<(String, Expression)>, body_expr: Box<Expression>}, CallExpr(String, Vec<Expression>) } fn parse_primary_expr(tokens : &mut Vec, settings : & mut ParserSettings) -> PartParsingResult { match tokens. last() { Some( & Ident(_)) => parse_ident_expr(tokens, settings), Some( & Number(_)) => parse_literal_expr(tokens, settings), Some( &If) => parse_conditional_expr(tokens, settings), Some( &For) => parse_loop_expr(tokens, settings), Some( &Var) => parse_var_expr(tokens, settings), Some( & Operator(_)) => parse_unary_expr(tokens, settings), Some( &OpeningParenthesis) => parse_parenthesis_expr(tokens, settings), None => return NotComplete, _ => error( "unknow token when expecting an expression") } } fn parse_var_expr(tokens : & mut Vec , settings : & mut ParserSettings) -> PartParsingResult { tokens. pop(); let mut parsed_tokens = vec![Var]; let mut vars = Vec :: new(); loop { let var_name = expect_token!( [ Ident(name), Ident(name. clone()), name] <= tokens, parsed_tokens, "expected identifier list after var"); let init_expr = expect_token!( [ Operator(op), Operator(op. clone()), { if op. as_str() != "=" { return error( "expected '=' in variable initialization") } parse_try!(parse_expr, tokens, settings, parsed_tokens) }] else { LiteralExpr( 0.0)} <= tokens, parsed_tokens); vars. push((var_name, init_expr)); expect_token!( [Comma, Comma, ()] else { break} <= tokens, parsed_tokens); } expect_token!( [In, In, ()] <= tokens, parsed_tokens, "expected 'in' after var"); let body_expr = parse_try!(parse_expr, tokens, settings, parsed_tokens); Good(VarExpr{vars: vars, body_expr: box body_expr}, parsed_tokens) }
Here we add new AST entry, namely var expression. It consists of the vector of binding/value pairs and the body expression. Than we dispatch on Var literal in the primary expression parsing function. In the var expression parsing function we straightforwadly parse list of bindings (if no value provided, we set it to 0). Finally we parse body expression.
Builder changes follow:
&parser::VarExpr{ref vars, ref body_expr} => {
let mut old_bindings = Vec::new();
let function = context.builder.get_insert_block().get_parent();
for var in vars.iter() {
let (ref name, ref init_expr) = *var;
let (init_value, _) = try!(init_expr.codegen(context, module_provider));
let variable = create_entry_block_alloca(context, &function, name);
context.builder.build_store(init_value, variable);
old_bindings.push(context.named_values.remove(name));
context.named_values.insert(name.clone(), variable);
}
let (body_value, _) = try!(body_expr.codegen(context, module_provider));
let mut old_iter = old_bindings.iter();
for var in vars.iter() {
let (ref name, _) = *var;
context.named_values.remove(name);
match old_iter.next() {
Some(&Some(value)) => {context.named_values.insert(name.clone(), value);},
_ => ()
};
}
Ok((body_value, false))
}
We save old bindings, generate new ones and create allocas for them, insert them into context and than generate code for the body expression. At the end we restore old bindings back.
That's all we needed to add properly scoped mutable local variables. LLVM allowed us to avoid dirty our hands with "iterated dominance frontier" and to have our code concise and easy.
The full code for this chapter is available. This chapter finishes the main part of the tutorial about writing REPL using LLVM.
Next parts will cover different topics (like debug information, different JITs etc.), but the main work is done.
2 Aug 26, 2022
7 Nov 15, 2022
1 Dec 14, 2021
54 Dec 25, 2022
2 Jan 17, 2022
4 Aug 30, 2022
3 Dec 31, 2022
3 Mar 15, 2024
69 Jul 11, 2022
19 Oct 3, 2022
98 Jun 21, 2023
113 Dec 13, 2022
3 Dec 17, 2021
454 Dec 30, 2022
265 Dec 11, 2022
870 Jan 3, 2023
2 Nov 8, 2022
3 Mar 6, 2022
14 Oct 23, 2022