3 MPDM - Minimum Profit Data Manager
4 Copyright (C) 2003/2007 Angel Ortega <angel@triptico.com>
6 mpdm_r.c - Regular expressions
8 This program is free software; you can redistribute it and/or
9 modify it under the terms of the GNU General Public License
10 as published by the Free Software Foundation; either version 2
11 of the License, or (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
22 http://www.triptico.com
36 #include <pcreposix.h>
39 #ifdef CONFOPT_SYSTEM_REGEX
43 #ifdef CONFOPT_INCLUDED_REGEX
44 #include "gnu_regex.h"
51 /* matching of the last regex */
53 int mpdm_regex_offset
= -1;
54 int mpdm_regex_size
= 0;
56 /* number of substitutions in last sregex */
58 int mpdm_sregex_count
= 0;
64 static wchar_t *regex_flags(const mpdm_t r
)
66 return wcsrchr((wchar_t *) r
->data
, *(wchar_t *) r
->data
);
70 static mpdm_t
mpdm_regcomp(mpdm_t r
)
73 mpdm_t regex_cache
= NULL
;
75 /* if cache does not exist, create it */
76 if ((regex_cache
= mpdm_hget_s(mpdm_root(), L
"__REGEX_CACHE__")) == NULL
) {
77 regex_cache
= MPDM_H(0);
78 mpdm_hset_s(mpdm_root(), L
"__REGEX_CACHE__", regex_cache
);
81 /* search the regex in the cache */
82 if ((c
= mpdm_hget(regex_cache
, r
)) == NULL
) {
89 /* not found; regex must be compiled */
92 rmb
= MPDM_2MBS(r
->data
);
94 regex
= (char *) rmb
->data
;
95 if ((flags
= strrchr(regex
, *regex
)) == NULL
)
98 if (strchr(flags
, 'i') != NULL
)
100 if (strchr(flags
, 'm') != NULL
)
106 if (!regcomp(&re
, regex
, f
)) {
109 if ((ptr
= malloc(sizeof(regex_t
))) != NULL
) {
111 memcpy(ptr
, &re
, sizeof(regex_t
));
114 c
= mpdm_new(MPDM_FREE
, ptr
, sizeof(regex_t
));
117 mpdm_hset(regex_cache
, r
, c
);
126 static mpdm_t
regex1(mpdm_t r
, const mpdm_t v
, int offset
)
127 /* test for one regex */
132 /* no matching yet */
133 mpdm_regex_offset
= -1;
135 /* compile the regex */
136 if ((cr
= mpdm_regcomp(r
)) != NULL
) {
143 /* takes pointer to 'last' flag */
144 if ((last
= regex_flags(r
)) != NULL
)
145 last
= wcschr(last
, 'l');
148 ptr
= mpdm_wcstombs((wchar_t *) v
->data
+ offset
, NULL
);
151 while (regexec((regex_t
*) cr
->data
, ptr
+ o
, 1,
152 &rm
, offset
> 0 ? REG_NOTBOL
: 0) == 0) {
155 /* if 'last' is not set, it's done */
165 /* converts to mbs the string from the beginning
166 to the start of the match, just to know
167 the size (and immediately frees it) */
168 free(mpdm_mbstowcs(ptr
, &mpdm_regex_offset
, rm
.rm_so
));
171 mpdm_regex_offset
+= offset
;
173 /* create now the matching string */
174 w
= MPDM_NMBS(ptr
+ rm
.rm_so
, rm
.rm_eo
- rm
.rm_so
);
176 /* and store the size */
177 mpdm_regex_size
= mpdm_size(w
);
188 * mpdm_regex - Matches a regular expression.
189 * @r: the regular expression
190 * @v: the value to be matched
191 * @offset: offset from the start of v->data
193 * Matches a regular expression against a value. Valid flags are 'i',
194 * for case-insensitive matching, 'm', to treat the string as a
195 * multiline string (i.e., one containing newline characters), so
196 * that ^ and $ match the boundaries of each line instead of the
197 * whole string, 'l', to return the last matching instead of the
198 * first one, or 'g', to match globally; in that last case, an array
199 * containing all matches is returned instead of a string scalar.
201 * If @r is a string, an ordinary regular expression matching is tried
202 * over the @v string. If the matching is possible, the match result
203 * is returned, or NULL otherwise.
205 * If @r is an array (of strings), each element is tried sequentially
206 * as an individual regular expression over the @v string, each one using
207 * the offset returned by the previous match. All regular expressions
208 * must match to be successful. If this is the case, an array (with
209 * the same number of arguments) is returned containing the matched
210 * strings, or NULL otherwise.
212 * If @r is NULL, the result of the previous regex matching
213 * is returned as a two element array. The first element will contain
214 * the character offset of the matching and the second the number of
215 * characters matched. If the previous regex was unsuccessful, NULL
217 * [Regular Expressions]
219 mpdm_t
mpdm_regex(mpdm_t r
, const mpdm_t v
, int offset
)
223 /* special case: if r is NULL, return previous match */
225 /* if previous regex was successful... */
226 if (mpdm_regex_offset
!= -1) {
229 mpdm_aset(w
, MPDM_I(mpdm_regex_offset
), 0);
230 mpdm_aset(w
, MPDM_I(mpdm_regex_size
), 1);
236 /* if the string to be tested is NULL, return NULL */
240 if (r
->flags
& MPDM_MULTIPLE
) {
244 /* multiple value; try sequentially all regexes,
245 moving the offset forward */
247 w
= MPDM_A(mpdm_size(r
));
249 for (n
= 0; n
< mpdm_size(r
); n
++) {
250 t
= mpdm_regex(mpdm_aget(r
, n
), v
, offset
);
252 /* if not found, invalid all search and exit */
258 /* found; store and move forward */
260 offset
= mpdm_regex_offset
+ mpdm_regex_size
;
266 /* takes pointer to 'global' flag */
267 if ((global
= regex_flags(r
)) != NULL
)
268 global
= wcschr(global
, 'g');
270 if (global
!= NULL
) {
273 /* match sequentially until done */
276 while ((t
= regex1(r
, v
, offset
)) != NULL
) {
279 offset
= mpdm_regex_offset
+ mpdm_regex_size
;
282 /* no matches? convert to NULL */
283 if (mpdm_size(w
) == 0)
287 w
= regex1(r
, v
, offset
);
294 static mpdm_t
expand_ampersands(const mpdm_t s
, const mpdm_t t
)
295 /* substitutes all unescaped ampersands in s with t */
297 const wchar_t *sptr
= mpdm_string(s
);
304 while ((wptr
= wcschr(sptr
, L
'\\')) != NULL
||
305 (wptr
= wcschr(sptr
, L
'&')) != NULL
) {
308 /* add the leading part */
309 r
= mpdm_strcat(r
, MPDM_NS(sptr
, n
));
312 r
= mpdm_strcat(r
, MPDM_NS(++wptr
, 1));
315 r
= mpdm_strcat(r
, t
);
323 /* add the rest of the string */
324 r
= mpdm_strcat(r
, MPDM_S(sptr
));
332 * mpdm_sregex - Matches and substitutes a regular expression.
333 * @r: the regular expression
334 * @v: the value to be matched
335 * @s: the substitution string, hash or code
336 * @offset: offset from the start of v->data
338 * Matches a regular expression against a value, and substitutes the
339 * found substring with @s. Valid flags are 'i', for case-insensitive
340 * matching, and 'g', for global replacements (all ocurrences in @v
341 * will be replaced, instead of just the first found one).
343 * If @s is executable, it's executed with the matched part as
344 * the only argument and its return value is used as the
345 * substitution string.
347 * If @s is a hash, the matched string is used as a key to it and
348 * its value used as the substitution. If this value itself is
349 * executable, it's executed with the matched string as its only
350 * argument and its return value used as the substitution.
352 * If @r is NULL, returns the number of substitutions made in the
353 * previous call to mpdm_sregex() (can be zero if none was done).
355 * The global variables @mpdm_regex_offset and @mpdm_regex_size are
356 * set to the offset of the matched string and the size of the
357 * replaced string, respectively.
359 * Returns the modified string, or the original one if no substitutions
361 * [Regular Expressions]
363 mpdm_t
mpdm_sregex(mpdm_t r
, const mpdm_t v
, const mpdm_t s
, int offset
)
369 /* return last count */
370 return MPDM_I(mpdm_sregex_count
);
376 /* compile the regex */
377 if ((cr
= mpdm_regcomp(r
)) != NULL
) {
383 /* takes pointer to global flag */
384 if ((global
= regex_flags(r
)) !=NULL
)
385 global
= wcschr(global
, 'g');
387 /* store the first part */
388 o
= MPDM_NS(v
->data
, offset
);
391 if ((ptr
= mpdm_wcstombs((wchar_t *) v
->data
+ offset
, NULL
)) == NULL
)
395 mpdm_sregex_count
= 0;
396 mpdm_regex_offset
= -1;
402 f
= !regexec((regex_t
*) cr
->data
, ptr
+ i
,
403 1, &rm
, offset
> 0 ? REG_NOTBOL
: 0);
406 /* creates a string from the beginning
407 to the start of the match */
408 t
= MPDM_NMBS(ptr
+ i
, rm
.rm_so
);
409 o
= mpdm_strcat(o
, t
);
411 /* store offset of substitution */
412 mpdm_regex_offset
= mpdm_size(t
) + offset
;
414 /* get the matched part */
415 t
= MPDM_NMBS(ptr
+ i
+ rm
.rm_so
, rm
.rm_eo
- rm
.rm_so
);
417 /* is s an executable value? */
418 if (MPDM_IS_EXEC(s
)) {
419 /* protect o from sweeping */
422 /* execute s, with t as argument */
423 t
= mpdm_exec_1(s
, t
);
428 /* is s a hash? use match as key */
429 if (MPDM_IS_HASH(s
)) {
430 mpdm_t v
= mpdm_hget(s
, t
);
432 /* is the value executable? */
434 v
= mpdm_exec_1(v
, t
);
439 t
= expand_ampersands(s
, t
);
441 /* appends the substitution string */
442 o
= mpdm_strcat(o
, t
);
444 /* store size of substitution */
445 mpdm_regex_size
= mpdm_size(t
);
449 /* one more substitution */
453 } while (f
&& global
);
455 /* no (more) matches; convert and append the rest */
456 t
= MPDM_MBS(ptr
+ i
);
457 o
= mpdm_strcat(o
, t
);