| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2020-08-30 | mv compiler to compiler/ | mark | -13/+0 | |
| 2020-08-14 | Rework `rustc_serialize` | Matthew Jasper | -1/+2 | |
| - Move the type parameter from `encode` and `decode` methods to the trait. - Remove `UseSpecialized(En|De)codable` traits. - Remove blanket impls for references. - Add `RefDecodable` trait to allow deserializing to arena-allocated references safely. - Remove ability to (de)serialize HIR. - Create proc-macros `(Ty)?(En|De)codable` to help implement these new traits. | ||||
| 2020-03-30 | rustc -> rustc_middle part 2 | Mazdak Farrokhzad | -1/+1 | |
| 2018-12-25 | Remove licenses | Mark Rousskov | -10/+0 | |
| 2017-11-29 | incr.comp.: Remove on-export crate metadata hashing. | Michael Woerister | -39/+0 | |
| 2017-11-16 | incr.comp.: Remove default serialization implementations for things in ↵ | Michael Woerister | -2/+1 | |
| rustc::hir::def_id so that we get an ICE instead of silently doing the wrong thing. | ||||
| 2017-10-02 | incr.comp.: Remove saving and loading of legacy dep-graph. | Michael Woerister | -68/+1 | |
| 2017-09-27 | Remove DepNodeIndex::new is already impl for Idx | Santiago Pastorino | -8/+0 | |
| 2017-06-09 | incr.comp.: Clean up and optimize dep-graph loading. | Michael Woerister | -12/+9 | |
| 2017-06-09 | incr.comp.: Uniformly represent DepNodes as (Kind, StableHash) pairs. | Michael Woerister | -3/+3 | |
| 2017-06-07 | Allocate DefIndices for global crate metadata. | Michael Woerister | -4/+0 | |
| This allows for treating global crate metadata the same as regular metadata with regard to incr. comp. | ||||
| 2017-06-06 | incr.comp.: Make WorkProductId opaque so we don't accidentally rely on being ↵ | Michael Woerister | -2/+1 | |
| able to reconstruct obj-file names from one. | ||||
| 2017-06-01 | incr.comp.: Use a more efficient encoding for the on-disk dependency graph. | Michael Woerister | -7/+34 | |
| 2017-05-31 | incr.comp.: Use DefPathHash-based DepNodes in the serialized DepGraph and ↵ | Michael Woerister | -7/+6 | |
| remove obsolete DefIdDirectory. | ||||
| 2017-05-08 | incr.comp.: Hash more pieces of crate metadata to detect changes there. | Michael Woerister | -1/+5 | |
| 2017-04-12 | ICH: Replace old, transitive metadata hashing with direct hashing approach. | Michael Woerister | -12/+2 | |
| Instead of collecting all potential inputs to some metadata entry and hashing those, we directly hash the values we are storing in metadata. This is more accurate and doesn't suffer from quadratic blow-up when many entries have the same dependencies. | ||||
| 2017-03-22 | Move Fingerprint to rustc::ich::Fingerprint. | Michael Woerister | -1/+1 | |
| 2017-02-22 | detect "bootstrap outputs" when serializing the dep-graph | Niko Matsakis | -0/+5 | |
| Fixes #39828. | ||||
| 2017-02-03 | make dirty process O(dirty) | Niko Matsakis | -9/+8 | |
| The old algorithm was O(graph) | ||||
| 2016-11-08 | Replace FnvHasher use with FxHasher. | Nicholas Nethercote | -2/+2 | |
| This speeds up compilation by 3--6% across most of rustc-benchmarks. | ||||
| 2016-10-17 | ICH: Use 128-bit Blake2b hash instead of 64-bit SipHash for incr. comp. ↵ | Michael Woerister | -2/+3 | |
| fingerprints. | ||||
| 2016-09-23 | ICH: Add ability to test the ICH of exported metadata items. | Michael Woerister | -0/+13 | |
| 2016-08-09 | use preds to serialize just what we need | Niko Matsakis | -5/+11 | |
| This massively speeds up serialization. It also seems to produce deterministic metadata hashes (before I was seeing inconsistent results). Fixes #35232. | ||||
| 2016-07-28 | Code to save/load the work-products map from disk | Niko Matsakis | -1/+11 | |
| Work products are deleted if any of their inputs are dirty. | ||||
| 2016-05-18 | load/save hashes of metadata | Niko Matsakis | -8/+35 | |
| This commit reorganizes how the persist code treats hashing. The idea is that each crate saves a file containing hashes representing the metadata for each item X. When we see a read from `MetaData(X)`, we can load this hash up (if we don't find a file for that crate, we just use the SVH for the entire crate). To compute the hash for `MetaData(Y)`, where Y is some local item, we examine all the predecessors of the `MetaData(Y)` node and hash their hashes together. | ||||
| 2016-05-18 | identify inputs of `MetaData(X)` nodes | Niko Matsakis | -1/+33 | |
| Generate a second hash file that contains the metadata for an X node. | ||||
| 2016-05-03 | Remove unused trait imports flagged by lint | Seo Sanghyeon | -1/+0 | |
| 2016-04-12 | prevent other `encode` methods from breaking `derive(RustcEncodable)` | Oliver Schneider | -3/+1 | |
| 2016-04-06 | add code to persist graph and for unit-testing | Niko Matsakis | -0/+35 | |
