mirror of
https://github.com/git/git.git
synced 2024-11-05 08:47:56 +01:00
56384e61ea
When memmem() was imported from glibc 2.2 into compat/, an optimization was dropped in the process, in order to make the code smaller and simpler. It was OK because memmem() wasn't used in performance-critical code. Now the situation has changed and we can benefit from this optimization. The trick is to avoid calling memcmp() if the first character of the needle already doesn't match. Checking one character directly is much cheaper than the function call overhead. We keep the first character of the needle in the variable named point and the rest in the one named tail. The following commands were run in a Linux kernel repository and timed, the best of five results is shown: $ STRING='Ensure that the real time constraints are schedulable.' $ git log -S"$STRING" HEAD -- kernel/sched.c >/dev/null On Windows Vista x64, before: real 0m8.470s user 0m0.000s sys 0m0.000s And after the patch: real 0m1.887s user 0m0.000s sys 0m0.000s Signed-off-by: Rene Scharfe <rene.scharfe@lsrfire.ath.cx> Signed-off-by: Junio C Hamano <gitster@pobox.com>
32 lines
752 B
C
32 lines
752 B
C
#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;
|
|
const char *tail = needle;
|
|
char point;
|
|
|
|
/*
|
|
* 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;
|
|
|
|
point = *tail++;
|
|
for (; begin <= last_possible; begin++) {
|
|
if (*begin == point && !memcmp(begin + 1, tail, needle_len - 1))
|
|
return (void *)begin;
|
|
}
|
|
|
|
return NULL;
|
|
}
|