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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
#include "common.h"
struct simple_pattern {
const char *match;
size_t len;
SIMPLE_PREFIX_MODE mode;
char negative;
struct simple_pattern *child;
struct simple_pattern *next;
};
static inline struct simple_pattern *parse_pattern(const char *str, SIMPLE_PREFIX_MODE default_mode) {
SIMPLE_PREFIX_MODE mode;
struct simple_pattern *child = NULL;
char *buf = strdupz(str);
char *s = buf, *c = buf;
// skip asterisks in front
while(*c == '*') c++;
// find the next asterisk
while(*c && *c != '*') c++;
// do we have an asterisk in the middle?
if(*c == '*' && c[1] != '\0') {
// yes, we have
child = parse_pattern(c, default_mode);
c[1] = '\0';
}
// check what this one matches
size_t len = strlen(s);
if(len >= 2 && *s == '*' && s[len - 1] == '*') {
s[len - 1] = '\0';
s++;
mode = SIMPLE_PATTERN_SUBSTRING;
}
else if(len >= 1 && *s == '*') {
s++;
mode = SIMPLE_PATTERN_SUFFIX;
}
else if(len >= 1 && s[len - 1] == '*') {
s[len - 1] = '\0';
mode = SIMPLE_PATTERN_PREFIX;
}
else
mode = default_mode;
// allocate the structure
struct simple_pattern *m = callocz(1, sizeof(struct simple_pattern));
if(*s) {
m->match = strdupz(s);
m->len = strlen(m->match);
m->mode = mode;
}
else {
m->mode = SIMPLE_PATTERN_SUBSTRING;
}
m->child = child;
freez(buf);
return m;
}
SIMPLE_PATTERN *simple_pattern_create(const char *list, SIMPLE_PREFIX_MODE default_mode) {
struct simple_pattern *root = NULL, *last = NULL;
if(unlikely(!list || !*list)) return root;
char *buf = strdupz(list);
if(buf && *buf) {
char *s = buf;
while(s && *s) {
char negative = 0;
// skip all spaces
while(isspace(*s)) s++;
if(*s == '!') {
negative = 1;
s++;
}
// empty string
if(unlikely(!*s)) break;
// find the next space
char *c = s;
while(*c && !isspace(*c)) c++;
// find the next word
char *n;
if(likely(*c)) n = c + 1;
else n = NULL;
// terminate our string
*c = '\0';
struct simple_pattern *m = parse_pattern(s, default_mode);
m->negative = negative;
if(likely(n)) *c = ' ';
// link it at the end
if(unlikely(!root))
root = last = m;
else {
last->next = m;
last = m;
}
// prepare for next loop
s = n;
}
}
freez(buf);
return (SIMPLE_PATTERN *)root;
}
static inline int match_pattern(struct simple_pattern *m, const char *str, size_t len) {
char *s;
if(m->len <= len) {
switch(m->mode) {
case SIMPLE_PATTERN_SUBSTRING:
if(!m->len) return 1;
if((s = strstr(str, m->match))) {
if(!m->child) return 1;
return match_pattern(m->child, &s[m->len], len - (s - str) - m->len);
}
break;
case SIMPLE_PATTERN_PREFIX:
if(unlikely(strncmp(str, m->match, m->len) == 0)) {
if(!m->child) return 1;
return match_pattern(m->child, &str[m->len], len - m->len);
}
break;
case SIMPLE_PATTERN_SUFFIX:
if(unlikely(strcmp(&str[len - m->len], m->match) == 0)) {
if(!m->child) return 1;
return 0;
}
break;
case SIMPLE_PATTERN_EXACT:
default:
if(unlikely(strcmp(str, m->match) == 0)) {
if(!m->child) return 1;
return 0;
}
break;
}
}
return 0;
}
int simple_pattern_matches(SIMPLE_PATTERN *list, const char *str) {
struct simple_pattern *m, *root = (struct simple_pattern *)list;
if(unlikely(!root)) return 0;
size_t len = strlen(str);
for(m = root; m ; m = m->next)
if(match_pattern(m, str, len)) {
if(m->negative) return 0;
return 1;
}
return 0;
}
static inline void free_pattern(struct simple_pattern *m) {
if(!m) return;
if(m->next) free_pattern(m->next);
if(m->child) free_pattern(m->child);
freez((void *)m->match);
freez(m);
}
void simple_pattern_free(SIMPLE_PATTERN *list) {
if(!list) return;
free_pattern(((struct simple_pattern *)list)->next);
}
|
