| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2019-09-25 | Remove unused DepTrackingMap | Mark Rousskov | -87/+0 | |
| 2019-07-04 | fix a dep_graph doc regarding type_of_item | ljedrz | -1/+1 | |
| 2019-07-04 | rename hir::map::local_def_id to local_def_id_from_node_id | ljedrz | -1/+1 | |
| 2019-02-10 | rustc: doc comments | Alexander Regueiro | -1/+1 | |
| 2019-02-05 | move librustc to 2018 | Mark Mansi | -1/+1 | |
| 2018-12-25 | Remove licenses | Mark Rousskov | -10/+0 | |
| 2018-12-06 | Use a function to access the Hir map to be able to turn it into a query later | John Kåre Alsaker | -1/+1 | |
| 2018-10-19 | Prefer `Default::default` over `FxHash*::default` in struct constructors | Oliver Scherer | -1/+1 | |
| 2018-10-19 | Deprecate the `FxHashMap()` and `FxHashSet()` constructor function hack | Oliver Scherer | -1/+1 | |
| 2018-01-01 | Fix docs for future pulldown migration | Malo Jaffré | -1/+1 | |
| 2017-07-12 | integrate anon dep nodes into trait selection | Niko Matsakis | -31/+9 | |
| 2017-07-05 | use field init shorthand in src/librustc | Zack M. Davis | -1/+1 | |
| The field init shorthand syntax was stabilized in 1.17.0 (aebd94f); we are now free to use it in the compiler. | ||||
| 2017-06-09 | incr.comp.: Uniformly represent DepNodes as (Kind, StableHash) pairs. | Michael Woerister | -22/+11 | |
| 2017-05-29 | Remove DepGraph::write() and its callers. | Michael Woerister | -19/+0 | |
| 2017-03-23 | convert inherent-impl-related things to on-demand queries | Niko Matsakis | -15/+0 | |
| There are now 3 queries: - inherent_impls(def-id): for a given type, get a `Rc<Vec<DefId>>` with all its inherent impls. This internally uses `crate_inherent_impls`, doing some hacks to keep the current deps (which, btw, are not clearly correct). - crate_inherent_impls(crate): gathers up a map from types to `Rc<Vec<DefId>>`, touching the entire krate, possibly generating errors. - crate_inherent_impls_overlap_check(crate): performs overlap checks between the inherent impls for a given type, generating errors. | ||||
| 2017-03-13 | some style fixes | Tshepang Lekhonkhobe | -1/+1 | |
| 2017-02-25 | rustc: allow handling cycle errors gracefully in on-demand. | Eduard-Mihai Burtescu | -0/+6 | |
| 2017-02-03 | go back to the older model of coherence collect | Niko Matsakis | -0/+15 | |
| 2017-02-02 | prevent multiple writes to a single entry in a `DepTrackingMap` | Niko Matsakis | -2/+2 | |
| 2017-02-02 | remove some of the ways to mutate a `DepTrackingMap` | Niko Matsakis | -19/+3 | |
| It is pretty suspect to insert an entry twice. | ||||
| 2017-01-26 | rustc: rename TyCtxt's `map` field to `hir`. | Eduard-Mihai Burtescu | -1/+1 | |
| 2016-11-10 | rustc: clean up lookup_item_type and remove TypeScheme. | Eduard Burtescu | -4/+4 | |
| 2016-11-08 | Replace FnvHasher use with FxHasher. | Nicholas Nethercote | -3/+3 | |
| This speeds up compilation by 3--6% across most of rustc-benchmarks. | ||||
| 2016-09-06 | write to inherent_impls during the visitor | Niko Matsakis | -0/+11 | |
| The goal here is to avoid writing to the `inherent_impls` map from within the general `Coherence` task, and instead write to it as we visit. Writing to it from the Coherence task is actually an information leak; it happened to be safe because Coherence read from `DepNode::Krate`, but that was very coarse. I removed the `Rc` here because, upon manual inspection, nobody clones the data in this table, and it meant that we can accumulate the data in place. That said, the pattern that is used for the inherent impls map is *generally* an anti-pattern (that is, holding the borrow lock for the duration of using the contents), so it'd probably be better to clone (and I doubt that would be expensive -- how many inherent impls does a typical type have?). | ||||
| 2016-08-08 | track MIR through the dep-graph | Niko Matsakis | -0/+10 | |
| Per the discussion on #34765, we make one `DepNode::Mir` variant and use it to represent both the MIR tracking map as well as passes that operate on MIR. We also track loads of cached MIR (which naturally comes from metadata). Note that the "HAIR" pass adds a read of TypeckItemBody because it uses a myriad of tables that are not individually tracked. | ||||
| 2016-04-06 | break dep-graph into modules, parameterize DepNode | Niko Matsakis | -1/+2 | |
| it is useful later to customize how change the type we use for reference items away from DefId | ||||
| 2016-01-06 | Fix numerous typos, renamings, and minor nits raised by mw. | Niko Matsakis | -8/+8 | |
| 2016-01-05 | Refactor compiler to make use of dep-tracking-maps. Also, in cases where | Niko Matsakis | -0/+56 | |
| we were using interior mutability (RefCells, TyIvar), add some reads/writes. | ||||
| 2016-01-05 | Introduce the DepGraph and DepTracking map abstractions, | Niko Matsakis | -0/+81 | |
| along with a README explaining how they are to be used | ||||
