HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%
Time: 17.5s
Alternatives: 13
Speedup: 1.0×

Specification

?
\[\left(10^{-5} \leq u \land u \leq 1\right) \land \left(0 \leq v \land v \leq 109.746574\right)\]
\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)
\end{array}

Sampling outcomes in binary32 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 13 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)
\end{array}

Alternative 1: 99.5% accurate, 0.5× speedup?

\[\begin{array}{l} \\ 1 + \left(\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right) + -1\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (+ (fma v (log (fma (- 1.0 u) (exp (/ -2.0 v)) u)) 1.0) -1.0)))
float code(float u, float v) {
	return 1.0f + (fmaf(v, logf(fmaf((1.0f - u), expf((-2.0f / v)), u)), 1.0f) + -1.0f);
}
function code(u, v)
	return Float32(Float32(1.0) + Float32(fma(v, log(fma(Float32(Float32(1.0) - u), exp(Float32(Float32(-2.0) / v)), u)), Float32(1.0)) + Float32(-1.0)))
end
\begin{array}{l}

\\
1 + \left(\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right) + -1\right)
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. expm1-log1p-u93.3%

      \[\leadsto 1 + \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)\right)\right)} \]
    2. log1p-define93.3%

      \[\leadsto 1 + \mathsf{expm1}\left(\color{blue}{\log \left(1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)\right)}\right) \]
    3. expm1-undefine93.3%

      \[\leadsto 1 + \color{blue}{\left(e^{\log \left(1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)\right)} - 1\right)} \]
    4. add-exp-log99.4%

      \[\leadsto 1 + \left(\color{blue}{\left(1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)\right)} - 1\right) \]
    5. +-commutative99.4%

      \[\leadsto 1 + \left(\color{blue}{\left(v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) + 1\right)} - 1\right) \]
    6. +-commutative99.4%

      \[\leadsto 1 + \left(\left(v \cdot \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)} + 1\right) - 1\right) \]
    7. fma-undefine99.5%

      \[\leadsto 1 + \left(\left(v \cdot \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)} + 1\right) - 1\right) \]
    8. fma-undefine99.5%

      \[\leadsto 1 + \left(\color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} - 1\right) \]
  4. Applied egg-rr99.5%

    \[\leadsto 1 + \color{blue}{\left(\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right) - 1\right)} \]
  5. Final simplification99.5%

    \[\leadsto 1 + \left(\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right) + -1\right) \]
  6. Add Preprocessing

Alternative 2: 99.5% accurate, 0.5× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (fma v (log (fma (- 1.0 u) (exp (/ -2.0 v)) u)) 1.0))
float code(float u, float v) {
	return fmaf(v, logf(fmaf((1.0f - u), expf((-2.0f / v)), u)), 1.0f);
}
function code(u, v)
	return fma(v, log(fma(Float32(Float32(1.0) - u), exp(Float32(Float32(-2.0) / v)), u)), Float32(1.0))
end
\begin{array}{l}

\\
\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Step-by-step derivation
    1. +-commutative99.4%

      \[\leadsto \color{blue}{v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) + 1} \]
    2. fma-define99.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]
    3. +-commutative99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
    4. fma-define99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]
  3. Simplified99.5%

    \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
  4. Add Preprocessing
  5. Final simplification99.5%

    \[\leadsto \mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right) \]
  6. Add Preprocessing

Alternative 3: 99.5% accurate, 0.7× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (fma (- 1.0 u) (exp (/ -2.0 v)) u)))))
float code(float u, float v) {
	return 1.0f + (v * logf(fmaf((1.0f - u), expf((-2.0f / v)), u)));
}
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(fma(Float32(Float32(1.0) - u), exp(Float32(Float32(-2.0) / v)), u))))
end
\begin{array}{l}

\\
1 + v \cdot \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Step-by-step derivation
    1. +-commutative99.4%

      \[\leadsto \color{blue}{v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) + 1} \]
    2. fma-define99.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]
    3. +-commutative99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
    4. fma-define99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]
  3. Simplified99.5%

    \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
  4. Add Preprocessing
  5. Step-by-step derivation
    1. fma-undefine99.5%

      \[\leadsto \color{blue}{v \cdot \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right) + 1} \]
  6. Applied egg-rr99.5%

    \[\leadsto \color{blue}{v \cdot \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right) + 1} \]
  7. Final simplification99.5%

    \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right) \]
  8. Add Preprocessing

