strcasestr() - Replaced by mutt's mutt_stristr function, because the thought of dynamically allocating memory and copying each line in a file to do a search or replace was causing me to lose sleep

git-svn-id: svn://svn.savannah.gnu.org/nano/trunk/nano@654 35c25a1d-7b9e-4130-9fde-d3aeb78583b8
This commit is contained in:
Chris Allegretta 2001-05-16 04:20:57 +00:00
parent 64bacd20b5
commit 99afb85752
2 changed files with 21 additions and 26 deletions

View File

@ -60,6 +60,11 @@ Cvs code -
do_replace() do_replace()
- If we manage to make it in somehow with VIEW_MODE on, abort - If we manage to make it in somehow with VIEW_MODE on, abort
nicely (fixes BUG #59). nicely (fixes BUG #59).
- utils.c
strcasestr()
- Replaced by mutt's mutt_stristr function, because the thought
of dynamically allocating memory and copying each line in a file
to do a search or replace was causing me to lose sleep.
- winio.c: - winio.c:
actual_x() actual_x()
- Remove inline from function decl (Albert Chin). - Remove inline from function decl (Albert Chin).

42
utils.c
View File

@ -48,37 +48,27 @@ void lowercase(char *src)
} }
/* I can't believe I have to write this function */ /* This is now mutt's version (called mutt_stristr) because it doesn't
Use memory allocation to do a simple search (yuck). */
char *strcasestr(char *haystack, char *needle) char *strcasestr(char *haystack, char *needle)
{ {
char *localneedle, *localhaystack, *found, *tmp, *tmp2; const char *p, *q;
/* Make a copy of the search string and search space */ if (!haystack)
localneedle = nmalloc(strlen(needle) + 2);
localhaystack = nmalloc(strlen(haystack) + 2);
strcpy(localneedle, needle);
strcpy(localhaystack, haystack);
/* Make them lowercase */
lowercase(localneedle);
lowercase(localhaystack);
/* Look for the lowercased substring in the lowercased search space -
return NULL if we didn't find anything */
if ((found = strstr(localhaystack, localneedle)) == NULL) {
free(localneedle);
free(localhaystack);
return NULL; return NULL;
if (!needle)
return (haystack);
while (*(p = haystack))
{
for (q = needle; *p && *q && tolower (*p) == tolower (*q); p++, q++)
;
if (!*q)
return (haystack);
haystack++;
} }
/* Else return the pointer to the same place in the real search space */ return NULL;
tmp2 = haystack;
for (tmp = localhaystack; tmp != found; tmp++)
tmp2++;
free(localneedle);
free(localhaystack);
return tmp2;
} }
char *strstrwrapper(char *haystack, char *needle) char *strstrwrapper(char *haystack, char *needle)