maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/Transforms/InstSimplify/add-mask.ll

80 lines
1.7 KiB
LLVM
Raw Normal View History

[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; NOTE: Assertions have been autogenerated by update_test_checks.py
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
; RUN: opt -S -instsimplify < %s | FileCheck %s
define i1 @test(i32 %a) {
[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; CHECK-LABEL: @test(
; CHECK: ret i1 false
;
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%rhs = add i32 %a, -1
%and = and i32 %a, %rhs
%res = icmp eq i32 %and, 1
ret i1 %res
}
define i1 @test2(i32 %a) {
[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; CHECK-LABEL: @test2(
; CHECK: ret i1 false
;
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%rhs = add i32 %a, 1
%and = and i32 %a, %rhs
%res = icmp eq i32 %and, 1
ret i1 %res
}
define i1 @test3(i32 %a) {
[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; CHECK-LABEL: @test3(
; CHECK: ret i1 false
;
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%rhs = add i32 %a, 7
%and = and i32 %a, %rhs
%res = icmp eq i32 %and, 1
ret i1 %res
}
@B = external global i32
declare void @llvm.assume(i1)
; Known bits without a constant
define i1 @test4(i32 %a) {
[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; CHECK-LABEL: @test4(
; CHECK: [[B:%.*]] = load i32, i32* @B
; CHECK-NEXT: [[B_AND:%.*]] = and i32 [[B]], 1
; CHECK-NEXT: [[B_CND:%.*]] = icmp eq i32 [[B_AND]], 1
; CHECK-NEXT: call void @llvm.assume(i1 [[B_CND]])
; CHECK-NEXT: ret i1 false
;
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%b = load i32, i32* @B
%b.and = and i32 %b, 1
%b.cnd = icmp eq i32 %b.and, 1
Revert @llvm.assume with operator bundles (r289755-r289757) This creates non-linear behavior in the inliner (see more details in r289755's commit thread). llvm-svn: 290086
2016-12-19 16:22:17 +08:00
call void @llvm.assume(i1 %b.cnd)
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%rhs = add i32 %a, %b
%and = and i32 %a, %rhs
%res = icmp eq i32 %and, 1
ret i1 %res
}
; Negative test - even number
define i1 @test5(i32 %a) {
[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; CHECK-LABEL: @test5(
; CHECK: [[RHS:%.*]] = add i32 %a, 2
; CHECK-NEXT: [[AND:%.*]] = and i32 %a, [[RHS]]
; CHECK-NEXT: [[RES:%.*]] = icmp eq i32 [[AND]], 1
; CHECK-NEXT: ret i1 [[RES]]
;
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%rhs = add i32 %a, 2
%and = and i32 %a, %rhs
%res = icmp eq i32 %and, 1
ret i1 %res
}
define i1 @test6(i32 %a) {
[InstSimplify] regenerate checks using a script I didn't notice any significant changes in the actual checks here; all of these tests already used FileCheck, so a script can batch update them in one shot. This commit is just to show the value of automating this process: We have uniform formatting as opposed to a mish-mash of check structure that changes based on individual prefs and the current fashion. This makes it simpler to update when we find a bug or make an enhancement. llvm-svn: 264457
2016-03-26 04:12:25 +08:00
; CHECK-LABEL: @test6(
; CHECK: ret i1 false
;
[ValueTracking] Recognize that and(x, add (x, -1)) clears the low bit This is a cleaned up version of a patch by John Regehr with permission. Originally found via the souper tool. If we add an odd number to x, then bitwise-and the result with x, we know that the low bit of the result must be zero. Either it was zero in x originally, or the add cleared it in the temporary value. As a result, one of the two values anded together must have the bit cleared. Differential Revision: http://reviews.llvm.org/D14315 llvm-svn: 252629
2015-11-11 02:46:14 +08:00
%lhs = add i32 %a, -1
%and = and i32 %lhs, %a
%res = icmp eq i32 %and, 1
ret i1 %res
}