1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
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
|
/* vi: set sw=4 ts=4: */
/*
* Utility routines.
*
* Copyright (C) 2008 Bernhard Reutner-Fischer
*
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
*/
#include "libbb.h"
/*
* The strrstr() function finds the last occurrence of the substring needle
* in the string haystack. The terminating nul characters are not compared.
*/
char* FAST_FUNC strrstr(const char *haystack, const char *needle)
{
char *r = NULL;
if (!needle[0])
return (char*)haystack + strlen(haystack);
while (1) {
char *p = strstr(haystack, needle);
if (!p)
return r;
r = p;
haystack = p + 1;
}
}
#if ENABLE_UNIT_TEST
BBUNIT_DEFINE_TEST(strrstr)
{
static const struct {
const char *h, *n;
int pos;
} test_array[] = {
/* 0123456789 */
{ "baaabaaab", "aaa", 5 },
{ "baaabaaaab", "aaa", 6 },
{ "baaabaab", "aaa", 1 },
{ "aaa", "aaa", 0 },
{ "aaa", "a", 2 },
{ "aaa", "bbb", -1 },
{ "a", "aaa", -1 },
{ "aaa", "", 3 },
{ "", "aaa", -1 },
{ "", "", 0 },
};
int i;
i = 0;
while (i < sizeof(test_array) / sizeof(test_array[0])) {
const char *r = strrstr(test_array[i].h, test_array[i].n);
if (r == NULL)
r = test_array[i].h - 1;
BBUNIT_ASSERT_EQ(r, test_array[i].h + test_array[i].pos);
i++;
}
BBUNIT_ENDTEST;
}
#endif /* ENABLE_UNIT_TEST */
|