Alternative 4: 99.5% accurate, 0.7× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (fma v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))) 1.0))
float code(float u, float v) {
	return fmaf(v, logf((u + ((1.0f - u) * expf((-2.0f / v))))), 1.0f);
}
function code(u, v)
	return fma(v, log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v))))), Float32(1.0))
end
\begin{array}{l}

\\
\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Step-by-step derivation
    1. +-commutative99.4%

      \[\leadsto \color{blue}{v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) + 1} \]
    2. fma-define99.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]
    3. +-commutative99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
    4. fma-define99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]
  3. Simplified99.5%

    \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
  4. Add Preprocessing
  5. Step-by-step derivation
    1. fma-undefine99.5%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
  6. Applied egg-rr99.5%

    \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
  7. Final simplification99.5%

    \[\leadsto \mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right) \]
  8. Add Preprocessing

Alternative 5: 99.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Add Preprocessing
  3. Final simplification99.4%

    \[\leadsto 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  4. Add Preprocessing

Alternative 6: 90.8% accurate, 1.8× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(v \cdot u\right) \cdot e^{\frac{2}{v}} - v \cdot u\right) + -1\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.20000000298023224)
   1.0
   (+ (- (* (* v u) (exp (/ 2.0 v))) (* v u)) -1.0)))
float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} else {
		tmp = (((v * u) * expf((2.0f / v))) - (v * u)) + -1.0f;
	}
	return tmp;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.20000000298023224e0) then
        tmp = 1.0e0
    else
        tmp = (((v * u) * exp((2.0e0 / v))) - (v * u)) + (-1.0e0)
    end if
    code = tmp
end function
function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.20000000298023224))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(Float32(Float32(v * u) * exp(Float32(Float32(2.0) / v))) - Float32(v * u)) + Float32(-1.0));
	end
	return tmp
end
function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.20000000298023224))
		tmp = single(1.0);
	else
		tmp = (((v * u) * exp((single(2.0) / v))) - (v * u)) + single(-1.0);
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.20000000298023224:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;\left(\left(v \cdot u\right) \cdot e^{\frac{2}{v}} - v \cdot u\right) + -1\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if v < 0.200000003

    1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around 0 94.7%

      \[\leadsto \color{blue}{1} \]

    if 0.200000003 < v

    1. Initial program 92.8%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in u around 0 61.9%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right)\right) - 1} \]
    4. Step-by-step derivation
      1. associate-*r*61.9%

        \[\leadsto \color{blue}{\left(u \cdot v\right) \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right)} - 1 \]
      2. sub-neg61.9%

        \[\leadsto \left(u \cdot v\right) \cdot \color{blue}{\left(\frac{1}{e^{\frac{-2}{v}}} + \left(-1\right)\right)} - 1 \]
      3. distribute-lft-in61.9%

        \[\leadsto \color{blue}{\left(\left(u \cdot v\right) \cdot \frac{1}{e^{\frac{-2}{v}}} + \left(u \cdot v\right) \cdot \left(-1\right)\right)} - 1 \]
      4. rec-exp61.9%

        \[\leadsto \left(\left(u \cdot v\right) \cdot \color{blue}{e^{-\frac{-2}{v}}} + \left(u \cdot v\right) \cdot \left(-1\right)\right) - 1 \]
      5. distribute-neg-frac61.9%

        \[\leadsto \left(\left(u \cdot v\right) \cdot e^{\color{blue}{\frac{--2}{v}}} + \left(u \cdot v\right) \cdot \left(-1\right)\right) - 1 \]
      6. metadata-eval61.9%

        \[\leadsto \left(\left(u \cdot v\right) \cdot e^{\frac{\color{blue}{2}}{v}} + \left(u \cdot v\right) \cdot \left(-1\right)\right) - 1 \]
      7. metadata-eval61.9%

        \[\leadsto \left(\left(u \cdot v\right) \cdot e^{\frac{2}{v}} + \left(u \cdot v\right) \cdot \color{blue}{-1}\right) - 1 \]
    5. Applied egg-rr61.9%

      \[\leadsto \color{blue}{\left(\left(u \cdot v\right) \cdot e^{\frac{2}{v}} + \left(u \cdot v\right) \cdot -1\right)} - 1 \]
  3. Recombined 2 regimes into one program.
  4. Final simplification92.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(v \cdot u\right) \cdot e^{\frac{2}{v}} - v \cdot u\right) + -1\\ \end{array} \]
  5. Add Preprocessing

