musl - musl - an implementation of the standard library for Linux-based systems

Age	Commit message (Collapse)	Author	Lines
2012-02-06	add deprecated (removed from posix) [efg]cvt() functions	Rich Felker	-0/+52
	these have not been heavily tested, but they should work as described in the old standards. probably broken for non-finite values...
2011-11-10	fix signed overflows at most-negative values in ato(i\|l\|ll)	Rich Felker	-6/+9
	patch by Pascal Cuoq (with minor tweaks to comments)
2011-09-19	fix incorrect long double parameters on arm (and other future ports)	Rich Felker	-0/+12
	this was the cause of crashes in printf when attempting to print floating point values.
2011-09-05	fix incorrect overflow errors on strtoul, etc.	Rich Felker	-8/+20

2011-07-14	fix various bugs in new integer parser framework	Rich Felker	-6/+8
	1. my interpretation of subject sequence definition was wrong. adjust parser to conform to the standard. 2. some code for handling tail overflow case was missing (forgot to finish writing it). 3. typo (= instead of ==) caused ERANGE to wrongly behave like EINVAL
2011-07-14	fix wcsto[iu]max with high characters	Rich Felker	-4/+2
	stopping without letting the parser see a stop character prevented getting a result. so treat all high chars as the null character and pass them into the parser. also eliminated ugly tmp var using compound literals.
2011-07-14	new restartable integer parsing framework.	Rich Felker	-156/+81
	this fixes a number of bugs in integer parsing due to lazy haphazard wrapping, as well as some misinterpretations of the standard. the new parser is able to work character-at-a-time or on whole strings, making it easy to support the wide functions without unbounded space for conversion. it will also be possible to update scanf to use the new parser.
2011-04-29	avoid crashing when nel==0 is passed to qsort	Rich Felker	-2/+6

2011-04-27	replace heap sort with smoothsort implementation by Valentin Ochs	Rich Felker	-32/+193
	Smoothsort is an adaptive variant of heapsort. This version was written by Valentin Ochs (apo) specifically for inclusion in musl. I worked with him to get it working in O(1) memory usage even with giant array element widths, and to optimize it heavily for size and speed. It's still roughly 4 times as large as the old heap sort implementation, but roughly 20 times faster given an almost-sorted array of 1M elements (20 being the base-2 log of 1M), i.e. it really does reduce O(n log n) to O(n) in the mostly-sorted case. It's still somewhat slower than glibc's Introsort for random input, but now considerably faster than glibc when the input is already sorted, or mostly sorted.
2011-04-07	fix broken unsigned comparison in wcstoumax	Rich Felker	-1/+1

2011-04-03	fix various bugs in strtold:	Rich Felker	-10/+13
	0e10000000000000000000000000000000 was setting ERANGE exponent char e/p was considered part of the match even if not followed by a valid decimal value "1e +10" was parsed as "1e+10" hex digits were misinterpreted as 0..5 instead of 10..15
2011-03-25	fix all implicit conversion between signed/unsigned pointers	Rich Felker	-4/+4
	sadly the C language does not specify any such implicit conversion, so this is not a matter of just fixing warnings (as gcc treats it) but actual errors. i would like to revisit a number of these changes and possibly revise the types used to reduce the number of casts required.
2011-02-17	don't compare elements with themselves during qsort.	Rich Felker	-1/+1
	this is actually a workaround for a bug in gcc, whereby it asserts inequality of the keys being compared...
2011-02-14	more header fixes, minor warning fix	Rich Felker	-2/+4

2011-02-12	initial check-in, version 0.5.0v0.5.0	Rich Felker	-0/+688