1 //===-- BrainF.h - BrainF compiler class ----------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===--------------------------------------------------------------------===//
10 // This class stores the data for the BrainF compiler so it doesn't have
11 // to pass all of it around. The main method is parse.
13 //===--------------------------------------------------------------------===//
18 #include "llvm/LLVMContext.h"
19 #include "llvm/Module.h"
20 #include "llvm/Support/IRBuilder.h"
24 /// This class provides a parser for the BrainF language.
25 /// The class itself is made to store values during
26 /// parsing so they don't have to be passed around
30 /// Options for how BrainF should compile
36 /// This is the main method. It parses BrainF from in1
37 /// and returns the module with a function
39 /// containing the resulting code.
40 /// On error, it calls abort.
41 /// The caller must delete the returned module.
42 Module
*parse(std::istream
*in1
, int mem
, CompileFlags cf
,
46 /// The different symbols in the BrainF language
58 /// Names of the different parts of the language.
59 /// Tape is used for reading and writing the tape.
60 /// headreg is used for the position of the head.
61 /// label is used for the labels for the BasicBlocks.
62 /// testreg is used for testing the loop exit condition.
63 static const char *tapereg
;
64 static const char *headreg
;
65 static const char *label
;
66 static const char *testreg
;
68 /// Put the brainf function preamble and other fixed pieces of code
69 void header(LLVMContext
& C
);
71 /// The main loop for parsing. It calls itself recursively
72 /// to handle the depth of nesting of "[]".
73 void readloop(PHINode
*phi
, BasicBlock
*oldbb
,
74 BasicBlock
*testbb
, LLVMContext
&Context
);
76 /// Constants during parsing
81 Function
*brainf_func
;
82 Function
*getchar_func
;
83 Function
*putchar_func
;
87 BasicBlock
*aberrorbb
;