llvm-6502/test/Transforms/InstCombine/2008-07-10-CastSextBool.ll

; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {%C = xor i1 %A, true}
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {ret i1 false}
; PR2539

define i1 @test1(i1 %A) {
	%B = zext i1 %A to i32
	%C = icmp slt i32 %B, 1
	ret i1 %C
}


define i1 @test2(i1 zeroext  %b) {
entry:
	%cmptmp = icmp slt i1 %b, true		; <i1> [#uses=1]
	ret i1 %cmptmp
}
Fix a bogus optimization: folding (slt (zext i1 A to i32), 1) -> (slt i1 A, true) This cause a regression in InstCombine/JavaCompare, which was doing the right thing on accident. To handle the missed case, generalize the comparisons based on masked bits a little bit to handle comparisons against the max value. For example, we can now xform (slt i32 (and X, 4), 4) -> (setne i32 (and X, 4), 4) git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53443 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-11 04:09:09 +00:00			`; RUN: llvm-as < %s \| opt -instcombine \| llvm-dis \| grep {%C = xor i1 %A, true}`
Fix folding of icmp's of i1 where the comparison is signed. The code was using the algorithm for folding unsigned comparisons which is completely wrong. This has been broken since the signless types change. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53444 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-11 04:20:58 +00:00			`; RUN: llvm-as < %s \| opt -instcombine \| llvm-dis \| grep {ret i1 false}`
Fix a bogus optimization: folding (slt (zext i1 A to i32), 1) -> (slt i1 A, true) This cause a regression in InstCombine/JavaCompare, which was doing the right thing on accident. To handle the missed case, generalize the comparisons based on masked bits a little bit to handle comparisons against the max value. For example, we can now xform (slt i32 (and X, 4), 4) -> (setne i32 (and X, 4), 4) git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53443 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-11 04:09:09 +00:00			`; PR2539`

Fix folding of icmp's of i1 where the comparison is signed. The code was using the algorithm for folding unsigned comparisons which is completely wrong. This has been broken since the signless types change. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53444 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-11 04:20:58 +00:00			`define i1 @test1(i1 %A) {`
Fix a bogus optimization: folding (slt (zext i1 A to i32), 1) -> (slt i1 A, true) This cause a regression in InstCombine/JavaCompare, which was doing the right thing on accident. To handle the missed case, generalize the comparisons based on masked bits a little bit to handle comparisons against the max value. For example, we can now xform (slt i32 (and X, 4), 4) -> (setne i32 (and X, 4), 4) git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53443 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-11 04:09:09 +00:00			`%B = zext i1 %A to i32`
			`%C = icmp slt i32 %B, 1`
			`ret i1 %C`
			`}`
Fix folding of icmp's of i1 where the comparison is signed. The code was using the algorithm for folding unsigned comparisons which is completely wrong. This has been broken since the signless types change. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53444 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-11 04:20:58 +00:00

			`define i1 @test2(i1 zeroext %b) {`
			`entry:`
			`%cmptmp = icmp slt i1 %b, true ; <i1> [#uses=1]`
			`ret i1 %cmptmp`
			`}`