
(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))
double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) / ((z * z) * (z + 1.0d0))
end function
public static double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
def code(x, y, z): return (x * y) / ((z * z) * (z + 1.0))
function code(x, y, z) return Float64(Float64(x * y) / Float64(Float64(z * z) * Float64(z + 1.0))) end
function tmp = code(x, y, z) tmp = (x * y) / ((z * z) * (z + 1.0)); end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))
double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) / ((z * z) * (z + 1.0d0))
end function
public static double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
def code(x, y, z): return (x * y) / ((z * z) * (z + 1.0))
function code(x, y, z) return Float64(Float64(x * y) / Float64(Float64(z * z) * Float64(z + 1.0))) end
function tmp = code(x, y, z) tmp = (x * y) / ((z * z) * (z + 1.0)); end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)}
\end{array}
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 2e-245)
(* (/ x_m z) (/ y_m z))
(if (<= (* y_m x_m) 1.2e+148)
(/ (/ (* y_m x_m) (fma z z z)) z)
(/ (/ x_m (+ 1.0 z)) (* (/ z y_m) z)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 2e-245) {
tmp = (x_m / z) * (y_m / z);
} else if ((y_m * x_m) <= 1.2e+148) {
tmp = ((y_m * x_m) / fma(z, z, z)) / z;
} else {
tmp = (x_m / (1.0 + z)) / ((z / y_m) * z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 2e-245) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (Float64(y_m * x_m) <= 1.2e+148) tmp = Float64(Float64(Float64(y_m * x_m) / fma(z, z, z)) / z); else tmp = Float64(Float64(x_m / Float64(1.0 + z)) / Float64(Float64(z / y_m) * z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 2e-245], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 1.2e+148], N[(N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(x$95$m / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] / N[(N[(z / y$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 2 \cdot 10^{-245}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 1.2 \cdot 10^{+148}:\\
\;\;\;\;\frac{\frac{y\_m \cdot x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{1 + z}}{\frac{z}{y\_m} \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1.9999999999999999e-245Initial program 78.6%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6477.8
Applied rewrites77.8%
if 1.9999999999999999e-245 < (*.f64 x y) < 1.19999999999999997e148Initial program 96.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6499.7
Applied rewrites99.7%
if 1.19999999999999997e148 < (*.f64 x y) Initial program 76.6%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
associate-/r*N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6497.5
Applied rewrites97.5%
Final simplification86.7%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (/ (* (/ y_m (* z z)) x_m) z)) (t_1 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+20)
t_0
(if (<= t_1 1.35e-317)
(* (/ x_m z) (/ y_m z))
(if (<= t_1 5e+118) (* (/ x_m (* (fma z z z) z)) y_m) t_0)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = ((y_m / (z * z)) * x_m) / z;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = t_0;
} else if (t_1 <= 1.35e-317) {
tmp = (x_m / z) * (y_m / z);
} else if (t_1 <= 5e+118) {
tmp = (x_m / (fma(z, z, z) * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(Float64(y_m / Float64(z * z)) * x_m) / z) t_1 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_1 <= -2e+20) tmp = t_0; elseif (t_1 <= 1.35e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (t_1 <= 5e+118) tmp = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -2e+20], t$95$0, If[LessEqual[t$95$1, 1.35e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+118], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{y\_m}{z \cdot z} \cdot x\_m}{z}\\
t_1 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+20}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 1.35 \cdot 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+118}:\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e20 or 4.99999999999999972e118 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 82.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6485.2
Applied rewrites85.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
associate-/r*N/A
associate-/l*N/A
div-invN/A
lift-/.f64N/A
lower-*.f64N/A
Applied rewrites92.7%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6491.8
Applied rewrites91.8%
if -2e20 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.34999979e-317Initial program 71.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 1.34999979e-317 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 4.99999999999999972e118Initial program 95.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6493.1
Applied rewrites93.1%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lift-fma.f64N/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-rgt-neg-inN/A
associate-*l*N/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lift-*.f64N/A
distribute-rgt-inN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lower-*.f6493.1
Applied rewrites93.1%
Final simplification94.6%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ (/ y_m z) (* z z)) x_m)) (t_1 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+20)
t_0
(if (<= t_1 1.35e-317)
(* (/ x_m z) (/ y_m z))
(if (<= t_1 5e+38) (* (/ x_m (* (fma z z z) z)) y_m) t_0)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = ((y_m / z) / (z * z)) * x_m;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = t_0;
} else if (t_1 <= 1.35e-317) {
tmp = (x_m / z) * (y_m / z);
} else if (t_1 <= 5e+38) {
tmp = (x_m / (fma(z, z, z) * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(Float64(y_m / z) / Float64(z * z)) * x_m) t_1 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_1 <= -2e+20) tmp = t_0; elseif (t_1 <= 1.35e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (t_1 <= 5e+38) tmp = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / z), $MachinePrecision] / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -2e+20], t$95$0, If[LessEqual[t$95$1, 1.35e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+38], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{y\_m}{z}}{z \cdot z} \cdot x\_m\\
t_1 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+20}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 1.35 \cdot 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+38}:\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e20 or 4.9999999999999997e38 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 82.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6494.3
Applied rewrites94.3%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites89.3%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6488.5
Applied rewrites88.5%
if -2e20 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.34999979e-317Initial program 71.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 1.34999979e-317 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 4.9999999999999997e38Initial program 95.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6492.7
Applied rewrites92.7%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lift-fma.f64N/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-rgt-neg-inN/A
associate-*l*N/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lift-*.f64N/A
distribute-rgt-inN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lower-*.f6492.7
Applied rewrites92.7%
Final simplification93.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (* z z) z)) (t_1 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+20)
(/ (* y_m x_m) t_0)
(if (<= t_1 1.35e-317)
(* (/ x_m z) (/ y_m z))
(if (<= t_1 2e-14) (* (/ x_m (* z z)) y_m) (* (/ x_m t_0) y_m))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * z;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = (y_m * x_m) / t_0;
} else if (t_1 <= 1.35e-317) {
tmp = (x_m / z) * (y_m / z);
} else if (t_1 <= 2e-14) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = (x_m / t_0) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (z * z) * z
t_1 = (1.0d0 + z) * (z * z)
if (t_1 <= (-2d+20)) then
tmp = (y_m * x_m) / t_0
else if (t_1 <= 1.35d-317) then
tmp = (x_m / z) * (y_m / z)
else if (t_1 <= 2d-14) then
tmp = (x_m / (z * z)) * y_m
else
tmp = (x_m / t_0) * y_m
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * z;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = (y_m * x_m) / t_0;
} else if (t_1 <= 1.35e-317) {
tmp = (x_m / z) * (y_m / z);
} else if (t_1 <= 2e-14) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = (x_m / t_0) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (z * z) * z t_1 = (1.0 + z) * (z * z) tmp = 0 if t_1 <= -2e+20: tmp = (y_m * x_m) / t_0 elif t_1 <= 1.35e-317: tmp = (x_m / z) * (y_m / z) elif t_1 <= 2e-14: tmp = (x_m / (z * z)) * y_m else: tmp = (x_m / t_0) * y_m return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(z * z) * z) t_1 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_1 <= -2e+20) tmp = Float64(Float64(y_m * x_m) / t_0); elseif (t_1 <= 1.35e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (t_1 <= 2e-14) tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); else tmp = Float64(Float64(x_m / t_0) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (z * z) * z;
t_1 = (1.0 + z) * (z * z);
tmp = 0.0;
if (t_1 <= -2e+20)
tmp = (y_m * x_m) / t_0;
elseif (t_1 <= 1.35e-317)
tmp = (x_m / z) * (y_m / z);
elseif (t_1 <= 2e-14)
tmp = (x_m / (z * z)) * y_m;
else
tmp = (x_m / t_0) * y_m;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -2e+20], N[(N[(y$95$m * x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$1, 1.35e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-14], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision]]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(z \cdot z\right) \cdot z\\
t_1 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+20}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{t\_0}\\
\mathbf{elif}\;t\_1 \leq 1.35 \cdot 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-14}:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e20Initial program 85.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.7
Applied rewrites90.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
associate-/r*N/A
associate-/l*N/A
div-invN/A
lift-/.f64N/A
lower-*.f64N/A
Applied rewrites94.4%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6492.9
Applied rewrites92.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
frac-timesN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6484.3
Applied rewrites84.3%
if -2e20 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.34999979e-317Initial program 71.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 1.34999979e-317 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2e-14Initial program 95.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6492.1
Applied rewrites92.1%
Taylor expanded in z around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6490.5
Applied rewrites90.5%
if 2e-14 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 79.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.5
Applied rewrites88.5%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lift-fma.f64N/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-rgt-neg-inN/A
associate-*l*N/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lift-*.f64N/A
distribute-rgt-inN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lower-*.f6484.5
Applied rewrites84.5%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6481.6
Applied rewrites81.6%
Final simplification90.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (/ (* (/ (/ y_m z) z) x_m) z)) (t_1 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_1 -4e+50)
t_0
(if (<= t_1 5e+132) (/ y_m (* (* (/ z x_m) z) (+ 1.0 z))) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (((y_m / z) / z) * x_m) / z;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -4e+50) {
tmp = t_0;
} else if (t_1 <= 5e+132) {
tmp = y_m / (((z / x_m) * z) * (1.0 + z));
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (((y_m / z) / z) * x_m) / z
t_1 = (1.0d0 + z) * (z * z)
if (t_1 <= (-4d+50)) then
tmp = t_0
else if (t_1 <= 5d+132) then
tmp = y_m / (((z / x_m) * z) * (1.0d0 + z))
else
tmp = t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (((y_m / z) / z) * x_m) / z;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -4e+50) {
tmp = t_0;
} else if (t_1 <= 5e+132) {
tmp = y_m / (((z / x_m) * z) * (1.0 + z));
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (((y_m / z) / z) * x_m) / z t_1 = (1.0 + z) * (z * z) tmp = 0 if t_1 <= -4e+50: tmp = t_0 elif t_1 <= 5e+132: tmp = y_m / (((z / x_m) * z) * (1.0 + z)) else: tmp = t_0 return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(Float64(Float64(y_m / z) / z) * x_m) / z) t_1 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_1 <= -4e+50) tmp = t_0; elseif (t_1 <= 5e+132) tmp = Float64(y_m / Float64(Float64(Float64(z / x_m) * z) * Float64(1.0 + z))); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (((y_m / z) / z) * x_m) / z;
t_1 = (1.0 + z) * (z * z);
tmp = 0.0;
if (t_1 <= -4e+50)
tmp = t_0;
elseif (t_1 <= 5e+132)
tmp = y_m / (((z / x_m) * z) * (1.0 + z));
else
tmp = t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -4e+50], t$95$0, If[LessEqual[t$95$1, 5e+132], N[(y$95$m / N[(N[(N[(z / x$95$m), $MachinePrecision] * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{\frac{y\_m}{z}}{z} \cdot x\_m}{z}\\
t_1 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+50}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+132}:\\
\;\;\;\;\frac{y\_m}{\left(\frac{z}{x\_m} \cdot z\right) \cdot \left(1 + z\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -4.0000000000000003e50 or 5.0000000000000001e132 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 81.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6484.6
Applied rewrites84.6%
Taylor expanded in z around inf
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.5
Applied rewrites97.5%
if -4.0000000000000003e50 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.0000000000000001e132Initial program 84.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
clear-numN/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6492.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6492.1
Applied rewrites92.1%
Final simplification94.0%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_0 0.0)
(/ (* (/ y_m (fma z z z)) x_m) z)
(if (<= t_0 5e+118)
(* (/ (/ x_m (fma z z z)) z) y_m)
(/ (* (/ (/ y_m z) z) x_m) z)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (1.0 + z) * (z * z);
double tmp;
if (t_0 <= 0.0) {
tmp = ((y_m / fma(z, z, z)) * x_m) / z;
} else if (t_0 <= 5e+118) {
tmp = ((x_m / fma(z, z, z)) / z) * y_m;
} else {
tmp = (((y_m / z) / z) * x_m) / z;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(Float64(Float64(y_m / fma(z, z, z)) * x_m) / z); elseif (t_0 <= 5e+118) tmp = Float64(Float64(Float64(x_m / fma(z, z, z)) / z) * y_m); else tmp = Float64(Float64(Float64(Float64(y_m / z) / z) * x_m) / z); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$0, 0.0], N[(N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$0, 5e+118], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)} \cdot x\_m}{z}\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+118}:\\
\;\;\;\;\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{y\_m}{z}}{z} \cdot x\_m}{z}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0Initial program 77.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6497.0
Applied rewrites97.0%
if 0.0 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 4.99999999999999972e118Initial program 94.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6493.2
Applied rewrites93.2%
if 4.99999999999999972e118 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 76.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6476.8
Applied rewrites76.8%
Taylor expanded in z around inf
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.5
Applied rewrites97.5%
Final simplification95.8%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (/ (* y_m x_m) (* (+ 1.0 z) (* z z))) 2e-215)
(* (/ (/ y_m z) (fma z z z)) x_m)
(/ (/ y_m (+ 1.0 z)) (* (/ z x_m) z))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 2e-215) {
tmp = ((y_m / z) / fma(z, z, z)) * x_m;
} else {
tmp = (y_m / (1.0 + z)) / ((z / x_m) * z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(y_m * x_m) / Float64(Float64(1.0 + z) * Float64(z * z))) <= 2e-215) tmp = Float64(Float64(Float64(y_m / z) / fma(z, z, z)) * x_m); else tmp = Float64(Float64(y_m / Float64(1.0 + z)) / Float64(Float64(z / x_m) * z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-215], N[(N[(N[(y$95$m / z), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(y$95$m / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] / N[(N[(z / x$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{y\_m \cdot x\_m}{\left(1 + z\right) \cdot \left(z \cdot z\right)} \leq 2 \cdot 10^{-215}:\\
\;\;\;\;\frac{\frac{y\_m}{z}}{\mathsf{fma}\left(z, z, z\right)} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{y\_m}{1 + z}}{\frac{z}{x\_m} \cdot z}\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 2.00000000000000008e-215Initial program 91.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6493.1
Applied rewrites93.1%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites94.9%
if 2.00000000000000008e-215 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 71.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6492.0
Applied rewrites92.0%
Final simplification93.7%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (/ (* y_m x_m) (* (+ 1.0 z) (* z z))) 1e-206)
(* (/ (/ y_m z) (fma z z z)) x_m)
(* (/ (/ x_m (fma z z z)) z) y_m)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e-206) {
tmp = ((y_m / z) / fma(z, z, z)) * x_m;
} else {
tmp = ((x_m / fma(z, z, z)) / z) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(y_m * x_m) / Float64(Float64(1.0 + z) * Float64(z * z))) <= 1e-206) tmp = Float64(Float64(Float64(y_m / z) / fma(z, z, z)) * x_m); else tmp = Float64(Float64(Float64(x_m / fma(z, z, z)) / z) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-206], N[(N[(N[(y$95$m / z), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{y\_m \cdot x\_m}{\left(1 + z\right) \cdot \left(z \cdot z\right)} \leq 10^{-206}:\\
\;\;\;\;\frac{\frac{y\_m}{z}}{\mathsf{fma}\left(z, z, z\right)} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot y\_m\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 1.00000000000000003e-206Initial program 91.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6493.1
Applied rewrites93.1%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites94.9%
if 1.00000000000000003e-206 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 71.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6486.2
Applied rewrites86.2%
Final simplification91.4%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (fma z z z) z)) (t_1 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+20)
(* (/ y_m t_0) x_m)
(if (<= t_1 1.35e-317) (* (/ x_m z) (/ y_m z)) (* (/ x_m t_0) y_m)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = fma(z, z, z) * z;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = (y_m / t_0) * x_m;
} else if (t_1 <= 1.35e-317) {
tmp = (x_m / z) * (y_m / z);
} else {
tmp = (x_m / t_0) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(fma(z, z, z) * z) t_1 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_1 <= -2e+20) tmp = Float64(Float64(y_m / t_0) * x_m); elseif (t_1 <= 1.35e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); else tmp = Float64(Float64(x_m / t_0) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -2e+20], N[(N[(y$95$m / t$95$0), $MachinePrecision] * x$95$m), $MachinePrecision], If[LessEqual[t$95$1, 1.35e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(z, z, z\right) \cdot z\\
t_1 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+20}:\\
\;\;\;\;\frac{y\_m}{t\_0} \cdot x\_m\\
\mathbf{elif}\;t\_1 \leq 1.35 \cdot 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e20Initial program 85.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6493.3
Applied rewrites93.3%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites89.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-fma.f64N/A
distribute-lft1-inN/A
associate-*r*N/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft1-inN/A
lift-fma.f64N/A
lower-*.f6482.8
Applied rewrites82.8%
if -2e20 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.34999979e-317Initial program 71.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 1.34999979e-317 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 89.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.6
Applied rewrites90.6%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lift-fma.f64N/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-rgt-neg-inN/A
associate-*l*N/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lift-*.f64N/A
distribute-rgt-inN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
Final simplification90.8%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_0 -2e+20)
(/ (* y_m x_m) (* (* z z) z))
(if (<= t_0 1.35e-317)
(* (/ x_m z) (/ y_m z))
(* (/ x_m (* (fma z z z) z)) y_m)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (1.0 + z) * (z * z);
double tmp;
if (t_0 <= -2e+20) {
tmp = (y_m * x_m) / ((z * z) * z);
} else if (t_0 <= 1.35e-317) {
tmp = (x_m / z) * (y_m / z);
} else {
tmp = (x_m / (fma(z, z, z) * z)) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_0 <= -2e+20) tmp = Float64(Float64(y_m * x_m) / Float64(Float64(z * z) * z)); elseif (t_0 <= 1.35e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); else tmp = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$0, -2e+20], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.35e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{+20}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot z}\\
\mathbf{elif}\;t\_0 \leq 1.35 \cdot 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e20Initial program 85.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.7
Applied rewrites90.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
associate-/r*N/A
associate-/l*N/A
div-invN/A
lift-/.f64N/A
lower-*.f64N/A
Applied rewrites94.4%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6492.9
Applied rewrites92.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
frac-timesN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6484.3
Applied rewrites84.3%
if -2e20 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.34999979e-317Initial program 71.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 1.34999979e-317 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 89.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.6
Applied rewrites90.6%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lift-fma.f64N/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-rgt-neg-inN/A
associate-*l*N/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lift-*.f64N/A
distribute-rgt-inN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
Final simplification91.2%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ x_m (* (* z z) z)) y_m)) (t_1 (* (+ 1.0 z) (* z z))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+20)
t_0
(if (<= t_1 2e-14) (* (/ x_m (* z z)) y_m) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (x_m / ((z * z) * z)) * y_m;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = t_0;
} else if (t_1 <= 2e-14) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (x_m / ((z * z) * z)) * y_m
t_1 = (1.0d0 + z) * (z * z)
if (t_1 <= (-2d+20)) then
tmp = t_0
else if (t_1 <= 2d-14) then
tmp = (x_m / (z * z)) * y_m
else
tmp = t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (x_m / ((z * z) * z)) * y_m;
double t_1 = (1.0 + z) * (z * z);
double tmp;
if (t_1 <= -2e+20) {
tmp = t_0;
} else if (t_1 <= 2e-14) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (x_m / ((z * z) * z)) * y_m t_1 = (1.0 + z) * (z * z) tmp = 0 if t_1 <= -2e+20: tmp = t_0 elif t_1 <= 2e-14: tmp = (x_m / (z * z)) * y_m else: tmp = t_0 return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(x_m / Float64(Float64(z * z) * z)) * y_m) t_1 = Float64(Float64(1.0 + z) * Float64(z * z)) tmp = 0.0 if (t_1 <= -2e+20) tmp = t_0; elseif (t_1 <= 2e-14) tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (x_m / ((z * z) * z)) * y_m;
t_1 = (1.0 + z) * (z * z);
tmp = 0.0;
if (t_1 <= -2e+20)
tmp = t_0;
elseif (t_1 <= 2e-14)
tmp = (x_m / (z * z)) * y_m;
else
tmp = t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(x$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -2e+20], t$95$0, If[LessEqual[t$95$1, 2e-14], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{x\_m}{\left(z \cdot z\right) \cdot z} \cdot y\_m\\
t_1 := \left(1 + z\right) \cdot \left(z \cdot z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+20}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-14}:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e20 or 2e-14 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 83.1%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6487.6
Applied rewrites87.6%
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/l/N/A
lift-fma.f64N/A
*-rgt-identityN/A
distribute-lft-inN/A
distribute-rgt-neg-inN/A
associate-*l*N/A
frac-2negN/A
lower-/.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-rgt-identityN/A
lift-*.f64N/A
distribute-rgt-inN/A
lift-*.f64N/A
lift-fma.f64N/A
*-commutativeN/A
lower-*.f6484.9
Applied rewrites84.9%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6482.7
Applied rewrites82.7%
if -2e20 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2e-14Initial program 83.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.4
Applied rewrites90.4%
Taylor expanded in z around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6480.9
Applied rewrites80.9%
Final simplification81.7%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (/ (* y_m x_m) (* (+ 1.0 z) (* z z))) 1e-206)
(/ (* y_m x_m) (* (* z z) z))
(* (/ x_m (* z z)) y_m)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e-206) {
tmp = (y_m * x_m) / ((z * z) * z);
} else {
tmp = (x_m / (z * z)) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (((y_m * x_m) / ((1.0d0 + z) * (z * z))) <= 1d-206) then
tmp = (y_m * x_m) / ((z * z) * z)
else
tmp = (x_m / (z * z)) * y_m
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e-206) {
tmp = (y_m * x_m) / ((z * z) * z);
} else {
tmp = (x_m / (z * z)) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): tmp = 0 if ((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e-206: tmp = (y_m * x_m) / ((z * z) * z) else: tmp = (x_m / (z * z)) * y_m return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(y_m * x_m) / Float64(Float64(1.0 + z) * Float64(z * z))) <= 1e-206) tmp = Float64(Float64(y_m * x_m) / Float64(Float64(z * z) * z)); else tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
tmp = 0.0;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e-206)
tmp = (y_m * x_m) / ((z * z) * z);
else
tmp = (x_m / (z * z)) * y_m;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-206], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{y\_m \cdot x\_m}{\left(1 + z\right) \cdot \left(z \cdot z\right)} \leq 10^{-206}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 1.00000000000000003e-206Initial program 91.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6495.8
Applied rewrites95.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
associate-/r*N/A
associate-/l*N/A
div-invN/A
lift-/.f64N/A
lower-*.f64N/A
Applied rewrites95.3%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6467.8
Applied rewrites67.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
frac-timesN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6466.2
Applied rewrites66.2%
if 1.00000000000000003e-206 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 71.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6486.2
Applied rewrites86.2%
Taylor expanded in z around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6467.5
Applied rewrites67.5%
Final simplification66.7%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (/ (* y_m x_m) (* (+ 1.0 z) (* z z))) 1e+274)
(* (/ (- x_m) z) y_m)
(* (/ (- y_m) z) x_m)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e+274) {
tmp = (-x_m / z) * y_m;
} else {
tmp = (-y_m / z) * x_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: tmp
if (((y_m * x_m) / ((1.0d0 + z) * (z * z))) <= 1d+274) then
tmp = (-x_m / z) * y_m
else
tmp = (-y_m / z) * x_m
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e+274) {
tmp = (-x_m / z) * y_m;
} else {
tmp = (-y_m / z) * x_m;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): tmp = 0 if ((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e+274: tmp = (-x_m / z) * y_m else: tmp = (-y_m / z) * x_m return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(y_m * x_m) / Float64(Float64(1.0 + z) * Float64(z * z))) <= 1e+274) tmp = Float64(Float64(Float64(-x_m) / z) * y_m); else tmp = Float64(Float64(Float64(-y_m) / z) * x_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
tmp = 0.0;
if (((y_m * x_m) / ((1.0 + z) * (z * z))) <= 1e+274)
tmp = (-x_m / z) * y_m;
else
tmp = (-y_m / z) * x_m;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+274], N[(N[((-x$95$m) / z), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[((-y$95$m) / z), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{y\_m \cdot x\_m}{\left(1 + z\right) \cdot \left(z \cdot z\right)} \leq 10^{+274}:\\
\;\;\;\;\frac{-x\_m}{z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{-y\_m}{z} \cdot x\_m\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 9.99999999999999921e273Initial program 92.6%
Taylor expanded in z around 0
*-lft-identityN/A
metadata-evalN/A
cancel-sign-sub-invN/A
lower-/.f64N/A
distribute-lft-out--N/A
mul-1-negN/A
sub-negN/A
associate-*r*N/A
mul-1-negN/A
*-commutativeN/A
distribute-lft-outN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
sub-negN/A
lower--.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.9
Applied rewrites69.9%
Taylor expanded in z around inf
Applied rewrites32.9%
Taylor expanded in z around inf
Applied rewrites34.9%
if 9.99999999999999921e273 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 59.0%
Taylor expanded in z around 0
*-lft-identityN/A
metadata-evalN/A
cancel-sign-sub-invN/A
lower-/.f64N/A
distribute-lft-out--N/A
mul-1-negN/A
sub-negN/A
associate-*r*N/A
mul-1-negN/A
*-commutativeN/A
distribute-lft-outN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
sub-negN/A
lower--.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6459.1
Applied rewrites59.1%
Taylor expanded in z around inf
Applied rewrites30.6%
Final simplification33.7%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* (+ 1.0 z) (* z z)) 0.0)
(/ (* (/ y_m (fma z z z)) x_m) z)
(* (/ (/ x_m (fma z z z)) z) y_m)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((1.0 + z) * (z * z)) <= 0.0) {
tmp = ((y_m / fma(z, z, z)) * x_m) / z;
} else {
tmp = ((x_m / fma(z, z, z)) / z) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(1.0 + z) * Float64(z * z)) <= 0.0) tmp = Float64(Float64(Float64(y_m / fma(z, z, z)) * x_m) / z); else tmp = Float64(Float64(Float64(x_m / fma(z, z, z)) / z) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision], 0.0], N[(N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;\left(1 + z\right) \cdot \left(z \cdot z\right) \leq 0:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)} \cdot x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot y\_m\\
\end{array}\right)
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0Initial program 77.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6497.0
Applied rewrites97.0%
if 0.0 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 89.1%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.8
Applied rewrites90.8%
Final simplification94.0%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 1e-209)
(* (/ x_m z) (/ y_m z))
(if (<= (* y_m x_m) 2e+223)
(/ (* y_m x_m) (* (+ 1.0 z) (* z z)))
(* (/ y_m (* (fma z z z) z)) x_m))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 1e-209) {
tmp = (x_m / z) * (y_m / z);
} else if ((y_m * x_m) <= 2e+223) {
tmp = (y_m * x_m) / ((1.0 + z) * (z * z));
} else {
tmp = (y_m / (fma(z, z, z) * z)) * x_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 1e-209) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (Float64(y_m * x_m) <= 2e+223) tmp = Float64(Float64(y_m * x_m) / Float64(Float64(1.0 + z) * Float64(z * z))); else tmp = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 1e-209], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 2e+223], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(1.0 + z), $MachinePrecision] * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 10^{-209}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 2 \cdot 10^{+223}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{\left(1 + z\right) \cdot \left(z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1e-209Initial program 78.4%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.5
Applied rewrites78.5%
if 1e-209 < (*.f64 x y) < 2.00000000000000009e223Initial program 99.7%
if 2.00000000000000009e223 < (*.f64 x y) Initial program 71.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites87.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-fma.f64N/A
distribute-lft1-inN/A
associate-*r*N/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft1-inN/A
lift-fma.f64N/A
lower-*.f6481.6
Applied rewrites81.6%
Final simplification84.5%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (fma z z z) z)))
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 1e-209)
(* (/ x_m z) (/ y_m z))
(if (<= (* y_m x_m) 2e+223)
(/ (* y_m x_m) t_0)
(* (/ y_m t_0) x_m)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = fma(z, z, z) * z;
double tmp;
if ((y_m * x_m) <= 1e-209) {
tmp = (x_m / z) * (y_m / z);
} else if ((y_m * x_m) <= 2e+223) {
tmp = (y_m * x_m) / t_0;
} else {
tmp = (y_m / t_0) * x_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(fma(z, z, z) * z) tmp = 0.0 if (Float64(y_m * x_m) <= 1e-209) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (Float64(y_m * x_m) <= 2e+223) tmp = Float64(Float64(y_m * x_m) / t_0); else tmp = Float64(Float64(y_m / t_0) * x_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 1e-209], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 2e+223], N[(N[(y$95$m * x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(y$95$m / t$95$0), $MachinePrecision] * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(z, z, z\right) \cdot z\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 10^{-209}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 2 \cdot 10^{+223}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{t\_0} \cdot x\_m\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 x y) < 1e-209Initial program 78.4%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.5
Applied rewrites78.5%
if 1e-209 < (*.f64 x y) < 2.00000000000000009e223Initial program 99.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.7
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6499.7
Applied rewrites99.7%
if 2.00000000000000009e223 < (*.f64 x y) Initial program 71.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites87.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-fma.f64N/A
distribute-lft1-inN/A
associate-*r*N/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft1-inN/A
lift-fma.f64N/A
lower-*.f6481.6
Applied rewrites81.6%
Final simplification84.5%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ y_m (* (fma z z z) z)) x_m)))
(*
x_s
(*
y_s
(if (<= z -1.05e-17)
t_0
(if (<= z 1.95e-87) (/ (* (/ x_m z) y_m) z) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (y_m / (fma(z, z, z) * z)) * x_m;
double tmp;
if (z <= -1.05e-17) {
tmp = t_0;
} else if (z <= 1.95e-87) {
tmp = ((x_m / z) * y_m) / z;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m) tmp = 0.0 if (z <= -1.05e-17) tmp = t_0; elseif (z <= 1.95e-87) tmp = Float64(Float64(Float64(x_m / z) * y_m) / z); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.05e-17], t$95$0, If[LessEqual[z, 1.95e-87], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.05 \cdot 10^{-17}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;z \leq 1.95 \cdot 10^{-87}:\\
\;\;\;\;\frac{\frac{x\_m}{z} \cdot y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if z < -1.04999999999999996e-17 or 1.9499999999999999e-87 < z Initial program 85.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6495.4
Applied rewrites95.4%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r/N/A
lift-/.f64N/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-*.f64N/A
Applied rewrites91.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-fma.f64N/A
distribute-lft1-inN/A
associate-*r*N/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-lft1-inN/A
lift-fma.f64N/A
lower-*.f6486.9
Applied rewrites86.9%
if -1.04999999999999996e-17 < z < 1.9499999999999999e-87Initial program 80.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6489.4
Applied rewrites89.4%
Taylor expanded in z around 0
associate-*l/N/A
lower-*.f64N/A
lower-/.f6495.8
Applied rewrites95.8%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= z -3.2e+16)
(/ (* (/ y_m (* z z)) x_m) z)
(* (/ (/ x_m (fma z z z)) z) y_m)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (z <= -3.2e+16) {
tmp = ((y_m / (z * z)) * x_m) / z;
} else {
tmp = ((x_m / fma(z, z, z)) / z) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (z <= -3.2e+16) tmp = Float64(Float64(Float64(y_m / Float64(z * z)) * x_m) / z); else tmp = Float64(Float64(Float64(x_m / fma(z, z, z)) / z) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, -3.2e+16], N[(N[(N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3.2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{y\_m}{z \cdot z} \cdot x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot y\_m\\
\end{array}\right)
\end{array}
if z < -3.2e16Initial program 85.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.2
Applied rewrites90.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
associate-/r*N/A
associate-/l*N/A
div-invN/A
lift-/.f64N/A
lower-*.f64N/A
Applied rewrites94.1%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6494.1
Applied rewrites94.1%
if -3.2e16 < z Initial program 82.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.1
Applied rewrites90.1%
y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (x_s y_s x_m y_m z) :precision binary64 (* x_s (* y_s (* (/ x_m (* z z)) y_m))))
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / (z * z)) * y_m));
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = x_s * (y_s * ((x_m / (z * z)) * y_m))
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / (z * z)) * y_m));
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): return x_s * (y_s * ((x_m / (z * z)) * y_m))
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) return Float64(x_s * Float64(y_s * Float64(Float64(x_m / Float64(z * z)) * y_m))) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
tmp = x_s * (y_s * ((x_m / (z * z)) * y_m));
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \left(\frac{x\_m}{z \cdot z} \cdot y\_m\right)\right)
\end{array}
Initial program 83.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6489.2
Applied rewrites89.2%
Taylor expanded in z around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6473.2
Applied rewrites73.2%
y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (x_s y_s x_m y_m z) :precision binary64 (* x_s (* y_s (* (/ (- x_m) z) y_m))))
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((-x_m / z) * y_m));
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = x_s * (y_s * ((-x_m / z) * y_m))
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((-x_m / z) * y_m));
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): return x_s * (y_s * ((-x_m / z) * y_m))
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) return Float64(x_s * Float64(y_s * Float64(Float64(Float64(-x_m) / z) * y_m))) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
tmp = x_s * (y_s * ((-x_m / z) * y_m));
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[((-x$95$m) / z), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \left(\frac{-x\_m}{z} \cdot y\_m\right)\right)
\end{array}
Initial program 83.2%
Taylor expanded in z around 0
*-lft-identityN/A
metadata-evalN/A
cancel-sign-sub-invN/A
lower-/.f64N/A
distribute-lft-out--N/A
mul-1-negN/A
sub-negN/A
associate-*r*N/A
mul-1-negN/A
*-commutativeN/A
distribute-lft-outN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
sub-negN/A
lower--.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6466.8
Applied rewrites66.8%
Taylor expanded in z around inf
Applied rewrites32.3%
Taylor expanded in z around inf
Applied rewrites32.6%
(FPCore (x y z) :precision binary64 (if (< z 249.6182814532307) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1.0 z)) x) z)))
double code(double x, double y, double z) {
double tmp;
if (z < 249.6182814532307) {
tmp = (y * (x / z)) / (z + (z * z));
} else {
tmp = (((y / z) / (1.0 + z)) * x) / z;
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (z < 249.6182814532307d0) then
tmp = (y * (x / z)) / (z + (z * z))
else
tmp = (((y / z) / (1.0d0 + z)) * x) / z
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if (z < 249.6182814532307) {
tmp = (y * (x / z)) / (z + (z * z));
} else {
tmp = (((y / z) / (1.0 + z)) * x) / z;
}
return tmp;
}
def code(x, y, z): tmp = 0 if z < 249.6182814532307: tmp = (y * (x / z)) / (z + (z * z)) else: tmp = (((y / z) / (1.0 + z)) * x) / z return tmp
function code(x, y, z) tmp = 0.0 if (z < 249.6182814532307) tmp = Float64(Float64(y * Float64(x / z)) / Float64(z + Float64(z * z))); else tmp = Float64(Float64(Float64(Float64(y / z) / Float64(1.0 + z)) * x) / z); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if (z < 249.6182814532307) tmp = (y * (x / z)) / (z + (z * z)); else tmp = (((y / z) / (1.0 + z)) * x) / z; end tmp_2 = tmp; end
code[x_, y_, z_] := If[Less[z, 249.6182814532307], N[(N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision] / N[(z + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y / z), $MachinePrecision] / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z < 249.6182814532307:\\
\;\;\;\;\frac{y \cdot \frac{x}{z}}{z + z \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{y}{z}}{1 + z} \cdot x}{z}\\
\end{array}
\end{array}
herbie shell --seed 2024248
(FPCore (x y z)
:name "Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< z 2496182814532307/10000000000000) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1 z)) x) z)))
(/ (* x y) (* (* z z) (+ z 1.0))))