Alternative 7: 90.8% accurate, 1.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right)\right) + -1\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.20000000298023224) 1.0 (+ (* u (* v (expm1 (/ 2.0 v)))) -1.0)))
float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} else {
		tmp = (u * (v * expm1f((2.0f / v)))) + -1.0f;
	}
	return tmp;
}
function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.20000000298023224))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(u * Float32(v * expm1(Float32(Float32(2.0) / v)))) + Float32(-1.0));
	end
	return tmp
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.20000000298023224:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right)\right) + -1\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if v < 0.200000003

    1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around 0 94.7%

      \[\leadsto \color{blue}{1} \]

    if 0.200000003 < v

    1. Initial program 92.8%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in u around 0 61.9%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right)\right) - 1} \]
    4. Step-by-step derivation
      1. sub-neg61.9%

        \[\leadsto u \cdot \left(v \cdot \color{blue}{\left(\frac{1}{e^{\frac{-2}{v}}} + \left(-1\right)\right)}\right) - 1 \]
      2. rec-exp61.9%

        \[\leadsto u \cdot \left(v \cdot \left(\color{blue}{e^{-\frac{-2}{v}}} + \left(-1\right)\right)\right) - 1 \]
      3. distribute-neg-frac61.9%

        \[\leadsto u \cdot \left(v \cdot \left(e^{\color{blue}{\frac{--2}{v}}} + \left(-1\right)\right)\right) - 1 \]
      4. metadata-eval61.9%

        \[\leadsto u \cdot \left(v \cdot \left(e^{\frac{\color{blue}{2}}{v}} + \left(-1\right)\right)\right) - 1 \]
      5. metadata-eval61.9%

        \[\leadsto u \cdot \left(v \cdot \left(e^{\frac{2}{v}} + \color{blue}{-1}\right)\right) - 1 \]
    5. Applied egg-rr61.9%

      \[\leadsto u \cdot \left(v \cdot \color{blue}{\left(e^{\frac{2}{v}} + -1\right)}\right) - 1 \]
    6. Step-by-step derivation
      1. metadata-eval61.9%

        \[\leadsto u \cdot \left(v \cdot \left(e^{\frac{2}{v}} + \color{blue}{\left(-1\right)}\right)\right) - 1 \]
      2. sub-neg61.9%

        \[\leadsto u \cdot \left(v \cdot \color{blue}{\left(e^{\frac{2}{v}} - 1\right)}\right) - 1 \]
      3. expm1-undefine61.9%

        \[\leadsto u \cdot \left(v \cdot \color{blue}{\mathsf{expm1}\left(\frac{2}{v}\right)}\right) - 1 \]
    7. Simplified61.9%

      \[\leadsto u \cdot \left(v \cdot \color{blue}{\mathsf{expm1}\left(\frac{2}{v}\right)}\right) - 1 \]
  3. Recombined 2 regimes into one program.
  4. Final simplification92.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right)\right) + -1\\ \end{array} \]
  5. Add Preprocessing

Alternative 8: 90.5% accurate, 6.6× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + 0.5 \cdot \frac{-4 \cdot \left(1 + u \cdot \left(u + -2\right)\right) + \left(1 - u\right) \cdot 4}{v}\right)\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.20000000298023224)
   1.0
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (* 0.5 (/ (+ (* -4.0 (+ 1.0 (* u (+ u -2.0)))) (* (- 1.0 u) 4.0)) v))))))
float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (0.5f * (((-4.0f * (1.0f + (u * (u + -2.0f)))) + ((1.0f - u) * 4.0f)) / v)));
	}
	return tmp;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.20000000298023224e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + (0.5e0 * ((((-4.0e0) * (1.0e0 + (u * (u + (-2.0e0))))) + ((1.0e0 - u) * 4.0e0)) / v)))
    end if
    code = tmp
