| /* |
| * Copyright (c) 2014 Advanced Micro Devices, Inc. |
| * |
| * Permission is hereby granted, free of charge, to any person obtaining a copy |
| * of this software and associated documentation files (the "Software"), to deal |
| * in the Software without restriction, including without limitation the rights |
| * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
| * copies of the Software, and to permit persons to whom the Software is |
| * furnished to do so, subject to the following conditions: |
| * |
| * The above copyright notice and this permission notice shall be included in |
| * all copies or substantial portions of the Software. |
| * |
| * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
| * THE SOFTWARE. |
| */ |
| |
| #include "math32.h" |
| |
| // Algorithm: |
| // |
| // x = (2^m)*A |
| // x = (2^m)*(G+g) with (1 <= G < 2) and (g <= 2^(-8)) |
| // x = (2^m)*2*(G/2+g/2) |
| // x = (2^m)*2*(F+f) with (0.5 <= F < 1) and (f <= 2^(-9)) |
| // |
| // Y = (2^(-1))*(2^(-m))*(2^m)*A |
| // Now, range of Y is: 0.5 <= Y < 1 |
| // |
| // F = 0x100 + (first 7 mantissa bits) + (8th mantissa bit) |
| // Now, range of F is: 128 <= F <= 256 |
| // F = F / 256 |
| // Now, range of F is: 0.5 <= F <= 1 |
| // |
| // f = (Y-F), with (f <= 2^(-9)) |
| // |
| // cbrt(x) = cbrt(2^m) * cbrt(2) * cbrt(F+f) |
| // cbrt(x) = cbrt(2^m) * cbrt(2) * cbrt(F) + cbrt(1+(f/F)) |
| // cbrt(x) = cbrt(2^m) * cbrt(2*F) * cbrt(1+r) |
| // |
| // r = (f/F), with (r <= 2^(-8)) |
| // r = f*(1/F) with (1/F) precomputed to avoid division |
| // |
| // cbrt(x) = cbrt(2^m) * cbrt(G) * (1+poly) |
| // |
| // poly = c1*r + c2*(r^2) + c3*(r^3) + c4*(r^4) + c5*(r^5) + c6*(r^6) |
| |
| __attribute__((overloadable)) float |
| cbrt(float x) |
| { |
| USE_TABLE(float2, p_cbrt, CBRT_TBL); |
| USE_TABLE(float, p_log_inv, LOG_INV_TBL); |
| |
| uint xi = as_uint(x); |
| uint axi = xi & EXSIGNBIT_SP32; |
| uint xsign = axi ^ xi; |
| xi = axi; |
| |
| int m = (xi >> EXPSHIFTBITS_SP32) - EXPBIAS_SP32; |
| |
| // Treat subnormals |
| uint xisub = as_uint(as_float(xi | 0x3f800000) - 1.0f); |
| int msub = (xisub >> EXPSHIFTBITS_SP32) - 253; |
| int c = m == -127; |
| xi = c ? xisub : xi; |
| m = c ? msub : m; |
| |
| int m3 = m / 3; |
| int rem = m - m3*3; |
| float mf = as_float((m3 + EXPBIAS_SP32) << EXPSHIFTBITS_SP32); |
| |
| uint indx = (xi & 0x007f0000) + ((xi & 0x00008000) << 1); |
| float f = as_float((xi & MANTBITS_SP32) | 0x3f000000) - as_float(indx | 0x3f000000); |
| |
| indx >>= 16; |
| float r = f * p_log_inv[indx]; |
| float poly = mad(mad(r, 0x1.f9add4p-5f, -0x1.c71c72p-4f), r*r, r * 0x1.555556p-2f); |
| |
| // This could also be done with a 5-element table |
| float remH = 0x1.428000p-1f; |
| float remT = 0x1.45f31ap-14f; |
| |
| remH = rem == -1 ? 0x1.964000p-1f : remH; |
| remT = rem == -1 ? 0x1.fea53ep-13f : remT; |
| |
| remH = rem == 0 ? 0x1.000000p+0f : remH; |
| remT = rem == 0 ? 0x0.000000p+0f : remT; |
| |
| remH = rem == 1 ? 0x1.428000p+0f : remH; |
| remT = rem == 1 ? 0x1.45f31ap-13f : remT; |
| |
| remH = rem == 2 ? 0x1.964000p+0f : remH; |
| remT = rem == 2 ? 0x1.fea53ep-12f : remT; |
| |
| float2 tv = p_cbrt[indx]; |
| float cbrtH = tv.s0; |
| float cbrtT = tv.s1; |
| |
| float bH = cbrtH * remH; |
| float bT = mad(cbrtH, remT, mad(cbrtT, remH, cbrtT*remT)); |
| |
| float z = mad(poly, bH, mad(poly, bT, bT)) + bH; |
| z *= mf; |
| z = as_float(as_uint(z) | xsign); |
| c = axi >= EXPBITS_SP32 | axi == 0; |
| z = c ? x : z; |
| return z; |
| } |
| |