
(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 14 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) 5e-312)
(* (/ y_m z) (/ x_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 ((y_m * x_m) <= 5e-312) {
tmp = (y_m / z) * (x_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 ((y_m * x_m) <= 5d-312) then
tmp = (y_m / z) * (x_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 ((y_m * x_m) <= 5e-312) {
tmp = (y_m / z) * (x_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 (y_m * x_m) <= 5e-312: tmp = (y_m / z) * (x_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(y_m * x_m) <= 5e-312) tmp = Float64(Float64(y_m / z) * Float64(x_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 ((y_m * x_m) <= 5e-312)
tmp = (y_m / z) * (x_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[(y$95$m * x$95$m), $MachinePrecision], 5e-312], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$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}\;y\_m \cdot x\_m \leq 5 \cdot 10^{-312}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_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) < 5.0000000000022e-312Initial program 82.5%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6476.5
Applied rewrites76.5%
if 5.0000000000022e-312 < (*.f64 x y) Initial program 87.7%
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-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Final simplification87.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 (* (* (pow (+ 1.0 z) -1.0) (/ 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) {
return x_s * (y_s * ((pow((1.0 + z), -1.0) * (y_m / z)) * (x_m / z)));
}
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 * ((((1.0d0 + z) ** (-1.0d0)) * (y_m / z)) * (x_m / z)))
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 * ((Math.pow((1.0 + z), -1.0) * (y_m / z)) * (x_m / z)));
}
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 * ((math.pow((1.0 + z), -1.0) * (y_m / z)) * (x_m / z)))
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(1.0 + z) ^ -1.0) * Float64(y_m / z)) * Float64(x_m / z)))) 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 * ((((1.0 + z) ^ -1.0) * (y_m / z)) * (x_m / z)));
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[(N[Power[N[(1.0 + z), $MachinePrecision], -1.0], $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision] * N[(x$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])\\
\\
x\_s \cdot \left(y\_s \cdot \left(\left({\left(1 + z\right)}^{-1} \cdot \frac{y\_m}{z}\right) \cdot \frac{x\_m}{z}\right)\right)
\end{array}
Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.1
Applied rewrites98.1%
Final simplification98.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 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -5e+51)
t_0
(if (<= t_1 2e+139) (/ y_m (* (/ (fma z z z) x_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 / z) / z) * (x_m / z);
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -5e+51) {
tmp = t_0;
} else if (t_1 <= 2e+139) {
tmp = y_m / ((fma(z, z, z) / x_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(Float64(y_m / z) / z) * Float64(x_m / z)) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -5e+51) tmp = t_0; elseif (t_1 <= 2e+139) tmp = Float64(y_m / Float64(Float64(fma(z, z, z) / x_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[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -5e+51], t$95$0, If[LessEqual[t$95$1, 2e+139], N[(y$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / x$95$m), $MachinePrecision] * z), $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{y\_m}{z}}{z} \cdot \frac{x\_m}{z}\\
t_1 := \left(z \cdot z\right) \cdot \left(1 + z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+51}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+139}:\\
\;\;\;\;\frac{y\_m}{\frac{\mathsf{fma}\left(z, z, z\right)}{x\_m} \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -5e51 or 2.00000000000000007e139 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 84.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6497.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.9
Applied rewrites97.9%
Taylor expanded in z around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.0
Applied rewrites98.0%
if -5e51 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 2.00000000000000007e139Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.2
Applied rewrites98.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
remove-double-negN/A
distribute-frac-negN/A
Applied rewrites93.7%
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) (* (* z z) (+ 1.0 z))) 5e+115)
(/ x_m (* (* (/ z y_m) z) (+ 1.0 z)))
(/ 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 (((y_m * x_m) / ((z * z) * (1.0 + z))) <= 5e+115) {
tmp = x_m / (((z / y_m) * z) * (1.0 + z));
} 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(y_m * x_m) / Float64(Float64(z * z) * Float64(1.0 + z))) <= 5e+115) tmp = Float64(x_m / Float64(Float64(Float64(z / y_m) * z) * Float64(1.0 + z))); 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[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+115], N[(x$95$m / N[(N[(N[(z / y$95$m), $MachinePrecision] * z), $MachinePrecision] * N[(1.0 + z), $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{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot \left(1 + z\right)} \leq 5 \cdot 10^{+115}:\\
\;\;\;\;\frac{x\_m}{\left(\frac{z}{y\_m} \cdot z\right) \cdot \left(1 + z\right)}\\
\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)))) < 5.00000000000000008e115Initial program 91.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.0
Applied rewrites98.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
Applied rewrites93.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lift-/.f64N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6494.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6494.1
Applied rewrites94.1%
if 5.00000000000000008e115 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 65.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.2
Applied rewrites98.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
remove-double-negN/A
distribute-frac-negN/A
Applied rewrites85.9%
Final simplification92.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
(if (<= (/ (* y_m x_m) (* (* z z) (+ 1.0 z))) 5e+115)
(/ x_m (* (/ (fma z z z) y_m) z))
(/ 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 (((y_m * x_m) / ((z * z) * (1.0 + z))) <= 5e+115) {
tmp = x_m / ((fma(z, z, z) / y_m) * z);
} 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(y_m * x_m) / Float64(Float64(z * z) * Float64(1.0 + z))) <= 5e+115) tmp = Float64(x_m / Float64(Float64(fma(z, z, z) / y_m) * z)); 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[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+115], N[(x$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $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{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot \left(1 + z\right)} \leq 5 \cdot 10^{+115}:\\
\;\;\;\;\frac{x\_m}{\frac{\mathsf{fma}\left(z, z, z\right)}{y\_m} \cdot z}\\
\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)))) < 5.00000000000000008e115Initial program 91.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.0
Applied rewrites98.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
Applied rewrites93.7%
if 5.00000000000000008e115 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 65.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.2
Applied rewrites98.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
remove-double-negN/A
distribute-frac-negN/A
Applied rewrites85.9%
Final simplification91.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) (* (* z z) (+ 1.0 z))) 50.0)
(/ x_m (* (/ (fma z z 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 tmp;
if (((y_m * x_m) / ((z * z) * (1.0 + z))) <= 50.0) {
tmp = x_m / ((fma(z, z, 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) tmp = 0.0 if (Float64(Float64(y_m * x_m) / Float64(Float64(z * z) * Float64(1.0 + z))) <= 50.0) tmp = Float64(x_m / Float64(Float64(fma(z, z, z) / y_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[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 50.0], N[(x$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $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{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot \left(1 + z\right)} \leq 50:\\
\;\;\;\;\frac{x\_m}{\frac{\mathsf{fma}\left(z, z, z\right)}{y\_m} \cdot 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 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 50Initial program 90.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.0
Applied rewrites98.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
Applied rewrites93.4%
if 50 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 69.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.f6486.6
Applied rewrites86.6%
Final simplification91.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 (<= (* y_m x_m) 0.0)
(* (/ y_m z) (/ x_m z))
(if (<= (* y_m x_m) 1e+171)
(/ (* (/ y_m (fma z z z)) x_m) 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) <= 0.0) {
tmp = (y_m / z) * (x_m / z);
} else if ((y_m * x_m) <= 1e+171) {
tmp = ((y_m / fma(z, z, z)) * x_m) / 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) <= 0.0) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); elseif (Float64(y_m * x_m) <= 1e+171) tmp = Float64(Float64(Float64(y_m / fma(z, z, z)) * x_m) / 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], 0.0], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 1e+171], N[(N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * x$95$m), $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 0:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 10^{+171}:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)} \cdot x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{1 + z}}{\frac{z}{y\_m} \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 0.0Initial program 83.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6476.0
Applied rewrites76.0%
if 0.0 < (*.f64 x y) < 9.99999999999999954e170Initial program 89.6%
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.f6499.3
Applied rewrites99.3%
if 9.99999999999999954e170 < (*.f64 x y) Initial program 79.8%
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-/.f6496.8
Applied rewrites96.8%
Final simplification86.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 (<= (/ (* y_m x_m) (* (* z z) (+ 1.0 z))) 1e+80)
(* (/ 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 (((y_m * x_m) / ((z * z) * (1.0 + z))) <= 1e+80) {
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 (Float64(Float64(y_m * x_m) / Float64(Float64(z * z) * Float64(1.0 + z))) <= 1e+80) 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[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+80], 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}\;\frac{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot \left(1 + z\right)} \leq 10^{+80}:\\
\;\;\;\;\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 (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 1e80Initial program 91.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.0
Applied rewrites98.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
Applied rewrites93.7%
lift-/.f64N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
*-commutativeN/A
associate-*l/N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
lower-/.f6494.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.1
Applied rewrites94.1%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
Applied rewrites91.5%
if 1e80 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 65.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.2
Applied rewrites98.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
remove-double-negN/A
distribute-frac-negN/A
Applied rewrites85.9%
Taylor expanded in z around 0
lower-/.f6480.6
Applied rewrites80.6%
Final simplification88.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) 0.0)
(* (/ y_m z) (/ x_m z))
(/ (* (/ 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 ((y_m * x_m) <= 0.0) {
tmp = (y_m / z) * (x_m / z);
} 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(y_m * x_m) <= 0.0) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); else tmp = Float64(Float64(Float64(y_m / 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[(y$95$m * x$95$m), $MachinePrecision], 0.0], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $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])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 0:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)} \cdot x\_m}{z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 0.0Initial program 83.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6476.0
Applied rewrites76.0%
if 0.0 < (*.f64 x y) Initial program 86.9%
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.f6495.6
Applied rewrites95.6%
Final simplification85.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 (* (fma z z z) z)))
(*
x_s
(*
y_s
(if (<= z -5e-109)
(* (/ x_m t_0) y_m)
(if (<= z 3.4e-16) (* (/ y_m z) (/ x_m z)) (* (/ 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 (z <= -5e-109) {
tmp = (x_m / t_0) * y_m;
} else if (z <= 3.4e-16) {
tmp = (y_m / z) * (x_m / z);
} 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 (z <= -5e-109) tmp = Float64(Float64(x_m / t_0) * y_m); elseif (z <= 3.4e-16) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); 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[z, -5e-109], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision], If[LessEqual[z, 3.4e-16], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $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}\;z \leq -5 \cdot 10^{-109}:\\
\;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\
\mathbf{elif}\;z \leq 3.4 \cdot 10^{-16}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{t\_0} \cdot x\_m\\
\end{array}\right)
\end{array}
\end{array}
if z < -5.0000000000000002e-109Initial program 85.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6496.3
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.3
Applied rewrites96.3%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
if -5.0000000000000002e-109 < z < 3.4e-16Initial program 82.3%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
if 3.4e-16 < z Initial program 87.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6498.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.2
Applied rewrites98.2%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
*-lft-identityN/A
associate-*l/N/A
lift-/.f64N/A
clear-numN/A
Applied rewrites93.4%
lift-/.f64N/A
lift-fma.f64N/A
distribute-lft1-inN/A
+-commutativeN/A
lift-+.f64N/A
*-commutativeN/A
associate-*l/N/A
frac-2negN/A
lift-neg.f64N/A
div-invN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
lower-/.f6493.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.2
Applied rewrites93.2%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
Applied rewrites89.1%
Final simplification92.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 (<= (* y_m x_m) 4e-275)
(* (/ y_m 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 ((y_m * x_m) <= 4e-275) {
tmp = (y_m / 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(y_m * x_m) <= 4e-275) tmp = Float64(Float64(y_m / z) * Float64(x_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_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 4e-275], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$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])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 4 \cdot 10^{-275}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 3.99999999999999974e-275Initial program 82.1%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6477.6
Applied rewrites77.6%
if 3.99999999999999974e-275 < (*.f64 x y) Initial program 88.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f6497.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.5
Applied rewrites97.5%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
un-div-invN/A
associate-/r*N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
Final simplification81.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 (<= (* y_m x_m) 2e-83)
(* (/ y_m z) (/ x_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 ((y_m * x_m) <= 2e-83) {
tmp = (y_m / z) * (x_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 ((y_m * x_m) <= 2d-83) then
tmp = (y_m / z) * (x_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 ((y_m * x_m) <= 2e-83) {
tmp = (y_m / z) * (x_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 (y_m * x_m) <= 2e-83: tmp = (y_m / z) * (x_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(y_m * x_m) <= 2e-83) tmp = Float64(Float64(y_m / z) * Float64(x_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 ((y_m * x_m) <= 2e-83)
tmp = (y_m / z) * (x_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[(y$95$m * x$95$m), $MachinePrecision], 2e-83], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$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}\;y\_m \cdot x\_m \leq 2 \cdot 10^{-83}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 2.0000000000000001e-83Initial program 83.5%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6480.8
Applied rewrites80.8%
if 2.0000000000000001e-83 < (*.f64 x y) Initial program 87.9%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6470.5
Applied rewrites70.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6472.1
Applied rewrites72.1%
Final simplification78.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 (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) {
return x_s * (y_s * (((x_m / fma(z, z, 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(Float64(x_m / fma(z, z, 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[(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 \left(\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot y\_m\right)\right)
\end{array}
Initial program 84.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.f6492.2
Applied rewrites92.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 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.9%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6471.5
Applied rewrites71.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
Final simplification75.8%
(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 2024308
(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))))