2006-07-03 01:17:05 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
2002-12-02 05:31:36 +05:30
|
|
|
/*
|
2010-08-16 23:44:46 +05:30
|
|
|
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
|
2002-12-02 05:31:36 +05:30
|
|
|
*/
|
2006-04-03 22:09:31 +05:30
|
|
|
#include "libbb.h"
|
2002-12-02 05:31:36 +05:30
|
|
|
|
2015-08-25 16:40:00 +05:30
|
|
|
/*
|
|
|
|
* Return NULL if string is not prefixed with key. Return pointer to the
|
|
|
|
* first character in string after the prefix key. If key is an empty string,
|
|
|
|
* return pointer to the beginning of string.
|
|
|
|
*/
|
2015-03-12 22:18:34 +05:30
|
|
|
char* FAST_FUNC is_prefixed_with(const char *string, const char *key)
|
|
|
|
{
|
|
|
|
#if 0 /* Two passes over key - probably slower */
|
|
|
|
int len = strlen(key);
|
|
|
|
if (strncmp(string, key, len) == 0)
|
|
|
|
return string + len;
|
|
|
|
return NULL;
|
|
|
|
#else /* Open-coded */
|
|
|
|
while (*key != '\0') {
|
|
|
|
if (*key != *string)
|
|
|
|
return NULL;
|
|
|
|
key++;
|
|
|
|
string++;
|
|
|
|
}
|
|
|
|
return (char*)string;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2015-08-25 20:06:43 +05:30
|
|
|
/*
|
|
|
|
* Return NULL if string is not suffixed with key. Return pointer to the
|
|
|
|
* beginning of prefix key in string. If key is an empty string return pointer
|
|
|
|
* to the end of string.
|
|
|
|
*/
|
|
|
|
char* FAST_FUNC is_suffixed_with(const char *string, const char *key)
|
|
|
|
{
|
|
|
|
size_t key_len = strlen(key);
|
|
|
|
ssize_t len_diff = strlen(string) - key_len;
|
|
|
|
|
|
|
|
if (len_diff >= 0) {
|
2015-08-26 01:17:33 +05:30
|
|
|
string += len_diff;
|
|
|
|
if (strcmp(string, key) == 0) {
|
|
|
|
return (char*)string;
|
2015-08-25 20:06:43 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2006-11-05 23:35:09 +05:30
|
|
|
/* returns the array index of the string */
|
|
|
|
/* (index of first match is returned, or -1) */
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC index_in_str_array(const char *const string_array[], const char *key)
|
2002-12-02 05:31:36 +05:30
|
|
|
{
|
2005-11-26 16:15:26 +05:30
|
|
|
int i;
|
2002-12-02 05:31:36 +05:30
|
|
|
|
|
|
|
for (i = 0; string_array[i] != 0; i++) {
|
|
|
|
if (strcmp(string_array[i], key) == 0) {
|
2005-11-26 16:15:26 +05:30
|
|
|
return i;
|
2002-12-02 05:31:36 +05:30
|
|
|
}
|
|
|
|
}
|
2006-11-05 23:35:09 +05:30
|
|
|
return -1;
|
2003-03-19 14:43:01 +05:30
|
|
|
}
|
|
|
|
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC index_in_strings(const char *strings, const char *key)
|
2007-07-24 21:24:42 +05:30
|
|
|
{
|
2021-01-29 18:53:27 +05:30
|
|
|
int j, idx = 0;
|
2007-07-24 21:24:42 +05:30
|
|
|
|
2008-05-31 13:04:14 +05:30
|
|
|
while (*strings) {
|
2021-01-29 18:53:27 +05:30
|
|
|
/* Do we see "key\0" at current position in strings? */
|
|
|
|
for (j = 0; *strings == key[j]; ++j) {
|
|
|
|
if (*strings++ == '\0') {
|
|
|
|
//bb_error_msg("found:'%s' i:%u", key, idx);
|
|
|
|
return idx; /* yes */
|
|
|
|
}
|
2007-07-24 21:24:42 +05:30
|
|
|
}
|
2021-01-29 18:53:27 +05:30
|
|
|
/* No. Move to the start of the next string. */
|
|
|
|
while (*strings++ != '\0')
|
|
|
|
continue;
|
2007-07-24 21:24:42 +05:30
|
|
|
idx++;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2006-11-05 23:35:09 +05:30
|
|
|
/* returns the array index of the string, even if it matches only a beginning */
|
|
|
|
/* (index of first match is returned, or -1) */
|
2007-07-24 21:24:42 +05:30
|
|
|
#ifdef UNUSED
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC index_in_substr_array(const char *const string_array[], const char *key)
|
2006-11-05 23:35:09 +05:30
|
|
|
{
|
|
|
|
int i;
|
2015-03-12 22:18:34 +05:30
|
|
|
if (key[0]) {
|
2007-03-30 20:13:27 +05:30
|
|
|
for (i = 0; string_array[i] != 0; i++) {
|
2015-03-12 22:18:34 +05:30
|
|
|
if (is_prefixed_with(string_array[i], key)) {
|
2007-03-30 20:13:27 +05:30
|
|
|
return i;
|
|
|
|
}
|
2006-11-05 23:35:09 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
2007-07-24 21:24:42 +05:30
|
|
|
#endif
|
|
|
|
|
2008-06-27 08:22:20 +05:30
|
|
|
int FAST_FUNC index_in_substrings(const char *strings, const char *key)
|
2007-07-24 21:24:42 +05:30
|
|
|
{
|
2010-04-03 04:22:16 +05:30
|
|
|
int matched_idx = -1;
|
|
|
|
const int len = strlen(key);
|
2007-07-24 21:24:42 +05:30
|
|
|
|
|
|
|
if (len) {
|
|
|
|
int idx = 0;
|
2008-05-31 13:04:14 +05:30
|
|
|
while (*strings) {
|
2007-07-24 21:24:42 +05:30
|
|
|
if (strncmp(strings, key, len) == 0) {
|
2010-04-03 04:22:16 +05:30
|
|
|
if (strings[len] == '\0')
|
|
|
|
return idx; /* exact match */
|
|
|
|
if (matched_idx >= 0)
|
|
|
|
return -1; /* ambiguous match */
|
|
|
|
matched_idx = idx;
|
2007-07-24 21:24:42 +05:30
|
|
|
}
|
|
|
|
strings += strlen(strings) + 1; /* skip NUL */
|
|
|
|
idx++;
|
|
|
|
}
|
|
|
|
}
|
2010-04-03 04:22:16 +05:30
|
|
|
return matched_idx;
|
2007-07-24 21:24:42 +05:30
|
|
|
}
|
2007-11-04 09:40:17 +05:30
|
|
|
|
2008-06-27 08:22:20 +05:30
|
|
|
const char* FAST_FUNC nth_string(const char *strings, int n)
|
2007-11-04 09:40:17 +05:30
|
|
|
{
|
2008-01-07 21:43:14 +05:30
|
|
|
while (n) {
|
2020-06-12 02:15:58 +05:30
|
|
|
if (*strings++ == '\0') {
|
|
|
|
if (*strings == '\0') /* reached end of strings */
|
|
|
|
break;
|
|
|
|
n--;
|
|
|
|
}
|
2008-01-07 21:43:14 +05:30
|
|
|
}
|
|
|
|
return strings;
|
2007-11-04 09:40:17 +05:30
|
|
|
}
|
2010-04-03 04:22:16 +05:30
|
|
|
|
|
|
|
#ifdef UNUSED_SO_FAR /* only brctl.c needs it yet */
|
|
|
|
/* Returns 0 for no, 1 for yes or a negative value on error. */
|
|
|
|
smallint FAST_FUNC yesno(const char *str)
|
|
|
|
{
|
|
|
|
static const char no_yes[] ALIGN1 =
|
|
|
|
"0\0" "off\0" "no\0"
|
|
|
|
"1\0" "on\0" "yes\0";
|
|
|
|
int ret = index_in_substrings(no_yes, str);
|
|
|
|
return ret / 3;
|
|
|
|
}
|
|
|
|
#endif
|
2015-08-25 16:39:59 +05:30
|
|
|
|
|
|
|
#if ENABLE_UNIT_TEST
|
|
|
|
|
|
|
|
BBUNIT_DEFINE_TEST(is_prefixed_with)
|
|
|
|
{
|
|
|
|
BBUNIT_ASSERT_STREQ(" bar", is_prefixed_with("foo bar", "foo"));
|
|
|
|
BBUNIT_ASSERT_STREQ("bar", is_prefixed_with("foo bar", "foo "));
|
|
|
|
BBUNIT_ASSERT_STREQ("", is_prefixed_with("foo", "foo"));
|
|
|
|
BBUNIT_ASSERT_STREQ("foo", is_prefixed_with("foo", ""));
|
|
|
|
BBUNIT_ASSERT_STREQ("", is_prefixed_with("", ""));
|
|
|
|
|
|
|
|
BBUNIT_ASSERT_NULL(is_prefixed_with("foo", "bar foo"));
|
|
|
|
BBUNIT_ASSERT_NULL(is_prefixed_with("foo foo", "bar"));
|
|
|
|
BBUNIT_ASSERT_NULL(is_prefixed_with("", "foo"));
|
|
|
|
|
|
|
|
BBUNIT_ENDTEST;
|
|
|
|
}
|
|
|
|
|
2015-08-25 20:06:43 +05:30
|
|
|
BBUNIT_DEFINE_TEST(is_suffixed_with)
|
|
|
|
{
|
|
|
|
BBUNIT_ASSERT_STREQ("bar", is_suffixed_with("foo bar", "bar"));
|
|
|
|
BBUNIT_ASSERT_STREQ("foo", is_suffixed_with("foo", "foo"));
|
|
|
|
BBUNIT_ASSERT_STREQ("", is_suffixed_with("foo", ""));
|
|
|
|
BBUNIT_ASSERT_STREQ("", is_suffixed_with("", ""));
|
2015-09-16 03:08:01 +05:30
|
|
|
BBUNIT_ASSERT_STREQ("foo", is_suffixed_with("barfoofoo", "foo"));
|
2015-08-25 20:06:43 +05:30
|
|
|
|
|
|
|
BBUNIT_ASSERT_NULL(is_suffixed_with("foo", "bar foo"));
|
|
|
|
BBUNIT_ASSERT_NULL(is_suffixed_with("foo foo", "bar"));
|
|
|
|
BBUNIT_ASSERT_NULL(is_suffixed_with("", "foo"));
|
|
|
|
|
|
|
|
BBUNIT_ENDTEST;
|
|
|
|
}
|
|
|
|
|
2015-08-25 16:39:59 +05:30
|
|
|
#endif /* ENABLE_UNIT_TEST */
|