
(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 13 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 (<= (* x_m y_m) 1e-317)
(* (/ x_m z) (/ y_m z))
(if (<= (* x_m y_m) 1e+220)
(/ (/ (* y_m x_m) (fma z z z)) z)
(/ (/ x_m (+ 1.0 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 ((x_m * y_m) <= 1e-317) {
tmp = (x_m / z) * (y_m / z);
} else if ((x_m * y_m) <= 1e+220) {
tmp = ((y_m * x_m) / fma(z, z, z)) / z;
} else {
tmp = (x_m / (1.0 + 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(x_m * y_m) <= 1e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (Float64(x_m * y_m) <= 1e+220) tmp = Float64(Float64(Float64(y_m * x_m) / fma(z, z, z)) / z); else tmp = Float64(Float64(x_m / Float64(1.0 + z)) / Float64(z * Float64(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[(x$95$m * y$95$m), $MachinePrecision], 1e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x$95$m * y$95$m), $MachinePrecision], 1e+220], 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[(z * N[(z / y$95$m), $MachinePrecision]), $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}\;x\_m \cdot y\_m \leq 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;x\_m \cdot y\_m \leq 10^{+220}:\\
\;\;\;\;\frac{\frac{y\_m \cdot x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{1 + z}}{z \cdot \frac{z}{y\_m}}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1.00000023e-317Initial program 82.2%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6479.7
Applied rewrites79.7%
if 1.00000023e-317 < (*.f64 x y) < 1e220Initial program 93.0%
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.8
Applied rewrites99.8%
if 1e220 < (*.f64 x y) Initial program 71.5%
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-/.f6499.9
Applied rewrites99.9%
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 (<= (/ (* x_m y_m) (* (* z z) (+ z 1.0))) 1e-65)
(/ x_m (* z (/ (fma z z z) y_m)))
(/ y_m (* (/ (fma z 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 (((x_m * y_m) / ((z * z) * (z + 1.0))) <= 1e-65) {
tmp = x_m / (z * (fma(z, z, z) / y_m));
} else {
tmp = y_m / ((fma(z, 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(x_m * y_m) / Float64(Float64(z * z) * Float64(z + 1.0))) <= 1e-65) tmp = Float64(x_m / Float64(z * Float64(fma(z, z, z) / y_m))); else tmp = Float64(y_m / Float64(Float64(fma(z, 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_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(x$95$m * y$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-65], N[(x$95$m / N[(z * N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / 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{x\_m \cdot y\_m}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \leq 10^{-65}:\\
\;\;\;\;\frac{x\_m}{z \cdot \frac{\mathsf{fma}\left(z, z, z\right)}{y\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{\frac{\mathsf{fma}\left(z, z, z\right)}{x\_m} \cdot z}\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 9.99999999999999923e-66Initial program 91.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6492.5
Applied rewrites92.5%
if 9.99999999999999923e-66 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 71.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6489.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6489.6
Applied rewrites89.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6489.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6489.7
Applied rewrites89.7%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites83.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
(*
x_s
(*
y_s
(if (<= (/ (* x_m y_m) (* (* z z) (+ z 1.0))) 1e-37)
(/ x_m (* z (/ (fma z z z) y_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 (((x_m * y_m) / ((z * z) * (z + 1.0))) <= 1e-37) {
tmp = x_m / (z * (fma(z, z, z) / y_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(x_m * y_m) / Float64(Float64(z * z) * Float64(z + 1.0))) <= 1e-37) tmp = Float64(x_m / Float64(z * Float64(fma(z, z, z) / y_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[(x$95$m * y$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-37], N[(x$95$m / N[(z * N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision]), $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{x\_m \cdot y\_m}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \leq 10^{-37}:\\
\;\;\;\;\frac{x\_m}{z \cdot \frac{\mathsf{fma}\left(z, z, z\right)}{y\_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.00000000000000007e-37Initial program 91.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6492.6
Applied rewrites92.6%
if 1.00000000000000007e-37 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 71.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.f6483.0
Applied rewrites83.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 (<= (/ (* x_m y_m) (* (* z z) (+ z 1.0))) 2e-22)
(* (/ y_m (* (fma z 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 (((x_m * y_m) / ((z * z) * (z + 1.0))) <= 2e-22) {
tmp = (y_m / (fma(z, 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(x_m * y_m) / Float64(Float64(z * z) * Float64(z + 1.0))) <= 2e-22) tmp = Float64(Float64(y_m / Float64(fma(z, 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[(x$95$m * y$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-22], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * 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{x\_m \cdot y\_m}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \leq 2 \cdot 10^{-22}:\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \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)))) < 2.0000000000000001e-22Initial program 91.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6495.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6495.7
Applied rewrites95.7%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6496.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.8
Applied rewrites96.8%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites93.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*r/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
distribute-lft-neg-outN/A
remove-double-negN/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
if 2.0000000000000001e-22 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 70.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.f6482.6
Applied rewrites82.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
(*
x_s
(*
y_s
(if (<= (/ (* x_m y_m) (* (* z z) (+ z 1.0))) 2e-22)
(* (/ y_m (* (fma z z z) z)) x_m)
(* (/ (/ x_m z) (fma 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 (((x_m * y_m) / ((z * z) * (z + 1.0))) <= 2e-22) {
tmp = (y_m / (fma(z, z, z) * z)) * x_m;
} else {
tmp = ((x_m / z) / fma(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(x_m * y_m) / Float64(Float64(z * z) * Float64(z + 1.0))) <= 2e-22) tmp = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m); else tmp = Float64(Float64(Float64(x_m / z) / fma(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[(x$95$m * y$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-22], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(N[(x$95$m / z), $MachinePrecision] / N[(z * 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{x\_m \cdot y\_m}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \leq 2 \cdot 10^{-22}:\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{z}}{\mathsf{fma}\left(z, z, z\right)} \cdot y\_m\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 2.0000000000000001e-22Initial program 91.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6495.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6495.7
Applied rewrites95.7%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6496.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.8
Applied rewrites96.8%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites93.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*r/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
distribute-lft-neg-outN/A
remove-double-negN/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
if 2.0000000000000001e-22 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 70.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.f6482.6
Applied rewrites82.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6482.5
Applied rewrites82.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 (* (* z z) (+ z 1.0))))
(*
x_s
(*
y_s
(if (or (<= t_0 -2e+18) (not (<= t_0 0.0)))
(* (/ x_m (* (fma z z z) z)) y_m)
(* (/ x_m 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 t_0 = (z * z) * (z + 1.0);
double tmp;
if ((t_0 <= -2e+18) || !(t_0 <= 0.0)) {
tmp = (x_m / (fma(z, z, z) * z)) * y_m;
} else {
tmp = (x_m / 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) t_0 = Float64(Float64(z * z) * Float64(z + 1.0)) tmp = 0.0 if ((t_0 <= -2e+18) || !(t_0 <= 0.0)) tmp = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m); else tmp = Float64(Float64(x_m / z) * Float64(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_] := Block[{t$95$0 = N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[Or[LessEqual[t$95$0, -2e+18], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / 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])\\
\\
\begin{array}{l}
t_0 := \left(z \cdot z\right) \cdot \left(z + 1\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{+18} \lor \neg \left(t\_0 \leq 0\right):\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -2e18 or 0.0 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 87.4%
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.f6491.4
Applied rewrites91.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
lower-/.f6489.1
Applied rewrites89.1%
if -2e18 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0Initial program 76.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6496.9
Applied rewrites96.9%
Final simplification90.9%
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 (* (* z z) (+ z 1.0))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+18)
(* (/ y_m t_0) x_m)
(if (<= t_1 0.0) (* (/ 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 = (z * z) * (z + 1.0);
double tmp;
if (t_1 <= -2e+18) {
tmp = (y_m / t_0) * x_m;
} else if (t_1 <= 0.0) {
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(z * z) * Float64(z + 1.0)) tmp = 0.0 if (t_1 <= -2e+18) tmp = Float64(Float64(y_m / t_0) * x_m); elseif (t_1 <= 0.0) 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[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -2e+18], N[(N[(y$95$m / t$95$0), $MachinePrecision] * x$95$m), $MachinePrecision], If[LessEqual[t$95$1, 0.0], 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(z \cdot z\right) \cdot \left(z + 1\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+18}:\\
\;\;\;\;\frac{y\_m}{t\_0} \cdot x\_m\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\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))) < -2e18Initial program 88.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6496.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.2
Applied rewrites96.2%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites90.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*r/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
distribute-lft-neg-outN/A
remove-double-negN/A
*-commutativeN/A
lower-*.f6485.1
Applied rewrites85.1%
if -2e18 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0Initial program 76.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6496.9
Applied rewrites96.9%
if 0.0 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 87.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.f6491.4
Applied rewrites91.4%
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
lower-/.f6488.6
Applied rewrites88.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
(*
x_s
(*
y_s
(if (<= (* x_m y_m) 1e-317)
(* (/ x_m z) (/ y_m z))
(if (<= (* x_m y_m) 1e+220)
(/ (/ (* y_m x_m) (fma z z z)) z)
(/ x_m (* (* (/ (+ z 1.0) y_m) z) 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 ((x_m * y_m) <= 1e-317) {
tmp = (x_m / z) * (y_m / z);
} else if ((x_m * y_m) <= 1e+220) {
tmp = ((y_m * x_m) / fma(z, z, z)) / z;
} else {
tmp = x_m / ((((z + 1.0) / y_m) * z) * 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(x_m * y_m) <= 1e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (Float64(x_m * y_m) <= 1e+220) tmp = Float64(Float64(Float64(y_m * x_m) / fma(z, z, z)) / z); else tmp = Float64(x_m / Float64(Float64(Float64(Float64(z + 1.0) / y_m) * z) * 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[(x$95$m * y$95$m), $MachinePrecision], 1e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x$95$m * y$95$m), $MachinePrecision], 1e+220], N[(N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(x$95$m / N[(N[(N[(N[(z + 1.0), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $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}\;x\_m \cdot y\_m \leq 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;x\_m \cdot y\_m \leq 10^{+220}:\\
\;\;\;\;\frac{\frac{y\_m \cdot x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\left(\frac{z + 1}{y\_m} \cdot z\right) \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1.00000023e-317Initial program 82.2%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6479.7
Applied rewrites79.7%
if 1.00000023e-317 < (*.f64 x y) < 1e220Initial program 93.0%
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.8
Applied rewrites99.8%
if 1e220 < (*.f64 x y) Initial program 71.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6491.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6491.4
Applied rewrites91.4%
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
frac-timesN/A
*-lft-identityN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6496.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.9
Applied rewrites96.9%
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 (<= (* x_m y_m) 1e-317)
(* (/ x_m z) (/ y_m z))
(/ (/ (* (/ y_m (+ 1.0 z)) x_m) z) 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 ((x_m * y_m) <= 1e-317) {
tmp = (x_m / z) * (y_m / z);
} else {
tmp = (((y_m / (1.0 + z)) * x_m) / z) / z;
}
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 ((x_m * y_m) <= 1d-317) then
tmp = (x_m / z) * (y_m / z)
else
tmp = (((y_m / (1.0d0 + z)) * x_m) / z) / z
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 ((x_m * y_m) <= 1e-317) {
tmp = (x_m / z) * (y_m / z);
} else {
tmp = (((y_m / (1.0 + z)) * x_m) / z) / z;
}
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 (x_m * y_m) <= 1e-317: tmp = (x_m / z) * (y_m / z) else: tmp = (((y_m / (1.0 + z)) * x_m) / z) / 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(x_m * y_m) <= 1e-317) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); else tmp = Float64(Float64(Float64(Float64(y_m / Float64(1.0 + z)) * x_m) / z) / z); 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 ((x_m * y_m) <= 1e-317)
tmp = (x_m / z) * (y_m / z);
else
tmp = (((y_m / (1.0 + z)) * x_m) / z) / z;
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[(x$95$m * y$95$m), $MachinePrecision], 1e-317], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y$95$m / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $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])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;x\_m \cdot y\_m \leq 10^{-317}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{y\_m}{1 + z} \cdot x\_m}{z}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1.00000023e-317Initial program 82.2%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6479.7
Applied rewrites79.7%
if 1.00000023e-317 < (*.f64 x y) Initial program 87.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6496.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.7
Applied rewrites96.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 (or (<= z -1.04e-10) (not (<= z 3.7e-34)))
(* (/ y_m (* (fma z z z) z)) x_m)
(/ y_m (* (/ 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 ((z <= -1.04e-10) || !(z <= 3.7e-34)) {
tmp = (y_m / (fma(z, z, z) * z)) * x_m;
} else {
tmp = y_m / ((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 ((z <= -1.04e-10) || !(z <= 3.7e-34)) tmp = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m); else tmp = Float64(y_m / 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[Or[LessEqual[z, -1.04e-10], N[Not[LessEqual[z, 3.7e-34]], $MachinePrecision]], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(y$95$m / 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}\;z \leq -1.04 \cdot 10^{-10} \lor \neg \left(z \leq 3.7 \cdot 10^{-34}\right):\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{\frac{z}{x\_m} \cdot z}\\
\end{array}\right)
\end{array}
if z < -1.04e-10 or 3.69999999999999988e-34 < z Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6494.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.6
Applied rewrites94.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6496.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.1
Applied rewrites96.1%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites90.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*r/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
distribute-lft-neg-outN/A
remove-double-negN/A
*-commutativeN/A
lower-*.f6487.4
Applied rewrites87.4%
if -1.04e-10 < z < 3.69999999999999988e-34Initial program 84.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6492.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6492.6
Applied rewrites92.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6492.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6492.6
Applied rewrites92.6%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites89.6%
Taylor expanded in z around 0
lower-/.f6489.6
Applied rewrites89.6%
Final simplification88.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
(*
x_s
(*
y_s
(if (or (<= z -1.04e-10) (not (<= z 3.75e-34)))
(* (/ y_m (* (fma z z z) z)) x_m)
(* (/ (/ 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 ((z <= -1.04e-10) || !(z <= 3.75e-34)) {
tmp = (y_m / (fma(z, z, z) * z)) * x_m;
} 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 ((z <= -1.04e-10) || !(z <= 3.75e-34)) tmp = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m); else tmp = Float64(Float64(Float64(x_m / 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[Or[LessEqual[z, -1.04e-10], N[Not[LessEqual[z, 3.75e-34]], $MachinePrecision]], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(N[(x$95$m / z), $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 -1.04 \cdot 10^{-10} \lor \neg \left(z \leq 3.75 \cdot 10^{-34}\right):\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{z}}{z} \cdot y\_m\\
\end{array}\right)
\end{array}
if z < -1.04e-10 or 3.7500000000000002e-34 < z Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6494.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.6
Applied rewrites94.6%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6496.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.1
Applied rewrites96.1%
lift-/.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
distribute-lft1-inN/A
associate-*l/N/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-fma.f64N/A
clear-numN/A
Applied rewrites90.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*r/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
distribute-lft-neg-outN/A
remove-double-negN/A
*-commutativeN/A
lower-*.f6487.4
Applied rewrites87.4%
if -1.04e-10 < z < 3.7500000000000002e-34Initial program 84.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.f6489.4
Applied rewrites89.4%
Taylor expanded in z around 0
lower-/.f6489.4
Applied rewrites89.4%
Final simplification88.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
(*
x_s
(*
y_s
(if (<= (* x_m y_m) 2e-77)
(* (/ x_m z) (/ y_m 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 ((x_m * y_m) <= 2e-77) {
tmp = (x_m / z) * (y_m / 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 ((x_m * y_m) <= 2d-77) then
tmp = (x_m / z) * (y_m / 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 ((x_m * y_m) <= 2e-77) {
tmp = (x_m / z) * (y_m / 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 (x_m * y_m) <= 2e-77: tmp = (x_m / z) * (y_m / 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(x_m * y_m) <= 2e-77) tmp = Float64(Float64(x_m / z) * Float64(y_m / 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 ((x_m * y_m) <= 2e-77)
tmp = (x_m / z) * (y_m / 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[(x$95$m * y$95$m), $MachinePrecision], 2e-77], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / 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}\;x\_m \cdot y\_m \leq 2 \cdot 10^{-77}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1.9999999999999999e-77Initial program 83.0%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6481.5
Applied rewrites81.5%
if 1.9999999999999999e-77 < (*.f64 x y) Initial program 88.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.f6490.1
Applied rewrites90.1%
Taylor expanded in z around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6468.8
Applied rewrites68.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 (* (/ 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 84.7%
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%
Taylor expanded in z around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6474.3
Applied rewrites74.3%
(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 2024313
(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))))