
(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 15 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
(let* ((t_0 (/ (* (/ (/ y_m z) z) x_m) z)) (t_1 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -2e+69)
t_0
(if (<= t_1 0.005) (/ 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 <= -2e+69) {
tmp = t_0;
} else if (t_1 <= 0.005) {
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(Float64(y_m / z) / z) * x_m) / z) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -2e+69) tmp = t_0; elseif (t_1 <= 0.005) 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[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $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, -2e+69], t$95$0, If[LessEqual[t$95$1, 0.005], 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{\frac{y\_m}{z}}{z} \cdot 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 -2 \cdot 10^{+69}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 0.005:\\
\;\;\;\;\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))) < -2.0000000000000001e69 or 0.0050000000000000001 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 78.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.8
Applied rewrites88.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6490.1
Applied rewrites90.1%
Taylor expanded in z around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.9
Applied rewrites96.9%
if -2.0000000000000001e69 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0050000000000000001Initial program 86.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6496.2
Applied rewrites96.2%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
associate-*l/N/A
*-commutativeN/A
clear-numN/A
lift-/.f64N/A
times-fracN/A
*-rgt-identityN/A
lift-*.f64N/A
lower-/.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification92.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 (* (* z z) z)) (t_1 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -40.0)
(* (/ x_m t_0) y_m)
(if (<= t_1 5e-307)
(* (/ x_m z) (/ y_m z))
(if (<= t_1 0.005) (* (/ x_m (* z z)) y_m) (/ (* x_m y_m) t_0))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * z;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = (x_m / t_0) * y_m;
} else if (t_1 <= 5e-307) {
tmp = (x_m / z) * (y_m / z);
} else if (t_1 <= 0.005) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = (x_m * y_m) / t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (z * z) * z
t_1 = (z * z) * (1.0d0 + z)
if (t_1 <= (-40.0d0)) then
tmp = (x_m / t_0) * y_m
else if (t_1 <= 5d-307) then
tmp = (x_m / z) * (y_m / z)
else if (t_1 <= 0.005d0) then
tmp = (x_m / (z * z)) * y_m
else
tmp = (x_m * y_m) / t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * z;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = (x_m / t_0) * y_m;
} else if (t_1 <= 5e-307) {
tmp = (x_m / z) * (y_m / z);
} else if (t_1 <= 0.005) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = (x_m * y_m) / t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (z * z) * z t_1 = (z * z) * (1.0 + z) tmp = 0 if t_1 <= -40.0: tmp = (x_m / t_0) * y_m elif t_1 <= 5e-307: tmp = (x_m / z) * (y_m / z) elif t_1 <= 0.005: tmp = (x_m / (z * z)) * y_m else: tmp = (x_m * y_m) / 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(z * z) * z) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -40.0) tmp = Float64(Float64(x_m / t_0) * y_m); elseif (t_1 <= 5e-307) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); elseif (t_1 <= 0.005) tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); else tmp = Float64(Float64(x_m * y_m) / t_0); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (z * z) * z;
t_1 = (z * z) * (1.0 + z);
tmp = 0.0;
if (t_1 <= -40.0)
tmp = (x_m / t_0) * y_m;
elseif (t_1 <= 5e-307)
tmp = (x_m / z) * (y_m / z);
elseif (t_1 <= 0.005)
tmp = (x_m / (z * z)) * y_m;
else
tmp = (x_m * y_m) / t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z), $MachinePrecision] * z), $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, -40.0], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision], If[LessEqual[t$95$1, 5e-307], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.005], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(x$95$m * y$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(z \cdot z\right) \cdot z\\
t_1 := \left(z \cdot z\right) \cdot \left(1 + z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -40:\\
\;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{elif}\;t\_1 \leq 0.005:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m \cdot y\_m}{t\_0}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -40Initial program 80.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.1
Applied rewrites88.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6492.2
Applied rewrites92.2%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites87.9%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6481.0
Applied rewrites81.0%
if -40 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.00000000000000014e-307Initial program 78.7%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6498.4
Applied rewrites98.4%
if 5.00000000000000014e-307 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0050000000000000001Initial program 91.0%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6485.0
Applied rewrites85.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6484.1
Applied rewrites84.1%
if 0.0050000000000000001 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 80.2%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6480.2
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6480.2
Applied rewrites80.2%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6480.2
Applied rewrites80.2%
Final simplification86.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 -2e+69)
t_0
(if (<= t_1 0.005) (/ 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 <= -2e+69) {
tmp = t_0;
} else if (t_1 <= 0.005) {
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 / Float64(z * z)) * x_m) / z) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -2e+69) tmp = t_0; elseif (t_1 <= 0.005) 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 / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $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, -2e+69], t$95$0, If[LessEqual[t$95$1, 0.005], 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 \cdot z} \cdot 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 -2 \cdot 10^{+69}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 0.005:\\
\;\;\;\;\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))) < -2.0000000000000001e69 or 0.0050000000000000001 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 78.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.8
Applied rewrites88.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6490.1
Applied rewrites90.1%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6490.1
Applied rewrites90.1%
if -2.0000000000000001e69 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0050000000000000001Initial program 86.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6496.2
Applied rewrites96.2%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
associate-*l/N/A
*-commutativeN/A
clear-numN/A
lift-/.f64N/A
times-fracN/A
*-rgt-identityN/A
lift-*.f64N/A
lower-/.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification90.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (fma z z z) z)) (t_1 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -40.0)
(* (/ y_m t_0) x_m)
(if (<= t_1 5e-307) (* (/ 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) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = (y_m / t_0) * x_m;
} else if (t_1 <= 5e-307) {
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(1.0 + z)) tmp = 0.0 if (t_1 <= -40.0) tmp = Float64(Float64(y_m / t_0) * x_m); elseif (t_1 <= 5e-307) 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[(1.0 + z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -40.0], N[(N[(y$95$m / t$95$0), $MachinePrecision] * x$95$m), $MachinePrecision], If[LessEqual[t$95$1, 5e-307], 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(1 + z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -40:\\
\;\;\;\;\frac{y\_m}{t\_0} \cdot x\_m\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\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))) < -40Initial program 80.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.1
Applied rewrites88.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6492.2
Applied rewrites92.2%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites87.9%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
if -40 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.00000000000000014e-307Initial program 78.7%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6498.4
Applied rewrites98.4%
if 5.00000000000000014e-307 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 85.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6491.8
Applied rewrites91.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6492.2
Applied rewrites92.2%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites85.9%
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
(let* ((t_0 (* (/ x_m (* (fma z z z) z)) y_m)) (t_1 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -40.0)
t_0
(if (<= t_1 5e-307) (* (/ x_m z) (/ y_m z)) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (x_m / (fma(z, z, z) * z)) * y_m;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = t_0;
} else if (t_1 <= 5e-307) {
tmp = (x_m / z) * (y_m / z);
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -40.0) tmp = t_0; elseif (t_1 <= 5e-307) tmp = Float64(Float64(x_m / z) * Float64(y_m / z)); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $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, -40.0], t$95$0, If[LessEqual[t$95$1, 5e-307], N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / 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{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
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 -40:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-307}:\\
\;\;\;\;\frac{x\_m}{z} \cdot \frac{y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -40 or 5.00000000000000014e-307 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 84.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.8
Applied rewrites90.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6492.2
Applied rewrites92.2%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites86.5%
if -40 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.00000000000000014e-307Initial program 78.7%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6498.4
Applied rewrites98.4%
Final simplification89.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)) (t_1 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -40.0)
(* (/ x_m t_0) y_m)
(if (<= t_1 0.005) (* (/ x_m (* z z)) y_m) (/ (* x_m y_m) t_0)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * z;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = (x_m / t_0) * y_m;
} else if (t_1 <= 0.005) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = (x_m * y_m) / t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (z * z) * z
t_1 = (z * z) * (1.0d0 + z)
if (t_1 <= (-40.0d0)) then
tmp = (x_m / t_0) * y_m
else if (t_1 <= 0.005d0) then
tmp = (x_m / (z * z)) * y_m
else
tmp = (x_m * y_m) / t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * z;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = (x_m / t_0) * y_m;
} else if (t_1 <= 0.005) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = (x_m * y_m) / t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (z * z) * z t_1 = (z * z) * (1.0 + z) tmp = 0 if t_1 <= -40.0: tmp = (x_m / t_0) * y_m elif t_1 <= 0.005: tmp = (x_m / (z * z)) * y_m else: tmp = (x_m * y_m) / 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(z * z) * z) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -40.0) tmp = Float64(Float64(x_m / t_0) * y_m); elseif (t_1 <= 0.005) tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); else tmp = Float64(Float64(x_m * y_m) / t_0); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (z * z) * z;
t_1 = (z * z) * (1.0 + z);
tmp = 0.0;
if (t_1 <= -40.0)
tmp = (x_m / t_0) * y_m;
elseif (t_1 <= 0.005)
tmp = (x_m / (z * z)) * y_m;
else
tmp = (x_m * y_m) / t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z), $MachinePrecision] * z), $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, -40.0], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision], If[LessEqual[t$95$1, 0.005], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(x$95$m * y$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(z \cdot z\right) \cdot z\\
t_1 := \left(z \cdot z\right) \cdot \left(1 + z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -40:\\
\;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\
\mathbf{elif}\;t\_1 \leq 0.005:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m \cdot y\_m}{t\_0}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -40Initial program 80.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.1
Applied rewrites88.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6492.2
Applied rewrites92.2%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites87.9%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6481.0
Applied rewrites81.0%
if -40 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0050000000000000001Initial program 85.1%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6482.0
Applied rewrites82.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6482.0
Applied rewrites82.0%
if 0.0050000000000000001 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 80.2%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6480.2
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6480.2
Applied rewrites80.2%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6480.2
Applied rewrites80.2%
Final simplification81.3%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ x_m (* (* z z) z)) y_m)) (t_1 (* (* z z) (+ 1.0 z))))
(*
x_s
(*
y_s
(if (<= t_1 -40.0)
t_0
(if (<= t_1 0.005) (* (/ x_m (* z z)) y_m) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (x_m / ((z * z) * z)) * y_m;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = t_0;
} else if (t_1 <= 0.005) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (x_m / ((z * z) * z)) * y_m
t_1 = (z * z) * (1.0d0 + z)
if (t_1 <= (-40.0d0)) then
tmp = t_0
else if (t_1 <= 0.005d0) then
tmp = (x_m / (z * z)) * y_m
else
tmp = t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (x_m / ((z * z) * z)) * y_m;
double t_1 = (z * z) * (1.0 + z);
double tmp;
if (t_1 <= -40.0) {
tmp = t_0;
} else if (t_1 <= 0.005) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (x_m / ((z * z) * z)) * y_m t_1 = (z * z) * (1.0 + z) tmp = 0 if t_1 <= -40.0: tmp = t_0 elif t_1 <= 0.005: tmp = (x_m / (z * z)) * y_m else: tmp = t_0 return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(x_m / Float64(Float64(z * z) * z)) * y_m) t_1 = Float64(Float64(z * z) * Float64(1.0 + z)) tmp = 0.0 if (t_1 <= -40.0) tmp = t_0; elseif (t_1 <= 0.005) tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (x_m / ((z * z) * z)) * y_m;
t_1 = (z * z) * (1.0 + z);
tmp = 0.0;
if (t_1 <= -40.0)
tmp = t_0;
elseif (t_1 <= 0.005)
tmp = (x_m / (z * z)) * y_m;
else
tmp = t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(x$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -40.0], t$95$0, If[LessEqual[t$95$1, 0.005], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{x\_m}{\left(z \cdot z\right) \cdot z} \cdot y\_m\\
t_1 := \left(z \cdot z\right) \cdot \left(1 + z\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -40:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 0.005:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -40 or 0.0050000000000000001 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 80.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6489.7
Applied rewrites89.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6491.7
Applied rewrites91.7%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites84.2%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6480.9
Applied rewrites80.9%
if -40 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0050000000000000001Initial program 85.1%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6482.0
Applied rewrites82.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6482.0
Applied rewrites82.0%
Final simplification81.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 (<= (/ (* x_m y_m) (* (* z z) (+ 1.0 z))) 1e+121)
(* (/ 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 (((x_m * y_m) / ((z * z) * (1.0 + z))) <= 1e+121) {
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(x_m * y_m) / Float64(Float64(z * z) * Float64(1.0 + z))) <= 1e+121) 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[(x$95$m * y$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+121], 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{x\_m \cdot y\_m}{\left(z \cdot z\right) \cdot \left(1 + z\right)} \leq 10^{+121}:\\
\;\;\;\;\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)))) < 1.00000000000000004e121Initial program 90.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6495.1
Applied rewrites95.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6496.1
Applied rewrites96.1%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites90.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6492.0
Applied rewrites92.0%
if 1.00000000000000004e121 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 63.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6487.7
Applied rewrites87.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-/.f64N/A
associate-*l/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
remove-double-negN/A
lower-*.f6469.8
Applied rewrites69.8%
Taylor expanded in z around 0
unpow2N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6468.8
Applied rewrites68.8%
Final simplification85.6%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (/ (* (/ y_m (* z z)) x_m) z)))
(*
x_s
(*
y_s
(if (<= z -1.65e+21)
t_0
(if (<= z -1e-138)
(* (/ x_m (* (* z z) (+ 1.0 z))) y_m)
(if (<= z 0.75) (/ (* (- (/ x_m z) x_m) y_m) z) t_0)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = ((y_m / (z * z)) * x_m) / z;
double tmp;
if (z <= -1.65e+21) {
tmp = t_0;
} else if (z <= -1e-138) {
tmp = (x_m / ((z * z) * (1.0 + z))) * y_m;
} else if (z <= 0.75) {
tmp = (((x_m / z) - x_m) * y_m) / z;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = ((y_m / (z * z)) * x_m) / z
if (z <= (-1.65d+21)) then
tmp = t_0
else if (z <= (-1d-138)) then
tmp = (x_m / ((z * z) * (1.0d0 + z))) * y_m
else if (z <= 0.75d0) then
tmp = (((x_m / z) - x_m) * y_m) / z
else
tmp = t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = ((y_m / (z * z)) * x_m) / z;
double tmp;
if (z <= -1.65e+21) {
tmp = t_0;
} else if (z <= -1e-138) {
tmp = (x_m / ((z * z) * (1.0 + z))) * y_m;
} else if (z <= 0.75) {
tmp = (((x_m / z) - x_m) * y_m) / z;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = ((y_m / (z * z)) * x_m) / z tmp = 0 if z <= -1.65e+21: tmp = t_0 elif z <= -1e-138: tmp = (x_m / ((z * z) * (1.0 + z))) * y_m elif z <= 0.75: tmp = (((x_m / z) - x_m) * y_m) / z else: tmp = t_0 return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(Float64(y_m / Float64(z * z)) * x_m) / z) tmp = 0.0 if (z <= -1.65e+21) tmp = t_0; elseif (z <= -1e-138) tmp = Float64(Float64(x_m / Float64(Float64(z * z) * Float64(1.0 + z))) * y_m); elseif (z <= 0.75) tmp = Float64(Float64(Float64(Float64(x_m / z) - x_m) * y_m) / z); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = ((y_m / (z * z)) * x_m) / z;
tmp = 0.0;
if (z <= -1.65e+21)
tmp = t_0;
elseif (z <= -1e-138)
tmp = (x_m / ((z * z) * (1.0 + z))) * y_m;
elseif (z <= 0.75)
tmp = (((x_m / z) - x_m) * y_m) / z;
else
tmp = t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] / z), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1.65e+21], t$95$0, If[LessEqual[z, -1e-138], N[(N[(x$95$m / N[(N[(z * z), $MachinePrecision] * N[(1.0 + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], If[LessEqual[z, 0.75], N[(N[(N[(N[(x$95$m / z), $MachinePrecision] - x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], t$95$0]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{y\_m}{z \cdot z} \cdot x\_m}{z}\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.65 \cdot 10^{+21}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;z \leq -1 \cdot 10^{-138}:\\
\;\;\;\;\frac{x\_m}{\left(z \cdot z\right) \cdot \left(1 + z\right)} \cdot y\_m\\
\mathbf{elif}\;z \leq 0.75:\\
\;\;\;\;\frac{\left(\frac{x\_m}{z} - x\_m\right) \cdot y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if z < -1.65e21 or 0.75 < z Initial program 78.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.8
Applied rewrites88.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6490.1
Applied rewrites90.1%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6490.1
Applied rewrites90.1%
if -1.65e21 < z < -1.00000000000000007e-138Initial program 91.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.3
Applied rewrites90.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6495.4
Applied rewrites95.4%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites95.3%
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft1-inN/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6495.4
Applied rewrites95.4%
if -1.00000000000000007e-138 < z < 0.75Initial program 84.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6498.9
Applied rewrites98.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6497.0
Applied rewrites97.0%
Taylor expanded in z around 0
Applied rewrites98.3%
Final simplification94.3%
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 5e+86)
(/ (/ y_m (fma z z z)) (/ z x_m))
(/ (/ (* (/ 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 <= 5e+86) {
tmp = (y_m / fma(z, z, z)) / (z / x_m);
} 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 (y_m <= 5e+86) tmp = Float64(Float64(y_m / fma(z, z, z)) / Float64(z / x_m)); 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 = 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[y$95$m, 5e+86], N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / N[(z / x$95$m), $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 \leq 5 \cdot 10^{+86}:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)}}{\frac{z}{x\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{y\_m}{1 + z} \cdot x\_m}{z}}{z}\\
\end{array}\right)
\end{array}
if y < 4.9999999999999998e86Initial program 85.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6495.5
Applied rewrites95.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6495.1
Applied rewrites95.1%
if 4.9999999999999998e86 < y Initial program 71.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-/.f6490.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6490.6
Applied rewrites90.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 (<= z -8.4e-17)
(* (/ y_m (* (fma z z z) z)) x_m)
(if (<= z 1.0)
(* (/ (/ (- x_m) z) z) (- y_m))
(/ (* (/ x_m z) 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 (z <= -8.4e-17) {
tmp = (y_m / (fma(z, z, z) * z)) * x_m;
} else if (z <= 1.0) {
tmp = ((-x_m / z) / z) * -y_m;
} else {
tmp = ((x_m / z) * 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 (z <= -8.4e-17) tmp = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m); elseif (z <= 1.0) tmp = Float64(Float64(Float64(Float64(-x_m) / z) / z) * Float64(-y_m)); else tmp = Float64(Float64(Float64(x_m / z) * y_m) / Float64(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[z, -8.4e-17], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], If[LessEqual[z, 1.0], N[(N[(N[((-x$95$m) / z), $MachinePrecision] / z), $MachinePrecision] * (-y$95$m)), $MachinePrecision], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / N[(z * 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 -8.4 \cdot 10^{-17}:\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
\mathbf{elif}\;z \leq 1:\\
\;\;\;\;\frac{\frac{-x\_m}{z}}{z} \cdot \left(-y\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{z} \cdot y\_m}{z \cdot z}\\
\end{array}\right)
\end{array}
if z < -8.39999999999999968e-17Initial program 82.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6489.2
Applied rewrites89.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6492.9
Applied rewrites92.9%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
frac-2negN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
div-invN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
associate-/r*N/A
neg-mul-1N/A
lower-*.f64N/A
Applied rewrites89.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.1
Applied rewrites86.1%
if -8.39999999999999968e-17 < z < 1Initial program 84.5%
lift-/.f64N/A
frac-2negN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
associate-/l*N/A
lower-*.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6484.6
Applied rewrites84.6%
Taylor expanded in z around 0
unpow2N/A
associate-/r*N/A
associate-/l*N/A
lower-/.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6487.2
Applied rewrites87.2%
if 1 < z Initial program 80.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6491.2
Applied rewrites91.2%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6491.1
Applied rewrites91.1%
Final simplification87.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 3.8e+253)
(/ (* (/ x_m z) y_m) (fma z z z))
(/ y_m (* (* (/ z x_m) z) (+ 1.0 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 <= 3.8e+253) {
tmp = ((x_m / z) * y_m) / fma(z, z, z);
} else {
tmp = y_m / (((z / x_m) * z) * (1.0 + 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 (y_m <= 3.8e+253) tmp = Float64(Float64(Float64(x_m / z) * y_m) / fma(z, z, z)); else tmp = Float64(y_m / Float64(Float64(Float64(z / x_m) * z) * Float64(1.0 + 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[y$95$m, 3.8e+253], N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision], N[(y$95$m / N[(N[(N[(z / x$95$m), $MachinePrecision] * z), $MachinePrecision] * N[(1.0 + z), $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}\;y\_m \leq 3.8 \cdot 10^{+253}:\\
\;\;\;\;\frac{\frac{x\_m}{z} \cdot y\_m}{\mathsf{fma}\left(z, z, z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{\left(\frac{z}{x\_m} \cdot z\right) \cdot \left(1 + z\right)}\\
\end{array}\right)
\end{array}
if y < 3.79999999999999989e253Initial program 84.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6494.6
Applied rewrites94.6%
if 3.79999999999999989e253 < y Initial program 65.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6466.1
Applied rewrites66.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6479.7
Applied rewrites79.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-/.f64N/A
associate-*l/N/A
remove-double-negN/A
distribute-lft-neg-outN/A
lift-fma.f64N/A
lower-/.f64N/A
lift-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
remove-double-negN/A
lower-*.f6472.7
Applied rewrites72.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-fma.f64N/A
distribute-lft1-inN/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f6486.6
Applied rewrites86.6%
Final simplification94.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
(if (<= x_m 1.1e-187)
(/ y_m (* (/ (fma z z z) x_m) z))
(/ (* x_m (/ y_m (fma z z 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 <= 1.1e-187) {
tmp = y_m / ((fma(z, z, z) / x_m) * z);
} else {
tmp = (x_m * (y_m / fma(z, z, 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 (x_m <= 1.1e-187) tmp = Float64(y_m / Float64(Float64(fma(z, z, z) / x_m) * z)); else tmp = Float64(Float64(x_m * Float64(y_m / fma(z, z, 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[x$95$m, 1.1e-187], N[(y$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / x$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m * N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision]), $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 \leq 1.1 \cdot 10^{-187}:\\
\;\;\;\;\frac{y\_m}{\frac{\mathsf{fma}\left(z, z, z\right)}{x\_m} \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m \cdot \frac{y\_m}{\mathsf{fma}\left(z, z, z\right)}}{z}\\
\end{array}\right)
\end{array}
if x < 1.10000000000000004e-187Initial program 82.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6493.8
Applied rewrites93.8%
lift-/.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
associate-*l/N/A
*-commutativeN/A
clear-numN/A
lift-/.f64N/A
times-fracN/A
*-rgt-identityN/A
lift-*.f64N/A
lower-/.f6491.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.1
Applied rewrites91.1%
if 1.10000000000000004e-187 < x Initial program 83.2%
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.f6492.8
Applied rewrites92.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) y_m) (fma z 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) {
return x_s * (y_s * (((x_m / z) * y_m) / fma(z, z, 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(x_m / z) * y_m) / fma(z, z, 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[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / N[(z * z + 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 \frac{\frac{x\_m}{z} \cdot y\_m}{\mathsf{fma}\left(z, z, z\right)}\right)
\end{array}
Initial program 83.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6493.1
Applied rewrites93.1%
y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (x_s y_s x_m y_m z) :precision binary64 (* x_s (* y_s (* (/ x_m (* z z)) y_m))))
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / (z * z)) * y_m));
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = x_s * (y_s * ((x_m / (z * z)) * y_m))
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / (z * z)) * y_m));
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): return x_s * (y_s * ((x_m / (z * z)) * y_m))
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) return Float64(x_s * Float64(y_s * Float64(Float64(x_m / Float64(z * z)) * y_m))) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
tmp = x_s * (y_s * ((x_m / (z * z)) * y_m));
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \left(\frac{x\_m}{z \cdot z} \cdot y\_m\right)\right)
\end{array}
Initial program 83.0%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6468.6
Applied rewrites68.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6471.0
Applied rewrites71.0%
Final simplification71.0%
(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 2024276
(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))))