about summary refs log tree commit diff
path: root/COPYRIGHT
Commit message (Collapse)AuthorAgeFilesLines
* update copyright dates to 2014Rich Felker2014-03-061-2/+2
|
* add arm-optimized memcpy implementation from bionic libcRich Felker2013-08-141-0/+4
| | | | | | | | | | | | | | | | | | | | the approach of this implementation was heavily investigated prior to adopting it. attempts to obtain similar performance with pure C code were capping out at about 75% of the performance of the asm, with considerably larger code size, and were fragile in that the compiler would sometimes compile part of memcpy into a call to itself. therefore, just using the asm seems to be the best option. this commit is the first to make use of the new subarch-specific asm framework. the new armel directory is the location for arm asm that should not be used for all arm subarchs, only the default one. armhf is the name of the little-endian hardfloat-ABI subarch, which can use the exact same asm. in both cases, the build system finds the asm by following a memcpy.sub file. the other two subarchs, armeb and armebhf, would need a big-endian variant of this code. it would not be hard to adapt the code to big endian, but I will hold off on doing so until there is demand for it.
* mention bits headers in another part of copyright fileRich Felker2013-04-201-1/+1
|
* update copyright yearRich Felker2013-04-201-2/+2
|
* clarify that bits headers are included as public headersRich Felker2013-04-201-6/+6
|
* update copyright file for recent contributionsRich Felker2012-11-141-5/+9
|
* update copyright/credits for recent code additionsRich Felker2012-08-151-2/+12
|
* relicense musl under MIT licenseRich Felker2012-05-051-11/+33
|
* update license of njk contributed code (x86_64 asm)Rich Felker2012-05-051-2/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | these changes are based on the following communication via email: "I hereby grant that all of the code I have contributed to musl on or before April 23, 2012 may be licensed under the terms of the following MIT license: Copyright (c) 2011-2012 Nicholas J. Kain 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."
* update COPYRIGHT status of TRE regex codeRich Felker2012-03-241-4/+4
|
* Merge remote branch 'nsz/master'Rich Felker2012-03-161-5/+9
|\
| * fix copyright notice for the math libnsz2012-03-131-5/+9
| |
* | revert COPYRIGHT file changes in preparation to merge nsz's math branchRich Felker2012-03-161-4/+5
| |
* | update copyright status (math library and new year)Rich Felker2012-03-161-6/+5
|/
* XSI search.h API implementation by Szabolcs NagyRich Felker2011-06-251-3/+5
|
* initial commit of prng implementation by Szabolcs NagyRich Felker2011-06-231-0/+4
|
* replace heap sort with smoothsort implementation by Valentin OchsRich Felker2011-04-271-0/+4
| | | | | | | | | | | | | | 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.
* some docs fixes for x86_64Rich Felker2011-02-151-0/+3
|
* explicitly release crt/* to the public domainRich Felker2011-02-131-0/+6
|
* initial check-in, version 0.5.0 v0.5.0Rich Felker2011-02-121-0/+31