| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2016-10-19 | Merge pull request #37173 from brson/stable-next 1.12.1 | Brian Anderson | -49/+268 | |
| [stable] Backports for 1.12.1 | ||||
| 2016-10-18 | debuginfo: Create debuginfo for re-aggregated spread_arg instead of for the ↵ | Michael Woerister | -22/+13 | |
| individual pieces. | ||||
| 2016-10-18 | Some tests to check that lifetime parametric fn's do not trip up LLVM. | Felix S. Klock II | -0/+54 | |
| 2016-10-18 | Inject bitcast if types mismatch when building a store instruction. | Felix S. Klock II | -0/+24 | |
| 2016-10-18 | Fix ICE by injecting bitcasts if types mismatch when building invokes or calls. | Felix S. Klock II | -17/+32 | |
| 2016-10-18 | Bump version to 1.12.1 | Brian Anderson | -1/+1 | |
| 2016-10-18 | Temporary fix for metadata decoding for struct constructors | Vadim Petrochenkov | -3/+15 | |
| 2016-10-18 | stop having identity casts be lexprs | Ariel Ben-Yehuda | -2/+47 | |
| that made no sense (see test), and was incompatible with borrowck. Fixes #36936. | ||||
| 2016-10-14 | LLVM: Backport "[SimplifyCFG] Correctly test for unconditional branches in ↵ | Michael Woerister | -1/+1 | |
| GetCaseResults" | ||||
| 2016-10-14 | force `i1` booleans to `i8` when comparing | Niko Matsakis | -1/+34 | |
| Work around LLVM bug. cc #36856 | ||||
| 2016-10-14 | loosen assertion against proj in collector | Niko Matsakis | -2/+47 | |
| The collector was asserting a total absence of projections, but some projections are expected, even in trans: in particular, projections containing higher-ranked regions, which we don't currently normalize. | ||||
| 2016-09-23 | Merge pull request #36687 from brson/beta-next 1.12.0 | Brian Anderson | -2/+0 | |
| Remove reverted feature from relnotes | ||||
| 2016-09-23 | Remove reverted feature from relnotes | Brian Anderson | -2/+0 | |
| 2016-09-23 | Merge pull request #36686 from brson/beta-next | Brian Anderson | -21/+1 | |
| Beta next | ||||
| 2016-09-23 | Bump beta to .6 | Brian Anderson | -1/+1 | |
| 2016-09-23 | Revert "implement `From<Vec<char>>` and `From<&'a [char]>` for `String`" | Brian Anderson | -20/+0 | |
| This reverts commit ac73335f2f5421c914fa3900567696cc6dc73d8d. | ||||
| 2016-09-21 | Merge pull request #36634 from brson/beta-next | Brian Anderson | -2/+2 | |
| [beta] Fix optimization regressions for operations on [x; n]-initialized arr… | ||||
| 2016-09-21 | Fix optimization regressions for operations on [x; n]-initialized arrays. | Eduard Burtescu | -2/+2 | |
| 2016-09-21 | Merge pull request #36633 from brson/beta-next | Brian Anderson | -0/+261 | |
| [beta] Add changelog for 1.12 | ||||
| 2016-09-21 | Add changelog for 1.12 | Brian Anderson | -0/+261 | |
| 2016-09-21 | Merge pull request #36628 from nikomatsakis/backport-issue-36496 | Brian Anderson | -5/+47 | |
| Backport #36496 | ||||
| 2016-09-21 | Merge pull request #36630 from brson/beta-next | Brian Anderson | -1/+1 | |
| Bump to 1.12.0-beta.5 | ||||
| 2016-09-21 | Bump to 1.12.0-beta.5 | Brian Anderson | -1/+1 | |
| 2016-09-21 | Workaround #34427 by using memset of 0 on ARM to set the discriminant. | Felix S. Klock II | -5/+47 | |
| Conflicts: src/librustc_trans/adt.rs | ||||
| 2016-09-21 | Merge pull request #36620 from pnkfelix/beta-next | Niko Matsakis | -31/+133 | |
| Beta backports | ||||
| 2016-09-21 | fix PR 36459 post backport to beta. | Felix S. Klock II | -2/+3 | |
| 2016-09-21 | add missing test | Niko Matsakis | -0/+28 | |
| 2016-09-21 | invoke drop glue with a ptr to (data, meta) | Niko Matsakis | -3/+21 | |
| This is done by creating a little space on the stack. Hokey, but it's the simplest fix I can see. | ||||
| 2016-09-21 | use `adt::trans_const` when translating constant closures and tuples | Ariel Ben-Yehuda | -28/+83 | |
| Fixes #36401 | ||||
| 2016-09-21 | Merge pull request #36608 from brson/beta-next | Brian Anderson | -0/+0 | |
| [beta] Update rust-installer. Fixes #35840 | ||||
| 2016-09-21 | Update rust-installer. Fixes #35840 | Brian Anderson | -0/+0 | |
| 2016-09-20 | Merge pull request #36606 from brson/beta-next | Brian Anderson | -1/+0 | |
| Fix build error | ||||
| 2016-09-20 | Fix build error | Brian Anderson | -1/+0 | |
| 2016-09-20 | Merge pull request #36602 from brson/beta-next | Brian Anderson | -1/+1 | |
| Bump to beta.4 | ||||
| 2016-09-20 | Bump to beta.4 | Brian Anderson | -1/+1 | |
| 2016-09-20 | Merge pull request #36591 from brson/beta-next | Brian Anderson | -40/+74 | |
| Beta backports | ||||
| 2016-09-19 | Remove data structure specialization for .zip() iterator | Ulrik Sverdrup | -38/+31 | |
| Go back on half the specialization, the part that changed the Zip struct's fields themselves depending on the types of the iterators. This means that the Zip iterator will always carry two usize fields, which are unused. If a whole for loop using a .zip() iterator is inlined, these are simply removed and have no effect. The same improvement for Zip of for example slice iterators remain, and they still optimize well. However, like when the specialization of zip was merged, the compiler is still very sensistive to the exact context. For example this code only autovectorizes if the function is used, not if the code in zip_sum_i32 is inserted inline it was called: ``` fn zip_sum_i32(xs: &[i32], ys: &[i32]) -> i32 { let mut s = 0; for (&x, &y) in xs.iter().zip(ys) { s += x * y; } s } fn zipdot_i32_default_zip(b: &mut test::Bencher) { let xs = vec![1; 1024]; let ys = vec![1; 1024]; b.iter(|| { zip_sum_i32(&xs, &ys) }) } ``` Include a test that checks that Zip<T, U> is covariant w.r.t. T and U. | ||||
| 2016-09-19 | Default RUST_MIN_STACK to 16MiB for now | Simonas Kazlauskas | -1/+2 | |
| 2016-09-19 | Up the LLVM | Simonas Kazlauskas | -1/+41 | |
| Fixes #36474 | ||||
| 2016-09-16 | Merge pull request #36538 from brson/beta-next | Brian Anderson | -4/+48 | |
| Beta backports | ||||
| 2016-09-16 | Make `private_in_public` compatibility lint warn-by-default again | Vadim Petrochenkov | -3/+11 | |
| 2016-09-16 | Fix issue #36036. | Felix S. Klock II | -1/+37 | |
| We were treating an associated type as unsized even when the concrete instantiation was actually sized. Fix is to normalize before checking if it is sized. | ||||
| 2016-09-16 | Merge pull request #36517 from brson/beta-bump | Alex Crichton | -1/+1 | |
| Bump beta to .3 | ||||
| 2016-09-16 | Bump beta to .3 | Brian Anderson | -1/+1 | |
| 2016-09-16 | Merge pull request #36433 from alexcrichton/beta-next | Brian Anderson | -4/+129 | |
| Backport PRs to beta | ||||
| 2016-09-12 | llvm: backport "[SimplifyCFG] Hoisting invalidates metadata". | Eduard Burtescu | -1/+33 | |
| 2016-09-12 | memrchr: Use a conditional instead of subtracting a complicated min | Ulrik Sverdrup | -1/+1 | |
| This makes the critical calculation easier to understand. | ||||
| 2016-09-12 | memrchr: Correct aligned offset computation | Ulrik Sverdrup | -1/+23 | |
| The memrchr fallback did not compute the offset correctly. It was intentioned to land on usize-aligned addresses but did not. This was suspected to resulted in a crash on ARMv7 platform! This bug affected non-linux platforms. I think like this, if we have a slice with pointer `ptr` and length `len`, we want to find the last usize-aligned offset in the slice. The correct computation should be: For example if ptr = 1 and len = 6, and size_of::<usize>() is 4: [ x x x x x x ] 1 2 3 4 5 6 ^-- last aligned address at offset 3 from the start. The last aligned address is ptr + len - (ptr + len) % usize_size. Compute offset from the start as: offset = len - (ptr + len) % usize_size = 6 - (1 + 6) % 4 = 6 - 3 = 3. I believe the function's return value was always correct previously, if the platform supported unaligned addresses. | ||||
| 2016-09-12 | rustc_trans: do not generate allocas for unused locals. | Eduard Burtescu | -0/+24 | |
| 2016-09-12 | typeck: use NoExpectation to check return type of diverging fn | Alex Burka | -2/+49 | |
| This fixes #35849, a regression introduced by the typeck refactoring around TyNever/!. | ||||
