llvm/test/Transforms/InstCombine/2008-07-16-fsub.ll

; RUN: opt < %s -instcombine -S | grep sub
; PR2553

define double @test(double %X) nounwind {
	; fsub of self can't be optimized away.
	%Y = fsub double %X, %X
	ret double %Y
}
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 sub`
Fix PR2553 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53715 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-17 06:07:20 +00:00			`; PR2553`

			`define double @test(double %X) nounwind {`
			`; fsub of self can't be optimized away.`
Split the Add, Sub, and Mul instruction opcodes into separate integer and floating-point opcodes, introducing FAdd, FSub, and FMul. For now, the AsmParser, BitcodeReader, and IRBuilder all preserve backwards compatability, and the Core LLVM APIs preserve backwards compatibility for IR producers. Most front-ends won't need to change immediately. This implements the first step of the plan outlined here: http://nondot.org/sabre/LLVMNotes/IntegerOverflow.txt git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@72897 91177308-0d34-0410-b5e6-96231b3b80d8 2009-06-04 22:49:04 +00:00			`%Y = fsub double %X, %X`
Fix PR2553 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53715 91177308-0d34-0410-b5e6-96231b3b80d8 2008-07-17 06:07:20 +00:00			`ret double %Y`
			`}`