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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/*
* sysobj - https://github.com/bp0/verbose-spork
* Copyright (C) 2018 Burt P. <pburt0@gmail.com>
*
* 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.
*
*/
/* versions of strstr() and strcasestr() where the match must be preceded and
* succeded by a non-alpha-numeric character. */
#define _GNU_SOURCE
#include <string.h>
#include <ctype.h>
static char *_strstr(const char *haystack, const char *needle, int anycase) {
return anycase
? strcasestr(haystack, needle)
: strstr(haystack, needle);
}
static char *_strstr_word(const char *haystack, const char *needle,
int anycase, int prefix_ok, int suffix_ok) {
if (!haystack || !needle)
return NULL;
char *c;
const char *p = haystack;
size_t l = strlen(needle);
while((c = _strstr(p, needle, anycase))) {
const char *before = (c == haystack) ? NULL : c-1;
const char *after = c + l;
int ok = 1, wbs = 1, wbe = 1;
if (isalnum(*after)) wbe = 0;
if (before && isalnum(*before)) wbs = 0;
if (!wbe && !prefix_ok) ok = 0;
if (!wbs && !suffix_ok) ok = 0;
if (!(wbs || wbe)) ok = 0;
if (ok) return c;
p++;
}
return NULL;
}
char *strstr_word(const char *haystack, const char *needle) {
return _strstr_word(haystack, needle, 0, 0, 0);
}
char *strcasestr_word(const char *haystack, const char *needle) {
return _strstr_word(haystack, needle, 1, 0, 0);
}
char *strstr_word_prefix(const char *haystack, const char *needle) {
return _strstr_word(haystack, needle, 0, 1, 0);
}
char *strcasestr_word_prefix(const char *haystack, const char *needle) {
return _strstr_word(haystack, needle, 1, 1, 0);
}
char *strstr_word_suffix(const char *haystack, const char *needle) {
return _strstr_word(haystack, needle, 0, 0, 1);
}
char *strcasestr_word_suffix(const char *haystack, const char *needle) {
return _strstr_word(haystack, needle, 1, 0, 1);
}
|
