| Commit message (Expand) | Author | Files | Lines |
|---|
| 2012-03-22 | tgmath.h: suppress any existing macro definitions before defining macros•••this is necessary so that we can freely add macro versions of some of
the math/complex functions without worrying about breaking tgmath.
| Rich Felker | 1 | -0/+63 |
| 2012-03-22 | acos.s fix: use the formula acos(x) = atan2(sqrt(1-x),sqrt(1+x))•••the old formula atan2(1,sqrt((1+x)/(1-x))) was faster but
could give nan result at x=1 when the rounding mode is
FE_DOWNWARD (so 1-1 == -0 and 2/-0 == -inf), the new formula
gives -0 at x=+-1 with downward rounding.
| nsz | 2 | -6/+2 |
| 2012-03-22 | sysconf support for dynamic limits (open files and processes) | Rich Felker | 1 | -2/+9 |
| 2012-03-21 | fix DECIMAL_DIG definitions•••DECIMAL_DIG is not the same as LDBL_DIG
type_DIG is the maximimum number of decimal digits that can survive a
round trip from decimal to type and back to decimal.
DECIMAL_DIG is the minimum number of decimal digits required in order
for any floating point type to survive the round trip to decimal and
back, and it is generally larger than LDBL_DIG. since the exact
formula is non-trivial, and defining it larger than necessary may be
legal but wasteful, just define the right value in bits/float.h.
| Rich Felker | 4 | -2/+6 |
| 2012-03-21 | initial, very primitive strfmon | Rich Felker | 2 | -0/+98 |
| 2012-03-20 | x86_64 math asm, long double functions only•••this has not been tested heavily, but it's known to at least assemble
and run in basic usage cases. it's nearly identical to the
corresponding i386 code, and thus expected to be just as correct or
just as incorrect.
| Rich Felker | 17 | -0/+239 |
| 2012-03-20 | limits.h: support gcc's -funsigned-char•••some software apparently uses this and breaks with musl due to
mismatching definitions...
| Rich Felker | 1 | -2/+10 |
| 2012-03-20 | upgrade to latest upstream TRE regex code (0.8.0)•••the main practical results of this change are
1. the regex code is no longer subject to LGPL; it's now 2-clause BSD
2. most (all?) popular nonstandard regex extensions are supported
I hesitate to call this a "sync" since both the old and new code are
heavily modified. in one sense, the old code was "more severely"
modified, in that it was actively hostile to non-strictly-conforming
expressions. on the other hand, the new code has eliminated the
useless translation of the entire regex string to wchar_t prior to
compiling, and now only converts multibyte character literals as
needed.
in the future i may use this modified TRE as a basis for writing the
long-planned new regex engine that will avoid multibyte-to-wide
character conversion entirely by compiling multibyte bracket
expressions specific to UTF-8.
| Rich Felker | 5 | -1155/+1024 |
| 2012-03-20 | nearbyint optimization (only clear inexact when necessary)•••old code saved/restored the fenv (the new code is only as slow
as that when inexact is not set before the call, but some other
flag is set and the rounding is inexact, which is rare)
before:
bench_nearbyint_exact 5000000 N 261 ns/op
bench_nearbyint_inexact_set 5000000 N 262 ns/op
bench_nearbyint_inexact_unset 5000000 N 261 ns/op
after:
bench_nearbyint_exact 10000000 N 94.99 ns/op
bench_nearbyint_inexact_set 25000000 N 65.81 ns/op
bench_nearbyint_inexact_unset 10000000 N 94.97 ns/op
| nsz | 3 | -19/+29 |
| 2012-03-20 | remove a fixme comment | nsz | 3 | -3/+2 |
| 2012-03-20 | clean up pow.c and powf.c•••fix comments about special cases
| nsz | 2 | -57/+43 |
| 2012-03-20 | clean up powl.c•••fix special cases, use multiplication instead of scalbnl
| nsz | 1 | -92/+47 |
| 2012-03-20 | fix a cbrtl.c regression and remove x87 precision setting | nsz | 1 | -27/+6 |
| 2012-03-20 | optimize scalbn family•••the fscale instruction is slow everywhere, probably because it
involves a costly and unnecessary integer truncation operation that
ends up being a no-op in common usages. instead, construct a floating
point scale value with integer arithmetic and simply multiply by it,
when possible.
for float and double, this is always possible by going to the
next-larger type. we use some cheap but effective saturating
arithmetic tricks to make sure even very large-magnitude exponents
fit. for long double, if the scaling exponent is too large to fit in
the exponent of a long double value, we simply fallback to the
expensive fscale method.
on atom cpu, these changes speed up scalbn by over 30%. (min rdtsc
timing dropped from 110 cycles to 70 cycles.)
| Rich Felker | 3 | -7/+46 |
| 2012-03-19 | remquo asm: return quotient mod 8, as intended by the spec•••this is a lot more efficient and also what is generally wanted.
perhaps the bit shuffling could be more efficient...
| Rich Felker | 1 | -17/+26 |
| 2012-03-19 | use alternate formula for acos asm to avoid loss of precision | Rich Felker | 1 | -3/+11 |
| 2012-03-19 | fix exp asm•••exponents (base 2) near 16383 were broken due to (1) wrong cutoff, and
(2) inability to fit the necessary range of scalings into a long
double value.
as a solution, we fall back to using frndint/fscale for insanely large
exponents, and also have to special-case infinities here to avoid
inf-inf generating nan.
thankfully the costly code never runs in normal usage cases.
| Rich Felker | 1 | -23/+22 |
| 2012-03-19 | code cleanup of named constants•••zero, one, two, half are replaced by const literals
The policy was to use the f suffix for float consts (1.0f),
but don't use suffix for long double consts (these consts
can be exactly represented as double).
| nsz | 73 | -623/+513 |
| 2012-03-19 | fix remainder*.c: remove useless long double cast | nsz | 2 | -15/+6 |
| 2012-03-19 | don't try to create non-standard denormalization signal•••Underflow exception is only raised when the result is
invalid, but fmod is always exact. x87 has a denormalization
exception, but that's nonstandard. And the superflous *1.0
will be optimized away by any compiler that does not honor
signaling nans.
| nsz | 3 | -7/+4 |
| 2012-03-19 | new modff.c code, fix nan handling in modfl | nsz | 2 | -44/+26 |
| 2012-03-19 | use scalbn or *2.0 instead of ldexp, fix fmal•••Some code assumed ldexp(x, 1) is faster than 2.0*x,
but ldexp is a wrapper around scalbn which uses
multiplications inside, so this optimization is
wrong.
This commit also fixes fmal which accidentally
used ldexp instead of ldexpl loosing precision.
There are various additional changes from the
work-in-progress const cleanups.
| nsz | 8 | -101/+102 |
| 2012-03-19 | fix long double const workaround in cbrtl | nsz | 1 | -5/+1 |
| 2012-03-19 | don't inline __rem_pio2l so the code size is smaller | nsz | 6 | -9/+2 |
| 2012-03-19 | minor fix in __tanl (get sign properly) | nsz | 1 | -2/+1 |
| 2012-03-19 | bug fix: wrong opcode for writing long long | Rich Felker | 2 | -2/+2 |
| 2012-03-19 | remove long double const workarounds•••Some long double consts were stored in two doubles as a workaround
for x86_64 and i386 with the following comment:
/* Long double constants are slow on these arches, and broken on i386. */
This is most likely old gcc bug related to the default x87 fpu
precision setting (it's double instead of double extended on BSD).
| nsz | 6 | -79/+2 |
| 2012-03-19 | fix erfl wrapper for long double==double case | nsz | 1 | -1/+1 |
| 2012-03-19 | asm for log1p | Rich Felker | 3 | -0/+45 |
| 2012-03-19 | asm for log2 | Rich Felker | 3 | -0/+21 |
| 2012-03-19 | asm for remquo•••this could perhaps use some additional testing for corner cases, but
it seems to be correct.
| Rich Felker | 3 | -0/+43 |
| 2012-03-19 | optimize exponential asm for i386•••up to 30% faster exp2 by avoiding slow frndint and fscale functions.
expm1 also takes a much more direct path for small arguments (the
expected usage case).
| Rich Felker | 2 | -58/+77 |
| 2012-03-19 | fix broken modf family functions | Rich Felker | 3 | -27/+66 |
| 2012-03-19 | asm for modf functions | Rich Felker | 3 | -0/+45 |
| 2012-03-19 | simplify scalbn*.c implementations•••The old scalbn.c was wrong and slow, the new one is just slow.
(scalbn(0x1p+1023,-2097) should give 0x1p-1074, but the old code gave 0)
| nsz | 3 | -152/+65 |
| 2012-03-19 | asm for floor/ceil/trunc | Rich Felker | 9 | -0/+75 |
| 2012-03-19 | asm for scalbn family•••unlike some implementations, these functions perform the equivalent of
gcc's -ffloat-store on the result before returning. this is necessary
to raise underflow/overflow/inexact exceptions, perform the correct
rounding with denormals, etc.
| Rich Felker | 9 | -0/+64 |
| 2012-03-19 | asm for inverse trig functions•••unlike trig functions, these are easy to do in asm because they do not
involve (arbitrary-precision) argument reduction. fpatan automatically
takes care of domain issues, and in asin and acos, fsqrt takes care of
them for us.
| Rich Felker | 12 | -0/+93 |
| 2012-03-18 | asm for log functions | Rich Felker | 6 | -0/+42 |
| 2012-03-18 | fix broken exponential asm•••infinities were getting converted into nans. the new code simply tests
for infinity and replaces it with a large magnitude value of the same
sign.
also, the fcomi instruction is apparently not part of the i387
instruction set, so avoid using it.
| Rich Felker | 2 | -1/+21 |
| 2012-03-18 | asm for lrint family on i386 | Rich Felker | 6 | -0/+46 |
| 2012-03-18 | asm exponential functions for i386 | Rich Felker | 9 | -0/+89 |
| 2012-03-19 | remove unnecessary TODO comments from fma.c | nsz | 1 | -5/+1 |
| 2012-03-19 | fmal bug fix: nan input should not raise exception | nsz | 1 | -4/+4 |
| 2012-03-19 | add fma implementation for x86•••correctly rounded double precision fma using extended
precision arithmetics for ld80 systems (x87)
| nsz | 1 | -7/+143 |
| 2012-03-18 | assembly optimizations for fmod/remainder functions | Rich Felker | 8 | -0/+88 |
| 2012-03-18 | asm versions of some simple math functions for i386 and x86_64•••these are functions that have direct fpu approaches to implementation
without problematic exception or rounding issues. x86_64 lacks
float/double versions because i'm unfamiliar with the necessary sse
code for performing these operations.
| Rich Felker | 8 | -0/+48 |
| 2012-03-18 | simplify lround and llround functions•••Simple wrappers around round is enough because
spurious inexact exception is allowed.
| nsz | 6 | -112/+20 |
| 2012-03-18 | make lrint and llrint functions work without fenv support | nsz | 6 | -6/+16 |
| 2012-03-18 | faster lrint and llrint functions•••A faster workaround for spurious inexact exceptions
when the result cannot be represented. The old code
actually could be wrong, because gcc reordered the
integer conversion and the exception check.
| nsz | 6 | -80/+99 |
