llvm/test/CodeGen/X86/sub.ll

; RUN: llc -march=x86 < %s | FileCheck %s

define i32 @test1(i32 %x) {
  %xor = xor i32 %x, 31
  %sub = sub i32 32, %xor
  ret i32 %sub
; CHECK: test1:
; CHECK:      xorl $-32
; CHECK-NEXT: addl $33
; CHECK-NEXT: ret
}
Update test. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136170 91177308-0d34-0410-b5e6-96231b3b80d8 2011-07-26 22:45:39 +00:00			`; RUN: llc -march=x86 < %s \| FileCheck %s`
Add a neat little two's complement hack for x86. On x86 we can't encode an immediate LHS of a sub directly. If the RHS comes from a XOR with a constant we can fold the negation into the xor and add one to the immediate of the sub. Then we can turn the sub into an add, which can be commuted and encoded efficiently. This code is generated for __builtin_clz and friends. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@136167 91177308-0d34-0410-b5e6-96231b3b80d8 2011-07-26 22:42:13 +00:00
			`define i32 @test1(i32 %x) {`
			`%xor = xor i32 %x, 31`
			`%sub = sub i32 32, %xor`
			`ret i32 %sub`
			`; CHECK: test1:`
			`; CHECK: xorl $-32`
			`; CHECK-NEXT: addl $33`
			`; CHECK-NEXT: ret`
			`}`