c16c22cc9c
The optimized clone method ends up as the following MIR:
```
_2 = copy ((*_1).0: i32);
_3 = copy ((*_1).1: u64);
_4 = copy ((*_1).2: [i8; 3]);
_0 = Foo { a: move _2, b: move _3, c: move _4 };
```
We can transform this to:
```
_0 = copy (*_1);
```
41 lines
1.2 KiB
Rust
41 lines
1.2 KiB
Rust
//@ compile-flags: -O
|
|
|
|
#![crate_type = "lib"]
|
|
|
|
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
|
|
pub struct Int(u32);
|
|
|
|
const A: Int = Int(201);
|
|
const B: Int = Int(270);
|
|
const C: Int = Int(153);
|
|
|
|
// The code is from https://github.com/rust-lang/rust/issues/119520.
|
|
// This code will basically turn into `matches!(x.partial_cmp(&A), Some(Greater | Equal))`.
|
|
// The otherwise branch must be `Less`.
|
|
// CHECK-LABEL: @implicit_match(
|
|
// CHECK-SAME: [[TMP0:%.*]])
|
|
// CHECK-NEXT: start:
|
|
// CHECK-NEXT: [[TMP1:%.*]] = add i32 [[TMP0]], -201
|
|
// CHECK-NEXT: icmp ult i32 [[TMP1]], 70
|
|
// CHECK-NEXT: icmp eq i32 [[TMP0]], 153
|
|
// CHECK-NEXT: [[SPEC_SELECT:%.*]] = or i1
|
|
// CHECK-NEXT: ret i1 [[SPEC_SELECT]]
|
|
#[no_mangle]
|
|
pub fn implicit_match(x: Int) -> bool {
|
|
(x >= A && x <= B) || x == C
|
|
}
|
|
|
|
// The code is from https://github.com/rust-lang/rust/issues/110097.
|
|
// We expect it to generate the same optimized code as a full match.
|
|
// CHECK-LABEL: @if_let(
|
|
// CHECK: start:
|
|
// CHECK-NOT: zext
|
|
// CHECK: select
|
|
// CHECK-NEXT: insertvalue
|
|
// CHECK-NEXT: insertvalue
|
|
// CHECK-NEXT: ret
|
|
#[no_mangle]
|
|
pub fn if_let(val: Result<i32, ()>) -> Result<i32, ()> {
|
|
if let Ok(x) = val { Ok(x * 2) } else { Err(()) }
|
|
}
|