| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2016-04-28 | Make the codegen unit partitioner also emit item declarations. | Michael Woerister | -11/+22 | |
| 2016-04-03 | Use a BitVector instead of Vec<bool> for recording cleanup blocks | James Miller | -1/+26 | |
| Also adds a FromIterator impl for BitVector to allow construction of a BitVector from an iterator yeilding bools. | ||||
| 2016-03-30 | Add some standard traversal iterators for MIR | James Miller | -0/+1 | |
| Adds Preorder, Postorder and Reverse Postorder traversal iterators. Also makes trans/mir use Reverse Postorder traversal for blocks. | ||||
| 2016-03-05 | apply rustfmt to librustc_data_structures, correcting ↵ | Niko Matsakis | -15/+21 | |
| rust-lang-nursery/rustfmt#836 | ||||
| 2016-02-23 | [MIR] Change SimplifyCfg pass to use bitvec | Simonas Kazlauskas | -0/+79 | |
| BitVector is much more space efficient. | ||||
| 2016-01-21 | [MIR] Promote temps to alloca on multi-assignment | Simonas Kazlauskas | -2/+4 | |
| Fixes #31002 | ||||
| 2015-08-21 | nits from pnkfelix | Niko Matsakis | -23/+30 | |
| 2015-08-18 | generalize bitvector code into a bitmatrix; write some unit tests, but | Niko Matsakis | -9/+176 | |
| probably not enough. This code is so simple, what could possibly go wrong? | ||||
| 2015-07-09 | Use vec![elt; n] where possible | Ulrik Sverdrup | -3/+1 | |
| The common pattern `iter::repeat(elt).take(n).collect::<Vec<_>>()` is exactly equivalent to `vec![elt; n]`, do this replacement in the whole tree. (Actually, vec![] is smart enough to only call clone n - 1 times, while the former solution would call clone n times, and this fact is virtually irrelevant in practice.) | ||||
| 2015-04-17 | Add licenses. | Niko Matsakis | -0/+10 | |
| 2015-04-17 | Port to using the newer graph, which offers iterators instead of the | Niko Matsakis | -0/+32 | |
| older `each` method, but is otherwise identical. | ||||
