about summary refs log tree commit diff
Commit message (Collapse)AuthorAgeFilesLines
* improve name lookup performance in corner casesRich Felker2012-04-012-2/+2
| | | | | | | | | | | the buffer in getaddrinfo really only matters when /etc/hosts is huge, but in that case, the huge number of syscalls resulting from a tiny buffer would seriously impact the performance of every name lookup. the buffer in __dns.c has also been enlarged a bit so that typical resolv.conf files will fit fully in the buffer. there's no need to make it so large as to dominate the syscall overhead for large files, because resolv.conf should never be large.
* optimize signbit macroRich Felker2012-03-301-2/+2
|
* make math.h more c++-friendlyRich Felker2012-03-301-2/+5
|
* math: minor cleanups in ceil and floornsz2012-03-295-10/+7
|
* math: remove x86 modf asmnsz2012-03-294-111/+0
| | | | | the int part was wrong when -1 < x <= -0 (+0.0 instead of -0.0) and the size and performace gain of the asm version was negligible
* math: rewrite modf.c and clean up modff.cnsz2012-03-292-72/+45
| | | | cleaner implementation with unions and unsigned arithmetic
* math: fix modfl.c bugnsz2012-03-281-1/+1
| | | | | modfl(+-inf) was wrong on ld80 because the explicit msb was not taken into account during inf vs nan check
* math: fix a regression in powl and do some cleanupsnsz2012-03-271-12/+11
| | | | | previously a division was accidentally turned into integer div (w = -i/NXT;) instead of long double div (w = -i; w /= NXT;)
* math: add dummy tgamma and tgammaf implementationsnsz2012-03-272-0/+32
|
* math: remove comment about aliasing lgamma as gammansz2012-03-273-8/+4
| | | | | It is probably not worth supporting gamma. (it was already deprecated in 4.3BSD)
* math: fix typo in i386 remquof and remquol asmnsz2012-03-271-5/+5
| | | | (fldl instruction was used instead of flds and fldt)
* Merge branch 'master' of git://git.etalabs.net/muslnsz2012-03-263-10/+32
|\
| * Merge remote branch 'nsz/master'Rich Felker2012-03-252-15/+6
| |\
| * | add strfmon_l variant (still mostly incomplete)Rich Felker2012-03-251-3/+27
| | |
| * | update COPYRIGHT status of TRE regex codeRich Felker2012-03-241-4/+4
| | |
| * | update README to remove information no longer relevant as of 0.8.7Rich Felker2012-03-241-3/+1
| | |
* | | Merge branch 'master' of git://git.etalabs.net/muslnsz2012-03-233-6/+103
|\| | | |/ |/|
| * asm for hypot and hypotfRich Felker2012-03-232-0/+87
| | | | | | | | | | | | | | | | | | special care is made to avoid any inexact computations when either arg is zero (in which case the exact absolute value of the other arg should be returned) and to support the special condition that hypot(±inf,nan) yields inf. hypotl is not yet implemented since avoiding overflow is nontrivial.
| * make dlerror conform to posixRich Felker2012-03-231-6/+16
| | | | | | | | | | | | | | the error status is required to be sticky after failure of dlopen or dlsym until cleared by dlerror. applications and especially libraries should never rely on this since it is not thread-safe and subject to race conditions, but glib does anyway.
* | minor rintl.c fix: remove unsupported ldbl format messagensz2012-03-231-2/+0
| |
* | fix tgammal: don't set the signgam globalnsz2012-03-231-13/+6
|/ | | | (tgamma must be thread-safe, signgam is for lgamma* functions)
* simplify creal and cimag macrosRich Felker2012-03-221-8/+8
|
* add creal/cimag macros in complex.h (and use them in the functions defs)Rich Felker2012-03-228-20/+20
|
* tgmath.h: suppress any existing macro definitions before defining macrosRich Felker2012-03-221-0/+63
| | | | | this is necessary so that we can freely add macro versions of some of the math/complex functions without worrying about breaking tgmath.
* acos.s fix: use the formula acos(x) = atan2(sqrt(1-x),sqrt(1+x))nsz2012-03-222-6/+2
| | | | | | | 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.
* sysconf support for dynamic limits (open files and processes)Rich Felker2012-03-221-2/+9
|
* fix DECIMAL_DIG definitionsRich Felker2012-03-214-2/+6
| | | | | | | | | | | | | 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.
* initial, very primitive strfmonRich Felker2012-03-212-0/+98
|
* x86_64 math asm, long double functions onlyRich Felker2012-03-2017-0/+239
| | | | | | | 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.
* limits.h: support gcc's -funsigned-charRich Felker2012-03-201-2/+10
| | | | | some software apparently uses this and breaks with musl due to mismatching definitions...
* Merge remote branch 'nsz/master'Rich Felker2012-03-2010-198/+127
|\
| * nearbyint optimization (only clear inexact when necessary)nsz2012-03-203-19/+29
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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
| * remove a fixme commentnsz2012-03-203-3/+2
| |
| * clean up pow.c and powf.cnsz2012-03-202-57/+43
| | | | | | | | fix comments about special cases
| * clean up powl.cnsz2012-03-201-92/+47
| | | | | | | | fix special cases, use multiplication instead of scalbnl
| * fix a cbrtl.c regression and remove x87 precision settingnsz2012-03-201-27/+6
| |
| * Merge branch 'master' of git://git.etalabs.net/muslnsz2012-03-204-24/+72
| |\
| * \ Merge branch 'master' of git://git.etalabs.net/muslnsz2012-03-201-3/+11
| |\ \
| * \ \ Merge branch 'master' of git://git.etalabs.net/muslnsz2012-03-201-23/+22
| |\ \ \
| * \ \ \ Merge branch 'master' of git://git.etalabs.net/muslnsz2012-03-192-2/+2
| |\ \ \ \
* | | | | | upgrade to latest upstream TRE regex code (0.8.0)Rich Felker2012-03-205-1168/+1037
| |_|_|_|/ |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.
* | | | | optimize scalbn familyRich Felker2012-03-203-7/+46
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.)
* | | | | remquo asm: return quotient mod 8, as intended by the specRich Felker2012-03-191-17/+26
| |_|_|/ |/| | | | | | | | | | | | | | | this is a lot more efficient and also what is generally wanted. perhaps the bit shuffling could be more efficient...
* | | | use alternate formula for acos asm to avoid loss of precisionRich Felker2012-03-191-3/+11
| |_|/ |/| |
* | | Merge remote branch 'nsz/master'Rich Felker2012-03-1995-806/+655
|\| |
| * | code cleanup of named constantsnsz2012-03-1973-623/+513
| | | | | | | | | | | | | | | | | | | | | 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).
| * | fix remainder*.c: remove useless long double castnsz2012-03-192-15/+6
| | |
| * | don't try to create non-standard denormalization signalnsz2012-03-193-7/+4
| | | | | | | | | | | | | | | | | | | | | | | | 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.
| * | new modff.c code, fix nan handling in modflnsz2012-03-192-44/+26
| | |
| * | use scalbn or *2.0 instead of ldexp, fix fmalnsz2012-03-198-101/+102
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.