mirror of
				https://github.com/rust-lang/rust.git
				synced 2025-10-31 13:04:42 +00:00 
			
		
		
		
	 ed8dc5d817
			
		
	
	
		ed8dc5d817
		
	
	
	
	
		
			
			After 0d4a709bb8
LLVM becomes more clever and turns `@wider_reduce_loop` into an alias:
https://buildkite.com/llvm-project/rust-llvm-integrate-prototype/builds/17806#0186da6b-582c-46bf-a227-1565fa0859ac/743-766
This adapts the test to prevent this.
		
	
			
		
			
				
	
	
		
			56 lines
		
	
	
		
			1.6 KiB
		
	
	
	
		
			Rust
		
	
	
	
	
	
			
		
		
	
	
			56 lines
		
	
	
		
			1.6 KiB
		
	
	
	
		
			Rust
		
	
	
	
	
	
| // compile-flags: -C opt-level=3 -Z merge-functions=disabled --edition=2021
 | |
| // only-x86_64
 | |
| // ignore-debug: the debug assertions get in the way
 | |
| 
 | |
| #![crate_type = "lib"]
 | |
| #![feature(portable_simd)]
 | |
| 
 | |
| use std::simd::{Simd, SimdUint};
 | |
| const N: usize = 8;
 | |
| 
 | |
| #[no_mangle]
 | |
| // CHECK-LABEL: @wider_reduce_simd
 | |
| pub fn wider_reduce_simd(x: Simd<u8, N>) -> u16 {
 | |
|     // CHECK: zext <8 x i8>
 | |
|     // CHECK-SAME: to <8 x i16>
 | |
|     // CHECK: call i16 @llvm.vector.reduce.add.v8i16(<8 x i16>
 | |
|     let x: Simd<u16, N> = x.cast();
 | |
|     x.reduce_sum()
 | |
| }
 | |
| 
 | |
| #[no_mangle]
 | |
| // CHECK-LABEL: @wider_reduce_loop
 | |
| pub fn wider_reduce_loop(x: Simd<u8, N>) -> u16 {
 | |
|     // CHECK: zext <8 x i8>
 | |
|     // CHECK-SAME: to <8 x i16>
 | |
|     // CHECK: call i16 @llvm.vector.reduce.add.v8i16(<8 x i16>
 | |
|     let mut sum = 0_u16;
 | |
|     for i in 0..N {
 | |
|         sum += u16::from(x[i]);
 | |
|     }
 | |
|     sum
 | |
| }
 | |
| 
 | |
| #[no_mangle]
 | |
| // CHECK-LABEL: @wider_reduce_iter
 | |
| pub fn wider_reduce_iter(x: Simd<u8, N>) -> u16 {
 | |
|     // CHECK: zext <8 x i8>
 | |
|     // CHECK-SAME: to <8 x i16>
 | |
|     // CHECK: call i16 @llvm.vector.reduce.add.v8i16(<8 x i16>
 | |
|     x.as_array().iter().copied().map(u16::from).sum()
 | |
| }
 | |
| 
 | |
| // This iterator one is the most interesting, as it's the one
 | |
| // which used to not auto-vectorize due to a suboptimality in the
 | |
| // `<array::IntoIter as Iterator>::fold` implementation.
 | |
| 
 | |
| #[no_mangle]
 | |
| // CHECK-LABEL: @wider_reduce_into_iter
 | |
| pub fn wider_reduce_into_iter(x: Simd<u8, N>) -> u16 {
 | |
|     // FIXME MIR inlining messes up LLVM optimizations.
 | |
|     // WOULD-CHECK: zext <8 x i8>
 | |
|     // WOULD-CHECK-SAME: to <8 x i16>
 | |
|     // WOULD-CHECK: call i16 @llvm.vector.reduce.add.v8i16(<8 x i16>
 | |
|     x.to_array().into_iter().map(u16::from).sum()
 | |
| }
 |