mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 03:27:39 +00:00
e557058ac8
This change addresses various open source compatibility issues, so that we pass 313/411 of the tests in https://github.com/jart/libc-test where earlier today we were passing about 30/411 of them, due to header toil. Please note that Glibc only passes 341/411 so 313 today is pretty good! - Make the conformance of libc/isystem/ headers nearly perfect - Import more of the remaining math library routines from Musl - Fix inconsistencies with type signatures of calls like umask - Write tests for getpriority/setpriority which work great now - conform to `struct sockaddr *` on remaining socket functions - Import a bunch of uninteresting stdlib functions e.g. rand48 - Introduce readdir_r, scandir, pthread_kill, sigsetjmp, etc.. Follow the instructions in our `tool/scripts/cosmocc` toolchain to run these tests yourself. You use `make CC=cosmocc` on the test repository
100 lines
3.9 KiB
C
100 lines
3.9 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-2014 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/ldshape.internal.h"
|
|
|
|
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
|
|
|
|
#if LDBL_MANT_DIG == 53 && LDBL_MAX_EXP == 1024
|
|
long double hypotl(long double x, long double y)
|
|
{
|
|
return hypot(x, y);
|
|
}
|
|
#elif (LDBL_MANT_DIG == 64 || LDBL_MANT_DIG == 113) && LDBL_MAX_EXP == 16384
|
|
#if LDBL_MANT_DIG == 64
|
|
#define SPLIT (0x1p32L+1)
|
|
#elif LDBL_MANT_DIG == 113
|
|
#define SPLIT (0x1p57L+1)
|
|
#endif
|
|
|
|
static void sq(long double *hi, long double *lo, long double x)
|
|
{
|
|
long double xh, xl, xc;
|
|
xc = x*SPLIT;
|
|
xh = x - xc + xc;
|
|
xl = x - xh;
|
|
*hi = x*x;
|
|
*lo = xh*xh - *hi + 2*xh*xl + xl*xl;
|
|
}
|
|
|
|
long double hypotl(long double x, long double y)
|
|
{
|
|
union ldshape ux = {x}, uy = {y};
|
|
int ex, ey;
|
|
long double hx, lx, hy, ly, z;
|
|
|
|
ux.i.se &= 0x7fff;
|
|
uy.i.se &= 0x7fff;
|
|
if (ux.i.se < uy.i.se) {
|
|
ex = uy.i.se;
|
|
ey = ux.i.se;
|
|
x = uy.f;
|
|
y = ux.f;
|
|
} else {
|
|
ex = ux.i.se;
|
|
ey = uy.i.se;
|
|
x = ux.f;
|
|
y = uy.f;
|
|
}
|
|
|
|
if (ex == 0x7fff && isinf(y))
|
|
return y;
|
|
if (ex == 0x7fff || y == 0)
|
|
return x;
|
|
if (ex - ey > LDBL_MANT_DIG)
|
|
return x + y;
|
|
|
|
z = 1;
|
|
if (ex > 0x3fff+8000) {
|
|
z = 0x1p10000L;
|
|
x *= 0x1p-10000L;
|
|
y *= 0x1p-10000L;
|
|
} else if (ey < 0x3fff-8000) {
|
|
z = 0x1p-10000L;
|
|
x *= 0x1p10000L;
|
|
y *= 0x1p10000L;
|
|
}
|
|
sq(&hx, &lx, x);
|
|
sq(&hy, &ly, y);
|
|
return z*sqrtl(ly+lx+hy+hx);
|
|
}
|
|
#endif
|