mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-24 07:44:10 +00:00
c2fd26a115
Currently, we assume that ScalarPair is always represented using a two-element struct, both as an immediate value and when stored in memory. This currently works fairly well, but runs into problems with https://github.com/rust-lang/rust/pull/116672, where a ScalarPair involving an i128 type can no longer be represented as a two-element struct in memory. For example, the tuple `(i32, i128)` needs to be represented in-memory as `{ i32, [3 x i32], i128 }` to satisfy alignment requirement. Using `{ i32, i128 }` instead will result in the second element being stored at the wrong offset (prior to LLVM 18). Resolve this issue by no longer requiring that the immediate and in-memory type for ScalarPair are the same. The in-memory type will now look the same as for normal struct types (and will include padding filler and similar), while the immediate type stays a simple two-element struct type. This also means that booleans in immediate ScalarPair are now represented as i1 rather than i8, just like we do everywhere else. The core change here is to llvm_type (which now treats ScalarPair as a normal struct) and immediate_llvm_type (which returns the two-element struct that llvm_type used to produce). The rest is fixing things up to no longer assume these are the same. In particular, this switches places that try to get pointers to the ScalarPair elements to use byte-geps instead of struct-geps.
46 lines
1.3 KiB
Rust
46 lines
1.3 KiB
Rust
// compile-flags: -O
|
|
|
|
#![crate_type = "lib"]
|
|
|
|
// CHECK: define{{.*}}{ i1, i1 } @pair_bool_bool(i1 noundef zeroext %pair.0, i1 noundef zeroext %pair.1)
|
|
#[no_mangle]
|
|
pub fn pair_bool_bool(pair: (bool, bool)) -> (bool, bool) {
|
|
pair
|
|
}
|
|
|
|
// CHECK: define{{.*}}{ i1, i32 } @pair_bool_i32(i1 noundef zeroext %pair.0, i32 noundef %pair.1)
|
|
#[no_mangle]
|
|
pub fn pair_bool_i32(pair: (bool, i32)) -> (bool, i32) {
|
|
pair
|
|
}
|
|
|
|
// CHECK: define{{.*}}{ i32, i1 } @pair_i32_bool(i32 noundef %pair.0, i1 noundef zeroext %pair.1)
|
|
#[no_mangle]
|
|
pub fn pair_i32_bool(pair: (i32, bool)) -> (i32, bool) {
|
|
pair
|
|
}
|
|
|
|
// CHECK: define{{.*}}{ i1, i1 } @pair_and_or(i1 noundef zeroext %_1.0, i1 noundef zeroext %_1.1)
|
|
#[no_mangle]
|
|
pub fn pair_and_or((a, b): (bool, bool)) -> (bool, bool) {
|
|
// Make sure it can operate directly on the unpacked args
|
|
// (but it might not be using simple and/or instructions)
|
|
// CHECK-DAG: %_1.0
|
|
// CHECK-DAG: %_1.1
|
|
(a && b, a || b)
|
|
}
|
|
|
|
// CHECK: define{{.*}}void @pair_branches(i1 noundef zeroext %_1.0, i1 noundef zeroext %_1.1)
|
|
#[no_mangle]
|
|
pub fn pair_branches((a, b): (bool, bool)) {
|
|
// Make sure it can branch directly on the unpacked bool args
|
|
// CHECK: br i1 %_1.0
|
|
if a {
|
|
println!("Hello!");
|
|
}
|
|
// CHECK: br i1 %_1.1
|
|
if b {
|
|
println!("Goodbye!");
|
|
}
|
|
}
|