end function
function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.20000000298023224))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(Float32(1.0) - u) * Float32(-2.0)) + Float32(Float32(0.5) * Float32(Float32(Float32(Float32(-4.0) * Float32(Float32(1.0) + Float32(u * Float32(u + Float32(-2.0))))) + Float32(Float32(Float32(1.0) - u) * Float32(4.0))) / v))));
	end
	return tmp
end
function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.20000000298023224))
		tmp = single(1.0);
	else
		tmp = single(1.0) + (((single(1.0) - u) * single(-2.0)) + (single(0.5) * (((single(-4.0) * (single(1.0) + (u * (u + single(-2.0))))) + ((single(1.0) - u) * single(4.0))) / v)));
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.20000000298023224:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + 0.5 \cdot \frac{-4 \cdot \left(1 + u \cdot \left(u + -2\right)\right) + \left(1 - u\right) \cdot 4}{v}\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if v < 0.200000003

    1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around 0 94.7%

      \[\leadsto \color{blue}{1} \]

    if 0.200000003 < v

    1. Initial program 92.8%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around inf 59.6%

      \[\leadsto 1 + \color{blue}{\left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)}{v}\right)} \]
    4. Taylor expanded in u around 0 59.6%

      \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot \color{blue}{\left(1 + \left(-2 \cdot u + {u}^{2}\right)\right)} + 4 \cdot \left(1 - u\right)}{v}\right) \]
    5. Step-by-step derivation
      1. +-commutative59.6%

        \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot \left(1 + \color{blue}{\left({u}^{2} + -2 \cdot u\right)}\right) + 4 \cdot \left(1 - u\right)}{v}\right) \]
      2. unpow259.6%

        \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot \left(1 + \left(\color{blue}{u \cdot u} + -2 \cdot u\right)\right) + 4 \cdot \left(1 - u\right)}{v}\right) \]
      3. distribute-rgt-out59.6%

        \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot \left(1 + \color{blue}{u \cdot \left(u + -2\right)}\right) + 4 \cdot \left(1 - u\right)}{v}\right) \]
    6. Simplified59.6%

      \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot \color{blue}{\left(1 + u \cdot \left(u + -2\right)\right)} + 4 \cdot \left(1 - u\right)}{v}\right) \]
  3. Recombined 2 regimes into one program.
  4. Final simplification91.9%

    \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + 0.5 \cdot \frac{-4 \cdot \left(1 + u \cdot \left(u + -2\right)\right) + \left(1 - u\right) \cdot 4}{v}\right)\\ \end{array} \]
  5. Add Preprocessing

Alternative 9: 90.4% accurate, 15.2× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(u + \frac{u}{v}\right) + -1\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.20000000298023224) 1.0 (+ (* 2.0 (+ u (/ u v))) -1.0)))
float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} else {
		tmp = (2.0f * (u + (u / v))) + -1.0f;
	}
	return tmp;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.20000000298023224e0) then
        tmp = 1.0e0
    else
        tmp = (2.0e0 * (u + (u / v))) + (-1.0e0)
    end if
    code = tmp
end function
function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.20000000298023224))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(Float32(2.0) * Float32(u + Float32(u / v))) + Float32(-1.0));
	end
	return tmp
end
function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.20000000298023224))
		tmp = single(1.0);
	else
		tmp = (single(2.0) * (u + (u / v))) + single(-1.0);
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.20000000298023224:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;2 \cdot \left(u + \frac{u}{v}\right) + -1\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if v < 0.200000003

    1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around 0 94.7%

      \[\leadsto \color{blue}{1} \]

    if 0.200000003 < v

    1. Initial program 92.8%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in u around 0 61.9%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right)\right) - 1} \]
    4. Taylor expanded in v around inf 56.5%

      \[\leadsto \color{blue}{\left(2 \cdot u + 2 \cdot \frac{u}{v}\right)} - 1 \]
    5. Step-by-step derivation
      1. distribute-lft-out56.5%

        \[\leadsto \color{blue}{2 \cdot \left(u + \frac{u}{v}\right)} - 1 \]
    6. Simplified56.5%

      \[\leadsto \color{blue}{2 \cdot \left(u + \frac{u}{v}\right)} - 1 \]
  3. Recombined 2 regimes into one program.
  4. Final simplification91.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(u + \frac{u}{v}\right) + -1\\ \end{array} \]
  5. Add Preprocessing

