xlohi (overflows)

Percentage Accurate: 3.1% → 19.5%

Time: 20.4s

Alternatives: 5

Speedup: 7.0×

Specification

\[lo < -1 \cdot 10^{+308} \land hi > 10^{+308}\]

Math

\[\begin{array}{l} \\ \frac{x - lo}{hi - lo} \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 (/ (- x lo) (- hi lo)))

C

double code(double lo, double hi, double x) {
	return (x - lo) / (hi - lo);
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = (x - lo) / (hi - lo)
end function

Java

public static double code(double lo, double hi, double x) {
	return (x - lo) / (hi - lo);
}

Python

def code(lo, hi, x):
	return (x - lo) / (hi - lo)

Julia

function code(lo, hi, x)
	return Float64(Float64(x - lo) / Float64(hi - lo))
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = (x - lo) / (hi - lo);
end

Wolfram

code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / N[(hi - lo), $MachinePrecision]), $MachinePrecision]

Initial Program: 3.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - lo}{hi - lo} \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 (/ (- x lo) (- hi lo)))

C

double code(double lo, double hi, double x) {
	return (x - lo) / (hi - lo);
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = (x - lo) / (hi - lo)
end function

Java

public static double code(double lo, double hi, double x) {
	return (x - lo) / (hi - lo);
}

Python

def code(lo, hi, x):
	return (x - lo) / (hi - lo)

Julia

function code(lo, hi, x)
	return Float64(Float64(x - lo) / Float64(hi - lo))
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = (x - lo) / (hi - lo);
end

Wolfram

code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / N[(hi - lo), $MachinePrecision]), $MachinePrecision]

Alternative 1: 19.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ {\left(\frac{hi}{lo}\right)}^{2} \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 (pow (/ hi lo) 2.0))

C

double code(double lo, double hi, double x) {
	return pow((hi / lo), 2.0);
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = (hi / lo) ** 2.0d0
end function

Java

public static double code(double lo, double hi, double x) {
	return Math.pow((hi / lo), 2.0);
}

Python

def code(lo, hi, x):
	return math.pow((hi / lo), 2.0)

Julia

function code(lo, hi, x)
	return Float64(hi / lo) ^ 2.0
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = (hi / lo) ^ 2.0;
end

Wolfram

code[lo_, hi_, x_] := N[Power[N[(hi / lo), $MachinePrecision], 2.0], $MachinePrecision]

Derivation

1. Initial program 3.1%

   \[\frac{x - lo}{hi - lo} \]
2. Add Preprocessing

3. Taylor expanded in hi around 0 18.8%

   \[\leadsto \color{blue}{-1 \cdot \frac{x - lo}{lo} + hi \cdot \left(\left(\frac{1}{lo} + \frac{hi \cdot \left(\frac{1}{lo} - \frac{x}{{lo}^{2}}\right)}{lo}\right) - \frac{x}{{lo}^{2}}\right)} \]

4. Taylor expanded in lo around inf 18.8%

   \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \color{blue}{\frac{\left(1 + \frac{hi}{lo}\right) - \frac{x}{lo}}{lo}} \]
5. Step-by-step derivation

   1. associate--l+ 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \frac{\color{blue}{1 + \left(\frac{hi}{lo} - \frac{x}{lo}\right)}}{lo} \]

   2. div-sub 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \frac{1 + \color{blue}{\frac{hi - x}{lo}}}{lo} \]

6. Simplified 18.8%

   \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \color{blue}{\frac{1 + \frac{hi - x}{lo}}{lo}} \]
7. Step-by-step derivation

   1. log1p-expm1-u 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(hi \cdot \frac{1 + \frac{hi - x}{lo}}{lo}\right)\right)} \]

   2. log1p-undefine 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + \color{blue}{\log \left(1 + \mathsf{expm1}\left(hi \cdot \frac{1 + \frac{hi - x}{lo}}{lo}\right)\right)} \]

8. Applied egg-rr 18.8%

   \[\leadsto -1 \cdot \frac{x - lo}{lo} + \color{blue}{\log \left(1 + \mathsf{expm1}\left(hi \cdot \frac{1 + \frac{hi - x}{lo}}{lo}\right)\right)} \]

9. Taylor expanded in hi around inf 0.0%

   \[\leadsto \color{blue}{\frac{{hi}^{2}}{{lo}^{2}}} \]
10. Step-by-step derivation

    1. unpow2 0.0%

       \[\leadsto \frac{\color{blue}{hi \cdot hi}}{{lo}^{2}} \]

    2. unpow2 0.0%

       \[\leadsto \frac{hi \cdot hi}{\color{blue}{lo \cdot lo}} \]

    3. times-frac 19.5%

       \[\leadsto \color{blue}{\frac{hi}{lo} \cdot \frac{hi}{lo}} \]

    4. unpow2 19.5%

       \[\leadsto \color{blue}{{\left(\frac{hi}{lo}\right)}^{2}} \]

