librustc_codegen_llvm: deny(elided_lifetimes_in_paths)

2019-02-25T07:40:18+00:00

librustc_codegen_llvm => 2018

2019-02-17T18:58:58+00:00

rustc: doc comments

2019-02-10T23:42:32+00:00

Remove licenses

2018-12-26T04:08:33+00:00

Finished moving backend-agnostic code to rustc_codegen_ssa

2018-11-16T13:08:18+00:00

Great separation of librustc_codegen_llvm: librustc_codegen_ssa compiles

2018-11-16T13:07:24+00:00

Generalized mir::codegen_mir (and all subsequent functions)

2018-11-16T12:33:10+00:00

codegen_llvm/misc: improve common patterns

2018-10-09T13:15:41+00:00

Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.

2018-09-17T21:08:09+00:00

Currently we have two files implementing bitsets (and 2D bit matrices). This commit combines them into one, taking the best features from each. This involves renaming a lot of things. The high level changes are as follows. - bitvec.rs --> bit_set.rs - indexed_set.rs --> (removed) - BitArray + IdxSet --> BitSet (merged, see below) - BitVector --> GrowableBitSet - {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet - BitMatrix --> BitMatrix - SparseBitMatrix --> SparseBitMatrix The changes within the bitset types themselves are as follows. ``` OLD OLD NEW BitArray IdxSet BitSet -------- ------ ------ grow - grow new - (remove) new_empty new_empty new_empty new_filled new_filled new_filled - to_hybrid to_hybrid clear clear clear set_up_to set_up_to set_up_to clear_above - clear_above count - count contains(T) contains(&T) contains(T) contains_all - superset is_empty - is_empty insert(T) add(&T) insert(T) insert_all - insert_all() remove(T) remove(&T) remove(T) words words words words_mut words_mut words_mut - overwrite overwrite merge union union - subtract subtract - intersect intersect iter iter iter ``` In general, when choosing names I went with: - names that are more obvious (e.g. `BitSet` over `IdxSet`). - names that are more like the Rust libraries (e.g. `T` over `C`, `insert` over `add`); - names that are more set-like (e.g. `union` over `merge`, `superset` over `contains_all`, `domain_size` over `num_bits`). Also, using `T` for index arguments seems more sensible than `&T` -- even though the latter is standard in Rust collection types -- because indices are always copyable. It also results in fewer `&` and `*` sigils in practice.

Split out growth functionality into BitVector type

2018-08-01T12:50:40+00:00

rust/src/librustc_codegen_llvm/debuginfo/create_scope_map.rs, branch 1.36.0