2007-09-06 22:32:54 +00:00
|
|
|
#include "../git-compat-util.h"
|
|
|
|
|
|
|
|
void *gitmemmem(const void *haystack, size_t haystack_len,
|
|
|
|
const void *needle, size_t needle_len)
|
|
|
|
{
|
|
|
|
const char *begin = haystack;
|
|
|
|
const char *last_possible = begin + haystack_len - needle_len;
|
2009-03-02 23:19:30 +00:00
|
|
|
const char *tail = needle;
|
|
|
|
char point;
|
2007-09-06 22:32:54 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The first occurrence of the empty string is deemed to occur at
|
|
|
|
* the beginning of the string.
|
|
|
|
*/
|
|
|
|
if (needle_len == 0)
|
|
|
|
return (void *)begin;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sanity check, otherwise the loop might search through the whole
|
|
|
|
* memory.
|
|
|
|
*/
|
|
|
|
if (haystack_len < needle_len)
|
|
|
|
return NULL;
|
|
|
|
|
2009-03-02 23:19:30 +00:00
|
|
|
point = *tail++;
|
2007-09-06 22:32:54 +00:00
|
|
|
for (; begin <= last_possible; begin++) {
|
2009-03-02 23:19:30 +00:00
|
|
|
if (*begin == point && !memcmp(begin + 1, tail, needle_len - 1))
|
2007-09-06 22:32:54 +00:00
|
|
|
return (void *)begin;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|