commit | 885d211e714b3787cd059e347694f9b24e1db1f3 | [log] [tgz] |
---|---|---|
author | Junio C Hamano <gitster@pobox.com> | Tue Jan 12 19:21:46 2010 -0800 |
committer | Junio C Hamano <gitster@pobox.com> | Wed Jan 13 01:05:04 2010 -0800 |
tree | 1ae652d1f908637edef8c1ca592223bc99c8adc2 | |
parent | bbc09c22b9f7784b1aab71d4876227956e6e8f4f [diff] |
grep: rip out pessimization to use fixmatch() Even when running without the -F (--fixed-strings) option, we checked the pattern and used fixmatch() codepath when it does not contain any regex magic. Finding fixed strings with strstr() surely must be faster than running the regular expression crud. Not so. It turns out that on some libc implementations, using the regcomp()/regexec() pair is a lot faster than running strstr() and strcasestr() the fixmatch() codepath uses. Drop the optimization and use the fixmatch() codepath only when the user explicitly asked for it with the -F option. Signed-off-by: Junio C Hamano <gitster@pobox.com>