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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
/****************************************************************************
* bfs *
* Copyright (C) 2022 Tavian Barnes <tavianator@tavianator.com> *
* *
* Permission to use, copy, modify, and/or distribute this software for any *
* purpose with or without fee is hereby granted. *
* *
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES *
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF *
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR *
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES *
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN *
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF *
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *
****************************************************************************/
#include "regex.h"
#include <assert.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#if BFS_WITH_ONIGURUMA
# include <langinfo.h>
# include <oniguruma.h>
#else
# include <regex.h>
#endif
struct bfs_regex {
#if BFS_WITH_ONIGURUMA
OnigRegex impl;
#else
regex_t impl;
#endif
};
#if BFS_WITH_ONIGURUMA
/** Get (and initialize) the appropriate encoding for the current locale. */
static OnigEncoding bfs_onig_encoding(int *err) {
static OnigEncoding enc = NULL;
if (enc) {
return enc;
}
// Fall back to ASCII by default
enc = ONIG_ENCODING_ASCII;
// Oniguruma has no locale support, so try to guess the right encoding
// from the current locale.
const char *charmap = nl_langinfo(CODESET);
if (charmap) {
#define BFS_MAP_ENCODING(name, value) \
do { \
if (strcmp(charmap, name) == 0) { \
enc = value; \
} \
} while (0)
#define BFS_MAP_ENCODING2(name1, name2, value) \
do { \
BFS_MAP_ENCODING(name1, value); \
BFS_MAP_ENCODING(name2, value); \
} while (0)
// These names were found with locale -m on Linux and FreeBSD
#define BFS_MAP_ISO_8859(n) \
BFS_MAP_ENCODING2("ISO-8859-" #n, "ISO8859-" #n, ONIG_ENCODING_ISO_8859_ ## n)
BFS_MAP_ISO_8859(1);
BFS_MAP_ISO_8859(2);
BFS_MAP_ISO_8859(3);
BFS_MAP_ISO_8859(4);
BFS_MAP_ISO_8859(5);
BFS_MAP_ISO_8859(6);
BFS_MAP_ISO_8859(7);
BFS_MAP_ISO_8859(8);
BFS_MAP_ISO_8859(9);
BFS_MAP_ISO_8859(10);
BFS_MAP_ISO_8859(11);
// BFS_MAP_ISO_8859(12);
BFS_MAP_ISO_8859(13);
BFS_MAP_ISO_8859(14);
BFS_MAP_ISO_8859(15);
BFS_MAP_ISO_8859(16);
BFS_MAP_ENCODING("UTF-8", ONIG_ENCODING_UTF8);
#define BFS_MAP_EUC(name) \
BFS_MAP_ENCODING2("EUC-" #name, "euc" #name, ONIG_ENCODING_EUC_ ## name)
BFS_MAP_EUC(JP);
BFS_MAP_EUC(TW);
BFS_MAP_EUC(KR);
BFS_MAP_EUC(CN);
BFS_MAP_ENCODING2("SHIFT_JIS", "SJIS", ONIG_ENCODING_SJIS);
// BFS_MAP_ENCODING("KOI-8", ONIG_ENCODING_KOI8);
BFS_MAP_ENCODING("KOI8-R", ONIG_ENCODING_KOI8_R);
BFS_MAP_ENCODING("CP1251", ONIG_ENCODING_CP1251);
BFS_MAP_ENCODING("GB18030", ONIG_ENCODING_BIG5);
}
*err = onig_initialize(&enc, 1);
if (*err != ONIG_NORMAL) {
enc = NULL;
}
return enc;
}
#endif
struct bfs_regex *bfs_regcomp(const char *expr, enum bfs_regex_type type, enum bfs_regcomp_flags flags, int *err) {
struct bfs_regex *regex = malloc(sizeof(*regex));
if (!regex) {
#if BFS_WITH_ONIGURUMA
*err = ONIGERR_MEMORY;
#else
*err = REG_ESPACE;
#endif
return NULL;
}
#if BFS_WITH_ONIGURUMA
OnigSyntaxType *syntax = NULL;
switch (type) {
case BFS_REGEX_POSIX_BASIC:
syntax = ONIG_SYNTAX_POSIX_BASIC;
break;
case BFS_REGEX_POSIX_EXTENDED:
syntax = ONIG_SYNTAX_POSIX_EXTENDED;
break;
case BFS_REGEX_EMACS:
syntax = ONIG_SYNTAX_EMACS;
break;
case BFS_REGEX_GREP:
syntax = ONIG_SYNTAX_GREP;
break;
}
assert(syntax);
OnigOptionType options = syntax->options;
if (flags & BFS_REGEX_ICASE) {
options |= ONIG_OPTION_IGNORECASE;
}
OnigEncoding enc = bfs_onig_encoding(err);
if (!enc) {
goto fail;
}
const unsigned char *uexpr = (const unsigned char *)expr;
const unsigned char *end = uexpr + strlen(expr);
*err = onig_new(®ex->impl, uexpr, end, options, enc, syntax, NULL);
if (*err != ONIG_NORMAL) {
goto fail;
}
#else
int cflags = 0;
switch (type) {
case BFS_REGEX_POSIX_BASIC:
break;
case BFS_REGEX_POSIX_EXTENDED:
cflags |= REG_EXTENDED;
break;
default:
*err = REG_BADPAT;
goto fail;
}
if (flags & BFS_REGEX_ICASE) {
cflags |= REG_ICASE;
}
*err = regcomp(®ex->impl, expr, cflags);
if (*err != 0) {
goto fail;
}
#endif
return regex;
fail:
free(regex);
return NULL;
}
bool bfs_regexec(struct bfs_regex *regex, const char *str, enum bfs_regexec_flags flags, int *err) {
size_t len = strlen(str);
#if BFS_WITH_ONIGURUMA
const unsigned char *ustr = (const unsigned char *)str;
const unsigned char *end = ustr + len;
// The docs for onig_{match,search}() say
//
// Do not pass invalid byte string in the regex character encoding.
if (!onigenc_is_valid_mbc_string(onig_get_encoding(regex->impl), ustr, end)) {
*err = 0;
return false;
}
int ret;
if (flags & BFS_REGEX_ANCHOR) {
ret = onig_match(regex->impl, ustr, end, ustr, NULL, ONIG_OPTION_DEFAULT);
} else {
ret = onig_search(regex->impl, ustr, end, ustr, end, NULL, ONIG_OPTION_DEFAULT);
}
if (ret >= 0) {
*err = 0;
if (flags & BFS_REGEX_ANCHOR) {
return (size_t)ret == len;
} else {
return true;
}
} else if (ret == ONIG_MISMATCH) {
*err = 0;
} else {
*err = ret;
}
return false;
#else
regmatch_t match = {
.rm_so = 0,
.rm_eo = len,
};
int eflags = 0;
#ifdef REG_STARTEND
eflags |= REG_STARTEND;
#endif
int ret = regexec(®ex->impl, str, 1, &match, eflags);
if (ret == 0) {
*err = 0;
if (flags & BFS_REGEX_ANCHOR) {
return match.rm_so == 0 && (size_t)match.rm_eo == len;
} else {
return true;
}
} else if (ret == REG_NOMATCH) {
*err = 0;
} else {
*err = ret;
}
return false;
#endif
}
void bfs_regfree(struct bfs_regex *regex) {
if (regex) {
#if BFS_WITH_ONIGURUMA
onig_free(regex->impl);
#else
regfree(®ex->impl);
#endif
free(regex);
}
}
char *bfs_regerror(int err, const struct bfs_regex *regex) {
#if BFS_WITH_ONIGURUMA
unsigned char *str = malloc(ONIG_MAX_ERROR_MESSAGE_LEN);
if (str) {
onig_error_code_to_str(str, err);
}
return (char *)str;
#else
const regex_t *impl = regex ? ®ex->impl : NULL;
size_t len = regerror(err, impl, NULL, 0);
char *str = malloc(len);
if (str) {
regerror(err, impl, str, len);
}
return str;
#endif
}
|