More working CellSPU test cases:
- call.ll: Function call
- ctpop.ll: Count population
- dp_farith.ll: DP arithmetic
- eqv.ll: Equivalence primitives
- fcmp.ll: SP comparisons
- fdiv.ll: SP division
- fneg-fabs.ll: SP negation, aboslute value
- int2fp.ll: Integer -> SP conversion
- rotate_ops.ll: Rotation primitives
- select_bits.ll: (a & c) | (b & ~c) bit selection
- shift_ops.ll: Shift primitives
- sp_farith.ll: SP arithmentic
llvm-svn: 45217
diff --git a/llvm/test/CodeGen/CellSPU/dp_farith.ll b/llvm/test/CodeGen/CellSPU/dp_farith.ll
new file mode 100644
index 0000000..58c56e1
--- /dev/null
+++ b/llvm/test/CodeGen/CellSPU/dp_farith.ll
@@ -0,0 +1,100 @@
+; RUN: llvm-as -o - %s | llc -march=cellspu > %t1.s
+; RUN: grep dfa %t1.s | count 2 &&
+; RUN: grep dfs %t1.s | count 2 &&
+; RUN: grep dfm %t1.s | count 6 &&
+; RUN: grep dfma %t1.s | count 2 &&
+; RUN: grep dfms %t1.s | count 2 &&
+; RUN: grep dfnms %t1.s | count 4
+;
+; This file includes double precision floating point arithmetic instructions
+
+define double @fadd(double %arg1, double %arg2) {
+ %A = add double %arg1, %arg2
+ ret double %A
+}
+
+define <2 x double> @fadd_vec(<2 x double> %arg1, <2 x double> %arg2) {
+ %A = add <2 x double> %arg1, %arg2
+ ret <2 x double> %A
+}
+
+define double @fsub(double %arg1, double %arg2) {
+ %A = sub double %arg1, %arg2
+ ret double %A
+}
+
+define <2 x double> @fsub_vec(<2 x double> %arg1, <2 x double> %arg2) {
+ %A = sub <2 x double> %arg1, %arg2
+ ret <2 x double> %A
+}
+
+define double @fmul(double %arg1, double %arg2) {
+ %A = mul double %arg1, %arg2
+ ret double %A
+}
+
+define <2 x double> @fmul_vec(<2 x double> %arg1, <2 x double> %arg2) {
+ %A = mul <2 x double> %arg1, %arg2
+ ret <2 x double> %A
+}
+
+define double @fma(double %arg1, double %arg2, double %arg3) {
+ %A = mul double %arg1, %arg2
+ %B = add double %A, %arg3
+ ret double %B
+}
+
+define <2 x double> @fma_vec(<2 x double> %arg1, <2 x double> %arg2, <2 x double> %arg3) {
+ %A = mul <2 x double> %arg1, %arg2
+ %B = add <2 x double> %A, %arg3
+ ret <2 x double> %B
+}
+
+define double @fms(double %arg1, double %arg2, double %arg3) {
+ %A = mul double %arg1, %arg2
+ %B = sub double %A, %arg3
+ ret double %B
+}
+
+define <2 x double> @fms_vec(<2 x double> %arg1, <2 x double> %arg2, <2 x double> %arg3) {
+ %A = mul <2 x double> %arg1, %arg2
+ %B = sub <2 x double> %A, %arg3
+ ret <2 x double> %B
+}
+
+; - (a * b - c)
+define double @d_fnms_1(double %arg1, double %arg2, double %arg3) {
+ %A = mul double %arg1, %arg2
+ %B = sub double %A, %arg3
+ %C = sub double -0.000000e+00, %B ; <double> [#uses=1]
+ ret double %C
+}
+
+; Annother way of getting fnms
+; - ( a * b ) + c => c - (a * b)
+define double @d_fnms_2(double %arg1, double %arg2, double %arg3) {
+ %A = mul double %arg1, %arg2
+ %B = sub double %arg3, %A
+ ret double %B
+}
+
+; FNMS: - (a * b - c) => c - (a * b)
+define <2 x double> @d_fnms_vec_1(<2 x double> %arg1, <2 x double> %arg2, <2 x double> %arg3) {
+ %A = mul <2 x double> %arg1, %arg2
+ %B = sub <2 x double> %arg3, %A ;
+ ret <2 x double> %B
+}
+
+; Another way to get fnms using a constant vector
+; - ( a * b - c)
+define <2 x double> @d_fnms_vec_2(<2 x double> %arg1, <2 x double> %arg2, <2 x double> %arg3) {
+ %A = mul <2 x double> %arg1, %arg2 ; <<2 x double>> [#uses=1]
+ %B = sub <2 x double> %A, %arg3 ; <<2 x double>> [#uses=1]
+ %C = sub <2 x double> < double -0.00000e+00, double -0.00000e+00 >, %B
+ ret <2 x double> %C
+}
+
+;define double @fdiv_1(double %arg1, double %arg2) {
+; %A = fdiv double %arg1, %arg2 ; <double> [#uses=1]
+; ret double %A
+;}