Alternative 10: 89.8% accurate, 17.7× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(1 - u\right) \cdot -2\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.20000000298023224) 1.0 (+ 1.0 (* (- 1.0 u) -2.0))))
float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + ((1.0f - u) * -2.0f);
	}
	return tmp;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.20000000298023224e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + ((1.0e0 - u) * (-2.0e0))
    end if
    code = tmp
end function
function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.20000000298023224))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(1.0) - u) * Float32(-2.0)));
	end
	return tmp
end
function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.20000000298023224))
		tmp = single(1.0);
	else
		tmp = single(1.0) + ((single(1.0) - u) * single(-2.0));
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.20000000298023224:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;1 + \left(1 - u\right) \cdot -2\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if v < 0.200000003

    1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around 0 94.7%

      \[\leadsto \color{blue}{1} \]

    if 0.200000003 < v

    1. Initial program 92.8%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around inf 48.8%

      \[\leadsto 1 + \color{blue}{-2 \cdot \left(1 - u\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification91.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(1 - u\right) \cdot -2\\ \end{array} \]
  5. Add Preprocessing

Alternative 11: 89.8% accurate, 21.2× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot 2 + -1\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.20000000298023224) 1.0 (+ (* u 2.0) -1.0)))
float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} else {
		tmp = (u * 2.0f) + -1.0f;
	}
	return tmp;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.20000000298023224e0) then
        tmp = 1.0e0
    else
        tmp = (u * 2.0e0) + (-1.0e0)
    end if
    code = tmp
end function
function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.20000000298023224))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(u * Float32(2.0)) + Float32(-1.0));
	end
	return tmp
end
function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.20000000298023224))
		tmp = single(1.0);
	else
		tmp = (u * single(2.0)) + single(-1.0);
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.20000000298023224:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;u \cdot 2 + -1\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if v < 0.200000003

    1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around 0 94.7%

      \[\leadsto \color{blue}{1} \]

    if 0.200000003 < v

    1. Initial program 92.8%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in u around 0 61.9%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right)\right) - 1} \]
    4. Taylor expanded in v around inf 48.8%

      \[\leadsto \color{blue}{2 \cdot u} - 1 \]
    5. Step-by-step derivation
      1. *-commutative48.8%

        \[\leadsto \color{blue}{u \cdot 2} - 1 \]
    6. Simplified48.8%

      \[\leadsto \color{blue}{u \cdot 2} - 1 \]
  3. Recombined 2 regimes into one program.
  4. Final simplification91.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.20000000298023224:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot 2 + -1\\ \end{array} \]
  5. Add Preprocessing

Alternative 12: 5.8% accurate, 213.0× speedup?

\[\begin{array}{l} \\ -1 \end{array} \]
(FPCore (u v) :precision binary32 -1.0)
float code(float u, float v) {
	return -1.0f;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = -1.0e0
end function
function code(u, v)
	return Float32(-1.0)
end
function tmp = code(u, v)
	tmp = single(-1.0);
end
\begin{array}{l}

\\
-1
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 5.7%

    \[\leadsto \color{blue}{-1} \]
  4. Final simplification5.7%

    \[\leadsto -1 \]
  5. Add Preprocessing

Alternative 13: 86.9% accurate, 213.0× speedup?

\[\begin{array}{l} \\ 1 \end{array} \]
(FPCore (u v) :precision binary32 1.0)
float code(float u, float v) {
	return 1.0f;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0
end function
function code(u, v)
	return Float32(1.0)
end
function tmp = code(u, v)
	tmp = single(1.0);
end
\begin{array}{l}

\\
1
\end{array}
Derivation
  1. Initial program 99.4%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in v around 0 87.8%

    \[\leadsto \color{blue}{1} \]
  4. Final simplification87.8%

    \[\leadsto 1 \]
  5. Add Preprocessing

Reproduce

?
herbie shell --seed 2024041 
(FPCore (u v)
  :name "HairBSDF, sample_f, cosTheta"
  :precision binary32
  :pre (and (and (<= 1e-5 u) (<= u 1.0)) (and (<= 0.0 v) (<= v 109.746574)))
  (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))