11. Simplified 19.5%

    \[\leadsto \color{blue}{{\left(\frac{hi}{lo}\right)}^{2}} \]
12. Add Preprocessing

Alternative 2: 18.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ 1 + \frac{hi \cdot \left(\frac{hi}{lo} + 1\right)}{lo} \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 (+ 1.0 (/ (* hi (+ (/ hi lo) 1.0)) lo)))

C

double code(double lo, double hi, double x) {
	return 1.0 + ((hi * ((hi / lo) + 1.0)) / lo);
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = 1.0d0 + ((hi * ((hi / lo) + 1.0d0)) / lo)
end function

Java

public static double code(double lo, double hi, double x) {
	return 1.0 + ((hi * ((hi / lo) + 1.0)) / lo);
}

Python

def code(lo, hi, x):
	return 1.0 + ((hi * ((hi / lo) + 1.0)) / lo)

Julia

function code(lo, hi, x)
	return Float64(1.0 + Float64(Float64(hi * Float64(Float64(hi / lo) + 1.0)) / lo))
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = 1.0 + ((hi * ((hi / lo) + 1.0)) / lo);
end

Wolfram

code[lo_, hi_, x_] := N[(1.0 + N[(N[(hi * N[(N[(hi / lo), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 3.1%

   \[\frac{x - lo}{hi - lo} \]
2. Add Preprocessing

3. Taylor expanded in hi around 0 18.8%

   \[\leadsto \color{blue}{-1 \cdot \frac{x - lo}{lo} + hi \cdot \left(\left(\frac{1}{lo} + \frac{hi \cdot \left(\frac{1}{lo} - \frac{x}{{lo}^{2}}\right)}{lo}\right) - \frac{x}{{lo}^{2}}\right)} \]

4. Taylor expanded in lo around inf 18.8%

   \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \color{blue}{\frac{\left(1 + \frac{hi}{lo}\right) - \frac{x}{lo}}{lo}} \]
5. Step-by-step derivation

   1. associate--l+ 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \frac{\color{blue}{1 + \left(\frac{hi}{lo} - \frac{x}{lo}\right)}}{lo} \]

   2. div-sub 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \frac{1 + \color{blue}{\frac{hi - x}{lo}}}{lo} \]

6. Simplified 18.8%

   \[\leadsto -1 \cdot \frac{x - lo}{lo} + hi \cdot \color{blue}{\frac{1 + \frac{hi - x}{lo}}{lo}} \]
7. Step-by-step derivation

   1. log1p-expm1-u 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(hi \cdot \frac{1 + \frac{hi - x}{lo}}{lo}\right)\right)} \]

   2. log1p-undefine 18.8%

      \[\leadsto -1 \cdot \frac{x - lo}{lo} + \color{blue}{\log \left(1 + \mathsf{expm1}\left(hi \cdot \frac{1 + \frac{hi - x}{lo}}{lo}\right)\right)} \]

8. Applied egg-rr 18.8%

   \[\leadsto -1 \cdot \frac{x - lo}{lo} + \color{blue}{\log \left(1 + \mathsf{expm1}\left(hi \cdot \frac{1 + \frac{hi - x}{lo}}{lo}\right)\right)} \]

9. Taylor expanded in x around 0 18.9%

   \[\leadsto \color{blue}{1 + \frac{hi \cdot \left(1 + \frac{hi}{lo}\right)}{lo}} \]

10. Final simplification 18.9%

    \[\leadsto 1 + \frac{hi \cdot \left(\frac{hi}{lo} + 1\right)}{lo} \]
11. Add Preprocessing

Alternative 3: 18.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{hi} - \frac{lo}{hi} \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 (- (/ x hi) (/ lo hi)))

C

double code(double lo, double hi, double x) {
	return (x / hi) - (lo / hi);
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = (x / hi) - (lo / hi)
end function

Java

public static double code(double lo, double hi, double x) {
	return (x / hi) - (lo / hi);
}

Python

def code(lo, hi, x):
	return (x / hi) - (lo / hi)

Julia

function code(lo, hi, x)
	return Float64(Float64(x / hi) - Float64(lo / hi))
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = (x / hi) - (lo / hi);
end

Wolfram

code[lo_, hi_, x_] := N[(N[(x / hi), $MachinePrecision] - N[(lo / hi), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 3.1%

   \[\frac{x - lo}{hi - lo} \]
2. Add Preprocessing

3. Taylor expanded in lo around 0 18.8%

   \[\leadsto \color{blue}{-1 \cdot \left(lo \cdot \left(-1 \cdot \frac{x}{{hi}^{2}} + \frac{1}{hi}\right)\right) + \frac{x}{hi}} \]
4. Step-by-step derivation

   1. +-commutative 18.8%

      \[\leadsto \color{blue}{\frac{x}{hi} + -1 \cdot \left(lo \cdot \left(-1 \cdot \frac{x}{{hi}^{2}} + \frac{1}{hi}\right)\right)} \]

   2. mul-1-neg 18.8%

      \[\leadsto \frac{x}{hi} + \color{blue}{\left(-lo \cdot \left(-1 \cdot \frac{x}{{hi}^{2}} + \frac{1}{hi}\right)\right)} \]

   3. unsub-neg 18.8%

      \[\leadsto \color{blue}{\frac{x}{hi} - lo \cdot \left(-1 \cdot \frac{x}{{hi}^{2}} + \frac{1}{hi}\right)} \]

   4. +-commutative 18.8%

      \[\leadsto \frac{x}{hi} - lo \cdot \color{blue}{\left(\frac{1}{hi} + -1 \cdot \frac{x}{{hi}^{2}}\right)} \]

   5. mul-1-neg 18.8%

      \[\leadsto \frac{x}{hi} - lo \cdot \left(\frac{1}{hi} + \color{blue}{\left(-\frac{x}{{hi}^{2}}\right)}\right) \]

   6. unsub-neg 18.8%

      \[\leadsto \frac{x}{hi} - lo \cdot \color{blue}{\left(\frac{1}{hi} - \frac{x}{{hi}^{2}}\right)} \]

5. Simplified 18.8%

   \[\leadsto \color{blue}{\frac{x}{hi} - lo \cdot \left(\frac{1}{hi} - \frac{x}{{hi}^{2}}\right)} \]

6. Taylor expanded in hi around inf 18.8%

   \[\leadsto \frac{x}{hi} - \color{blue}{\frac{lo}{hi}} \]
7. Add Preprocessing

Alternative 4: 18.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \frac{lo}{-hi} \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 (/ lo (- hi)))

C

double code(double lo, double hi, double x) {
	return lo / -hi;
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = lo / -hi
end function

Java

public static double code(double lo, double hi, double x) {
	return lo / -hi;
}

Python

def code(lo, hi, x):
	return lo / -hi

Julia

function code(lo, hi, x)
	return Float64(lo / Float64(-hi))
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = lo / -hi;
end

Wolfram

code[lo_, hi_, x_] := N[(lo / (-hi)), $MachinePrecision]

Derivation

1. Initial program 3.1%

   \[\frac{x - lo}{hi - lo} \]
2. Add Preprocessing

3. Taylor expanded in hi around inf 18.7%

   \[\leadsto \color{blue}{\frac{x - lo}{hi}} \]

4. Taylor expanded in x around 0 18.8%

   \[\leadsto \color{blue}{-1 \cdot \frac{lo}{hi}} \]
5. Step-by-step derivation

   1. neg-mul-1 18.8%

      \[\leadsto \color{blue}{-\frac{lo}{hi}} \]

   2. distribute-neg-frac 18.8%

      \[\leadsto \color{blue}{\frac{-lo}{hi}} \]

6. Simplified 18.8%

   \[\leadsto \color{blue}{\frac{-lo}{hi}} \]

7. Final simplification 18.8%

   \[\leadsto \frac{lo}{-hi} \]
8. Add Preprocessing

Alternative 5: 18.7% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (lo hi x) :precision binary64 1.0)

C

double code(double lo, double hi, double x) {
	return 1.0;
}

Fortran

real(8) function code(lo, hi, x)
    real(8), intent (in) :: lo
    real(8), intent (in) :: hi
    real(8), intent (in) :: x
    code = 1.0d0
end function

Java

public static double code(double lo, double hi, double x) {
	return 1.0;
}

Python

def code(lo, hi, x):
	return 1.0

Julia

function code(lo, hi, x)
	return 1.0
end

MATLAB

function tmp = code(lo, hi, x)
	tmp = 1.0;
end

Wolfram

code[lo_, hi_, x_] := 1.0

Derivation

1. Initial program 3.1%

   \[\frac{x - lo}{hi - lo} \]
2. Add Preprocessing

3. Taylor expanded in lo around inf 18.7%

   \[\leadsto \color{blue}{1} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024140 
(FPCore (lo hi x)
  :name "xlohi (overflows)"
  :precision binary64
  :pre (and (< lo -1e+308) (> hi 1e+308))
  (/ (- x lo) (- hi lo)))