mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 11:37:35 +00:00
394d998315
At least in neovim, `│vi:` is not recognized as a modeline because it has no preceding whitespace. After fixing this, opening a file yields an error because `net` is not an option. (`noet`, however, is.)
91 lines
4.7 KiB
C
91 lines
4.7 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 │
|
|
╚──────────────────────────────────────────────────────────────────────────────╝
|
|
│ │
|
|
│ Musl Libc │
|
|
│ Copyright © 2005-2020 Rich Felker, et al. │
|
|
│ │
|
|
│ 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/math.h"
|
|
#include "libc/tinymath/kernel.internal.h"
|
|
|
|
asm(".ident\t\"\\n\\n\
|
|
fdlibm (fdlibm license)\\n\
|
|
Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.\"");
|
|
asm(".ident\t\"\\n\\n\
|
|
Musl libc (MIT License)\\n\
|
|
Copyright 2005-2014 Rich Felker, et. al.\"");
|
|
asm(".include \"libc/disclaimer.inc\"");
|
|
/* clang-format off */
|
|
|
|
/* origin: FreeBSD /usr/src/lib/msun/src/k_tanf.c */
|
|
/*
|
|
* Conversion to float by Ian Lance Taylor, Cygnus Support, ian@cygnus.com.
|
|
* Optimized by Bruce D. Evans.
|
|
*/
|
|
/*
|
|
* ====================================================
|
|
* Copyright 2004 Sun Microsystems, Inc. All Rights Reserved.
|
|
*
|
|
* Permission to use, copy, modify, and distribute this
|
|
* software is freely granted, provided that this notice
|
|
* is preserved.
|
|
* ====================================================
|
|
*/
|
|
|
|
/* |tan(x)/x - t(x)| < 2**-25.5 (~[-2e-08, 2e-08]). */
|
|
static const double T[] = {
|
|
0x15554d3418c99f.0p-54, /* 0.333331395030791399758 */
|
|
0x1112fd38999f72.0p-55, /* 0.133392002712976742718 */
|
|
0x1b54c91d865afe.0p-57, /* 0.0533812378445670393523 */
|
|
0x191df3908c33ce.0p-58, /* 0.0245283181166547278873 */
|
|
0x185dadfcecf44e.0p-61, /* 0.00297435743359967304927 */
|
|
0x1362b9bf971bcd.0p-59, /* 0.00946564784943673166728 */
|
|
};
|
|
|
|
float __tandf(double x, int odd)
|
|
{
|
|
double_t z,r,w,s,t,u;
|
|
|
|
z = x*x;
|
|
/*
|
|
* Split up the polynomial into small independent terms to give
|
|
* opportunities for parallel evaluation. The chosen splitting is
|
|
* micro-optimized for Athlons (XP, X64). It costs 2 multiplications
|
|
* relative to Horner's method on sequential machines.
|
|
*
|
|
* We add the small terms from lowest degree up for efficiency on
|
|
* non-sequential machines (the lowest degree terms tend to be ready
|
|
* earlier). Apart from this, we don't care about order of
|
|
* operations, and don't need to to care since we have precision to
|
|
* spare. However, the chosen splitting is good for accuracy too,
|
|
* and would give results as accurate as Horner's method if the
|
|
* small terms were added from highest degree down.
|
|
*/
|
|
r = T[4] + z*T[5];
|
|
t = T[2] + z*T[3];
|
|
w = z*z;
|
|
s = z*x;
|
|
u = T[0] + z*T[1];
|
|
r = (x + s*u) + (s*w)*(t + w*r);
|
|
return odd ? -1.0/r : r;
|
|
}
|