move a failing testcase from bit-tracking.ll to narrow.ll, and move the

xfail marker with it


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26129 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2006-02-12 02:02:43 +00:00
parent ee628cfefb
commit ecd9653981
2 changed files with 18 additions and 22 deletions

View File

@ -1,29 +1,7 @@
; This file contains various testcases that require tracking whether bits are
; set or cleared by various instructions.
; XFAIL: *
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep %ELIM
; test1 - Eliminating the casts in this testcase (by narrowing the AND
; operation) allows instcombine to realize the function always returns false.
;
bool %test1(int %A, int %B) {
%C1 = setlt int %A, %B
%ELIM1 = cast bool %C1 to uint
%C2 = setgt int %A, %B
%ELIM2 = cast bool %C2 to uint
%C3 = and uint %ELIM1, %ELIM2
%ELIM3 = cast uint %C3 to bool
ret bool %ELIM3
}
; See if we can eliminate the shifts...
int %test2(int %B) {
%ELIM1 = shl int %B, ubyte 31
%ELIM2 = shr int %ELIM1, ubyte 31
%inc = add int %ELIM2, 1 ; == xor int %B, 1
ret int %inc
}
; Reduce down to a single XOR
int %test3(int %B) {
%ELIMinc = and int %B, 1

View File

@ -0,0 +1,18 @@
; This file contains various testcases that check to see that instcombine
; is narrowing computations when possible.
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep %ELIM
; XFAIL: *
; test1 - Eliminating the casts in this testcase (by narrowing the AND
; operation) allows instcombine to realize the function always returns false.
;
bool %test1(int %A, int %B) {
%C1 = setlt int %A, %B
%ELIM1 = cast bool %C1 to uint
%C2 = setgt int %A, %B
%ELIM2 = cast bool %C2 to uint
%C3 = and uint %ELIM1, %ELIM2
%ELIM3 = cast uint %C3 to bool
ret bool %ELIM3
}