; NOTE: Assertions have been autogenerated by utils/update_test_checks.py ; RUN: opt < %s -passes=instcombine -S | FileCheck %s define i1 @reduction_logical_or(<4 x i1> %x) { ; CHECK-LABEL: @reduction_logical_or( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <4 x i1> [[X:%.*]] to i4 ; CHECK-NEXT: [[R:%.*]] = icmp ne i4 [[TMP1]], 0 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> %x) ret i1 %r } define i1 @reduction_logical_or_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_or_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.or.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.or.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_and(<4 x i1> %x) { ; CHECK-LABEL: @reduction_logical_and( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <4 x i1> [[X:%.*]] to i4 ; CHECK-NEXT: [[R:%.*]] = icmp eq i4 [[TMP1]], -1 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> %x) ret i1 %r } define i1 @reduction_logical_and_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_and_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.and.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.and.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_mul(<2 x i1> %x) { ; CHECK-LABEL: @reduction_logical_mul( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[X:%.*]] to i2 ; CHECK-NEXT: [[R:%.*]] = icmp eq i2 [[TMP1]], -1 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.mul.v4i1(<2 x i1> %x) ret i1 %r } define i1 @reduction_logical_mul_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_mul_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.and.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.mul.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_xor(<2 x i1> %x) { ; CHECK-LABEL: @reduction_logical_xor( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[X:%.*]] to i2 ; CHECK-NEXT: [[TMP2:%.*]] = call range(i2 0, -1) i2 @llvm.ctpop.i2(i2 [[TMP1]]) ; CHECK-NEXT: [[R:%.*]] = trunc i2 [[TMP2]] to i1 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.xor.v4i1(<2 x i1> %x) ret i1 %r } define i1 @reduction_logical_xor_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_xor_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.add.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.xor.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_smin(<2 x i1> %x) { ; CHECK-LABEL: @reduction_logical_smin( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[X:%.*]] to i2 ; CHECK-NEXT: [[R:%.*]] = icmp ne i2 [[TMP1]], 0 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.smin.v4i1(<2 x i1> %x) ret i1 %r } define i1 @reduction_logical_smin_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_smin_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.or.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.smin.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_smax(<2 x i1> %x) { ; CHECK-LABEL: @reduction_logical_smax( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[X:%.*]] to i2 ; CHECK-NEXT: [[R:%.*]] = icmp eq i2 [[TMP1]], -1 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.smax.v4i1(<2 x i1> %x) ret i1 %r } define i1 @reduction_logical_smax_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_smax_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.and.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.smax.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_umin(<2 x i1> %x) { ; CHECK-LABEL: @reduction_logical_umin( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[X:%.*]] to i2 ; CHECK-NEXT: [[R:%.*]] = icmp eq i2 [[TMP1]], -1 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.umin.v4i1(<2 x i1> %x) ret i1 %r } define i1 @reduction_logical_umin_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_umin_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.and.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.umin.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_umax(<2 x i1> %x) { ; CHECK-LABEL: @reduction_logical_umax( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[X:%.*]] to i2 ; CHECK-NEXT: [[R:%.*]] = icmp ne i2 [[TMP1]], 0 ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.umax.v4i1(<2 x i1> %x) ret i1 %r } define i1 @reduction_logical_umax_nxv2i1( %x) { ; CHECK-LABEL: @reduction_logical_umax_nxv2i1( ; CHECK-NEXT: [[R:%.*]] = call i1 @llvm.vector.reduce.or.nxv2i1( [[X:%.*]]) ; CHECK-NEXT: ret i1 [[R]] ; %r = call i1 @llvm.vector.reduce.umax.nxv2i1( %x) ret i1 %r } define i1 @reduction_logical_or_reverse_nxv2i1( %p) { ; CHECK-LABEL: @reduction_logical_or_reverse_nxv2i1( ; CHECK-NEXT: [[RED:%.*]] = call i1 @llvm.vector.reduce.or.nxv2i1( [[P:%.*]]) ; CHECK-NEXT: ret i1 [[RED]] ; %rev = call @llvm.vector.reverse.nxv2i1( %p) %red = call i1 @llvm.vector.reduce.or.nxv2i1( %rev) ret i1 %red } define i1 @reduction_logical_or_reverse_v2i1(<2 x i1> %p) { ; CHECK-LABEL: @reduction_logical_or_reverse_v2i1( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[P:%.*]] to i2 ; CHECK-NEXT: [[RED:%.*]] = icmp ne i2 [[TMP1]], 0 ; CHECK-NEXT: ret i1 [[RED]] ; %rev = call <2 x i1> @llvm.vector.reverse.v2i1(<2 x i1> %p) %red = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> %rev) ret i1 %red } define i1 @reduction_logical_and_reverse_nxv2i1( %p) { ; CHECK-LABEL: @reduction_logical_and_reverse_nxv2i1( ; CHECK-NEXT: [[RED:%.*]] = call i1 @llvm.vector.reduce.and.nxv2i1( [[P:%.*]]) ; CHECK-NEXT: ret i1 [[RED]] ; %rev = call @llvm.vector.reverse.nxv2i1( %p) %red = call i1 @llvm.vector.reduce.and.nxv2i1( %rev) ret i1 %red } define i1 @reduction_logical_and_reverse_v2i1(<2 x i1> %p) { ; CHECK-LABEL: @reduction_logical_and_reverse_v2i1( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[P:%.*]] to i2 ; CHECK-NEXT: [[RED:%.*]] = icmp eq i2 [[TMP1]], -1 ; CHECK-NEXT: ret i1 [[RED]] ; %rev = call <2 x i1> @llvm.vector.reverse.v2i1(<2 x i1> %p) %red = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> %rev) ret i1 %red } define i1 @reduction_logical_xor_reverse_nxv2i1( %p) { ; CHECK-LABEL: @reduction_logical_xor_reverse_nxv2i1( ; CHECK-NEXT: [[RED:%.*]] = call i1 @llvm.vector.reduce.add.nxv2i1( [[P:%.*]]) ; CHECK-NEXT: ret i1 [[RED]] ; %rev = call @llvm.vector.reverse.nxv2i1( %p) %red = call i1 @llvm.vector.reduce.xor.nxv2i1( %rev) ret i1 %red } define i1 @reduction_logical_xor_reverse_v2i1(<2 x i1> %p) { ; CHECK-LABEL: @reduction_logical_xor_reverse_v2i1( ; CHECK-NEXT: [[TMP1:%.*]] = bitcast <2 x i1> [[P:%.*]] to i2 ; CHECK-NEXT: [[TMP2:%.*]] = call range(i2 0, -1) i2 @llvm.ctpop.i2(i2 [[TMP1]]) ; CHECK-NEXT: [[RED:%.*]] = trunc i2 [[TMP2]] to i1 ; CHECK-NEXT: ret i1 [[RED]] ; %rev = call <2 x i1> @llvm.vector.reverse.v2i1(<2 x i1> %p) %red = call i1 @llvm.vector.reduce.xor.v2i1(<2 x i1> %rev) ret i1 %red } declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>) declare i1 @llvm.vector.reduce.or.nxv2i1() declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>) declare i1 @llvm.vector.reduce.and.nxv2i1() declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.xor.nxv2i1() declare i1 @llvm.vector.reduce.xor.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.mul.nxv2i1() declare i1 @llvm.vector.reduce.mul.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.smin.nxv2i1() declare i1 @llvm.vector.reduce.smin.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.smax.nxv2i1() declare i1 @llvm.vector.reduce.smax.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.umin.nxv2i1() declare i1 @llvm.vector.reduce.umin.v2i1(<2 x i1>) declare i1 @llvm.vector.reduce.umax.nxv2i1() declare i1 @llvm.vector.reduce.umax.v2i1(<2 x i1>) declare @llvm.vector.reverse.nxv2i1() declare <2 x i1> @llvm.vector.reverse.v2i1(<2 x i1>)