summary refs log tree commit diff
path: root/src/librustc_incremental
AgeCommit message (Collapse)AuthorLines
2017-03-10isolate dep-graph tasksNiko Matsakis-1/+5
A task function is now given as a `fn` pointer to ensure that it carries no state. Each fn can take two arguments, because that worked out to be convenient -- these two arguments must be of some type that is `DepGraphSafe`, a new trait that is intended to prevent "leaking" information into the task that was derived from tracked state. This intentionally leaves `DepGraph::in_task()`, the more common form, alone. Eventually all uses of `DepGraph::in_task()` should be ported to `with_task()`, but I wanted to start with a smaller subset. Originally I wanted to use closures bound by an auto trait, but that approach has some limitations: - the trait cannot have a `read()` method; since the current method is unused, that may not be a problem. - more importantly, we would want the auto trait to be "undefined" for all types *by default* -- that is, this use case doesn't really fit the typical auto trait scenario. For example, imagine that there is a `u32` loaded out of a `hir::Node` -- we don't really want to be passing that `u32` into the task!
2017-03-04Auto merge of #40202 - jseyfried:integrate_tokenstream, r=nrcbors-11/+5
syntax: integrate `TokenStream` Use `TokenStream` instead of `Vec<TokenTree>` in `TokenTree::Delimited` and elsewhere. r? @nrc
2017-03-03Integrate `TokenStream`.Jeffrey Seyfried-11/+5
2017-03-03Auto merge of #39927 - nikomatsakis:incr-comp-skip-borrowck-2, r=eddybbors-1/+1
transition borrowck to visit all **bodies** and not item-likes This is a better structure for incremental compilation and also more compatible with the eventual borrowck mir. It also fixes #38520 as a drive-by fix. r? @eddyb
2017-02-28Remove `Token::MatchNt`.Jeffrey Seyfried-4/+0
2017-02-28Add `syntax::ext::tt::quoted::{TokenTree, ..}` and remove ↵Jeffrey Seyfried-20/+0
`tokenstream::TokenTree::Sequence`.
2017-02-28store the visit order in the CrateNiko Matsakis-1/+1
2017-02-25rustc_typeck: rework coherence to be almost completely on-demand.Eduard-Mihai Burtescu-0/+3
2017-02-25rustc_typeck: hook up collect and item/body check to on-demand.Eduard-Mihai Burtescu-0/+6
2017-02-25Rollup merge of #40038 - nikomatsakis:issue-39828, r=michaelwoeristerEduard-Mihai Burtescu-3/+42
detect "bootstrap outputs" when serializing the dep-graph Fixes #39828. r? @michaelwoerister
2017-02-25Rollup merge of #40037 - froydnj:overflow-checks, r=alexcrichtonEduard-Mihai Burtescu-2/+1
add `-C overflow-checks` option In addition to defining and handling the new option, we also add a method on librustc::Session for determining the necessity of overflow checks. This method provides a single point to sort out the three (!) different ways for turning on overflow checks: -C debug-assertions, -C overflow-checks, and -Z force-overflow-checks. I was seeing a [run-pass/issue-28950.rs](https://github.com/rust-lang/rust/blob/b1363a73ede57ae595f3a1be2bb75d308ba4f7f6/src/test/run-pass/issue-28950.rs) failure on my machine with these patches, but I was also seeing the failure without the changes to the core compiler. We'll see what travis says. Fixes #33134. r? @alexcrichton
2017-02-25Rollup merge of #39864 - cramertj:normalize-breaks, r=nikomatsakisEduard-Mihai Burtescu-2/+4
Normalize labeled and unlabeled breaks Part of #39849.
2017-02-22detect "bootstrap outputs" when serializing the dep-graphNiko Matsakis-3/+42
Fixes #39828.
2017-02-22add `-C overflow-checks` optionNathan Froyd-2/+1
In addition to defining and handling the new option, we also add a method on librustc::Session for determining the necessity of overflow checks. This method provides a single point to sort out the three (!) different ways for turning on overflow checks: -C debug-assertions, -C overflow-checks, and -Z force-overflow-checks. Fixes #33134.
2017-02-17Normalize labeled and unlabeled breaksTaylor Cramer-2/+4
2017-02-15Stabilize field init shorthandest31-1/+1
Closes #37340.
2017-02-08Rollup merge of #39582 - nikomatsakis:incr-comp-issue-39569, r=michaelwoeristerCorey Farwell-35/+84
Handle the case where an intermediate node can't be recreated This solution grows the graph, but this is quite the corner case. r? @michaelwoerister
2017-02-06fix case where some edges can't be recreated by expanding the graphNiko Matsakis-35/+84
cc #39569 -- almost certainly a fix for that
2017-02-06Auto merge of #39500 - michaelwoerister:fix-ich-testing, r=nikomatsakisbors-31/+122
Let the dep-tracking test framework check that all #[rustc_dirty] attrs have been actually checked r? @nikomatsakis
2017-02-06Add comment about why the regular unused-attributes infrastructureMichael Woerister-0/+6
is not used for #[rustc_dirty]/#[rustc_clean].
2017-02-04pacify the mercilous tidy, improve cycle unit testNiko Matsakis-8/+76
2017-02-03Let the ICH testing framework check that all #[rustc_dirty] attrs have been ↵Michael Woerister-31/+116
actually checked.
2017-02-03add a comment about optimality that somehow got removedNiko Matsakis-58/+76
2017-02-03s/in_index/input_index/Niko Matsakis-7/+7
2017-02-03make dirty process O(dirty)Niko Matsakis-50/+66
The old algorithm was O(graph)
2017-01-31rewrite the predecessors code to create a reduced graphNiko Matsakis-467/+1095
The old code created a flat listing of "HIR -> WorkProduct" edges. While perfectly general, this could lead to a lot of repetition if the same HIR nodes affect many work-products. This is set to be a problem when we start to skip typeck, since we will be adding a lot more "work-product"-like nodes. The newer code uses an alternative strategy: it "reduces" the graph instead. Basically we walk the dep-graph and convert it to a DAG, where we only keep intermediate nodes if they are used by multiple work-products. This DAG does not contain the same set of nodes as the original graph, but it is guaranteed that (a) every output node is included in the graph and (b) the set of input nodes that can reach each output node is unchanged. (Input nodes are basically HIR nodes and foreign metadata; output nodes are nodes that have assocaited state which we will persist to disk in some way. These are assumed to be disjoint sets.)
2017-01-28rustc: always keep an explicit lifetime in trait objects.Eduard-Mihai Burtescu-1/+1
2017-01-27Auto merge of #39281 - michaelwoerister:make-cc-incr-comp-opt-in, r=nikomatsakisbors-13/+21
incr.comp.: Make cross-crate tracking for incr. comp. opt-in. The current implementation of cross-crate dependency tracking can cause quite long compile times and high memory usage for some crates (see #39208 for example). This PR therefore makes that part of dependency tracking optional. Incremental compilation still works, it will only have very coarse dep-tracking for upstream crates. r? @nikomatsakis
2017-01-26rustc: rename TyCtxt's `map` field to `hir`.Eduard-Mihai Burtescu-11/+11
2017-01-25rename `Tables` to `TypeckTables`Niko Matsakis-4/+4
2017-01-25merge TypeckItemBody and Tables depnodesNiko Matsakis-4/+4
2017-01-24incr.comp.: Make cross-crate tracking for incr. comp. opt-in.Michael Woerister-13/+21
2017-01-23Remove `open_span` and `close_span` from `Delimited`.Jeffrey Seyfried-4/+0
2017-01-22Remove unused `extern crate`s.Jeffrey Seyfried-3/+0
2017-01-22Warn on unused `#[macro_use]` imports.Jeffrey Seyfried-1/+1
2017-01-17Auto merge of #39109 - michaelwoerister:incr-comp-cache-cleanup, r=nikomatsakisbors-12/+45
incr.comp.: Delete orphaned work-products. The new partitioning scheme uncovered a hole in our incr. comp. cache directory garbage collection. So far, we relied on unneeded work products being deleted during the initial cache invalidation phase. However, we the new scheme, we get object files/work products that only contain code from upstream crates. Sometimes this code is not needed anymore (because all callers have been removed from the source) but because nothing that actually influences the contents of these work products had changed, we never deleted them from disk. r? @nikomatsakis
2017-01-17Rename ObjectSum into TraitObject in AST/HIRVadim Petrochenkov-1/+1
2017-01-16incr.comp.: Delete orphaned work-products.Michael Woerister-12/+45
2017-01-17AST/HIR: Merge ObjectSum and PolyTraitRefVadim Petrochenkov-2/+0
2017-01-12incr.comp.: Add some caching to Predecessors construction.Michael Woerister-9/+297
2017-01-12Add some more info to -Zincremental-infoMichael Woerister-0/+11
2017-01-08Auto merge of #38679 - alexcrichton:always-deny-warnings, r=nrcbors-1/+1
Remove not(stage0) from deny(warnings) Historically this was done to accommodate bugs in lints, but there hasn't been a bug in a lint since this feature was added which the warnings affected. Let's completely purge warnings from all our stages by denying warnings in all stages. This will also assist in tracking down `stage0` code to be removed whenever we're updating the bootstrap compiler.
2016-12-30Compilation fixesest31-0/+3
2016-12-29Remove not(stage0) from deny(warnings)Alex Crichton-1/+1
Historically this was done to accommodate bugs in lints, but there hasn't been a bug in a lint since this feature was added which the warnings affected. Let's completely purge warnings from all our stages by denying warnings in all stages. This will also assist in tracking down `stage0` code to be removed whenever we're updating the bootstrap compiler.
2016-12-28rustc: move function arguments into hir::Body.Eduard-Mihai Burtescu-2/+4
2016-12-28rustc: separate bodies for static/(associated)const and embedded constants.Eduard-Mihai Burtescu-5/+15
2016-12-28rustc: separate TraitItem from their parent Item, just like ImplItem.Eduard-Mihai Burtescu-4/+20
2016-12-28Auto merge of #38479 - michaelwoerister:extern_mod_ich, r=nikomatsakisbors-9/+27
ICH: Fix and test foreign mod hashing. r? @nikomatsakis
2016-12-24Rollup merge of #38557 - michaelwoerister:inline-asm-ich, r=nikomatsakisSteve Klabnik-3/+43
incr. comp.: Improve InlineAsm hashing and add test case r? @nikomatsakis
2016-12-22ICH: Make InlineAsm hashes stable.Michael Woerister-3/+43
generated by cgit-pink 1.4.1-3-g733a5 (git 2.37.1) at 2026-07-12 11:33:59 +0000