llvm-6502/test/Transforms/InstCombine/2009-01-31-Pressure.ll

; RUN: opt < %s -instcombine -S | grep {%B = add i8 %b, %x}
; PR2698

declare void @use1(i1)
declare void @use8(i8)

define void @test1(i8 %a, i8 %b, i8 %x) {
  %A = add i8 %a, %x
  %B = add i8 %b, %x
  %C = icmp eq i8 %A, %B
  call void @use1(i1 %C)
  ret void
}

define void @test2(i8 %a, i8 %b, i8 %x) {
  %A = add i8 %a, %x
  %B = add i8 %b, %x
  %C = icmp eq i8 %A, %B
  call void @use1(i1 %C)
  call void @use8(i8 %A)
  ret void
}
Change tests from "opt %s" to "opt < %s" so that opt doesn't see the input filename so that opt doesn't print the input filename in the output so that grep lines in the tests don't unintentionally match strings in the input filename. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81537 91177308-0d34-0410-b5e6-96231b3b80d8 2009-09-11 18:01:28 +00:00			`; RUN: opt < %s -instcombine -S \| grep {%B = add i8 %b, %x}`
Reinstate this optimization to fold icmp of xor when possible. Don't try to turn icmp eq a+x, b+x into icmp eq a, b if a+x or b+x has other uses. This may have been increasing register pressure leading to the bzip2 slowdown. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@63487 91177308-0d34-0410-b5e6-96231b3b80d8 2009-01-31 21:30:05 +00:00			`; PR2698`

			`declare void @use1(i1)`
			`declare void @use8(i8)`

			`define void @test1(i8 %a, i8 %b, i8 %x) {`
			`%A = add i8 %a, %x`
			`%B = add i8 %b, %x`
			`%C = icmp eq i8 %A, %B`
			`call void @use1(i1 %C)`
			`ret void`
			`}`

			`define void @test2(i8 %a, i8 %b, i8 %x) {`
			`%A = add i8 %a, %x`
			`%B = add i8 %b, %x`
			`%C = icmp eq i8 %A, %B`
			`call void @use1(i1 %C)`
			`call void @use8(i8 %A)`
			`ret void`
			`}`