Linear.Quaternion:$clog from linear-1.19.1.3

Percentage Accurate: 69.2% → 99.8%

Time: 3.2s

Alternatives: 6

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \sqrt{x \cdot x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (+ (* x x) y)))

C

double code(double x, double y) {
	return sqrt(((x * x) + y));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(((x * x) + y))
end function

Java

public static double code(double x, double y) {
	return Math.sqrt(((x * x) + y));
}

Python

def code(x, y):
	return math.sqrt(((x * x) + y))

Julia

function code(x, y)
	return sqrt(Float64(Float64(x * x) + y))
end

MATLAB

function tmp = code(x, y)
	tmp = sqrt(((x * x) + y));
end

Wolfram

code[x_, y_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]

Initial Program: 69.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{x \cdot x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (+ (* x x) y)))

C

double code(double x, double y) {
	return sqrt(((x * x) + y));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(((x * x) + y))
end function

Java

public static double code(double x, double y) {
	return Math.sqrt(((x * x) + y));
}

Python

def code(x, y):
	return math.sqrt(((x * x) + y))

Julia

function code(x, y)
	return sqrt(Float64(Float64(x * x) + y))
end

MATLAB

function tmp = code(x, y)
	tmp = sqrt(((x * x) + y));
end

Wolfram

code[x_, y_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]

Alternative 1: 99.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \cdot x\_m \leq 2 \cdot 10^{+231}:\\ \;\;\;\;\sqrt{x\_m \cdot x\_m + y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{0.5}{x\_m}, x\_m\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= (* x_m x_m) 2e+231) (sqrt (+ (* x_m x_m) y)) (fma y (/ 0.5 x_m) x_m)))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if ((x_m * x_m) <= 2e+231) {
		tmp = sqrt(((x_m * x_m) + y));
	} else {
		tmp = fma(y, (0.5 / x_m), x_m);
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (Float64(x_m * x_m) <= 2e+231)
		tmp = sqrt(Float64(Float64(x_m * x_m) + y));
	else
		tmp = fma(y, Float64(0.5 / x_m), x_m);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[N[(x$95$m * x$95$m), $MachinePrecision], 2e+231], N[Sqrt[N[(N[(x$95$m * x$95$m), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision], N[(y * N[(0.5 / x$95$m), $MachinePrecision] + x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 2.0000000000000001e231

   1. Initial program 100.0%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   if 2.0000000000000001e231 < (*.f64 x x)

   1. Initial program 25.7%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

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

      3. +-commutative N/A

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

      4. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2} \cdot y}{{x}^{2}}} \cdot x + x \]

      5. associate-*l/ N/A

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

      6. unpow2 N/A

         \[\leadsto \frac{\left(\frac{1}{2} \cdot y\right) \cdot x}{\color{blue}{x \cdot x}} + x \]

      7. times-frac N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2} \cdot y}{x} \cdot \frac{x}{x}} + x \]

      8. *-inverses N/A

         \[\leadsto \frac{\frac{1}{2} \cdot y}{x} \cdot \color{blue}{1} + x \]

      9. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{\left(\frac{1}{2} \cdot y\right) \cdot 1}{x}} + x \]

      10. associate-*r/ N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot y\right) \cdot \frac{1}{x}} + x \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(y \cdot \frac{1}{2}\right)} \cdot \frac{1}{x} + x \]

      12. associate-*r* N/A

          \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} \cdot \frac{1}{x}\right)} + x \]

      13. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{1}{2} \cdot \frac{1}{x}, x\right)} \]

      14. associate-*r/ N/A

          \[\leadsto \mathsf{fma}\left(y, \color{blue}{\frac{\frac{1}{2} \cdot 1}{x}}, x\right) \]

      15. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(y, \frac{\color{blue}{\frac{1}{2}}}{x}, x\right) \]

      16. lower-/.f64 54.5

          \[\leadsto \mathsf{fma}\left(y, \color{blue}{\frac{0.5}{x}}, x\right) \]

   5. Applied rewrites 54.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{0.5}{x}, x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \cdot x\_m \leq 2 \cdot 10^{+231}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(x\_m, x\_m, y\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{0.5}{x\_m}, x\_m\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= (* x_m x_m) 2e+231) (sqrt (fma x_m x_m y)) (fma y (/ 0.5 x_m) x_m)))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if ((x_m * x_m) <= 2e+231) {
		tmp = sqrt(fma(x_m, x_m, y));
	} else {
		tmp = fma(y, (0.5 / x_m), x_m);
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (Float64(x_m * x_m) <= 2e+231)
		tmp = sqrt(fma(x_m, x_m, y));
	else
		tmp = fma(y, Float64(0.5 / x_m), x_m);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[N[(x$95$m * x$95$m), $MachinePrecision], 2e+231], N[Sqrt[N[(x$95$m * x$95$m + y), $MachinePrecision]], $MachinePrecision], N[(y * N[(0.5 / x$95$m), $MachinePrecision] + x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 2.0000000000000001e231

   1. Initial program 100.0%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x + y}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x} + y} \]

      3. lower-fma.f64 100.0

         \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

   4. Applied rewrites 100.0%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

   if 2.0000000000000001e231 < (*.f64 x x)

   1. Initial program 25.7%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

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

      3. +-commutative N/A

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

      4. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2} \cdot y}{{x}^{2}}} \cdot x + x \]

      5. associate-*l/ N/A

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

      6. unpow2 N/A

         \[\leadsto \frac{\left(\frac{1}{2} \cdot y\right) \cdot x}{\color{blue}{x \cdot x}} + x \]

      7. times-frac N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2} \cdot y}{x} \cdot \frac{x}{x}} + x \]

      8. *-inverses N/A

         \[\leadsto \frac{\frac{1}{2} \cdot y}{x} \cdot \color{blue}{1} + x \]

      9. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{\left(\frac{1}{2} \cdot y\right) \cdot 1}{x}} + x \]

      10. associate-*r/ N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot y\right) \cdot \frac{1}{x}} + x \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(y \cdot \frac{1}{2}\right)} \cdot \frac{1}{x} + x \]

      12. associate-*r* N/A

          \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} \cdot \frac{1}{x}\right)} + x \]

      13. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{1}{2} \cdot \frac{1}{x}, x\right)} \]

      14. associate-*r/ N/A

          \[\leadsto \mathsf{fma}\left(y, \color{blue}{\frac{\frac{1}{2} \cdot 1}{x}}, x\right) \]

      15. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(y, \frac{\color{blue}{\frac{1}{2}}}{x}, x\right) \]

      16. lower-/.f64 54.5

          \[\leadsto \mathsf{fma}\left(y, \color{blue}{\frac{0.5}{x}}, x\right) \]

   5. Applied rewrites 54.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{0.5}{x}, x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 53.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;y \leq 2.5 \cdot 10^{-144}:\\ \;\;\;\;\sqrt{x\_m \cdot x\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{y}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= y 2.5e-144) (sqrt (* x_m x_m)) (sqrt y)))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if (y <= 2.5e-144) {
		tmp = sqrt((x_m * x_m));
	} else {
		tmp = sqrt(y);
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 2.5d-144) then
        tmp = sqrt((x_m * x_m))
    else
        tmp = sqrt(y)
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	double tmp;
	if (y <= 2.5e-144) {
		tmp = Math.sqrt((x_m * x_m));
	} else {
		tmp = Math.sqrt(y);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	tmp = 0
	if y <= 2.5e-144:
		tmp = math.sqrt((x_m * x_m))
	else:
		tmp = math.sqrt(y)
	return tmp

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (y <= 2.5e-144)
		tmp = sqrt(Float64(x_m * x_m));
	else
		tmp = sqrt(y);
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y)
	tmp = 0.0;
	if (y <= 2.5e-144)
		tmp = sqrt((x_m * x_m));
	else
		tmp = sqrt(y);
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[y, 2.5e-144], N[Sqrt[N[(x$95$m * x$95$m), $MachinePrecision]], $MachinePrecision], N[Sqrt[y], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.4999999999999999e-144

   1. Initial program 61.6%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \sqrt{\color{blue}{{x}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x}} \]

      2. lower-*.f64 53.8

         \[\leadsto \sqrt{\color{blue}{x \cdot x}} \]

   5. Applied rewrites 53.8%

      \[\leadsto \sqrt{\color{blue}{x \cdot x}} \]

   if 2.4999999999999999e-144 < y

   1. Initial program 79.7%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\sqrt{y}} \]
   4. Step-by-step derivation

      1. lower-sqrt.f64 65.9

         \[\leadsto \color{blue}{\sqrt{y}} \]

   5. Applied rewrites 65.9%

      \[\leadsto \color{blue}{\sqrt{y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 69.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \sqrt{\mathsf{fma}\left(x\_m, x\_m, y\right)} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (sqrt (fma x_m x_m y)))

C

x_m = fabs(x);
double code(double x_m, double y) {
	return sqrt(fma(x_m, x_m, y));
}

Julia

x_m = abs(x)
function code(x_m, y)
	return sqrt(fma(x_m, x_m, y))
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := N[Sqrt[N[(x$95$m * x$95$m + y), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 70.1%

   \[\sqrt{x \cdot x + y} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \sqrt{\color{blue}{x \cdot x + y}} \]

   2. lift-*.f64 N/A

      \[\leadsto \sqrt{\color{blue}{x \cdot x} + y} \]

   3. lower-fma.f64 70.1

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

4. Applied rewrites 70.1%

   \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]
5. Add Preprocessing

Alternative 5: 34.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \sqrt{y} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (sqrt y))

C

x_m = fabs(x);
double code(double x_m, double y) {
	return sqrt(y);
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    code = sqrt(y)
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	return Math.sqrt(y);
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	return math.sqrt(y)

Julia

x_m = abs(x)
function code(x_m, y)
	return sqrt(y)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m, y)
	tmp = sqrt(y);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := N[Sqrt[y], $MachinePrecision]

Derivation

1. Initial program 70.1%

   \[\sqrt{x \cdot x + y} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\sqrt{y}} \]
4. Step-by-step derivation

   1. lower-sqrt.f64 36.0

      \[\leadsto \color{blue}{\sqrt{y}} \]

5. Applied rewrites 36.0%

   \[\leadsto \color{blue}{\sqrt{y}} \]
6. Add Preprocessing

Alternative 6: 1.3% accurate, 6.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ -x\_m \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (- x_m))

C

x_m = fabs(x);
double code(double x_m, double y) {
	return -x_m;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    code = -x_m
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	return -x_m;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	return -x_m

Julia

x_m = abs(x)
function code(x_m, y)
	return Float64(-x_m)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m, y)
	tmp = -x_m;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := (-x$95$m)

Derivation

1. Initial program 70.1%

   \[\sqrt{x \cdot x + y} \]
2. Add Preprocessing

3. Taylor expanded in x around -inf

   \[\leadsto \color{blue}{-1 \cdot x} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

   2. lower-neg.f64 33.8

      \[\leadsto \color{blue}{-x} \]

5. Applied rewrites 33.8%

   \[\leadsto \color{blue}{-x} \]
6. Add Preprocessing

Developer Target 1: 98.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \frac{y}{x} + x\\ \mathbf{if}\;x < -1.5097698010472593 \cdot 10^{+153}:\\ \;\;\;\;-t\_0\\ \mathbf{elif}\;x < 5.582399551122541 \cdot 10^{+57}:\\ \;\;\;\;\sqrt{x \cdot x + y}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* 0.5 (/ y x)) x)))
   (if (< x -1.5097698010472593e+153)
     (- t_0)
     (if (< x 5.582399551122541e+57) (sqrt (+ (* x x) y)) t_0))))

