llvm-project/llvm/test/Transforms/InstCombine/2006-12-01-BadFPVectorXform.ll

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

define <4 x float> @test(<4 x float> %tmp26, <4 x float> %tmp53) {
        ; (X+Y)-Y != X for fp vectors.
        %tmp64 = fadd <4 x float> %tmp26, %tmp53         ; <<4 x float>> [#uses=1]
        %tmp75 = fsub <4 x float> %tmp64, %tmp53         ; <<4 x float>> [#uses=1]
        ret <4 x float> %tmp75
}
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. llvm-svn: 81537 2009-09-12 02:01:28 +08:00			`; RUN: opt < %s -instcombine -S \| grep sub`
			`; RUN: opt < %s -instcombine -S \| grep add`
new testcase llvm-svn: 32111 2006-12-02 08:12:32 +08:00
Remove llvm-upgrade and update test cases. llvm-svn: 47793 2008-03-01 17:15:35 +08:00			`define <4 x float> @test(<4 x float> %tmp26, <4 x float> %tmp53) {`
			`; (X+Y)-Y != X for fp vectors.`
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 llvm-svn: 72897 2009-06-05 06:49:04 +08:00			`%tmp64 = fadd <4 x float> %tmp26, %tmp53 ; <<4 x float>> [#uses=1]`
			`%tmp75 = fsub <4 x float> %tmp64, %tmp53 ; <<4 x float>> [#uses=1]`
Remove llvm-upgrade and update test cases. llvm-svn: 47793 2008-03-01 17:15:35 +08:00			`ret <4 x float> %tmp75`
new testcase llvm-svn: 32111 2006-12-02 08:12:32 +08:00			`}`