strcasestr.c 1.79 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
/*
 * This file is part of the Sofia-SIP package
 *
 * Copyright (C) 2005 Nokia Corporation.
 *
 * Contact: Pekka Pessi <pekka.pessi@nokia.com>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA
 *
 */

Pekka Pessi's avatar
Pekka Pessi committed
25
/**@internal @file strcasestr.c
26
 * @brief Backup implementation of strcasestr()
27
 *
28 29 30 31 32 33 34 35 36 37 38 39
 * @author Pekka Pessi <Pekka.Pessi@nokia.com>
 */

#include "config.h"

#include <ctype.h>
#include <stddef.h>

/* Naive implementation of strcasestr() */
char *strcasestr(const char *haystack,
		 const char *needle)
{
40
  unsigned char lcn, ucn;
41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
  unsigned i;

  if (haystack == NULL || needle == NULL)
    return NULL;

  lcn = ucn = needle[0];
  if (isupper(lcn))
    lcn = tolower(lcn);
  else if (islower(ucn))
    ucn = toupper(ucn);

  if (lcn == 0)
    return (char *)haystack;

  while (haystack[0] != 0) {
    if (lcn == haystack[0] || ucn == haystack[0]) {
      for (i = 1; ; i++) {
	char n = needle[i], h = haystack[i];
	if (n == 0)
	  return (char *)haystack;
	if (h == 0)
	  return NULL;
	if (isupper(n)) n = tolower(n);
	if (isupper(h)) h = tolower(h);
	if (n != h)
	  break;
      }
    }
    haystack++;
70
  }
71 72 73

  return NULL;		/* Not found */
}