rust/src/librustc
bors cbf88730e7 Auto merge of #38813 - eddyb:lazy-11, r=nikomatsakis
[11/n] Separate ty::Tables into one per each body.

_This is part of a series ([prev](https://github.com/rust-lang/rust/pull/38449) | [next]()) of patches designed to rework rustc into an out-of-order on-demand pipeline model for both better feature support (e.g. [MIR-based](https://github.com/solson/miri) early constant evaluation) and incremental execution of compiler passes (e.g. type-checking), with beneficial consequences to IDE support as well.
If any motivation is unclear, please ask for additional PR description clarifications or code comments._

<hr>

In order to track the results of type-checking and inference for incremental recompilation, they must be stored separately for each function or constant value, instead of lumped together.

These side-`Tables` also have to be tracked by various passes, as they visit through bodies (all of which have `Tables`, even if closures share the ones from their parent functions). This is usually done by switching a `tables` field in an override of `visit_nested_body` before recursing through `visit_body`, to the relevant one and then restoring it - however, in many cases the nesting is unnecessary and creating the visitor for each body in the crate and then visiting that body, would be a much cleaner solution.

To simplify handling of inlined HIR & its side-tables, their `NodeId` remapping and entries HIR map were fully stripped out, which means that `NodeId`s from inlined HIR must not be used where a local `NodeId` is expected. It might be possible to make the nodes (`Expr`, `Block`, `Pat`, etc.) that only show up within a `Body` have IDs that are scoped to that `Body`, which would also allow `Tables` to use `Vec`s.

That last part also fixes #38790 which was accidentally introduced in a previous refactor.
2017-01-08 11:36:52 +00:00
..
cfg rustc: keep track of tables everywhere as if they were per-body. 2017-01-06 22:23:29 +02:00
dep_graph rustc: store ty::Tables separately for each body (except closures'). 2017-01-06 22:23:29 +02:00
hir Auto merge of #38813 - eddyb:lazy-11, r=nikomatsakis 2017-01-08 11:36:52 +00:00
infer rustc: keep track of tables everywhere as if they were per-body. 2017-01-06 22:23:29 +02:00
lint rustc: keep track of tables everywhere as if they were per-body. 2017-01-06 22:23:29 +02:00
middle rustc: keep track of tables everywhere as if they were per-body. 2017-01-06 22:23:29 +02:00
mir rustc: keep track of tables everywhere as if they were per-body. 2017-01-06 22:23:29 +02:00
session fix help for the --print option 2017-01-03 23:44:10 -06:00
traits rustc: keep track of tables everywhere as if they were per-body. 2017-01-06 22:23:29 +02:00
ty rustc: store ty::Tables separately for each body (except closures'). 2017-01-06 22:23:29 +02:00
util propagate TIME_DEPTH to the helper threads for -Z time-passes 2016-12-27 21:35:34 -05:00
Cargo.toml Such large. Very 128. Much bits. 2016-12-30 15:15:44 +01:00
diagnostics.rs Expand E0309 explanation with motivating example 2016-12-11 23:57:20 -05:00
lib.rs Auto merge of #38679 - alexcrichton:always-deny-warnings, r=nrc 2017-01-08 08:22:06 +00:00
macros.rs use diagnostic-mutating style for note_type_err too 2016-07-22 22:47:38 +03:00
README.md

An informal guide to reading and working on the rustc compiler.

If you wish to expand on this document, or have a more experienced Rust contributor add anything else to it, please get in touch:

or file a bug:

https://github.com/rust-lang/rust/issues

Your concerns are probably the same as someone else's.

The crates of rustc

Rustc consists of a number of crates, including libsyntax, librustc, librustc_back, librustc_trans, and librustc_driver (the names and divisions are not set in stone and may change; in general, a finer-grained division of crates is preferable):

  • libsyntax contains those things concerned purely with syntax that is, the AST, parser, pretty-printer, lexer, macro expander, and utilities for traversing ASTs are in a separate crate called "syntax", whose files are in ./../libsyntax, where . is the current directory (that is, the parent directory of front/, middle/, back/, and so on).

  • librustc (the current directory) contains the high-level analysis passes, such as the type checker, borrow checker, and so forth. It is the heart of the compiler.

  • librustc_back contains some very low-level details that are specific to different LLVM targets and so forth.

  • librustc_trans contains the code to convert from Rust IR into LLVM IR, and then from LLVM IR into machine code, as well as the main driver that orchestrates all the other passes and various other bits of miscellany. In general it contains code that runs towards the end of the compilation process.

  • librustc_driver invokes the compiler from libsyntax, then the analysis phases from librustc, and finally the lowering and codegen passes from librustc_trans.

Roughly speaking the "order" of the three crates is as follows:

          librustc_driver
                  |
+-----------------+-------------------+
|                                     |
libsyntax -> librustc -> librustc_trans

The compiler process:

The Rust compiler is comprised of six main compilation phases.

  1. Parsing input
  2. Configuration & expanding (cfg rules & syntax extension expansion)
  3. Running analysis passes
  4. Translation to LLVM
  5. LLVM passes
  6. Linking

Phase one is responsible for parsing & lexing the input to the compiler. The output of this phase is an abstract syntax tree (AST). The AST at this point includes all macro uses & attributes. This means code which will be later expanded and/or removed due to cfg attributes is still present in this version of the AST. Parsing abstracts away details about individual files which have been read into the AST.

Phase two handles configuration and macro expansion. You can think of this phase as a function acting on the AST from the previous phase. The input for this phase is the unexpanded AST from phase one, and the output is an expanded version of the same AST. This phase will expand all macros & syntax extensions and will evaluate all cfg attributes, potentially removing some code. The resulting AST will not contain any macros or macro_use statements.

The code for these first two phases is in libsyntax.

After this phase, the compiler allocates IDs to each node in the AST (technically not every node, but most of them). If we are writing out dependencies, that happens now.

The third phase is analysis. This is the most complex phase in the compiler, and makes up much of the code. This phase included name resolution, type checking, borrow checking, type & lifetime inference, trait selection, method selection, linting and so on. Most of the error detection in the compiler comes from this phase (with the exception of parse errors which arise during parsing). The "output" of this phase is a set of side tables containing semantic information about the source program. The analysis code is in librustc and some other crates with the librustc_ prefix.

The fourth phase is translation. This phase translates the AST (and the side tables from the previous phase) into LLVM IR (intermediate representation). This is achieved by calling into the LLVM libraries. The code for this is in librustc_trans.

Phase five runs the LLVM backend. This runs LLVM's optimization passes on the generated IR and generates machine code resulting in object files. This phase is not really part of the Rust compiler, as LLVM carries out all the work. The interface between LLVM and Rust is in librustc_llvm.

The final phase, phase six, links the object files into an executable. This is again outsourced to other tools and not performed by the Rust compiler directly. The interface is in librustc_back (which also contains some things used primarily during translation).

A module called the driver coordinates all these phases. It handles all the highest level coordination of compilation from parsing command line arguments all the way to invoking the linker to produce an executable.

Modules in the librustc crate

The librustc crate itself consists of the following submodules (mostly, but not entirely, in their own directories):

  • session: options and data that pertain to the compilation session as a whole
  • middle: middle-end: name resolution, typechecking, LLVM code generation
  • metadata: encoder and decoder for data required by separate compilation
  • plugin: infrastructure for compiler plugins
  • lint: infrastructure for compiler warnings
  • util: ubiquitous types and helper functions
  • lib: bindings to LLVM

The entry-point for the compiler is main() in the librustc_driver crate.

The 3 central data structures:

  1. ./../libsyntax/ast.rs defines the AST. The AST is treated as immutable after parsing, but it depends on mutable context data structures (mainly hash maps) to give it meaning.

    • Many though not all nodes within this data structure are wrapped in the type spanned<T>, meaning that the front-end has marked the input coordinates of that node. The member node is the data itself, the member span is the input location (file, line, column; both low and high).

    • Many other nodes within this data structure carry a def_id. These nodes represent the 'target' of some name reference elsewhere in the tree. When the AST is resolved, by middle/resolve.rs, all names wind up acquiring a def that they point to. So anything that can be pointed-to by a name winds up with a def_id.

  2. middle/ty.rs defines the datatype sty. This is the type that represents types after they have been resolved and normalized by the middle-end. The typeck phase converts every ast type to a ty::sty, and the latter is used to drive later phases of compilation. Most variants in the ast::ty tag have a corresponding variant in the ty::sty tag.

  3. ./../librustc_llvm/lib.rs defines the exported types ValueRef, TypeRef, BasicBlockRef, and several others. Each of these is an opaque pointer to an LLVM type, manipulated through the lib::llvm interface.