C

double code(double x, double y) {
	double t_0 = (0.5 * (y / x)) + x;
	double tmp;
	if (x < -1.5097698010472593e+153) {
		tmp = -t_0;
	} else if (x < 5.582399551122541e+57) {
		tmp = sqrt(((x * x) + y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (0.5d0 * (y / x)) + x
    if (x < (-1.5097698010472593d+153)) then
        tmp = -t_0
    else if (x < 5.582399551122541d+57) then
        tmp = sqrt(((x * x) + y))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (0.5 * (y / x)) + x;
	double tmp;
	if (x < -1.5097698010472593e+153) {
		tmp = -t_0;
	} else if (x < 5.582399551122541e+57) {
		tmp = Math.sqrt(((x * x) + y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (0.5 * (y / x)) + x
	tmp = 0
	if x < -1.5097698010472593e+153:
		tmp = -t_0
	elif x < 5.582399551122541e+57:
		tmp = math.sqrt(((x * x) + y))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(0.5 * Float64(y / x)) + x)
	tmp = 0.0
	if (x < -1.5097698010472593e+153)
		tmp = Float64(-t_0);
	elseif (x < 5.582399551122541e+57)
		tmp = sqrt(Float64(Float64(x * x) + y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (0.5 * (y / x)) + x;
	tmp = 0.0;
	if (x < -1.5097698010472593e+153)
		tmp = -t_0;
	elseif (x < 5.582399551122541e+57)
		tmp = sqrt(((x * x) + y));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(0.5 * N[(y / x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[Less[x, -1.5097698010472593e+153], (-t$95$0), If[Less[x, 5.582399551122541e+57], N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2024233 
(FPCore (x y)
  :name "Linear.Quaternion:$clog from linear-1.19.1.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< x -1509769801047259300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* 1/2 (/ y x)) x)) (if (< x 5582399551122541000000000000000000000000000000000000000000) (sqrt (+ (* x x) y)) (+ (* 1/2 (/ y x)) x))))

  (sqrt (+ (* x x) y)))