mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-25 20:59:51 +00:00
ae3a0be92e
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
41 lines
1.1 KiB
LLVM
41 lines
1.1 KiB
LLVM
; RUN: llvm-as < %s | llc -march=x86 -x86-asm-syntax=intel | \
|
|
; RUN: grep -i ST | not grep {fadd\\|fsub\\|fdiv\\|fmul}
|
|
|
|
; Test that the load of the memory location is folded into the operation.
|
|
|
|
define double @test_add(double %X, double* %P) {
|
|
%Y = load double* %P ; <double> [#uses=1]
|
|
%R = fadd double %X, %Y ; <double> [#uses=1]
|
|
ret double %R
|
|
}
|
|
|
|
define double @test_mul(double %X, double* %P) {
|
|
%Y = load double* %P ; <double> [#uses=1]
|
|
%R = fmul double %X, %Y ; <double> [#uses=1]
|
|
ret double %R
|
|
}
|
|
|
|
define double @test_sub(double %X, double* %P) {
|
|
%Y = load double* %P ; <double> [#uses=1]
|
|
%R = fsub double %X, %Y ; <double> [#uses=1]
|
|
ret double %R
|
|
}
|
|
|
|
define double @test_subr(double %X, double* %P) {
|
|
%Y = load double* %P ; <double> [#uses=1]
|
|
%R = fsub double %Y, %X ; <double> [#uses=1]
|
|
ret double %R
|
|
}
|
|
|
|
define double @test_div(double %X, double* %P) {
|
|
%Y = load double* %P ; <double> [#uses=1]
|
|
%R = fdiv double %X, %Y ; <double> [#uses=1]
|
|
ret double %R
|
|
}
|
|
|
|
define double @test_divr(double %X, double* %P) {
|
|
%Y = load double* %P ; <double> [#uses=1]
|
|
%R = fdiv double %Y, %X ; <double> [#uses=1]
|
|
ret double %R
|
|
}
|