[libclc] fb5a87e - [libclc][NFC] Reformat ep_log.cl

[Fraser Cormack via cfe-commits]

Author: Fraser Cormack
Date: 2025-02-19T15:18:05Z
New Revision: fb5a87e1a6febb2a81fd85f800e78c2e6dff5715

URL: https://github.com/llvm/llvm-project/commit/fb5a87e1a6febb2a81fd85f800e78c2e6dff5715
DIFF: https://github.com/llvm/llvm-project/commit/fb5a87e1a6febb2a81fd85f800e78c2e6dff5715.diff

LOG: [libclc][NFC] Reformat ep_log.cl

Added: 
    

Modified: 
    libclc/generic/lib/math/ep_log.cl

Removed: 
    


################################################################################
diff  --git a/libclc/generic/lib/math/ep_log.cl b/libclc/generic/lib/math/ep_log.cl
index 90c9fa426fec1..65db94a85b9b4 100644
--- a/libclc/generic/lib/math/ep_log.cl
+++ b/libclc/generic/lib/math/ep_log.cl
@@ -38,57 +38,56 @@
 #define LF1 1.24999999978138668903e-02
 #define LF2 2.23219810758559851206e-03
 
-_CLC_DEF void __clc_ep_log(double x, int *xexp, double *r1, double *r2)
-{
-    // Computes natural log(x). Algorithm based on:
-    // Ping-Tak Peter Tang
-    // "Table-driven implementation of the logarithm function in IEEE
-    // floating-point arithmetic"
-    // ACM Transactions on Mathematical Software (TOMS)
-    // Volume 16, Issue 4 (December 1990)
-    int near_one = x >= 0x1.e0faap-1 & x <= 0x1.1082cp+0;
-
-    ulong ux = as_ulong(x);
-    ulong uxs = as_ulong(as_double(0x03d0000000000000UL | ux) - 0x1.0p-962);
-    int c = ux < IMPBIT_DP64;
-    ux = c ? uxs : ux;
-    int expadjust = c ? 60 : 0;
-
-    // Store the exponent of x in xexp and put f into the range [0.5,1)
-    int xexp1 = ((as_int2(ux).hi >> 20) & 0x7ff) - EXPBIAS_DP64 - expadjust;
-    double f = as_double(HALFEXPBITS_DP64 | (ux & MANTBITS_DP64));
-    *xexp = near_one ? 0 : xexp1;
-
-    double r = x - 1.0;
-    double u1 = MATH_DIVIDE(r, 2.0 + r);
-    double ru1 = -r * u1;
-    u1 = u1 + u1;
-
-    int index = as_int2(ux).hi >> 13;
-    index = ((0x80 | (index & 0x7e)) >> 1) + (index & 0x1);
-
-    double f1 = index * 0x1.0p-7;
-    double f2 = f - f1;
-    double u2 = MATH_DIVIDE(f2, fma(0.5, f2, f1));
-
-    double2 tv = USE_TABLE(ln_tbl, (index - 64));
-    double z1 = tv.s0;
-    double q = tv.s1;
-
-    z1 = near_one ? r : z1;
-    q = near_one ? 0.0 : q;
-    double u = near_one ? u1 : u2;
-    double v = u*u;
-
-    double cc = near_one ? ru1 : u2;
-
-    double z21 = fma(v, fma(v, fma(v, LN3, LN2), LN1), LN0);
-    double z22 = fma(v, fma(v, LF2, LF1), LF0);
-    double z2 = near_one ? z21 : z22;
-    z2 = fma(u*v, z2, cc) + q;
-
-    *r1 = z1;
-    *r2 = z2;
+_CLC_DEF void __clc_ep_log(double x, int *xexp, double *r1, double *r2) {
+  // Computes natural log(x). Algorithm based on:
+  // Ping-Tak Peter Tang
+  // "Table-driven implementation of the logarithm function in IEEE
+  // floating-point arithmetic"
+  // ACM Transactions on Mathematical Software (TOMS)
+  // Volume 16, Issue 4 (December 1990)
+  int near_one = x >= 0x1.e0faap-1 & x <= 0x1.1082cp+0;
+
+  ulong ux = as_ulong(x);
+  ulong uxs = as_ulong(as_double(0x03d0000000000000UL | ux) - 0x1.0p-962);
+  int c = ux < IMPBIT_DP64;
+  ux = c ? uxs : ux;
+  int expadjust = c ? 60 : 0;
+
+  // Store the exponent of x in xexp and put f into the range [0.5,1)
+  int xexp1 = ((as_int2(ux).hi >> 20) & 0x7ff) - EXPBIAS_DP64 - expadjust;
+  double f = as_double(HALFEXPBITS_DP64 | (ux & MANTBITS_DP64));
+  *xexp = near_one ? 0 : xexp1;
+
+  double r = x - 1.0;
+  double u1 = MATH_DIVIDE(r, 2.0 + r);
+  double ru1 = -r * u1;
+  u1 = u1 + u1;
+
+  int index = as_int2(ux).hi >> 13;
+  index = ((0x80 | (index & 0x7e)) >> 1) + (index & 0x1);
+
+  double f1 = index * 0x1.0p-7;
+  double f2 = f - f1;
+  double u2 = MATH_DIVIDE(f2, fma(0.5, f2, f1));
+
+  double2 tv = USE_TABLE(ln_tbl, (index - 64));
+  double z1 = tv.s0;
+  double q = tv.s1;
+
+  z1 = near_one ? r : z1;
+  q = near_one ? 0.0 : q;
+  double u = near_one ? u1 : u2;
+  double v = u * u;
+
+  double cc = near_one ? ru1 : u2;
+
+  double z21 = fma(v, fma(v, fma(v, LN3, LN2), LN1), LN0);
+  double z22 = fma(v, fma(v, LF2, LF1), LF0);
+  double z2 = near_one ? z21 : z22;
+  z2 = fma(u * v, z2, cc) + q;
+
+  *r1 = z1;
+  *r2 = z2;
 }
 
 #endif