Josh Stone
413aaf3227
Rollup merge of #59393 - czipperz:refactor_tuple_comparison_tests, r=shepmaster
...
Refactor tuple comparison tests
2019-03-27 18:15:32 -07:00
Josh Stone
35b339bd5f
Rollup merge of #59390 - czipperz:ptr_eq_smart_pointer, r=Centril,steveklabnik
...
Make `ptr::eq` documentation mention fat-pointer behavior
Resolves #59214
2019-03-27 18:15:30 -07:00
Josh Stone
a4bf8557b2
Rollup merge of #59372 - euclio:rename-trim, r=rkruppe
...
add rustfix-able suggestions to trim_{left,right} deprecations
Fixes #53802 (technically already fixed by #58002 , but that issue is about these methods).
2019-03-27 18:15:28 -07:00
Josh Stone
ad5bbf01c0
Rollup merge of #59284 - RalfJung:maybe-uninit, r=sfackler
...
adjust MaybeUninit API to discussions
uninitialized -> uninit
into_initialized -> assume_init
read_initialized -> read
set -> write
2019-03-27 18:15:27 -07:00
Josh Stone
c70cdc0ed4
Rollup merge of #59283 - SimonSapin:branchless-ascii-case, r=joshtriplett
...
Make ASCII case conversions more than 4× faster
Reformatted output of `./x.py bench src/libcore --test-args ascii` below. The `libcore` benchmark calls `[u8]::make_ascii_lowercase`. `lookup` has code (effectively) identical to that before this PR, and ~~`branchless`~~ `mask_shifted_bool_match_range` after this PR.
~~See [code comments](ce933f77c8 (diff-01076f91a26400b2db49663d787c2576R3796)
) in `u8::to_ascii_uppercase` in `src/libcore/num/mod.rs` for an explanation of the branchless algorithm.~~
**Update:** the algorithm was simplified while keeping the performance. See `branchless` v.s. `mask_shifted_bool_match_range` benchmarks.
Credits to @raphlinus for the idea in https://twitter.com/raphlinus/status/1107654782544736261 , which extends this algorithm to “fake SIMD” on `u32` to convert four bytes at a time. The `fake_simd_u32` benchmarks implements this with [`let (before, aligned, after) = bytes.align_to_mut::<u32>()`](https://doc.rust-lang.org/std/primitive.slice.html#method.align_to_mut ). Note however that this is buggy when addition carries/overflows into the next byte (which does not happen if the input is known to be ASCII).
This could be fixed (to optimize `[u8]::make_ascii_lowercase` and `[u8]::make_ascii_uppercase` in `src/libcore/slice/mod.rs`) either with some more bitwise trickery that I didn’t quite figure out, or by using “real” SIMD intrinsics for byte-wise addition. I did not pursue this however because the current (incorrect) fake SIMD algorithm is only marginally faster than the one-byte-at-a-time branchless algorithm. This is because LLVM auto-vectorizes the latter, as can be seen on https://rust.godbolt.org/z/anKtbR .
Benchmark results on Linux x64 with Intel i7-7700K: (updated from https://github.com/rust-lang/rust/pull/59283#issuecomment-474146863 )
```rust
6830 bytes string:
alloc_only ... bench: 112 ns/iter (+/- 0) = 62410 MB/s
black_box_read_each_byte ... bench: 1,733 ns/iter (+/- 8) = 4033 MB/s
lookup_table ... bench: 1,766 ns/iter (+/- 11) = 3958 MB/s
branch_and_subtract ... bench: 417 ns/iter (+/- 1) = 16762 MB/s
branch_and_mask ... bench: 401 ns/iter (+/- 1) = 17431 MB/s
branchless ... bench: 365 ns/iter (+/- 0) = 19150 MB/s
libcore ... bench: 367 ns/iter (+/- 1) = 19046 MB/s
fake_simd_u32 ... bench: 361 ns/iter (+/- 2) = 19362 MB/s
fake_simd_u64 ... bench: 361 ns/iter (+/- 1) = 19362 MB/s
mask_mult_bool_branchy_lookup_table ... bench: 6,309 ns/iter (+/- 19) = 1107 MB/s
mask_mult_bool_lookup_table ... bench: 4,183 ns/iter (+/- 29) = 1671 MB/s
mask_mult_bool_match_range ... bench: 339 ns/iter (+/- 0) = 20619 MB/s
mask_shifted_bool_match_range ... bench: 339 ns/iter (+/- 1) = 20619 MB/s
32 bytes string:
alloc_only ... bench: 15 ns/iter (+/- 0) = 2133 MB/s
black_box_read_each_byte ... bench: 29 ns/iter (+/- 0) = 1103 MB/s
lookup_table ... bench: 24 ns/iter (+/- 4) = 1333 MB/s
branch_and_subtract ... bench: 16 ns/iter (+/- 0) = 2000 MB/s
branch_and_mask ... bench: 16 ns/iter (+/- 0) = 2000 MB/s
branchless ... bench: 16 ns/iter (+/- 0) = 2000 MB/s
libcore ... bench: 15 ns/iter (+/- 0) = 2133 MB/s
fake_simd_u32 ... bench: 17 ns/iter (+/- 0) = 1882 MB/s
fake_simd_u64 ... bench: 16 ns/iter (+/- 0) = 2000 MB/s
mask_mult_bool_branchy_lookup_table ... bench: 42 ns/iter (+/- 0) = 761 MB/s
mask_mult_bool_lookup_table ... bench: 35 ns/iter (+/- 0) = 914 MB/s
mask_mult_bool_match_range ... bench: 16 ns/iter (+/- 0) = 2000 MB/s
mask_shifted_bool_match_range ... bench: 16 ns/iter (+/- 0) = 2000 MB/s
7 bytes string:
alloc_only ... bench: 14 ns/iter (+/- 0) = 500 MB/s
black_box_read_each_byte ... bench: 22 ns/iter (+/- 0) = 318 MB/s
lookup_table ... bench: 16 ns/iter (+/- 0) = 437 MB/s
branch_and_subtract ... bench: 16 ns/iter (+/- 0) = 437 MB/s
branch_and_mask ... bench: 16 ns/iter (+/- 0) = 437 MB/s
branchless ... bench: 19 ns/iter (+/- 0) = 368 MB/s
libcore ... bench: 20 ns/iter (+/- 0) = 350 MB/s
fake_simd_u32 ... bench: 18 ns/iter (+/- 0) = 388 MB/s
fake_simd_u64 ... bench: 21 ns/iter (+/- 0) = 333 MB/s
mask_mult_bool_branchy_lookup_table ... bench: 20 ns/iter (+/- 0) = 350 MB/s
mask_mult_bool_lookup_table ... bench: 19 ns/iter (+/- 0) = 368 MB/s
mask_mult_bool_match_range ... bench: 19 ns/iter (+/- 0) = 368 MB/s
mask_shifted_bool_match_range ... bench: 19 ns/iter (+/- 0) = 368 MB/s
```
2019-03-27 18:15:25 -07:00
Josh Stone
e5fa59735b
Rollup merge of #59268 - estebank:from-string, r=QuietMisdreavus
...
Add suggestion to use `&*var` when `&str: From<String>` is expected
Fix #53879 .
2019-03-27 18:15:24 -07:00
Josh Stone
ecf63630cf
Rollup merge of #58837 - Centril:librustc_interface_2018, r=petrochenkov
...
librustc_interface => 2018
r? @oli-obk
This will likely produce an ICE for some reason... so super-WIP.
2019-03-27 18:15:22 -07:00
Josh Stone
2a3c2bfce4
Rollup merge of #58253 - taiki-e:librustc_driver-2018, r=petrochenkov
...
librustc_driver => 2018
Transitions `librustc_driver` to Rust 2018; cc #58099
r? @Centril
2019-03-27 18:15:21 -07:00
Josh Stone
c818c1a1d6
Rollup merge of #57565 - petrochenkov:turbowarn, r=Centril
...
syntax: Remove warning for unnecessary path disambiguators
`rustfmt` is now stable and it removes unnecessary turbofishes, so removing the warning as discussed in https://github.com/rust-lang/rust/pull/43540 (where it was introduced).
One hardcoded warning less.
Closes https://github.com/rust-lang/rust/issues/58055
r? @nikomatsakis
2019-03-27 18:15:19 -07:00
Josh Stone
74a69f2e74
Rollup merge of #57293 - Zoxc:incr-passes3, r=michaelwoerister
...
Make some lints incremental
Blocked on https://github.com/rust-lang/rust/pull/57253
r? @michaelwoerister
2019-03-27 18:15:18 -07:00
varkor
c6e3ea475b
Visit path in walk_mac
2019-03-27 22:41:41 +00:00
Eric Huss
5113e73e81
Update books
2019-03-27 11:02:55 -07:00
Mateusz Mikuła
c764890d7c
musl: build toolchain libs with -fPIC
2019-03-27 18:37:21 +01:00
hgallagher1993
4d648ce1b9
Better diagnostic for binary operation on BoxedValues
2019-03-27 13:13:09 -04:00
David Wood
4187560bdf
Add comments for new AdtDef
functions.
2019-03-27 17:27:21 +01:00
Chris Gregory
f0a7610724
Add higher-ranked trait bounds link
2019-03-27 12:03:14 -04:00
Nikhil Benesch
3e0db7cecd
Clarify behavior of dbg macro
2019-03-27 11:22:55 -04:00
Andy Russell
e1daa36ba7
replace llvm-rebuild-trigger with commit hash
2019-03-27 10:05:32 -04:00
Taiki Endo
d59b46fd49
Add a test
2019-03-27 22:48:39 +09:00
bors
33ef0bad21
Auto merge of #59415 - varkor:values_since_snapshot, r=eddyb
...
Refactor InferenceFudger (née RegionFudger)
- Rename `RegionFudger` (and related methods) to `InferenceFudger`.
- Take integer and float inference variables into account.
- Refactor `types_created_since_snapshot` and `vars_created_since_snapshot` with the [new version of ena](https://github.com/rust-lang-nursery/ena/pull/21 ).
- Some other refactoring in the area.
r? @eddyb
2019-03-27 13:20:16 +00:00
Konrad Borowski
ba21e0b368
Include id in Thread's Debug implementation
...
Since Rust 1.19.0, id is a stable method, so there is no reason to
not include it in Debug implementation.
2019-03-27 12:28:17 +01:00
Yuki OKUSHI
2368aa8e97
Add some tests
2019-03-27 19:30:33 +09:00
varkor
86d5a69d9d
Use Vec instead of FxHashMap
2019-03-27 09:44:55 +00:00
varkor
688cbad9b8
Lookup region variable origin instead of choosing one
2019-03-27 09:44:55 +00:00
varkor
2d48ffa9c6
Store type variable origins in InferenceFudger
2019-03-27 09:44:55 +00:00
varkor
58a04f06cb
Propitiate tidy
2019-03-27 09:44:55 +00:00
varkor
3683f51352
Update ena to version 0.13.0
2019-03-27 09:44:55 +00:00
varkor
267370ed58
Use eq_relations
2019-03-27 09:44:55 +00:00
varkor
fa18c129c3
Add next_int_var
and next_float_var
2019-03-27 09:44:55 +00:00
varkor
f9d8bb8e2c
Simplify fudge_inference_if_ok
2019-03-27 09:44:55 +00:00
varkor
ac94858e32
Add int variables and float variables to InferenceFudger
2019-03-27 09:44:55 +00:00
varkor
1f9a2326b5
Rename RegionFudger
to InferenceFudger
2019-03-27 09:44:55 +00:00
varkor
6cc09fc8b2
Remove TypeVariableMap
2019-03-27 09:44:55 +00:00
varkor
abf5e81663
Use Ranges for vars_since_snapshot
2019-03-27 09:44:55 +00:00
varkor
a5c653be63
Simplify TypeVariableTable::vars_since_snapshot
2019-03-27 09:44:55 +00:00
varkor
2a08860ae6
Simplify RegionConstraintCollector::vars_since_snapshot
2019-03-27 09:44:55 +00:00
varkor
92b2021b0a
Make vars_since_snapshot
naming consistent
2019-03-27 09:44:55 +00:00
varkor
443a2d4f86
Update ena
2019-03-27 09:44:55 +00:00
Mazdak Farrokhzad
ce1c5e0a61
add negative test case in assignment-expected-bool
2019-03-27 10:19:47 +01:00
Mazdak Farrokhzad
0b9c589beb
adjust assignment-in-if test accordingly.
2019-03-27 10:19:47 +01:00
Mazdak Farrokhzad
05d59feb64
add test for assignment x = y where type bool is expected.
2019-03-27 10:19:47 +01:00
Mazdak Farrokhzad
7945eff080
generalize diagnostic for x = y where type bool is expected.
2019-03-27 10:19:47 +01:00
bors
c5fb4d0d2f
Auto merge of #55780 - ogoffart:span_source_text, r=petrochenkov
...
Introduce proc_macro::Span::source_text
A function to extract the actual source behind a Span.
Background: I would like to use `syn` in a `build.rs` script to parse the rust code, and extract part of the source code. However, `syn` only gives access to proc_macro2::Span, and i would like to get the source code behind that.
I opened an issue on proc_macro2 bug tracker for this feature https://github.com/alexcrichton/proc-macro2/issues/110 and @alexcrichton said the feature should first go upstream in proc_macro. So there it is!
Since most of the Span API is unstable anyway, this is guarded by the same `proc_macro_span` feature as everything else.
2019-03-27 08:58:40 +00:00
Mazdak Farrokhzad
bf1068b137
librustc_interface => 2018; rename rustc-rayon to rayon in Cargo.toml
2019-03-27 09:48:50 +01:00
Mazdak Farrokhzad
14f3f6c712
librustc_interface => 2018
2019-03-27 09:41:42 +01:00
Chris Gregory
65b5e57226
Make into itemized list and fix some wording
2019-03-27 01:52:55 -04:00
Chris Gregory
61b6c56f50
Minor rewordings and add dyn
keyword
2019-03-27 01:46:24 -04:00
bors
267fb90b55
Auto merge of #59447 - GuillaumeGomez:rollup, r=GuillaumeGomez
...
Rollup of 7 pull requests
Successful merges:
- #59004 ([rustdoc] Improve "in parameters" search and search more generally)
- #59026 (Fix moving text in search tabs headers)
- #59197 (Exclude old book redirect stubs from search engines)
- #59330 (Improve the documentation for std::convert (From, Into, AsRef and AsMut))
- #59424 (Fix code block display in portability element in dark theme)
- #59427 (Link to PhantomData in NonNull documentation)
- #59432 (Improve some compiletest documentation)
Failed merges:
r? @ghost
2019-03-27 05:25:50 +00:00
Chris Gregory
a68a0e33d1
Add documentation about for
used as higher ranked trait bounds
...
Resolves #55416
2019-03-27 01:23:14 -04:00
Simonas Kazlauskas
8d4afbe413
Use informational target machine for metadata
...
Since there is nothing to optimise there...
2019-03-27 04:03:42 +02:00