mirror of
https://github.com/espressif/esp-idf.git
synced 2024-10-05 20:47:46 -04:00
58 lines
2.4 KiB
C
58 lines
2.4 KiB
C
|
/*-
|
||
|
|
* Copyright (c) 1990, 1993
|
||
|
|
* The Regents of the University of California. All rights reserved.
|
||
|
|
*
|
||
|
|
* The quadratic code is derived from software contributed to Berkeley by
|
||
|
|
* Chris Torek.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
* 4. Neither the name of the University nor the names of its contributors
|
||
|
|
* may be used to endorse or promote products derived from this software
|
||
|
|
* without specific prior written permission.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
|
* SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
/* Linear algorithm Copyright (C) 2008 Eric Blake
|
||
|
|
* Permission to use, copy, modify, and distribute the linear portion of
|
||
|
|
* software is freely granted, provided that this notice is preserved.
|
||
|
|
*/
|
||
|
|
#include "transport_strcasestr.h"
|
||
|
|
#include <string.h>
|
||
|
|
#include <ctype.h>
|
||
|
|
|
||
|
|
char *transport_strcasestr(const char *buffer, const char *key)
|
||
|
|
{
|
||
|
|
char c, sc;
|
||
|
|
size_t len;
|
||
|
|
|
||
|
|
if ((c = *key++) != 0) {
|
||
|
|
c = tolower((unsigned char)c);
|
||
|
|
len = strlen(key);
|
||
|
|
do {
|
||
|
|
do {
|
||
|
|
if ((sc = *buffer++) == 0)
|
||
|
|
return (NULL);
|
||
|
|
} while ((char)tolower((unsigned char)sc) != c);
|
||
|
|
} while (strncasecmp(buffer, key, len) != 0);
|
||
|
|
buffer--;
|
||
|
|
}
|
||
|
|
return ((char *)buffer);
|
||
|
|
}
|