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/InstCombine/compare-signs.ll

59 lines
1.8 KiB
LLVM
Raw Normal View History

Tests: rewrite 'opt ... %s' to 'opt ... < %s' so that opt does not emit a ModuleID This is done to avoid odd test failures, like the one fixed in r171243. My previous regex was not good enough to find these. llvm-svn: 171343
2013-01-01 21:57:25 +08:00
; RUN: opt -instcombine -S < %s | FileCheck %s
Teach instcombine to look for booleans in wider integers when it encounters a zext(icmp). It may be able to optimize that away. This fixes one of the cases in PR5438. llvm-svn: 88830
2009-11-15 13:55:17 +08:00
; PR5438
; TODO: This should also optimize down.
Generalize this optimization to work on equality comparisons between any two integers that are constant except for a single bit (the same n-th bit in each). llvm-svn: 90646
2009-12-05 13:00:00 +08:00
;define i32 @test1(i32 %a, i32 %b) nounwind readnone {
Teach instcombine to look for booleans in wider integers when it encounters a zext(icmp). It may be able to optimize that away. This fixes one of the cases in PR5438. llvm-svn: 88830
2009-11-15 13:55:17 +08:00
;entry:
; %0 = icmp sgt i32 %a, -1 ; <i1> [#uses=1]
; %1 = icmp slt i32 %b, 0 ; <i1> [#uses=1]
; %2 = xor i1 %1, %0 ; <i1> [#uses=1]
; %3 = zext i1 %2 to i32 ; <i32> [#uses=1]
; ret i32 %3
;}
Generalize this optimization to work on equality comparisons between any two integers that are constant except for a single bit (the same n-th bit in each). llvm-svn: 90646
2009-12-05 13:00:00 +08:00
; TODO: This optimizes partially but not all the way.
;define i32 @test2(i32 %a, i32 %b) nounwind readnone {
;entry:
; %0 = and i32 %a, 8 ;<i32> [#uses=1]
; %1 = and i32 %b, 8 ;<i32> [#uses=1]
; %2 = icmp eq i32 %0, %1 ;<i1> [#uses=1]
; %3 = zext i1 %2 to i32 ;<i32> [#uses=1]
; ret i32 %3
;}
define i32 @test3(i32 %a, i32 %b) nounwind readnone {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test3(
Teach instcombine to look for booleans in wider integers when it encounters a zext(icmp). It may be able to optimize that away. This fixes one of the cases in PR5438. llvm-svn: 88830
2009-11-15 13:55:17 +08:00
entry:
; CHECK: xor i32 %a, %b
Fix some CHECK lines which were ignored by accident. llvm-svn: 91214
2009-12-12 17:25:50 +08:00
; CHECK: lshr i32 %0, 31
Teach instcombine to look for booleans in wider integers when it encounters a zext(icmp). It may be able to optimize that away. This fixes one of the cases in PR5438. llvm-svn: 88830
2009-11-15 13:55:17 +08:00
; CHECK: xor i32 %1, 1
%0 = lshr i32 %a, 31 ; <i32> [#uses=1]
%1 = lshr i32 %b, 31 ; <i32> [#uses=1]
%2 = icmp eq i32 %0, %1 ; <i1> [#uses=1]
%3 = zext i1 %2 to i32 ; <i32> [#uses=1]
ret i32 %3
; CHECK-NOT: icmp
; CHECK-NOT: zext
; CHECK: ret i32 %2
}
Generalize this optimization to work on equality comparisons between any two integers that are constant except for a single bit (the same n-th bit in each). llvm-svn: 90646
2009-12-05 13:00:00 +08:00
; Variation on @test3: checking the 2nd bit in a situation where the 5th bit
; is one, not zero.
define i32 @test3i(i32 %a, i32 %b) nounwind readnone {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test3i(
Generalize this optimization to work on equality comparisons between any two integers that are constant except for a single bit (the same n-th bit in each). llvm-svn: 90646
2009-12-05 13:00:00 +08:00
entry:
; CHECK: xor i32 %a, %b
Fix some CHECK lines which were ignored by accident. llvm-svn: 91214
2009-12-12 17:25:50 +08:00
; CHECK: lshr i32 %0, 31
Generalize this optimization to work on equality comparisons between any two integers that are constant except for a single bit (the same n-th bit in each). llvm-svn: 90646
2009-12-05 13:00:00 +08:00
; CHECK: xor i32 %1, 1
%0 = lshr i32 %a, 29 ; <i32> [#uses=1]
%1 = lshr i32 %b, 29 ; <i32> [#uses=1]
%2 = or i32 %0, 35
%3 = or i32 %1, 35
%4 = icmp eq i32 %2, %3 ; <i1> [#uses=1]
%5 = zext i1 %4 to i32 ; <i32> [#uses=1]
ret i32 %5
; CHECK-NOT: icmp
; CHECK-NOT: zext
; CHECK: ret i32 %2
}