summaryrefslogtreecommitdiff
path: root/src/stdlib/llabs.c
diff options
context:
space:
mode:
authorRich Felker <dalias@aerifal.cx>2012-04-28 18:05:29 -0400
committerRich Felker <dalias@aerifal.cx>2012-04-28 18:05:29 -0400
commit45b38550eec7de580d790440154791c67cae8475 (patch)
tree93005ff72589f5f0ea2989eb08b383d35198b695 /src/stdlib/llabs.c
parenta1b442335d6382b0dc0363fdd3a5604493b6a9c7 (diff)
downloadmusl-45b38550eec7de580d790440154791c67cae8475.tar.gz
musl-45b38550eec7de580d790440154791c67cae8475.tar.bz2
musl-45b38550eec7de580d790440154791c67cae8475.tar.xz
musl-45b38550eec7de580d790440154791c67cae8475.zip
new fnmatch implementation
unlike the old one, this one's algorithm does not suffer from potential stack overflow issues or pathologically bad performance on certain patterns. instead of backtracking, it uses a matching algorithm which I have not seen before (unsure whether I invented or re-invented it) that runs in O(1) space and O(nm) time. it may be possible to improve the time to O(n), but not without significantly greater complexity.
Diffstat (limited to 'src/stdlib/llabs.c')
0 files changed, 0 insertions, 0 deletions