Eval of Julia code
One of the hardest parts about learning how the Julia Language runs code is learning how all of the pieces work together to execute a block of 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,
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).
The 10,000 foot view of the whole process is as follows:
The user starts
The C function
ui/repl.cgets called. This function processes the command line arguments, filling in the
jl_optionsstruct and setting the variable
ARGS. It then initializes Julia (by calling
task.c, which may load a previously compiled sysimg). Finally, it passes off control to Julia by calling
_start()takes over control, the subsequent sequence of commands depends on the command line arguments given. For example, if a filename was supplied, it will proceed to execute that file. Otherwise, it will start an interactive REPL.
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.
If the block of code to run is in a file,
jl_load(char *filename)gets invoked to load the file and parse it. Each fragment of code is then passed to
Each fragment of code (or AST), is handed off to
eval()to turn into results.
eval()takes each code fragment and tries to run it in
jl_toplevel_eval_flex()decides whether the code is a "toplevel" action (such as
module), which would be invalid inside a function. If so, it passes off the code to the toplevel interpreter.
jl_toplevel_eval_flex()then expands the code to eliminate any macros and to "lower" the AST to make it simpler to execute.
jl_toplevel_eval_flex()then uses some simple heuristics to decide whether to JIT compiler the AST or to interpret it directly.
The bulk of the work to interpret code is handled by
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 codegen step to generate faster code.
Eventually, the user quits the REPL, or the end of the program is reached, and the
Just before exiting,
jl_atexit_hook(exit_code). This calls
Base._atexit()(which calls any functions registered to
atexit()inside Julia). Then it calls
jl_gc_run_all_finalizers(). Finally, it gracefully cleans up all
libuvhandles and waits for them to flush and close.
The Julia parser is a small lisp program written in femtolisp, the source-code for which is distributed inside Julia in src/flisp.
The interface functions for this are primarily defined in
jlfrontend.scm. The code in
ast.c 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
julia-syntax.scm, which handles transforming complex AST representations into simpler, "lowered" AST representations which are more suitable for analysis and execution.
eval() encounters a macro, it expands that AST node before attempting to evaluate the expression. Macro expansion involves a handoff from
eval() (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
jl_expand(), although it can also be invoked directly by a call to
Type inference is implemented in Julia by
inference.jl. 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.
JIT Code Generation
Codegen is the process of turning a Julia AST into native machine code.
The JIT environment is initialized by an early call to
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
builtins.c) for various combinations of argument types.
Other parts of codegen are handled by various helper files:
Handles backtraces for JIT functions
Handles the ccall and llvmcall FFI, along with various
Handles the emission of various low-level intrinsic functions
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
sysimg.jl, 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
Base modules (and whatever else was in the environment at the end of bootstrapping). This serializer/deserializer is implemented by
If there is no sysimg file (
jl_options.image_file == NULL), this also implies that
--build was given on the command line, so the final result should be a new sysimg file. During Julia initialization, minimal
Main modules are created. Then a file named
boot.jl is evaluated from the current directory. Julia then evaluates any file given as a command line argument until it reaches the end. Finally, it saves the resulting environment to a "sysimg" file for use as a starting point for a future Julia run.