Disney BSSRDF, sample scattering profile, lower

Percentage Accurate: 61.5% → 98.7%
Time: 7.0s
Alternatives: 6
Speedup: 11.4×

Specification

?
\[\left(0 \leq s \land s \leq 256\right) \land \left(2.328306437 \cdot 10^{-10} \leq u \land u \leq 0.25\right)\]
\[\begin{array}{l} \\ s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))
float code(float s, float u) {
	return s * logf((1.0f / (1.0f - (4.0f * u))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * log((1.0e0 / (1.0e0 - (4.0e0 * u))))
end function
function code(s, u)
	return Float32(s * log(Float32(Float32(1.0) / Float32(Float32(1.0) - Float32(Float32(4.0) * u)))))
end
function tmp = code(s, u)
	tmp = s * log((single(1.0) / (single(1.0) - (single(4.0) * u))));
end
\begin{array}{l}

\\
s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\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 6 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: 61.5% accurate, 1.0× speedup?

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

\\
s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right)
\end{array}

Alternative 1: 98.7% accurate, 0.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;u \cdot 4 \leq 0.05000000074505806:\\ \;\;\;\;\left(s \cdot 4 + \left(\left(\left(\frac{21.333333333333332}{u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s\right) \cdot u\\ \mathbf{else}:\\ \;\;\;\;\log \left(\frac{1}{1 - u \cdot 4}\right) \cdot s\\ \end{array} \end{array} \]
(FPCore (s u)
 :precision binary32
 (if (<= (* u 4.0) 0.05000000074505806)
   (*
    (+
     (* s 4.0)
     (*
      (* (* (+ (/ 21.333333333333332 u) (+ (/ 8.0 (* u u)) 64.0)) (* u u)) u)
      s))
    u)
   (* (log (/ 1.0 (- 1.0 (* u 4.0)))) s)))
float code(float s, float u) {
	float tmp;
	if ((u * 4.0f) <= 0.05000000074505806f) {
		tmp = ((s * 4.0f) + (((((21.333333333333332f / u) + ((8.0f / (u * u)) + 64.0f)) * (u * u)) * u) * s)) * u;
	} else {
		tmp = logf((1.0f / (1.0f - (u * 4.0f)))) * s;
	}
	return tmp;
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    real(4) :: tmp
    if ((u * 4.0e0) <= 0.05000000074505806e0) then
        tmp = ((s * 4.0e0) + (((((21.333333333333332e0 / u) + ((8.0e0 / (u * u)) + 64.0e0)) * (u * u)) * u) * s)) * u
    else
        tmp = log((1.0e0 / (1.0e0 - (u * 4.0e0)))) * s
    end if
    code = tmp
end function
function code(s, u)
	tmp = Float32(0.0)
	if (Float32(u * Float32(4.0)) <= Float32(0.05000000074505806))
		tmp = Float32(Float32(Float32(s * Float32(4.0)) + Float32(Float32(Float32(Float32(Float32(Float32(21.333333333333332) / u) + Float32(Float32(Float32(8.0) / Float32(u * u)) + Float32(64.0))) * Float32(u * u)) * u) * s)) * u);
	else
		tmp = Float32(log(Float32(Float32(1.0) / Float32(Float32(1.0) - Float32(u * Float32(4.0))))) * s);
	end
	return tmp
end
function tmp_2 = code(s, u)
	tmp = single(0.0);
	if ((u * single(4.0)) <= single(0.05000000074505806))
		tmp = ((s * single(4.0)) + (((((single(21.333333333333332) / u) + ((single(8.0) / (u * u)) + single(64.0))) * (u * u)) * u) * s)) * u;
	else
		tmp = log((single(1.0) / (single(1.0) - (u * single(4.0))))) * s;
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;u \cdot 4 \leq 0.05000000074505806:\\
\;\;\;\;\left(s \cdot 4 + \left(\left(\left(\frac{21.333333333333332}{u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s\right) \cdot u\\

\mathbf{else}:\\
\;\;\;\;\log \left(\frac{1}{1 - u \cdot 4}\right) \cdot s\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (*.f32 #s(literal 4 binary32) u) < 0.0500000007

    1. Initial program 55.7%

      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in u around 0

      \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
    4. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
      2. lower-*.f32N/A

        \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
    5. Applied rewrites81.0%

      \[\leadsto \color{blue}{\left(s \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right), u, 4\right)\right) \cdot u} \]
    6. Step-by-step derivation
      1. Applied rewrites94.7%

        \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
      2. Taylor expanded in u around inf

        \[\leadsto \left(\left(\left({u}^{2} \cdot \left(64 + \left(\frac{64}{3} \cdot \frac{1}{u} + \frac{8}{{u}^{2}}\right)\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
      3. Step-by-step derivation
        1. Applied rewrites99.4%

          \[\leadsto \left(\left(\left(\left(\left(64 + \frac{8}{u \cdot u}\right) + \frac{21.333333333333332}{u}\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]

        if 0.0500000007 < (*.f32 #s(literal 4 binary32) u)

        1. Initial program 95.5%

          \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
        2. Add Preprocessing
      4. Recombined 2 regimes into one program.
      5. Final simplification98.8%

        \[\leadsto \begin{array}{l} \mathbf{if}\;u \cdot 4 \leq 0.05000000074505806:\\ \;\;\;\;\left(s \cdot 4 + \left(\left(\left(\frac{21.333333333333332}{u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s\right) \cdot u\\ \mathbf{else}:\\ \;\;\;\;\log \left(\frac{1}{1 - u \cdot 4}\right) \cdot s\\ \end{array} \]
      6. Add Preprocessing

      Alternative 2: 93.2% accurate, 1.7× speedup?

      \[\begin{array}{l} \\ \left(\left(\left(\left(\frac{1}{0.046875 \cdot u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + s \cdot 4\right) \cdot u \end{array} \]
      (FPCore (s u)
       :precision binary32
       (*
        (+
         (* (* (* (+ (/ 1.0 (* 0.046875 u)) (+ (/ 8.0 (* u u)) 64.0)) (* u u)) u) s)
         (* s 4.0))
        u))
      float code(float s, float u) {
      	return ((((((1.0f / (0.046875f * u)) + ((8.0f / (u * u)) + 64.0f)) * (u * u)) * u) * s) + (s * 4.0f)) * u;
      }
      
      real(4) function code(s, u)
          real(4), intent (in) :: s
          real(4), intent (in) :: u
          code = ((((((1.0e0 / (0.046875e0 * u)) + ((8.0e0 / (u * u)) + 64.0e0)) * (u * u)) * u) * s) + (s * 4.0e0)) * u
      end function
      
      function code(s, u)
      	return Float32(Float32(Float32(Float32(Float32(Float32(Float32(Float32(1.0) / Float32(Float32(0.046875) * u)) + Float32(Float32(Float32(8.0) / Float32(u * u)) + Float32(64.0))) * Float32(u * u)) * u) * s) + Float32(s * Float32(4.0))) * u)
      end
      
      function tmp = code(s, u)
      	tmp = ((((((single(1.0) / (single(0.046875) * u)) + ((single(8.0) / (u * u)) + single(64.0))) * (u * u)) * u) * s) + (s * single(4.0))) * u;
      end
      
      \begin{array}{l}
      
      \\
      \left(\left(\left(\left(\frac{1}{0.046875 \cdot u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + s \cdot 4\right) \cdot u
      \end{array}
      
      Derivation
      1. Initial program 61.6%

        \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
      2. Add Preprocessing
      3. Taylor expanded in u around 0

        \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
      4. Step-by-step derivation
        1. *-commutativeN/A

          \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
        2. lower-*.f32N/A

          \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
      5. Applied rewrites74.3%

        \[\leadsto \color{blue}{\left(s \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right), u, 4\right)\right) \cdot u} \]
      6. Step-by-step derivation
        1. Applied rewrites87.3%

          \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
        2. Taylor expanded in u around inf

          \[\leadsto \left(\left(\left({u}^{2} \cdot \left(64 + \left(\frac{64}{3} \cdot \frac{1}{u} + \frac{8}{{u}^{2}}\right)\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
        3. Step-by-step derivation
          1. Applied rewrites93.8%

            \[\leadsto \left(\left(\left(\left(\left(64 + \frac{8}{u \cdot u}\right) + \frac{21.333333333333332}{u}\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
          2. Step-by-step derivation
            1. Applied rewrites93.8%

              \[\leadsto \left(\left(\left(\left(\left(64 + \frac{8}{u \cdot u}\right) + \frac{1}{u \cdot 0.046875}\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
            2. Final simplification93.8%

              \[\leadsto \left(\left(\left(\left(\frac{1}{0.046875 \cdot u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + s \cdot 4\right) \cdot u \]
            3. Add Preprocessing

            Alternative 3: 93.2% accurate, 1.9× speedup?

            \[\begin{array}{l} \\ \left(s \cdot 4 + \left(\left(\left(\frac{21.333333333333332}{u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s\right) \cdot u \end{array} \]
            (FPCore (s u)
             :precision binary32
             (*
              (+
               (* s 4.0)
               (*
                (* (* (+ (/ 21.333333333333332 u) (+ (/ 8.0 (* u u)) 64.0)) (* u u)) u)
                s))
              u))
            float code(float s, float u) {
            	return ((s * 4.0f) + (((((21.333333333333332f / u) + ((8.0f / (u * u)) + 64.0f)) * (u * u)) * u) * s)) * u;
            }
            
            real(4) function code(s, u)
                real(4), intent (in) :: s
                real(4), intent (in) :: u
                code = ((s * 4.0e0) + (((((21.333333333333332e0 / u) + ((8.0e0 / (u * u)) + 64.0e0)) * (u * u)) * u) * s)) * u
            end function
            
            function code(s, u)
            	return Float32(Float32(Float32(s * Float32(4.0)) + Float32(Float32(Float32(Float32(Float32(Float32(21.333333333333332) / u) + Float32(Float32(Float32(8.0) / Float32(u * u)) + Float32(64.0))) * Float32(u * u)) * u) * s)) * u)
            end
            
            function tmp = code(s, u)
            	tmp = ((s * single(4.0)) + (((((single(21.333333333333332) / u) + ((single(8.0) / (u * u)) + single(64.0))) * (u * u)) * u) * s)) * u;
            end
            
            \begin{array}{l}
            
            \\
            \left(s \cdot 4 + \left(\left(\left(\frac{21.333333333333332}{u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s\right) \cdot u
            \end{array}
            
            Derivation
            1. Initial program 61.6%

              \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
            2. Add Preprocessing
            3. Taylor expanded in u around 0

              \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
            4. Step-by-step derivation
              1. *-commutativeN/A

                \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
              2. lower-*.f32N/A

                \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
            5. Applied rewrites74.3%

              \[\leadsto \color{blue}{\left(s \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right), u, 4\right)\right) \cdot u} \]
            6. Step-by-step derivation
              1. Applied rewrites87.3%

                \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
              2. Taylor expanded in u around inf

                \[\leadsto \left(\left(\left({u}^{2} \cdot \left(64 + \left(\frac{64}{3} \cdot \frac{1}{u} + \frac{8}{{u}^{2}}\right)\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
              3. Step-by-step derivation
                1. Applied rewrites93.8%

                  \[\leadsto \left(\left(\left(\left(\left(64 + \frac{8}{u \cdot u}\right) + \frac{21.333333333333332}{u}\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
                2. Final simplification93.8%

                  \[\leadsto \left(s \cdot 4 + \left(\left(\left(\frac{21.333333333333332}{u} + \left(\frac{8}{u \cdot u} + 64\right)\right) \cdot \left(u \cdot u\right)\right) \cdot u\right) \cdot s\right) \cdot u \]
                3. Add Preprocessing

                Alternative 4: 86.6% accurate, 5.2× speedup?

                \[\begin{array}{l} \\ \left(\left(8 \cdot u\right) \cdot s + s \cdot 4\right) \cdot u \end{array} \]
                (FPCore (s u) :precision binary32 (* (+ (* (* 8.0 u) s) (* s 4.0)) u))
                float code(float s, float u) {
                	return (((8.0f * u) * s) + (s * 4.0f)) * u;
                }
                
                real(4) function code(s, u)
                    real(4), intent (in) :: s
                    real(4), intent (in) :: u
                    code = (((8.0e0 * u) * s) + (s * 4.0e0)) * u
                end function
                
                function code(s, u)
                	return Float32(Float32(Float32(Float32(Float32(8.0) * u) * s) + Float32(s * Float32(4.0))) * u)
                end
                
                function tmp = code(s, u)
                	tmp = (((single(8.0) * u) * s) + (s * single(4.0))) * u;
                end
                
                \begin{array}{l}
                
                \\
                \left(\left(8 \cdot u\right) \cdot s + s \cdot 4\right) \cdot u
                \end{array}
                
                Derivation
                1. Initial program 61.6%

                  \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
                2. Add Preprocessing
                3. Taylor expanded in u around 0

                  \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
                4. Step-by-step derivation
                  1. *-commutativeN/A

                    \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
                  2. lower-*.f32N/A

                    \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
                5. Applied rewrites74.3%

                  \[\leadsto \color{blue}{\left(s \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right), u, 4\right)\right) \cdot u} \]
                6. Step-by-step derivation
                  1. Applied rewrites87.3%

                    \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right) \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
                  2. Taylor expanded in u around 0

                    \[\leadsto \left(\left(8 \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
                  3. Step-by-step derivation
                    1. Applied rewrites87.3%

                      \[\leadsto \left(\left(8 \cdot u\right) \cdot s + 4 \cdot s\right) \cdot u \]
                    2. Final simplification87.3%

                      \[\leadsto \left(\left(8 \cdot u\right) \cdot s + s \cdot 4\right) \cdot u \]
                    3. Add Preprocessing

                    Alternative 5: 73.8% accurate, 11.4× speedup?

                    \[\begin{array}{l} \\ \left(u \cdot 4\right) \cdot s \end{array} \]
                    (FPCore (s u) :precision binary32 (* (* u 4.0) s))
                    float code(float s, float u) {
                    	return (u * 4.0f) * s;
                    }
                    
                    real(4) function code(s, u)
                        real(4), intent (in) :: s
                        real(4), intent (in) :: u
                        code = (u * 4.0e0) * s
                    end function
                    
                    function code(s, u)
                    	return Float32(Float32(u * Float32(4.0)) * s)
                    end
                    
                    function tmp = code(s, u)
                    	tmp = (u * single(4.0)) * s;
                    end
                    
                    \begin{array}{l}
                    
                    \\
                    \left(u \cdot 4\right) \cdot s
                    \end{array}
                    
                    Derivation
                    1. Initial program 61.6%

                      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
                    2. Add Preprocessing
                    3. Taylor expanded in u around 0

                      \[\leadsto s \cdot \color{blue}{\left(4 \cdot u\right)} \]
                    4. Step-by-step derivation
                      1. *-commutativeN/A

                        \[\leadsto s \cdot \color{blue}{\left(u \cdot 4\right)} \]
                      2. lower-*.f3274.3

                        \[\leadsto s \cdot \color{blue}{\left(u \cdot 4\right)} \]
                    5. Applied rewrites74.3%

                      \[\leadsto s \cdot \color{blue}{\left(u \cdot 4\right)} \]
                    6. Final simplification74.3%

                      \[\leadsto \left(u \cdot 4\right) \cdot s \]
                    7. Add Preprocessing

                    Alternative 6: 73.6% accurate, 11.4× speedup?

                    \[\begin{array}{l} \\ \left(s \cdot u\right) \cdot 4 \end{array} \]
                    (FPCore (s u) :precision binary32 (* (* s u) 4.0))
                    float code(float s, float u) {
                    	return (s * u) * 4.0f;
                    }
                    
                    real(4) function code(s, u)
                        real(4), intent (in) :: s
                        real(4), intent (in) :: u
                        code = (s * u) * 4.0e0
                    end function
                    
                    function code(s, u)
                    	return Float32(Float32(s * u) * Float32(4.0))
                    end
                    
                    function tmp = code(s, u)
                    	tmp = (s * u) * single(4.0);
                    end
                    
                    \begin{array}{l}
                    
                    \\
                    \left(s \cdot u\right) \cdot 4
                    \end{array}
                    
                    Derivation
                    1. Initial program 61.6%

                      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
                    2. Add Preprocessing
                    3. Taylor expanded in u around 0

                      \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
                    4. Step-by-step derivation
                      1. *-commutativeN/A

                        \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
                      2. lower-*.f32N/A

                        \[\leadsto \color{blue}{\left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right) \cdot u} \]
                    5. Applied rewrites74.3%

                      \[\leadsto \color{blue}{\left(s \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right), u, 4\right)\right) \cdot u} \]
                    6. Step-by-step derivation
                      1. Applied rewrites74.0%

                        \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(64, u, 21.333333333333332\right), u, 8\right), u, 4\right) \cdot \color{blue}{\left(s \cdot u\right)} \]
                      2. Taylor expanded in u around 0

                        \[\leadsto 4 \cdot \left(\color{blue}{s} \cdot u\right) \]
                      3. Step-by-step derivation
                        1. Applied rewrites74.0%

                          \[\leadsto 4 \cdot \left(\color{blue}{s} \cdot u\right) \]
                        2. Final simplification74.0%

                          \[\leadsto \left(s \cdot u\right) \cdot 4 \]
                        3. Add Preprocessing

                        Reproduce

                        ?
                        herbie shell --seed 2024248 
                        (FPCore (s u)
                          :name "Disney BSSRDF, sample scattering profile, lower"
                          :precision binary32
                          :pre (and (and (<= 0.0 s) (<= s 256.0)) (and (<= 2.328306437e-10 u) (<= u 0.25)))
                          (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))