2012-08-06 02:55:45 +00:00
|
|
|
/*
|
|
|
|
Serval string primitives
|
|
|
|
Copyright (C) 2012 Serval Project Inc.
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU General Public License
|
|
|
|
as published by the Free Software Foundation; either version 2
|
|
|
|
of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
This program 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 General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
|
|
|
2012-08-30 11:18:16 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
2012-08-06 02:55:45 +00:00
|
|
|
#include <ctype.h>
|
|
|
|
#include "str.h"
|
2012-08-31 03:26:39 +00:00
|
|
|
#include "log.h"
|
2012-08-06 02:55:45 +00:00
|
|
|
|
|
|
|
int str_startswith(char *str, const char *substring, char **afterp)
|
|
|
|
{
|
|
|
|
while (*substring && *substring == *str)
|
|
|
|
++substring, ++str;
|
|
|
|
if (*substring)
|
|
|
|
return 0;
|
|
|
|
if (afterp)
|
|
|
|
*afterp = str;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int strcase_startswith(char *str, const char *substring, char **afterp)
|
|
|
|
{
|
|
|
|
while (*substring && *str && toupper(*substring) == toupper(*str))
|
|
|
|
++substring, ++str;
|
|
|
|
if (*substring)
|
|
|
|
return 0;
|
|
|
|
if (afterp)
|
|
|
|
*afterp = str;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2012-08-30 11:18:16 +00:00
|
|
|
/* Like strstr() but doesn't depend on null termination */
|
2012-10-03 07:43:45 +00:00
|
|
|
char *str_str(char *haystack, const char *needle, int haystack_len)
|
2012-08-30 11:18:16 +00:00
|
|
|
{
|
2012-10-03 07:43:45 +00:00
|
|
|
size_t needle_len = strlen(needle);
|
|
|
|
if (needle_len == 0)
|
|
|
|
return haystack;
|
|
|
|
if (haystack_len >= needle_len) {
|
|
|
|
for (; *haystack && haystack_len >= needle_len; ++haystack, --haystack_len)
|
|
|
|
if (strncmp(haystack, needle, needle_len) == 0)
|
|
|
|
return haystack;
|
|
|
|
}
|
2012-08-30 11:18:16 +00:00
|
|
|
return NULL;
|
|
|
|
}
|