Eval of Julia code

    Each chunk of code typically makes a trip through many steps with potentially unfamiliar names, such as (in no particular order): flisp, AST, C++, LLVM, , typeinf, macroexpand, sysimg (or system image), bootstrapping, compile, parse, execute, JIT, interpret, box, unbox, intrinsic function, and primitive function, before turning into the desired result (hopefully).

    Definitions

    • REPL

      REPL stands for Read-Eval-Print Loop. It’s just what we call the command line environment for short.

    • AST

      Abstract Syntax Tree The AST is the digital representation of the code structure. In this form the code has been tokenized for meaning so that it is more suitable for manipulation and execution.

    The 10,000 foot view of the whole process is as follows:

    1. The user starts julia.
    2. The C function main() from ui/repl.c gets called. This function processes the command line arguments, filling in the jl_options struct and setting the variable ARGS. It then initializes Julia (by calling julia_init in task.c, which may load a previously compiled ). Finally, it passes off control to Julia by calling Base._start().
    3. Skipping the details about how the REPL interacts with the user, let’s just say the program ends up with a block of code that it wants to run.
    4. If the block of code to run is in a file, gets invoked to load the file and parse it. Each fragment of code is then passed to eval to execute.
    5. Each fragment of code (or AST), is handed off to to turn into results.
    6. eval() takes each code fragment and tries to run it in .
    7. jl_toplevel_eval_flex() decides whether the code is a “toplevel” action (such as using or module), which would be invalid inside a function. If so, it passes off the code to the toplevel interpreter.
    8. jl_toplevel_eval_flex() then expands the code to eliminate any macros and to “lower” the AST to make it simpler to execute.
    9. jl_toplevel_eval_flex() then uses some simple heuristics to decide whether to JIT compiler the AST or to interpret it directly.
    10. The bulk of the work to interpret code is handled by .
    11. If instead, the code is compiled, the bulk of the work is handled by codegen.cpp. Whenever a Julia function is called for the first time with a given set of argument types, type inference will be run on that function. This information is used by the step to generate faster code.
    12. Eventually, the user quits the REPL, or the end of the program is reached, and the _start() method returns.

    Parsing

    The Julia parser is a small lisp program written in femtolisp, the source-code for which is distributed inside Julia in .

    The interface functions for this are primarily defined in jlfrontend.scm. The code in handles this handoff on the Julia side.

    The other relevant files at this stage are julia-parser.scm, which handles tokenizing Julia code and turning it into an AST, and , which handles transforming complex AST representations into simpler, “lowered” AST representations which are more suitable for analysis and execution.

    When eval() encounters a macro, it expands that AST node before attempting to evaluate the expression. Macro expansion involves a handoff from (in Julia), to the parser function jl_macroexpand() (written in flisp) to the Julia macro itself (written in - what else - Julia) via fl_invoke_julia_macro(), and back.

    Typically, macro expansion is invoked as a first step during a call to Meta.lower()/jl_expand(), although it can also be invoked directly by a call to /jl_macroexpand().

    Type Inference

    Type inference is implemented in Julia by . Type inference is the process of examining a Julia function and determining bounds for the types of each of its variables, as well as bounds on the type of the return value from the function. This enables many future optimizations, such as unboxing of known immutable values, and compile-time hoisting of various run-time operations such as computing field offsets and function pointers. Type inference may also include other steps such as constant propagation and inlining.

    More Definitions

    • JIT

    • LLVM

      Low-Level Virtual Machine (a compiler) The Julia JIT compiler is a program/library called libLLVM. Codegen in Julia refers both to the process of taking a Julia AST and turning it into LLVM instructions, and the process of LLVM optimizing that and turning it into native assembly instructions.

    • C++

      The programming language that LLVM is implemented in, which means that codegen is also implemented in this language. The rest of Julia’s library is implemented in C, in part because its smaller feature set makes it more usable as a cross-language interface layer.

    • box

      This term is used to describe the process of taking a value and allocating a wrapper around the data that is tracked by the garbage collector (gc) and is tagged with the object’s type.

    • unbox

      The reverse of boxing a value. This operation enables more efficient manipulation of data when the type of that data is fully known at compile-time (through type inference).

    • generic function

      A Julia function composed of multiple “methods” that are selected for dynamic dispatch based on the argument type-signature

    • anonymous function or “method”

      A Julia function without a name and without type-dispatch capabilities

    • primitive function

      A function implemented in C but exposed in Julia as a named function “method” (albeit without generic function dispatch capabilities, similar to a anonymous function)

    • intrinsic function

    Codegen is the process of turning a Julia AST into native machine code.

    The JIT environment is initialized by an early call to jl_init_codegen in codegen.cpp.

    On demand, a Julia method is converted into a native function by the function emit_function(jl_method_instance_t*). (note, when using the MCJIT (in LLVM v3.4+), each function must be JIT into a new module.) This function recursively calls emit_expr() until the entire function has been emitted.

    Much of the remaining bulk of this file is devoted to various manual optimizations of specific code patterns. For example, emit_known_call() knows how to inline many of the primitive functions (defined in ) for various combinations of argument types.

    Other parts of codegen are handled by various helper files:

    • debuginfo.cpp

      Handles backtraces for JIT functions

    • Handles the emission of various low-level intrinsic functions

    Bootstrapping

    The process of creating a new system image is called “bootstrapping”.

    The etymology of this word comes from the phrase “pulling oneself up by the bootstraps”, and refers to the idea of starting from a very limited set of available functions and definitions and ending with the creation of a full-featured environment.

    System Image

    The system image is a precompiled archive of a set of Julia files. The sys.ji file distributed with Julia is one such system image, generated by executing the file , and serializing the resulting environment (including Types, Functions, Modules, and all other defined values) into a file. Therefore, it contains a frozen version of the Main, Core, and Base modules (and whatever else was in the environment at the end of bootstrapping). This serializer/deserializer is implemented by jl_save_system_image/jl_restore_system_image in staticdata.c.