| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2022-06-14 | `BitSet` perf improvements | Jakob Degen | -13/+57 | |
| This commit makes two changes: 1. Changes `MaybeLiveLocals` to use `ChunkedBitSet` 2. Overrides the `fold` method for the iterator for `ChunkedBitSet` | ||||
| 2022-04-30 | Add element iterator for ChunkedBitSet | Tomasz Miąsko | -0/+34 | |
| 2022-02-23 | Introduce `ChunkedBitSet` and use it for some dataflow analyses. | Nicholas Nethercote | -0/+195 | |
| This reduces peak memory usage significantly for some programs with very large functions, such as: - `keccak`, `unicode_normalization`, and `match-stress-enum`, from the `rustc-perf` benchmark suite; - `http-0.2.6` from crates.io. The new type is used in the analyses where the bitsets can get huge (e.g. 10s of thousands of bits): `MaybeInitializedPlaces`, `MaybeUninitializedPlaces`, and `EverInitializedPlaces`. Some refactoring was required in `rustc_mir_dataflow`. All existing analysis domains are either `BitSet` or a trivial wrapper around `BitSet`, and access in a few places is done via `Borrow<BitSet>` or `BorrowMut<BitSet>`. Now that some of these domains are `ClusterBitSet`, that no longer works. So this commit replaces the `Borrow`/`BorrowMut` usage with a new trait `BitSetExt` containing the needed bitset operations. The impls just forward these to the underlying bitset type. This required fiddling with trait bounds in a few places. The commit also: - Moves `static_assert_size` from `rustc_data_structures` to `rustc_index` so it can be used in the latter; the former now re-exports it so existing users are unaffected. - Factors out some common "clear excess bits in the final word" functionality in `bit_set.rs`. - Uses `fill` in a few places instead of loops. | ||||
| 2021-11-03 | Optimize live point computation | Mark Rousskov | -0/+95 | |
| This is just replicating the previous algorithm, but taking advantage of the bitset structures to optimize into tighter and better optimized loops. Particularly advantageous on enormous MIR blocks, which are relatively rare in practice. | ||||
| 2021-08-26 | Formatting | Will Crichton | -6/+6 | |
| 2021-08-26 | Fix failing test | Will Crichton | -7/+7 | |
| 2021-08-26 | Add comments and unit tests for new SparseBitMatrix methods | Will Crichton | -0/+66 | |
| 2021-08-26 | Compile failure | Will Crichton | -1/+1 | |
| 2021-08-26 | Compilation failure in tests | Will Crichton | -6/+6 | |
| 2021-08-26 | Fix sparse intersect bug, add more sparse / dense tests | Will Crichton | -1/+12 | |
| 2021-08-25 | Add unit tests for BitSet intersect/subtract | Will Crichton | -1/+12 | |
| 2021-02-02 | Add additional benchmarks to bit_set | kadmin | -0/+34 | |
| 2020-08-30 | mv compiler to compiler/ | mark | -0/+366 | |
