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
|
#include "AppHdr.h"
#include "pattern.h"
///////////////////////////////////////////////////////////////////////
// Pattern matching
inline int pm_lower(int ch, bool icase)
{
return icase? tolower(ch) : ch;
}
// Determines whether the pattern specified by 'pattern' matches the given
// text. A pattern is a simple glob, with the traditional * and ? wildcards.
static bool glob_match( const char *pattern, const char *text, bool icase )
{
char p, t;
bool special;
while (true)
{
p = pm_lower(*pattern++, icase);
t = pm_lower(*text++, icase);
special = true;
if (!p)
return (t == 0);
if (p == '\\' && *pattern)
{
p = pm_lower(*pattern++, icase);
special = false;
}
if (p == '*' && special)
{
// Try to match exactly at the current text position...
if (!*pattern || glob_match(pattern, text - 1, icase))
return (true);
// Or skip one character in the text and try the wildcard match
// again. If this is the end of the text, the match has failed.
return (t ? glob_match(pattern - 1, text, icase) : false);
}
else if (!t || p != t && (p != '?' || !special))
return (false);
}
}
////////////////////////////////////////////////////////////////////
// Basic glob (always available)
struct glob_info
{
std::string s;
bool ignore_case;
};
void *compile_glob_pattern(const char *pattern, bool icase)
{
// If we're using simple globs, we need to box the pattern with '*'
std::string s = std::string("*") + pattern + "*";
glob_info *gi = new glob_info;
if (gi)
{
gi->s = s;
gi->ignore_case = icase;
}
return gi;
}
void free_compiled_glob_pattern(void *compiled_pattern)
{
delete static_cast<glob_info *>( compiled_pattern );
}
bool glob_pattern_match(void *compiled_pattern, const char *text, int length)
{
glob_info *gi = static_cast<glob_info *>( compiled_pattern );
return glob_match(gi->s.c_str(), text, gi->ignore_case);
}
////////////////////////////////////////////////////////////////////
#if defined(REGEX_PCRE)
////////////////////////////////////////////////////////////////////
// Perl Compatible Regular Expressions
void *compile_pattern(const char *pattern, bool icase)
{
const char *error;
int erroffset;
int flags = icase? PCRE_CASELESS : 0;
return pcre_compile(pattern,
flags,
&error,
&erroffset,
NULL);
}
void free_compiled_pattern(void *cp)
{
if (cp)
pcre_free(cp);
}
bool pattern_match(void *compiled_pattern, const char *text, int length)
{
int ovector[42];
int pcre_rc = pcre_exec(static_cast<pcre *>(compiled_pattern),
NULL,
text, length, 0, 0,
ovector, sizeof(ovector) / sizeof(*ovector));
return (pcre_rc >= 0);
}
////////////////////////////////////////////////////////////////////
#elif defined(REGEX_POSIX)
////////////////////////////////////////////////////////////////////
// POSIX regular expressions
void *compile_pattern(const char *pattern, bool icase)
{
regex_t *re = new regex_t;
if (!re)
return NULL;
int flags = REG_EXTENDED | REG_NOSUB;
if (icase)
flags |= REG_ICASE;
int rc = regcomp(re, pattern, flags);
// Nonzero return code == failure
if (rc)
{
delete re;
return NULL;
}
return re;
}
void free_compiled_pattern(void *cp)
{
if (cp)
{
regex_t *re = static_cast<regex_t *>( cp );
regfree(re);
delete re;
}
}
bool pattern_match(void *compiled_pattern, const char *text, int length)
{
regex_t *re = static_cast<regex_t *>( compiled_pattern );
return !regexec(re, text, 0, NULL, 0);
}
////////////////////////////////////////////////////////////////////
#else
void *compile_pattern(const char *pattern, bool icase)
{
return compile_glob_pattern(pattern, icase);
}
void free_compiled_pattern(void *cp)
{
free_compiled_glob_pattern(cp);
}
bool pattern_match(void *compiled_pattern, const char *text, int length)
{
return glob_pattern_match(compiled_pattern, text, length);
}
#endif
|
