bfc3d82256
adjtimex: code shrink libbb: move nth_string function into libbb hdparm: nth_string was here text data bss dec hex filename 730013 10334 12032 752379 b7afb busybox_old 730093 10134 12032 752259 b7a83 busybox_unstripped
79 lines
1.5 KiB
C
79 lines
1.5 KiB
C
/* vi: set sw=4 ts=4: */
|
|
/*
|
|
* Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
|
|
*/
|
|
|
|
#include "libbb.h"
|
|
|
|
/* returns the array index of the string */
|
|
/* (index of first match is returned, or -1) */
|
|
int index_in_str_array(const char *const string_array[], const char *key)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; string_array[i] != 0; i++) {
|
|
if (strcmp(string_array[i], key) == 0) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
int index_in_strings(const char *strings, const char *key)
|
|
{
|
|
int idx = 0;
|
|
|
|
while (strings[0]) {
|
|
if (strcmp(strings, key) == 0) {
|
|
return idx;
|
|
}
|
|
strings += strlen(strings) + 1; /* skip NUL */
|
|
idx++;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
/* returns the array index of the string, even if it matches only a beginning */
|
|
/* (index of first match is returned, or -1) */
|
|
#ifdef UNUSED
|
|
int index_in_substr_array(const char *const string_array[], const char *key)
|
|
{
|
|
int i;
|
|
int len = strlen(key);
|
|
if (len) {
|
|
for (i = 0; string_array[i] != 0; i++) {
|
|
if (strncmp(string_array[i], key, len) == 0) {
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
#endif
|
|
|
|
int index_in_substrings(const char *strings, const char *key)
|
|
{
|
|
int len = strlen(key);
|
|
|
|
if (len) {
|
|
int idx = 0;
|
|
while (strings[0]) {
|
|
if (strncmp(strings, key, len) == 0) {
|
|
return idx;
|
|
}
|
|
strings += strlen(strings) + 1; /* skip NUL */
|
|
idx++;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
const char *nth_string(const char *strings, int n)
|
|
{
|
|
while (n) {
|
|
n--;
|
|
strings += strlen(strings) + 1;
|
|
}
|
|
return strings;
|
|
}
|