mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 19:43:32 +00:00
550b52abf6
- Introduce epoll_pwait() - Rewrite -ftrapv and ffs() libraries in C code - Use more FreeBSD code in math function library - Get significantly more tests passing on qemu-aarch64 - Fix many Musl long double functions that were broken on AARCH64
107 lines
4.5 KiB
C
107 lines
4.5 KiB
C
/*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-│
|
||
│vi: set et ft=c ts=8 tw=8 fenc=utf-8 :vi│
|
||
╚──────────────────────────────────────────────────────────────────────────────╝
|
||
│ │
|
||
│ Optimized Routines │
|
||
│ Copyright (c) 1999-2022, Arm Limited. │
|
||
│ │
|
||
│ 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 "libc/intrin/likely.h"
|
||
#include "libc/math.h"
|
||
#include "libc/tinymath/internal.h"
|
||
#include "libc/tinymath/logf_data.internal.h"
|
||
|
||
asm(".ident\t\"\\n\\n\
|
||
Optimized Routines (MIT License)\\n\
|
||
Copyright 2022 ARM Limited\"");
|
||
asm(".include \"libc/disclaimer.inc\"");
|
||
// clang-format off
|
||
|
||
/*
|
||
* Single-precision log function.
|
||
*
|
||
* Copyright (c) 2017-2018, Arm Limited.
|
||
* SPDX-License-Identifier: MIT
|
||
*/
|
||
|
||
/*
|
||
LOGF_TABLE_BITS = 4
|
||
LOGF_POLY_ORDER = 4
|
||
|
||
ULP error: 0.818 (nearest rounding.)
|
||
Relative error: 1.957 * 2^-26 (before rounding.)
|
||
*/
|
||
|
||
#define T __logf_data.tab
|
||
#define A __logf_data.poly
|
||
#define Ln2 __logf_data.ln2
|
||
#define N (1 << LOGF_TABLE_BITS)
|
||
#define OFF 0x3f330000
|
||
|
||
/**
|
||
* Returns natural logarithm of 𝑥.
|
||
*/
|
||
float logf(float x)
|
||
{
|
||
double_t z, r, r2, y, y0, invc, logc;
|
||
uint32_t ix, iz, tmp;
|
||
int k, i;
|
||
|
||
ix = asuint(x);
|
||
/* Fix sign of zero with downward rounding when x==1. */
|
||
if (WANT_ROUNDING && UNLIKELY(ix == 0x3f800000))
|
||
return 0;
|
||
if (UNLIKELY(ix - 0x00800000 >= 0x7f800000 - 0x00800000)) {
|
||
/* x < 0x1p-126 or inf or nan. */
|
||
if (ix * 2 == 0)
|
||
return __math_divzerof(1);
|
||
if (ix == 0x7f800000) /* log(inf) == inf. */
|
||
return x;
|
||
if ((ix & 0x80000000) || ix * 2 >= 0xff000000)
|
||
return __math_invalidf(x);
|
||
/* x is subnormal, normalize it. */
|
||
ix = asuint(x * 0x1p23f);
|
||
ix -= 23 << 23;
|
||
}
|
||
|
||
/* x = 2^k z; where z is in range [OFF,2*OFF] and exact.
|
||
The range is split into N subintervals.
|
||
The ith subinterval contains z and c is near its center. */
|
||
tmp = ix - OFF;
|
||
i = (tmp >> (23 - LOGF_TABLE_BITS)) % N;
|
||
k = (int32_t)tmp >> 23; /* arithmetic shift */
|
||
iz = ix - (tmp & 0xff800000);
|
||
invc = T[i].invc;
|
||
logc = T[i].logc;
|
||
z = (double_t)asfloat(iz);
|
||
|
||
/* log(x) = log1p(z/c-1) + log(c) + k*Ln2 */
|
||
r = z * invc - 1;
|
||
y0 = logc + (double_t)k * Ln2;
|
||
|
||
/* Pipelined polynomial evaluation to approximate log1p(r). */
|
||
r2 = r * r;
|
||
y = A[1] * r + A[2];
|
||
y = A[0] * r2 + y;
|
||
y = y * r2 + (y0 + r);
|
||
return eval_as_float(y);
|
||
}
|