
(FPCore (x y z) :precision binary64 (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))
double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
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 * z)) + (z * z)
end function
public static double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
def code(x, y, z): return (((x * y) + (z * z)) + (z * z)) + (z * z)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * y) + Float64(z * z)) + Float64(z * z)) + Float64(z * z)) end
function tmp = code(x, y, z) tmp = (((x * y) + (z * z)) + (z * z)) + (z * z); end
code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))
double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
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 * z)) + (z * z)
end function
public static double code(double x, double y, double z) {
return (((x * y) + (z * z)) + (z * z)) + (z * z);
}
def code(x, y, z): return (((x * y) + (z * z)) + (z * z)) + (z * z)
function code(x, y, z) return Float64(Float64(Float64(Float64(x * y) + Float64(z * z)) + Float64(z * z)) + Float64(z * z)) end
function tmp = code(x, y, z) tmp = (((x * y) + (z * z)) + (z * z)) + (z * z); end
code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
\end{array}
(FPCore (x y z) :precision binary64 (fma y x (* (* 3.0 z) z)))
double code(double x, double y, double z) {
return fma(y, x, ((3.0 * z) * z));
}
function code(x, y, z) return fma(y, x, Float64(Float64(3.0 * z) * z)) end
code[x_, y_, z_] := N[(y * x + N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(y, x, \left(3 \cdot z\right) \cdot z\right)
\end{array}
Initial program 97.9%
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
associate-+l+N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
count-2N/A
distribute-lft1-inN/A
metadata-evalN/A
lower-*.f6499.1
Applied rewrites99.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.1
Applied rewrites99.1%
Final simplification99.1%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 2e+20) (fma z (+ z z) (* x y)) (fma z (+ z z) (* z z))))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+20) {
tmp = fma(z, (z + z), (x * y));
} else {
tmp = fma(z, (z + z), (z * z));
}
return tmp;
}
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e+20) tmp = fma(z, Float64(z + z), Float64(x * y)); else tmp = fma(z, Float64(z + z), Float64(z * z)); end return tmp end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 2e+20], N[(z * N[(z + z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(z * N[(z + z), $MachinePrecision] + N[(z * z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+20}:\\
\;\;\;\;\mathsf{fma}\left(z, z + z, x \cdot y\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(z, z + z, z \cdot z\right)\\
\end{array}
\end{array}
if (*.f64 z z) < 2e20Initial program 99.9%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.7
Applied rewrites99.7%
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-+.f6499.8
lift-/.f64N/A
lift-/.f64N/A
remove-double-div100.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
Taylor expanded in z around 0
*-commutativeN/A
lower-*.f6487.3
Applied rewrites87.3%
if 2e20 < (*.f64 z z) Initial program 95.7%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6495.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
Applied rewrites95.7%
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-+.f6496.7
lift-/.f64N/A
lift-/.f64N/A
remove-double-div96.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.7
Applied rewrites96.7%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6485.8
Applied rewrites85.8%
Final simplification86.6%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 2e+20) (fma z (+ z z) (* x y)) (* (* 3.0 z) z)))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+20) {
tmp = fma(z, (z + z), (x * y));
} else {
tmp = (3.0 * z) * z;
}
return tmp;
}
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e+20) tmp = fma(z, Float64(z + z), Float64(x * y)); else tmp = Float64(Float64(3.0 * z) * z); end return tmp end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 2e+20], N[(z * N[(z + z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+20}:\\
\;\;\;\;\mathsf{fma}\left(z, z + z, x \cdot y\right)\\
\mathbf{else}:\\
\;\;\;\;\left(3 \cdot z\right) \cdot z\\
\end{array}
\end{array}
if (*.f64 z z) < 2e20Initial program 99.9%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6499.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.7
Applied rewrites99.7%
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lower-fma.f64N/A
lower-+.f6499.8
lift-/.f64N/A
lift-/.f64N/A
remove-double-div100.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
Taylor expanded in z around 0
*-commutativeN/A
lower-*.f6487.3
Applied rewrites87.3%
if 2e20 < (*.f64 z z) Initial program 95.7%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6495.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
Applied rewrites95.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6485.7
Applied rewrites85.7%
Taylor expanded in z around inf
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6485.7
Applied rewrites85.7%
Final simplification86.5%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 2e+20) (fma z z (* x y)) (* (* 3.0 z) z)))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+20) {
tmp = fma(z, z, (x * y));
} else {
tmp = (3.0 * z) * z;
}
return tmp;
}
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e+20) tmp = fma(z, z, Float64(x * y)); else tmp = Float64(Float64(3.0 * z) * z); end return tmp end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 2e+20], N[(z * z + N[(x * y), $MachinePrecision]), $MachinePrecision], N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+20}:\\
\;\;\;\;\mathsf{fma}\left(z, z, x \cdot y\right)\\
\mathbf{else}:\\
\;\;\;\;\left(3 \cdot z\right) \cdot z\\
\end{array}
\end{array}
if (*.f64 z z) < 2e20Initial program 99.9%
Taylor expanded in z around 0
*-commutativeN/A
lower-*.f6486.9
Applied rewrites86.9%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6486.9
Applied rewrites86.9%
if 2e20 < (*.f64 z z) Initial program 95.7%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6495.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
Applied rewrites95.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6485.7
Applied rewrites85.7%
Taylor expanded in z around inf
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6485.7
Applied rewrites85.7%
Final simplification86.3%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 2e+20) (* x y) (* (* 3.0 z) z)))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+20) {
tmp = x * y;
} else {
tmp = (3.0 * z) * 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 * z) <= 2d+20) then
tmp = x * y
else
tmp = (3.0d0 * z) * z
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+20) {
tmp = x * y;
} else {
tmp = (3.0 * z) * z;
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 2e+20: tmp = x * y else: tmp = (3.0 * z) * z return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e+20) tmp = Float64(x * y); else tmp = Float64(Float64(3.0 * z) * z); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 2e+20) tmp = x * y; else tmp = (3.0 * z) * z; end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 2e+20], N[(x * y), $MachinePrecision], N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+20}:\\
\;\;\;\;x \cdot y\\
\mathbf{else}:\\
\;\;\;\;\left(3 \cdot z\right) \cdot z\\
\end{array}
\end{array}
if (*.f64 z z) < 2e20Initial program 99.9%
Taylor expanded in z around 0
*-commutativeN/A
lower-*.f6485.0
Applied rewrites85.0%
if 2e20 < (*.f64 z z) Initial program 95.7%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6495.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
Applied rewrites95.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6485.7
Applied rewrites85.7%
Taylor expanded in z around inf
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6485.7
Applied rewrites85.7%
Final simplification85.4%
(FPCore (x y z) :precision binary64 (if (<= (* z z) 1.22e+27) (* x y) (* (* z z) 3.0)))
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1.22e+27) {
tmp = x * y;
} else {
tmp = (z * z) * 3.0;
}
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 * z) <= 1.22d+27) then
tmp = x * y
else
tmp = (z * z) * 3.0d0
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1.22e+27) {
tmp = x * y;
} else {
tmp = (z * z) * 3.0;
}
return tmp;
}
def code(x, y, z): tmp = 0 if (z * z) <= 1.22e+27: tmp = x * y else: tmp = (z * z) * 3.0 return tmp
function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1.22e+27) tmp = Float64(x * y); else tmp = Float64(Float64(z * z) * 3.0); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if ((z * z) <= 1.22e+27) tmp = x * y; else tmp = (z * z) * 3.0; end tmp_2 = tmp; end
code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1.22e+27], N[(x * y), $MachinePrecision], N[(N[(z * z), $MachinePrecision] * 3.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 1.22 \cdot 10^{+27}:\\
\;\;\;\;x \cdot y\\
\mathbf{else}:\\
\;\;\;\;\left(z \cdot z\right) \cdot 3\\
\end{array}
\end{array}
if (*.f64 z z) < 1.2200000000000001e27Initial program 99.9%
Taylor expanded in z around 0
*-commutativeN/A
lower-*.f6485.0
Applied rewrites85.0%
if 1.2200000000000001e27 < (*.f64 z z) Initial program 95.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6485.7
Applied rewrites85.7%
Final simplification85.3%
(FPCore (x y z) :precision binary64 (fma y x (* (* z z) 3.0)))
double code(double x, double y, double z) {
return fma(y, x, ((z * z) * 3.0));
}
function code(x, y, z) return fma(y, x, Float64(Float64(z * z) * 3.0)) end
code[x_, y_, z_] := N[(y * x + N[(N[(z * z), $MachinePrecision] * 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(y, x, \left(z \cdot z\right) \cdot 3\right)
\end{array}
Initial program 97.9%
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
associate-+l+N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
count-2N/A
distribute-lft1-inN/A
metadata-evalN/A
lower-*.f6499.1
Applied rewrites99.1%
Final simplification99.1%
(FPCore (x y z) :precision binary64 (fma (* 3.0 z) z (* x y)))
double code(double x, double y, double z) {
return fma((3.0 * z), z, (x * y));
}
function code(x, y, z) return fma(Float64(3.0 * z), z, Float64(x * y)) end
code[x_, y_, z_] := N[(N[(3.0 * z), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(3 \cdot z, z, x \cdot y\right)
\end{array}
Initial program 97.9%
Taylor expanded in z around 0
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.3
Applied rewrites98.3%
Final simplification98.3%
(FPCore (x y z) :precision binary64 (* x y))
double code(double x, double y, double z) {
return x * y;
}
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
end function
public static double code(double x, double y, double z) {
return x * y;
}
def code(x, y, z): return x * y
function code(x, y, z) return Float64(x * y) end
function tmp = code(x, y, z) tmp = x * y; end
code[x_, y_, z_] := N[(x * y), $MachinePrecision]
\begin{array}{l}
\\
x \cdot y
\end{array}
Initial program 97.9%
Taylor expanded in z around 0
*-commutativeN/A
lower-*.f6452.9
Applied rewrites52.9%
Final simplification52.9%
(FPCore (x y z) :precision binary64 (+ (* (* 3.0 z) z) (* y x)))
double code(double x, double y, double z) {
return ((3.0 * z) * z) + (y * x);
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = ((3.0d0 * z) * z) + (y * x)
end function
public static double code(double x, double y, double z) {
return ((3.0 * z) * z) + (y * x);
}
def code(x, y, z): return ((3.0 * z) * z) + (y * x)
function code(x, y, z) return Float64(Float64(Float64(3.0 * z) * z) + Float64(y * x)) end
function tmp = code(x, y, z) tmp = ((3.0 * z) * z) + (y * x); end
code[x_, y_, z_] := N[(N[(N[(3.0 * z), $MachinePrecision] * z), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(3 \cdot z\right) \cdot z + y \cdot x
\end{array}
herbie shell --seed 2024244
(FPCore (x y z)
:name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
:precision binary64
:alt
(! :herbie-platform default (+ (* (* 3 z) z) (* y x)))
(+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))