summaryrefslogtreecommitdiff
path: root/lib/memmem.c
Commit message (Expand)AuthorAgeFilesLines
* maint: Run 'make update-copyright'Paul Eggert2019-01-011-1/+1
* maint: Run 'make update-copyright'Paul Eggert2018-01-011-1/+1
* all: prefer https: URLsPaul Eggert2017-09-131-1/+1
* version-etc: new yearPaul Eggert2017-01-011-1/+1
* builtin-expect: new modulePaul Eggert2016-12-161-4/+0
* version-etc: new yearPaul Eggert2016-01-011-1/+1
* version-etc: new yearPaul Eggert2014-12-311-1/+1
* maint: update copyrightEric Blake2014-01-011-1/+1
* maint: update all copyright year number rangesEric Blake2013-01-011-1/+1
* maint: replace FSF snail-mail addresses with URLsPaul Eggert2012-02-091-2/+1
* maint: update all copyright year number rangesJim Meyering2012-01-011-1/+1
* maint: update almost all copyright ranges to include 2011Jim Meyering2011-01-011-2/+2
* update nearly all FSF copyright year lists to include 2010Jim Meyering2010-01-011-1/+1
* update nearly all FSF copyright year lists to include 2009Jim Meyering2009-12-291-2/+2
* Use spaces for indentation, not tabs.Bruno Haible2009-12-101-3/+3
* Share two-way algorithm.Eric Blake2008-01-101-352/+3
* Rewrite memmem to guarantee linear complexity without malloc.Eric Blake2008-01-081-193/+362
* Treat untyped memory as an 'unsigned char' array.Bruno Haible2008-01-041-19/+21
* Protect against integer overflow in malloca() calls.Bruno Haible2007-12-311-4/+1
* * lib/memmem.c (knuth_morris_pratt): Check for size_t overflowPaul Eggert2007-12-291-1/+4
* Use GNU style coding conventions.Bruno Haible2007-12-261-54/+54
* Add more comments about Knuth-Morris-Pratt algorithm.Bruno Haible2007-12-261-5/+38
* Fix memmem to avoid O(n^2) worst-case complexity.Eric Blake2007-12-201-16/+176
* * lib/getsubopt.c [!_LIBC]: Include config.h and getsubopt.h.Paul Eggert2007-02-051-1/+5
* *** empty log message ***Paul Eggert2005-05-141-1/+1
* Sync with glibc.Simon Josefsson2004-10-041-12/+11
* New module 'memmem', from Simon Josefsson.Bruno Haible2004-10-041-0/+58