2013-03-27 01:30:02 +08:00
|
|
|
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
|
|
|
|
target datalayout = "E-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-f128:128:128-v128:128:128-n32:64"
|
|
|
|
target triple = "powerpc64-unknown-linux-gnu"
|
|
|
|
|
|
|
|
; These tests are extracted from bitcast.ll.
|
|
|
|
; Verify that they also work correctly on big-endian targets.
|
|
|
|
|
|
|
|
define float @test2(<2 x float> %A, <2 x i32> %B) {
|
|
|
|
%tmp28 = bitcast <2 x float> %A to i64 ; <i64> [#uses=2]
|
|
|
|
%tmp23 = trunc i64 %tmp28 to i32 ; <i32> [#uses=1]
|
|
|
|
%tmp24 = bitcast i32 %tmp23 to float ; <float> [#uses=1]
|
|
|
|
|
|
|
|
%tmp = bitcast <2 x i32> %B to i64
|
|
|
|
%tmp2 = trunc i64 %tmp to i32 ; <i32> [#uses=1]
|
|
|
|
%tmp4 = bitcast i32 %tmp2 to float ; <float> [#uses=1]
|
|
|
|
|
|
|
|
%add = fadd float %tmp24, %tmp4
|
|
|
|
ret float %add
|
|
|
|
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @test2(
|
2013-03-27 01:30:02 +08:00
|
|
|
; CHECK-NEXT: %tmp24 = extractelement <2 x float> %A, i32 1
|
|
|
|
; CHECK-NEXT: bitcast <2 x i32> %B to <2 x float>
|
|
|
|
; CHECK-NEXT: %tmp4 = extractelement <2 x float> {{.*}}, i32 1
|
|
|
|
; CHECK-NEXT: %add = fadd float %tmp24, %tmp4
|
|
|
|
; CHECK-NEXT: ret float %add
|
|
|
|
}
|
|
|
|
|
|
|
|
define float @test3(<2 x float> %A, <2 x i64> %B) {
|
|
|
|
%tmp28 = bitcast <2 x float> %A to i64
|
|
|
|
%tmp29 = lshr i64 %tmp28, 32
|
|
|
|
%tmp23 = trunc i64 %tmp29 to i32
|
|
|
|
%tmp24 = bitcast i32 %tmp23 to float
|
|
|
|
|
|
|
|
%tmp = bitcast <2 x i64> %B to i128
|
|
|
|
%tmp1 = lshr i128 %tmp, 64
|
|
|
|
%tmp2 = trunc i128 %tmp1 to i32
|
|
|
|
%tmp4 = bitcast i32 %tmp2 to float
|
|
|
|
|
|
|
|
%add = fadd float %tmp24, %tmp4
|
|
|
|
ret float %add
|
|
|
|
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @test3(
|
2013-03-27 01:30:02 +08:00
|
|
|
; CHECK-NEXT: %tmp24 = extractelement <2 x float> %A, i32 0
|
|
|
|
; CHECK-NEXT: bitcast <2 x i64> %B to <4 x float>
|
|
|
|
; CHECK-NEXT: %tmp4 = extractelement <4 x float> {{.*}}, i32 1
|
|
|
|
; CHECK-NEXT: %add = fadd float %tmp24, %tmp4
|
|
|
|
; CHECK-NEXT: ret float %add
|
|
|
|
}
|
|
|
|
|
2013-08-12 15:26:09 +08:00
|
|
|
define <2 x i32> @test4(i32 %A, i32 %B){
|
|
|
|
%tmp38 = zext i32 %A to i64
|
|
|
|
%tmp32 = zext i32 %B to i64
|
|
|
|
%tmp33 = shl i64 %tmp32, 32
|
|
|
|
%ins35 = or i64 %tmp33, %tmp38
|
|
|
|
%tmp43 = bitcast i64 %ins35 to <2 x i32>
|
|
|
|
ret <2 x i32> %tmp43
|
|
|
|
; CHECK-LABEL: @test4(
|
|
|
|
; CHECK-NEXT: insertelement <2 x i32> undef, i32 %B, i32 0
|
|
|
|
; CHECK-NEXT: insertelement <2 x i32> {{.*}}, i32 %A, i32 1
|
|
|
|
; CHECK-NEXT: ret <2 x i32>
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
define <2 x float> @test5(float %A, float %B) {
|
|
|
|
%tmp37 = bitcast float %A to i32
|
|
|
|
%tmp38 = zext i32 %tmp37 to i64
|
|
|
|
%tmp31 = bitcast float %B to i32
|
|
|
|
%tmp32 = zext i32 %tmp31 to i64
|
|
|
|
%tmp33 = shl i64 %tmp32, 32
|
|
|
|
%ins35 = or i64 %tmp33, %tmp38
|
|
|
|
%tmp43 = bitcast i64 %ins35 to <2 x float>
|
|
|
|
ret <2 x float> %tmp43
|
|
|
|
; CHECK-LABEL: @test5(
|
|
|
|
; CHECK-NEXT: insertelement <2 x float> undef, float %B, i32 0
|
|
|
|
; CHECK-NEXT: insertelement <2 x float> {{.*}}, float %A, i32 1
|
|
|
|
; CHECK-NEXT: ret <2 x float>
|
|
|
|
}
|
|
|
|
|
|
|
|
define <2 x float> @test6(float %A){
|
|
|
|
%tmp23 = bitcast float %A to i32 ; <i32> [#uses=1]
|
|
|
|
%tmp24 = zext i32 %tmp23 to i64 ; <i64> [#uses=1]
|
|
|
|
%tmp25 = shl i64 %tmp24, 32 ; <i64> [#uses=1]
|
|
|
|
%mask20 = or i64 %tmp25, 1109917696 ; <i64> [#uses=1]
|
|
|
|
%tmp35 = bitcast i64 %mask20 to <2 x float> ; <<2 x float>> [#uses=1]
|
|
|
|
ret <2 x float> %tmp35
|
|
|
|
; CHECK-LABEL: @test6(
|
|
|
|
; CHECK-NEXT: insertelement <2 x float> undef, float %A, i32 0
|
|
|
|
; CHECK-NEXT: insertelement <2 x float> {{.*}}, float 4.200000e+01, i32 1
|
|
|
|
; CHECK: ret
|
|
|
|
}
|
2016-02-25 06:31:18 +08:00
|
|
|
|
|
|
|
; Verify that 'xor' of vector and constant is done as a vector bitwise op before the bitcast.
|
|
|
|
|
|
|
|
define <2 x i32> @xor_bitcast_vec_to_vec(<1 x i64> %a) {
|
|
|
|
%t1 = bitcast <1 x i64> %a to <2 x i32>
|
|
|
|
%t2 = xor <2 x i32> <i32 1, i32 2>, %t1
|
|
|
|
ret <2 x i32> %t2
|
|
|
|
|
|
|
|
; CHECK-LABEL: @xor_bitcast_vec_to_vec(
|
[InstCombine] transform bitcasted bitwise logic ops with constants (PR26702)
Given that we're not actually reducing the instruction count in the included
regression tests, I think we would call this a canonicalization step.
The motivation comes from the example in PR26702:
https://llvm.org/bugs/show_bug.cgi?id=26702
If we hoist the bitwise logic ahead of the bitcast, the previously unoptimizable
example of:
define <4 x i32> @is_negative(<4 x i32> %x) {
%lobit = ashr <4 x i32> %x, <i32 31, i32 31, i32 31, i32 31>
%not = xor <4 x i32> %lobit, <i32 -1, i32 -1, i32 -1, i32 -1>
%bc = bitcast <4 x i32> %not to <2 x i64>
%notnot = xor <2 x i64> %bc, <i64 -1, i64 -1>
%bc2 = bitcast <2 x i64> %notnot to <4 x i32>
ret <4 x i32> %bc2
}
Simplifies to the expected:
define <4 x i32> @is_negative(<4 x i32> %x) {
%lobit = ashr <4 x i32> %x, <i32 31, i32 31, i32 31, i32 31>
ret <4 x i32> %lobit
}
Differential Revision: http://reviews.llvm.org/D17583
llvm-svn: 262645
2016-03-04 03:19:04 +08:00
|
|
|
; CHECK-NEXT: %t21 = xor <1 x i64> %a, <i64 4294967298>
|
|
|
|
; CHECK-NEXT: %t2 = bitcast <1 x i64> %t21 to <2 x i32>
|
2016-02-25 06:31:18 +08:00
|
|
|
; CHECK-NEXT: ret <2 x i32> %t2
|
|
|
|
}
|
|
|
|
|
|
|
|
; Verify that 'and' of integer and constant is done as a vector bitwise op before the bitcast.
|
|
|
|
|
|
|
|
define i64 @and_bitcast_vec_to_int(<2 x i32> %a) {
|
|
|
|
%t1 = bitcast <2 x i32> %a to i64
|
|
|
|
%t2 = and i64 %t1, 3
|
|
|
|
ret i64 %t2
|
|
|
|
|
|
|
|
; CHECK-LABEL: @and_bitcast_vec_to_int(
|
[InstCombine] transform bitcasted bitwise logic ops with constants (PR26702)
Given that we're not actually reducing the instruction count in the included
regression tests, I think we would call this a canonicalization step.
The motivation comes from the example in PR26702:
https://llvm.org/bugs/show_bug.cgi?id=26702
If we hoist the bitwise logic ahead of the bitcast, the previously unoptimizable
example of:
define <4 x i32> @is_negative(<4 x i32> %x) {
%lobit = ashr <4 x i32> %x, <i32 31, i32 31, i32 31, i32 31>
%not = xor <4 x i32> %lobit, <i32 -1, i32 -1, i32 -1, i32 -1>
%bc = bitcast <4 x i32> %not to <2 x i64>
%notnot = xor <2 x i64> %bc, <i64 -1, i64 -1>
%bc2 = bitcast <2 x i64> %notnot to <4 x i32>
ret <4 x i32> %bc2
}
Simplifies to the expected:
define <4 x i32> @is_negative(<4 x i32> %x) {
%lobit = ashr <4 x i32> %x, <i32 31, i32 31, i32 31, i32 31>
ret <4 x i32> %lobit
}
Differential Revision: http://reviews.llvm.org/D17583
llvm-svn: 262645
2016-03-04 03:19:04 +08:00
|
|
|
; CHECK-NEXT: %t21 = and <2 x i32> %a, <i32 0, i32 3>
|
|
|
|
; CHECK-NEXT: %t2 = bitcast <2 x i32> %t21 to i64
|
2016-02-25 06:31:18 +08:00
|
|
|
; CHECK-NEXT: ret i64 %t2
|
|
|
|
}
|
|
|
|
|
|
|
|
; Verify that 'or' of vector and constant is done as an integer bitwise op before the bitcast.
|
|
|
|
|
|
|
|
define <2 x i32> @or_bitcast_int_to_vec(i64 %a) {
|
|
|
|
%t1 = bitcast i64 %a to <2 x i32>
|
|
|
|
%t2 = or <2 x i32> %t1, <i32 1, i32 2>
|
|
|
|
ret <2 x i32> %t2
|
|
|
|
|
|
|
|
; CHECK-LABEL: @or_bitcast_int_to_vec(
|
[InstCombine] transform bitcasted bitwise logic ops with constants (PR26702)
Given that we're not actually reducing the instruction count in the included
regression tests, I think we would call this a canonicalization step.
The motivation comes from the example in PR26702:
https://llvm.org/bugs/show_bug.cgi?id=26702
If we hoist the bitwise logic ahead of the bitcast, the previously unoptimizable
example of:
define <4 x i32> @is_negative(<4 x i32> %x) {
%lobit = ashr <4 x i32> %x, <i32 31, i32 31, i32 31, i32 31>
%not = xor <4 x i32> %lobit, <i32 -1, i32 -1, i32 -1, i32 -1>
%bc = bitcast <4 x i32> %not to <2 x i64>
%notnot = xor <2 x i64> %bc, <i64 -1, i64 -1>
%bc2 = bitcast <2 x i64> %notnot to <4 x i32>
ret <4 x i32> %bc2
}
Simplifies to the expected:
define <4 x i32> @is_negative(<4 x i32> %x) {
%lobit = ashr <4 x i32> %x, <i32 31, i32 31, i32 31, i32 31>
ret <4 x i32> %lobit
}
Differential Revision: http://reviews.llvm.org/D17583
llvm-svn: 262645
2016-03-04 03:19:04 +08:00
|
|
|
; CHECK-NEXT: %t21 = or i64 %a, 4294967298
|
|
|
|
; CHECK-NEXT: %t2 = bitcast i64 %t21 to <2 x i32>
|
2016-02-25 06:31:18 +08:00
|
|
|
; CHECK-NEXT: ret <2 x i32> %t2
|
|
|
|
}
|
|
|
|
|