
(FPCore (x) :precision binary64 (/ (- (exp x) 1.0) x))
double code(double x) {
return (exp(x) - 1.0) / x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (exp(x) - 1.0d0) / x
end function
public static double code(double x) {
return (Math.exp(x) - 1.0) / x;
}
def code(x): return (math.exp(x) - 1.0) / x
function code(x) return Float64(Float64(exp(x) - 1.0) / x) end
function tmp = code(x) tmp = (exp(x) - 1.0) / x; end
code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x} - 1}{x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (/ (- (exp x) 1.0) x))
double code(double x) {
return (exp(x) - 1.0) / x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (exp(x) - 1.0d0) / x
end function
public static double code(double x) {
return (Math.exp(x) - 1.0) / x;
}
def code(x): return (math.exp(x) - 1.0) / x
function code(x) return Float64(Float64(exp(x) - 1.0) / x) end
function tmp = code(x) tmp = (exp(x) - 1.0) / x; end
code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x} - 1}{x}
\end{array}
(FPCore (x) :precision binary64 (/ (expm1 x) x))
double code(double x) {
return expm1(x) / x;
}
public static double code(double x) {
return Math.expm1(x) / x;
}
def code(x): return math.expm1(x) / x
function code(x) return Float64(expm1(x) / x) end
code[x_] := N[(N[(Exp[x] - 1), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{expm1}\left(x\right)}{x}
\end{array}
Initial program 49.4%
accelerator-lowering-expm1.f64100.0
Applied egg-rr100.0%
(FPCore (x)
:precision binary64
(if (<= (/ (+ (exp x) -1.0) x) 2.0)
(fma x (fma x 0.16666666666666666 0.5) 1.0)
(*
x
(fma
x
(fma x (* (* x x) 0.0026041666666666665) 0.16666666666666666)
0.5))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * fma(x, fma(x, ((x * x) * 0.0026041666666666665), 0.16666666666666666), 0.5);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * fma(x, fma(x, Float64(Float64(x * x) * 0.0026041666666666665), 0.16666666666666666), 0.5)); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.0026041666666666665), $MachinePrecision] + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, \left(x \cdot x\right) \cdot 0.0026041666666666665, 0.16666666666666666\right), 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6470.3
Simplified70.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6461.1
Simplified61.1%
flip3-+N/A
/-lowering-/.f64N/A
unpow-prod-downN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
swap-sqrN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-eval20.0
Applied egg-rr20.0%
Taylor expanded in x around 0
Simplified73.1%
Taylor expanded in x around -inf
Simplified73.1%
Final simplification70.9%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (* x (fma x (* (* x x) 0.0026041666666666665) 0.16666666666666666)))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * (x * fma(x, ((x * x) * 0.0026041666666666665), 0.16666666666666666));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * Float64(x * fma(x, Float64(Float64(x * x) * 0.0026041666666666665), 0.16666666666666666))); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.0026041666666666665), $MachinePrecision] + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot \mathsf{fma}\left(x, \left(x \cdot x\right) \cdot 0.0026041666666666665, 0.16666666666666666\right)\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6470.3
Simplified70.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6461.1
Simplified61.1%
flip3-+N/A
/-lowering-/.f64N/A
unpow-prod-downN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
swap-sqrN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-eval20.0
Applied egg-rr20.0%
Taylor expanded in x around 0
Simplified73.1%
Taylor expanded in x around inf
Simplified73.1%
Final simplification70.9%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (* 0.0026041666666666665 (* x (* x (* x x)))))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * (0.0026041666666666665 * (x * (x * (x * x))));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * Float64(0.0026041666666666665 * Float64(x * Float64(x * Float64(x * x))))); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(0.0026041666666666665 * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(0.0026041666666666665 \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6470.3
Simplified70.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6461.1
Simplified61.1%
flip3-+N/A
/-lowering-/.f64N/A
unpow-prod-downN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
swap-sqrN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-eval20.0
Applied egg-rr20.0%
Taylor expanded in x around 0
Simplified73.1%
Taylor expanded in x around inf
metadata-evalN/A
pow-plusN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
metadata-evalN/A
pow-plusN/A
associate-*l*N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
pow-plusN/A
metadata-evalN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6473.1
Simplified73.1%
Final simplification70.9%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (fma x (fma x 0.041666666666666664 0.16666666666666666) 0.5))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5)); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6470.3
Simplified70.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6461.1
Simplified61.1%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
associate-+r+N/A
distribute-lft-inN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
associate-/r/N/A
metadata-evalN/A
*-rgt-identityN/A
associate-*r/N/A
unpow2N/A
associate-*l*N/A
rgt-mult-inverseN/A
*-rgt-identityN/A
Simplified61.1%
Final simplification68.3%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (* x (fma x 0.041666666666666664 0.16666666666666666)))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * (x * fma(x, 0.041666666666666664, 0.16666666666666666));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * Float64(x * fma(x, 0.041666666666666664, 0.16666666666666666))); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right)\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6470.3
Simplified70.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6461.1
Simplified61.1%
Taylor expanded in x around inf
unpow3N/A
unpow2N/A
associate-*l*N/A
unpow2N/A
+-commutativeN/A
distribute-rgt-inN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
associate-*r*N/A
*-lowering-*.f64N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
distribute-rgt-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified61.1%
Final simplification68.3%
(FPCore (x)
:precision binary64
(let* ((t_0 (fma x (* (* x x) 7.233796296296296e-5) 0.004629629629629629))
(t_1 (* x t_0)))
(if (<= x 2e+60)
(fma
(* x (fma (* t_1 t_1) 1296.0 -0.25))
(/ 1.0 (fma t_0 (* x 36.0) -0.5))
1.0)
(* x (* 0.0026041666666666665 (* x (* x (* x x))))))))
double code(double x) {
double t_0 = fma(x, ((x * x) * 7.233796296296296e-5), 0.004629629629629629);
double t_1 = x * t_0;
double tmp;
if (x <= 2e+60) {
tmp = fma((x * fma((t_1 * t_1), 1296.0, -0.25)), (1.0 / fma(t_0, (x * 36.0), -0.5)), 1.0);
} else {
tmp = x * (0.0026041666666666665 * (x * (x * (x * x))));
}
return tmp;
}
function code(x) t_0 = fma(x, Float64(Float64(x * x) * 7.233796296296296e-5), 0.004629629629629629) t_1 = Float64(x * t_0) tmp = 0.0 if (x <= 2e+60) tmp = fma(Float64(x * fma(Float64(t_1 * t_1), 1296.0, -0.25)), Float64(1.0 / fma(t_0, Float64(x * 36.0), -0.5)), 1.0); else tmp = Float64(x * Float64(0.0026041666666666665 * Float64(x * Float64(x * Float64(x * x))))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(N[(x * x), $MachinePrecision] * 7.233796296296296e-5), $MachinePrecision] + 0.004629629629629629), $MachinePrecision]}, Block[{t$95$1 = N[(x * t$95$0), $MachinePrecision]}, If[LessEqual[x, 2e+60], N[(N[(x * N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 1296.0 + -0.25), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(t$95$0 * N[(x * 36.0), $MachinePrecision] + -0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(0.0026041666666666665 * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(x, \left(x \cdot x\right) \cdot 7.233796296296296 \cdot 10^{-5}, 0.004629629629629629\right)\\
t_1 := x \cdot t\_0\\
\mathbf{if}\;x \leq 2 \cdot 10^{+60}:\\
\;\;\;\;\mathsf{fma}\left(x \cdot \mathsf{fma}\left(t\_1 \cdot t\_1, 1296, -0.25\right), \frac{1}{\mathsf{fma}\left(t\_0, x \cdot 36, -0.5\right)}, 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(0.0026041666666666665 \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right)\\
\end{array}
\end{array}
if x < 1.9999999999999999e60Initial program 40.1%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6465.0
Simplified65.0%
flip3-+N/A
/-lowering-/.f64N/A
unpow-prod-downN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
swap-sqrN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-eval64.8
Applied egg-rr64.8%
Taylor expanded in x around 0
Simplified65.0%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
div-invN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr67.7%
if 1.9999999999999999e60 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6483.8
Simplified83.8%
flip3-+N/A
/-lowering-/.f64N/A
unpow-prod-downN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
swap-sqrN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-eval26.3
Applied egg-rr26.3%
Taylor expanded in x around 0
Simplified100.0%
Taylor expanded in x around inf
metadata-evalN/A
pow-plusN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
metadata-evalN/A
pow-plusN/A
associate-*l*N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
pow-plusN/A
metadata-evalN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
Final simplification72.8%
(FPCore (x) :precision binary64 (fma x (fma x (fma x (* (* x x) 0.0026041666666666665) 0.16666666666666666) 0.5) 1.0))
double code(double x) {
return fma(x, fma(x, fma(x, ((x * x) * 0.0026041666666666665), 0.16666666666666666), 0.5), 1.0);
}
function code(x) return fma(x, fma(x, fma(x, Float64(Float64(x * x) * 0.0026041666666666665), 0.16666666666666666), 0.5), 1.0) end
code[x_] := N[(x * N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.0026041666666666665), $MachinePrecision] + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, \left(x \cdot x\right) \cdot 0.0026041666666666665, 0.16666666666666666\right), 0.5\right), 1\right)
\end{array}
Initial program 49.4%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6467.9
Simplified67.9%
flip3-+N/A
/-lowering-/.f64N/A
unpow-prod-downN/A
accelerator-lowering-fma.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
swap-sqrN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
--lowering--.f64N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
metadata-eval58.8
Applied egg-rr58.8%
Taylor expanded in x around 0
Simplified70.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6470.4
Simplified70.4%
Final simplification70.4%
(FPCore (x) :precision binary64 (if (<= x 6.5) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* (* x (* x x)) 0.041666666666666664)))
double code(double x) {
double tmp;
if (x <= 6.5) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = (x * (x * x)) * 0.041666666666666664;
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 6.5) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(Float64(x * Float64(x * x)) * 0.041666666666666664); end return tmp end
code[x_] := If[LessEqual[x, 6.5], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision] * 0.041666666666666664), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 6.5:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \left(x \cdot x\right)\right) \cdot 0.041666666666666664\\
\end{array}
\end{array}
if x < 6.5Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6470.3
Simplified70.3%
if 6.5 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6461.1
Simplified61.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.1
Simplified61.1%
Final simplification68.3%
(FPCore (x) :precision binary64 (fma x (fma x (fma x 0.041666666666666664 0.16666666666666666) 0.5) 1.0))
double code(double x) {
return fma(x, fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5), 1.0);
}
function code(x) return fma(x, fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5), 1.0) end
code[x_] := N[(x * N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right), 1\right)
\end{array}
Initial program 49.4%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6467.9
Simplified67.9%
(FPCore (x) :precision binary64 (if (<= x 2.5) (fma x 0.5 1.0) (* x (fma x 0.16666666666666666 0.5))))
double code(double x) {
double tmp;
if (x <= 2.5) {
tmp = fma(x, 0.5, 1.0);
} else {
tmp = x * fma(x, 0.16666666666666666, 0.5);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 2.5) tmp = fma(x, 0.5, 1.0); else tmp = Float64(x * fma(x, 0.16666666666666666, 0.5)); end return tmp end
code[x_] := If[LessEqual[x, 2.5], N[(x * 0.5 + 1.0), $MachinePrecision], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2.5:\\
\;\;\;\;\mathsf{fma}\left(x, 0.5, 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right)\\
\end{array}
\end{array}
if x < 2.5Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6469.6
Simplified69.6%
if 2.5 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6444.4
Simplified44.4%
Taylor expanded in x around inf
Simplified44.4%
(FPCore (x) :precision binary64 (if (<= x 4.5) (fma x 0.5 1.0) (* (* x x) 0.16666666666666666)))
double code(double x) {
double tmp;
if (x <= 4.5) {
tmp = fma(x, 0.5, 1.0);
} else {
tmp = (x * x) * 0.16666666666666666;
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 4.5) tmp = fma(x, 0.5, 1.0); else tmp = Float64(Float64(x * x) * 0.16666666666666666); end return tmp end
code[x_] := If[LessEqual[x, 4.5], N[(x * 0.5 + 1.0), $MachinePrecision], N[(N[(x * x), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 4.5:\\
\;\;\;\;\mathsf{fma}\left(x, 0.5, 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot x\right) \cdot 0.16666666666666666\\
\end{array}
\end{array}
if x < 4.5Initial program 35.3%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6469.6
Simplified69.6%
if 4.5 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6444.4
Simplified44.4%
Taylor expanded in x around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6444.4
Simplified44.4%
Final simplification64.1%
(FPCore (x) :precision binary64 (fma x (fma x 0.16666666666666666 0.5) 1.0))
double code(double x) {
return fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
}
function code(x) return fma(x, fma(x, 0.16666666666666666, 0.5), 1.0) end
code[x_] := N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)
\end{array}
Initial program 49.4%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6464.6
Simplified64.6%
(FPCore (x) :precision binary64 (fma x 0.5 1.0))
double code(double x) {
return fma(x, 0.5, 1.0);
}
function code(x) return fma(x, 0.5, 1.0) end
code[x_] := N[(x * 0.5 + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, 0.5, 1\right)
\end{array}
Initial program 49.4%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6455.5
Simplified55.5%
(FPCore (x) :precision binary64 1.0)
double code(double x) {
return 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double x) {
return 1.0;
}
def code(x): return 1.0
function code(x) return 1.0 end
function tmp = code(x) tmp = 1.0; end
code[x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 49.4%
Taylor expanded in x around 0
Simplified55.1%
(FPCore (x) :precision binary64 (let* ((t_0 (- (exp x) 1.0))) (if (and (< x 1.0) (> x -1.0)) (/ t_0 (log (exp x))) (/ t_0 x))))
double code(double x) {
double t_0 = exp(x) - 1.0;
double tmp;
if ((x < 1.0) && (x > -1.0)) {
tmp = t_0 / log(exp(x));
} else {
tmp = t_0 / x;
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
real(8) :: tmp
t_0 = exp(x) - 1.0d0
if ((x < 1.0d0) .and. (x > (-1.0d0))) then
tmp = t_0 / log(exp(x))
else
tmp = t_0 / x
end if
code = tmp
end function
public static double code(double x) {
double t_0 = Math.exp(x) - 1.0;
double tmp;
if ((x < 1.0) && (x > -1.0)) {
tmp = t_0 / Math.log(Math.exp(x));
} else {
tmp = t_0 / x;
}
return tmp;
}
def code(x): t_0 = math.exp(x) - 1.0 tmp = 0 if (x < 1.0) and (x > -1.0): tmp = t_0 / math.log(math.exp(x)) else: tmp = t_0 / x return tmp
function code(x) t_0 = Float64(exp(x) - 1.0) tmp = 0.0 if ((x < 1.0) && (x > -1.0)) tmp = Float64(t_0 / log(exp(x))); else tmp = Float64(t_0 / x); end return tmp end
function tmp_2 = code(x) t_0 = exp(x) - 1.0; tmp = 0.0; if ((x < 1.0) && (x > -1.0)) tmp = t_0 / log(exp(x)); else tmp = t_0 / x; end tmp_2 = tmp; end
code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]}, If[And[Less[x, 1.0], Greater[x, -1.0]], N[(t$95$0 / N[Log[N[Exp[x], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 / x), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{x} - 1\\
\mathbf{if}\;x < 1 \land x > -1:\\
\;\;\;\;\frac{t\_0}{\log \left(e^{x}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x}\\
\end{array}
\end{array}
herbie shell --seed 2024204
(FPCore (x)
:name "Kahan's exp quotient"
:precision binary64
:alt
(! :herbie-platform default (if (and (< x 1) (> x -1)) (/ (- (exp x) 1) (log (exp x))) (/ (- (exp x) 1) x)))
(/ (- (exp x) 1.0) x))