about summary refs log tree commit diff
path: root/src
Commit message (Collapse)AuthorAgeFilesLines
* fix signedness error handling invalid multibyte sequences in regexecRich Felker2012-04-141-2/+2
| | | | | | | the "< 0" test was always false due to use of an unsigned type. this resulted in infinite loops on 32-bit machines (adding -1U to a pointer is the same as adding -1) and crashes on 64-bit machines (offsetting the string pointer by 4gb-1b when an illegal sequence was hit).
* remove invalid code from TRERich Felker2012-04-131-14/+0
| | | | | | | | | | | TRE wants to treat + and ? after a +, ?, or * as special; ? means ungreedy and + is reserved for future use. however, this is non-conformant. although redundant, these redundant characters have well-defined (no-op) meaning for POSIX ERE, and are actually _literal_ characters (which TRE is wrongly ignoring) in POSIX BRE mode. the simplest fix is to simply remove the unneeded nonstandard functionality. as a plus, this shaves off a small amount of bloat.
* fix broken regerror (typo) and missing messageRich Felker2012-04-131-2/+2
|
* use fast version of the int reading code for the high-order digits tooRich Felker2012-04-131-3/+13
| | | | | this increases code size slightly, but it's considerably faster, especially for power-of-2 bases.
* use macros instead of inline functions in shgetc.hRich Felker2012-04-131-20/+4
| | | | | | at -Os optimization level, gcc refuses to inline these functions even though the inlined code would roughly the same size as the function call, and much faster. the easy solution is to make them into macros.
* fix spurious overflows in strtoull with small basesRich Felker2012-04-131-7/+3
| | | | | | | whenever the base was small enough that more than one digit could still fit after UINTMAX_MAX/36-1 was reached, only the first would be allowed; subsequent digits would trigger spurious overflow, making it impossible to read the largest values in low bases.
* remove magic numbers from floatscanRich Felker2012-04-121-5/+5
|
* optimize more integer cases in floatscan; comment the whole procedureRich Felker2012-04-121-8/+27
|
* revert invalid optimization in floatscanRich Felker2012-04-111-2/+2
|
* fix stupid typo in floatscan that caused excess rounding of some valuesRich Felker2012-04-111-1/+1
|
* Merge remote branch 'nsz/master'Rich Felker2012-04-112-5/+6
|\
| * math: fix x86 asin accuracynsz2012-04-042-5/+6
| | | | | | | | | | use (1-x)*(1+x) instead of (1-x*x) in asin.s the later can be inaccurate with upward rounding when x is close to 1
* | optimize floatscan downscaler to skip results that won't be neededRich Felker2012-04-111-2/+3
| | | | | | | | | | | | | | | | | | | | | | | | | | | | when upscaling, even the very last digit is needed in cases where the input is exact; no digits can be discarded. but when downscaling, any digits less significant than the mantissa bits are destined for the great bitbucket; the only influence they can have is their presence (being nonzero). thus, we simply throw them away early. the result is nearly a 4x performance improvement for processing huge values. the particular threshold LD_B1B_DIG+3 is not chosen sharply; it's simply a "safe" distance past the significant bits. it would be nice to replace it with a sharp bound, but i suspect performance will be comparable (within a few percent) anyway.
* | simplify/debloat radix point alignment code in floatscanRich Felker2012-04-111-9/+4
| | | | | | | | | | | | | | | | | | | | | | | | now that this is the first operation, it can rely on the circular buffer contents not being wrapped when it begins. we limit the number of digits read slightly in the initial parsing loops too so that this code does not have to consider the case where it might cause the circular buffer to wrap; this is perfectly fine because KMAX is chosen as a power of two for circular-buffer purposes and is much larger than it otherwise needs to be, anyway. these changes should not affect performance at all.
* | optimize floatscan: avoid excessive upscalingRich Felker2012-04-111-27/+27
| | | | | | | | | | | | | | | | | | | | upscaling by even one step too much creates 3-29 extra iterations for the next loop. this is still suboptimal since it always goes by 2^29 rather than using a smaller upscale factor when nearing the target, but performance on common, small-magnitude, few-digit values has already more than doubled with this change. more optimizations on the way...
* | fix incorrect initial count in shgetc when data is already bufferedRich Felker2012-04-111-1/+1
| |
* | fix bug parsing lone zero followed by junk, and hex float over-readingRich Felker2012-04-111-6/+5
| |
* | fix float scanning of certain values ending in zerosRich Felker2012-04-101-1/+3
| | | | | | | | | | | | | | for example, "1000000000" was being read as "1" due to this loop exiting early. it's necessary to actually update z and zero the entries so that the subsequent rounding code does not get confused; before i did that, spurious inexact exceptions were being raised.
* | fix potential overflow in exponent readingRich Felker2012-04-101-1/+1
| | | | | | | | | | | | | | note that there's no need for a precise cutoff, because exponents this large will always result in overflow or underflow (it's impossible to read enough digits to compensate for the exponent magnitude; even at a few nanoseconds per digit it would take hundreds of years).
* | set errno properly when parsing floating pointRich Felker2012-04-101-4/+21
| |
* | add "scan helper getc" and rework strtod, etc. to use itRich Felker2012-04-106-75/+115
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | the immediate benefit is a significant debloating of the float parsing code by moving the responsibility for keeping track of the number of characters read to a different module. by linking shgetc with the stdio buffer logic, counting logic is defered to buffer refill time, keeping the calls to shgetc fast and light. in the future, shgetc will also be useful for integrating the new float code with scanf, which needs to not only count the characters consumed, but also limit the number of characters read based on field width specifiers. shgetc may also become a useful tool for simplifying the integer parsing code.
* | unify strtof/strtod/strtold wrappers and fix initial whitespace issueRich Felker2012-04-103-34/+21
| |
* | new floating point parser/converterRich Felker2012-04-105-94/+477
|/ | | | | | | | | | | | | | | | | this version is intended to be fully conformant to the ISO C, POSIX, and IEEE standards for conversion of decimal/hex floating point strings to float, double, and long double (ld64 or ld80 only at present) values. in particular, all results are intended to be rounded correctly according to the current rounding mode. further, this implementation aims to set the floating point underflow, overflow, and inexact flags to reflect the conversion performed. a moderate amount of testing has been performed (by nsz and myself) prior to integration of the code in musl, but it still may have bugs. so far, only strto(d|ld|f) use the new code. scanf integration will be done as a separate commit, and i will add implementations of the wide character functions later.
* 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.
* 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 remote branch 'nsz/master'Rich Felker2012-03-252-15/+6
|\
| * 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)
* | add strfmon_l variant (still mostly incomplete)Rich Felker2012-03-251-3/+27
| |
* | 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.
* add creal/cimag macros in complex.h (and use them in the functions defs)Rich Felker2012-03-227-20/+9
|
* 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
|
* initial, very primitive strfmonRich Felker2012-03-211-0/+77
|
* 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.
* 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
| |
* | 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.