| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2019-01-08 | Move diagnostics out from QueryJob and optimize for the case with no diagnostics | John Kåre Alsaker | -1/+1 | |
| 2019-01-08 | Auto merge of #57114 - Zoxc:query-perf11, r=michaelwoerister | bors | -162/+120 | |
| Clean up and optimize OpenTask / read_index r? @michaelwoerister | ||||
| 2019-01-04 | implement a hack to make traitobject 0.1.0 compile | Ariel Ben-Yehuda | -0/+1 | |
| 2018-12-31 | Clean up and optimize OpenTask / read_index | John Kåre Alsaker | -162/+120 | |
| 2018-12-31 | Address comments | John Kåre Alsaker | -3/+7 | |
| 2018-12-31 | Use `entry` API to avoid double lookup when interning dep nodes | John Kåre Alsaker | -30/+39 | |
| 2018-12-31 | Group dep node data into a single structure | John Kåre Alsaker | -126/+80 | |
| 2018-12-27 | Integrate chalk engine | scalexm | -0/+1 | |
| 2018-12-25 | Remove licenses | Mark Rousskov | -101/+0 | |
| 2018-12-19 | Auto merge of #54252 - arielb1:deref-query, r=nikomatsakis | bors | -0/+1 | |
| process nested obligations in autoderef Fixes #53843. r? @nikomatsakis | ||||
| 2018-12-17 | Remove *_inlined variants | John Kåre Alsaker | -11/+3 | |
| 2018-12-17 | Turn some asserts into debug_asserts | John Kåre Alsaker | -2/+2 | |
| 2018-12-17 | Tweak query code for performance | John Kåre Alsaker | -11/+22 | |
| 2018-12-15 | make autoderef steps a query | Ariel Ben-Yehuda | -0/+1 | |
| 2018-12-07 | Various minor/cosmetic improvements to code | Alexander Regueiro | -3/+3 | |
| 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 | -4/+4 | |
| 2018-12-04 | cleanup: remove static lifetimes from consts | ljedrz | -1/+1 | |
| 2018-11-30 | proc_macro: introduce a "bridge" between clients (proc macros) and servers ↵ | Eduard-Mihai Burtescu | -1/+1 | |
| (compiler front-ends). | ||||
| 2018-11-26 | rustc-guide has moved | Mark Mansi | -2/+2 | |
| 2018-11-21 | rustc: implement and use Default on more types. | Eduard-Mihai Burtescu | -2/+2 | |
| 2018-11-15 | Rollup merge of #55901 - euclio:speling, r=petrochenkov | Pietro Albini | -1/+1 | |
| fix various typos in doc comments | ||||
| 2018-11-13 | fix various typos in doc comments | Andy Russell | -1/+1 | |
| 2018-11-12 | Turn `HirLocalId` into a `newtype_index` | Oliver Scherer | -3/+3 | |
| 2018-10-25 | Report const eval error inside the query | Oliver Schneider | -0/+1 | |
| 2018-10-24 | introduce (but do not use) `ascribe_user_type` goal | Niko Matsakis | -2/+4 | |
| Lots of annoying boilerplate. | ||||
| 2018-10-19 | Prefer `Default::default` over `FxHash*::default` in struct constructors | Oliver Scherer | -20/+10 | |
| 2018-10-19 | Deprecate the `FxHashMap()` and `FxHashSet()` constructor function hack | Oliver Scherer | -9/+9 | |
| 2018-10-17 | Use `Environment` instead of `ty::ParamEnv` in chalk context | scalexm | -1/+3 | |
| 2018-10-03 | Only promote calls to `#[rustc_promotable]` const fns | Oliver Schneider | -0/+1 | |
| 2018-09-29 | don't elide lifetimes in paths in librustc/ | Zack M. Davis | -8/+8 | |
| This seemed like a good way to kick the tires on the elided-lifetimes-in-paths lint (#52069)—seems to work! This was also pretty tedious—it sure would be nice if `cargo fix` worked on this codebase (#53896)! | ||||
| 2018-09-18 | incr.comp.: Allow for more fine-grained testing of CGU reuse and use it to ↵ | Michael Woerister | -0/+146 | |
| test incremental ThinLTO. | ||||
| 2018-09-08 | Rollup merge of #53315 - nikomatsakis:newtype-index, r=Mark-Simulacrum | kennytm | -5/+11 | |
| use `NonZeroU32` in `newtype_index!`macro, change syntax Various improvements to the `newtype_index!` macro: - Use `NonZeroU32` so that `Option<T>` is cheap - More ergonomic helper method, no need to import `Idx` trait all the time - Improve syntax to use `struct` keyword so that ripgrep works to find type def'n Fixes https://github.com/rust-lang/rust/issues/50337 I'm curious to see if this passes tests =) | ||||
| 2018-09-07 | rewrite constants to use NewType::MAX instead of u32::MAX | Niko Matsakis | -3/+1 | |
| Also, adjust the MAX to be `u32::MAX - 1`, leaving room for `u32::MAX` to become a sentinel value in the future. | ||||
| 2018-09-07 | remove all references to `private` from outside the macro | Niko Matsakis | -3/+7 | |
| 2018-09-07 | change from tuple struct to brace struct | Niko Matsakis | -3/+3 | |
| 2018-09-07 | change syntax of `newtype_index` to look like a struct decl | Niko Matsakis | -2/+6 | |
| 2018-09-06 | crates that provide a `panic_handler` are exempt from `unused_extern_crates` | Jorge Aparicio | -0/+1 | |
| fixes the *first* false positive reported in #53964 | ||||
| 2018-09-03 | Auto merge of #53673 - michaelwoerister:incr-thinlto-2000, r=alexcrichton | bors | -1/+1 | |
| Enable ThinLTO with incremental compilation. This is an updated version of #52309. This PR allows `rustc` to use (local) ThinLTO and incremental compilation at the same time. In theory this should allow for getting compile-time improvements for small changes while keeping the runtime performance of the generated code roughly the same as when compiling non-incrementally. The difference to #52309 is that this version also caches the pre-LTO version of LLVM bitcode. This allows for another layer of caching: 1. if the module itself has changed, we have to re-codegen and re-optimize. 2. if the module itself has not changed, but a module it imported from during ThinLTO has, we don't need to re-codegen and don't need to re-run the first optimization phase. Only the second (i.e. ThinLTO-) optimization phase is re-run. 3. if neither the module itself nor any of its imports have changed then we can re-use the final, post-ThinLTO version of the module. (We might have to load its pre-ThinLTO version though so it's available for other modules to import from) | ||||
| 2018-08-31 | Always add all modules to the global ThinLTO module analysis when compiling ↵ | Michael Woerister | -1/+0 | |
| incrementally. | ||||
| 2018-08-31 | Support local ThinLTO with incremental compilation. | Michael Woerister | -1/+2 | |
| 2018-08-31 | trip const_to_alloc query | csmoe | -2/+1 | |
| 2018-08-23 | Use optimized SmallVec implementation | Igor Gutorov | -2/+2 | |
| 2018-08-22 | miri/CTFE refactor | Ralf Jung | -1/+1 | |
| * Value gets renamed to Operand, so that now interpret::{Place, Operand} are the "dynamic" versions of mir::{Place, Operand}. * Operand and Place share the data for their "stuff is in memory"-base in a new type, MemPlace. This also makes it possible to give some more precise types in other areas. Both Operand and MemPlace have methods available to project into fields (and other kinds of projections) without causing further allocations. * The type for "a Scalar or a ScalarPair" is called Value, and again used to give some more precise types. * All of these have versions with an attached layout, so that we can more often drag the layout along instead of recomputing it. This lets us get rid of `PlaceExtra::Downcast`. MPlaceTy and PlaceTy can only be constructed in place.rs, making sure the layout is handled properly. (The same should eventually be done for ValTy and OpTy.) * All the high-level functions to write typed memory take a Place, and live in place.rs. All the high-level typed functions to read typed memory take an Operand, and live in operands.rs. | ||||
| 2018-08-05 | Improve query efficiency | varkor | -1/+1 | |
| 2018-08-05 | Fix outdated handling of GetLangItems | varkor | -1/+1 | |
| 2018-08-05 | Add lint for unknown feature attributes | varkor | -0/+2 | |
| 2018-07-27 | Better Option handling | Shotaro Yamada | -6/+8 | |
| 2018-07-25 | introduce new subtyping | Niko Matsakis | -1/+0 | |
| 2018-07-23 | Change single char str patterns to chars | ljedrz | -1/+1 | |
| 2018-07-21 | Convert implied_outlives_bounds to a query | Tyler Mandry | -0/+1 | |
