1 /* GRegex -- regular expression API wrapper around PCRE.
3 * Copyright (C) 1999, 2000 Scott Wimer
4 * Copyright (C) 2004, Matthias Clasen <mclasen@redhat.com>
5 * Copyright (C) 2005 - 2007, Marco Barisione <marco@barisione.org>
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
26 #ifdef USE_SYSTEM_PCRE
29 #include "pcre/pcre.h"
36 #include "gmessages.h"
37 #include "gstrfuncs.h"
43 * @title: Perl-compatible regular expressions
44 * @short_description: matches strings against regular expressions
45 * @see_also: <xref linkend="glib-regex-syntax"/>
47 * The <function>g_regex_*()</function> functions implement regular
48 * expression pattern matching using syntax and semantics similar to
49 * Perl regular expression.
51 * Some functions accept a @start_position argument, setting it differs
52 * from just passing over a shortened string and setting #G_REGEX_MATCH_NOTBOL
53 * in the case of a pattern that begins with any kind of lookbehind assertion.
54 * For example, consider the pattern "\Biss\B" which finds occurrences of "iss"
55 * in the middle of words. ("\B" matches only if the current position in the
56 * subject is not a word boundary.) When applied to the string "Mississipi"
57 * from the fourth byte, namely "issipi", it does not match, because "\B" is
58 * always false at the start of the subject, which is deemed to be a word
59 * boundary. However, if the entire string is passed , but with
60 * @start_position set to 4, it finds the second occurrence of "iss" because
61 * it is able to look behind the starting point to discover that it is
62 * preceded by a letter.
64 * Note that, unless you set the #G_REGEX_RAW flag, all the strings passed
65 * to these functions must be encoded in UTF-8. The lengths and the positions
66 * inside the strings are in bytes and not in characters, so, for instance,
67 * "\xc3\xa0" (i.e. "à") is two bytes long but it is treated as a
68 * single character. If you set #G_REGEX_RAW the strings can be non-valid
69 * UTF-8 strings and a byte is treated as a character, so "\xc3\xa0" is two
70 * bytes and two characters long.
72 * When matching a pattern, "\n" matches only against a "\n" character in
73 * the string, and "\r" matches only a "\r" character. To match any newline
74 * sequence use "\R". This particular group matches either the two-character
75 * sequence CR + LF ("\r\n"), or one of the single characters LF (linefeed,
76 * U+000A, "\n"), VT vertical tab, U+000B, "\v"), FF (formfeed, U+000C, "\f"),
77 * CR (carriage return, U+000D, "\r"), NEL (next line, U+0085), LS (line
78 * separator, U+2028), or PS (paragraph separator, U+2029).
80 * The behaviour of the dot, circumflex, and dollar metacharacters are
81 * affected by newline characters, the default is to recognize any newline
82 * character (the same characters recognized by "\R"). This can be changed
83 * with #G_REGEX_NEWLINE_CR, #G_REGEX_NEWLINE_LF and #G_REGEX_NEWLINE_CRLF
84 * compile options, and with #G_REGEX_MATCH_NEWLINE_ANY,
85 * #G_REGEX_MATCH_NEWLINE_CR, #G_REGEX_MATCH_NEWLINE_LF and
86 * #G_REGEX_MATCH_NEWLINE_CRLF match options. These settings are also
87 * relevant when compiling a pattern if #G_REGEX_EXTENDED is set, and an
88 * unescaped "#" outside a character class is encountered. This indicates
89 * a comment that lasts until after the next newline.
91 * Creating and manipulating the same #GRegex structure from different
92 * threads is not a problem as #GRegex does not modify its internal
93 * state between creation and destruction, on the other hand #GMatchInfo
96 * The regular expressions low-level functionalities are obtained through
97 * the excellent <ulink url="http://www.pcre.org/">PCRE</ulink> library
98 * written by Philip Hazel.
101 /* Mask of all the possible values for GRegexCompileFlags. */
102 #define G_REGEX_COMPILE_MASK (G_REGEX_CASELESS | \
103 G_REGEX_MULTILINE | \
107 G_REGEX_DOLLAR_ENDONLY | \
110 G_REGEX_NO_AUTO_CAPTURE | \
113 G_REGEX_NEWLINE_CR | \
114 G_REGEX_NEWLINE_LF | \
115 G_REGEX_NEWLINE_CRLF | \
116 G_REGEX_NEWLINE_ANYCRLF)
118 /* Mask of all the possible values for GRegexMatchFlags. */
119 #define G_REGEX_MATCH_MASK (G_REGEX_MATCH_ANCHORED | \
120 G_REGEX_MATCH_NOTBOL | \
121 G_REGEX_MATCH_NOTEOL | \
122 G_REGEX_MATCH_NOTEMPTY | \
123 G_REGEX_MATCH_PARTIAL | \
124 G_REGEX_MATCH_NEWLINE_CR | \
125 G_REGEX_MATCH_NEWLINE_LF | \
126 G_REGEX_MATCH_NEWLINE_CRLF | \
127 G_REGEX_MATCH_NEWLINE_ANY | \
128 G_REGEX_MATCH_NEWLINE_ANYCRLF)
130 /* we rely on these flags having the same values */
131 G_STATIC_ASSERT (G_REGEX_CASELESS == PCRE_CASELESS);
132 G_STATIC_ASSERT (G_REGEX_MULTILINE == PCRE_MULTILINE);
133 G_STATIC_ASSERT (G_REGEX_DOTALL == PCRE_DOTALL);
134 G_STATIC_ASSERT (G_REGEX_EXTENDED == PCRE_EXTENDED);
135 G_STATIC_ASSERT (G_REGEX_ANCHORED == PCRE_ANCHORED);
136 G_STATIC_ASSERT (G_REGEX_DOLLAR_ENDONLY == PCRE_DOLLAR_ENDONLY);
137 G_STATIC_ASSERT (G_REGEX_UNGREEDY == PCRE_UNGREEDY);
138 G_STATIC_ASSERT (G_REGEX_NO_AUTO_CAPTURE == PCRE_NO_AUTO_CAPTURE);
139 G_STATIC_ASSERT (G_REGEX_DUPNAMES == PCRE_DUPNAMES);
140 G_STATIC_ASSERT (G_REGEX_NEWLINE_CR == PCRE_NEWLINE_CR);
141 G_STATIC_ASSERT (G_REGEX_NEWLINE_LF == PCRE_NEWLINE_LF);
142 G_STATIC_ASSERT (G_REGEX_NEWLINE_CRLF == PCRE_NEWLINE_CRLF);
143 G_STATIC_ASSERT (G_REGEX_NEWLINE_ANYCRLF == PCRE_NEWLINE_ANYCRLF);
145 G_STATIC_ASSERT (G_REGEX_MATCH_ANCHORED == PCRE_ANCHORED);
146 G_STATIC_ASSERT (G_REGEX_MATCH_NOTBOL == PCRE_NOTBOL);
147 G_STATIC_ASSERT (G_REGEX_MATCH_NOTEOL == PCRE_NOTEOL);
148 G_STATIC_ASSERT (G_REGEX_MATCH_NOTEMPTY == PCRE_NOTEMPTY);
149 G_STATIC_ASSERT (G_REGEX_MATCH_PARTIAL == PCRE_PARTIAL);
150 G_STATIC_ASSERT (G_REGEX_MATCH_NEWLINE_CR == PCRE_NEWLINE_CR);
151 G_STATIC_ASSERT (G_REGEX_MATCH_NEWLINE_LF == PCRE_NEWLINE_LF);
152 G_STATIC_ASSERT (G_REGEX_MATCH_NEWLINE_CRLF == PCRE_NEWLINE_CRLF);
153 G_STATIC_ASSERT (G_REGEX_MATCH_NEWLINE_ANY == PCRE_NEWLINE_ANY);
154 G_STATIC_ASSERT (G_REGEX_MATCH_NEWLINE_ANYCRLF == PCRE_NEWLINE_ANYCRLF);
156 /* if the string is in UTF-8 use g_utf8_ functions, else use
158 #define NEXT_CHAR(re, s) (((re)->compile_opts & PCRE_UTF8) ? \
159 g_utf8_next_char (s) : \
161 #define PREV_CHAR(re, s) (((re)->compile_opts & PCRE_UTF8) ? \
162 g_utf8_prev_char (s) : \
167 volatile gint ref_count; /* the ref count */
168 GRegex *regex; /* the regex */
169 GRegexMatchFlags match_opts; /* options used at match time on the regex */
170 gint matches; /* number of matching sub patterns */
171 gint pos; /* position in the string where last match left off */
172 gint n_offsets; /* number of offsets */
173 gint *offsets; /* array of offsets paired 0,1 ; 2,3 ; 3,4 etc */
174 gint *workspace; /* workspace for pcre_dfa_exec() */
175 gint n_workspace; /* number of workspace elements */
176 const gchar *string; /* string passed to the match function */
177 gssize string_len; /* length of string */
182 volatile gint ref_count; /* the ref count for the immutable part */
183 gchar *pattern; /* the pattern */
184 pcre *pcre_re; /* compiled form of the pattern */
185 GRegexCompileFlags compile_opts; /* options used at compile time on the pattern */
186 GRegexMatchFlags match_opts; /* options used at match time on the regex */
187 pcre_extra *extra; /* data stored when G_REGEX_OPTIMIZE is used */
190 /* TRUE if ret is an error code, FALSE otherwise. */
191 #define IS_PCRE_ERROR(ret) ((ret) < PCRE_ERROR_NOMATCH && (ret) != PCRE_ERROR_PARTIAL)
193 typedef struct _InterpolationData InterpolationData;
194 static gboolean interpolation_list_needs_match (GList *list);
195 static gboolean interpolate_replacement (const GMatchInfo *match_info,
198 static GList *split_replacement (const gchar *replacement,
200 static void free_interpolation_data (InterpolationData *data);
204 match_error (gint errcode)
208 case PCRE_ERROR_NOMATCH:
211 case PCRE_ERROR_NULL:
212 /* NULL argument, this should not happen in GRegex */
213 g_warning ("A NULL argument was passed to PCRE");
215 case PCRE_ERROR_BADOPTION:
216 return "bad options";
217 case PCRE_ERROR_BADMAGIC:
218 return _("corrupted object");
219 case PCRE_ERROR_UNKNOWN_OPCODE:
220 return N_("internal error or corrupted object");
221 case PCRE_ERROR_NOMEMORY:
222 return _("out of memory");
223 case PCRE_ERROR_NOSUBSTRING:
224 /* not used by pcre_exec() */
226 case PCRE_ERROR_MATCHLIMIT:
227 return _("backtracking limit reached");
228 case PCRE_ERROR_CALLOUT:
229 /* callouts are not implemented */
231 case PCRE_ERROR_BADUTF8:
232 case PCRE_ERROR_BADUTF8_OFFSET:
233 /* we do not check if strings are valid */
235 case PCRE_ERROR_PARTIAL:
238 case PCRE_ERROR_BADPARTIAL:
239 return _("the pattern contains items not supported for partial matching");
240 case PCRE_ERROR_INTERNAL:
241 return _("internal error");
242 case PCRE_ERROR_BADCOUNT:
243 /* negative ovecsize, this should not happen in GRegex */
244 g_warning ("A negative ovecsize was passed to PCRE");
246 case PCRE_ERROR_DFA_UITEM:
247 return _("the pattern contains items not supported for partial matching");
248 case PCRE_ERROR_DFA_UCOND:
249 return _("back references as conditions are not supported for partial matching");
250 case PCRE_ERROR_DFA_UMLIMIT:
251 /* the match_field field is not used in GRegex */
253 case PCRE_ERROR_DFA_WSSIZE:
254 /* handled expanding the workspace */
256 case PCRE_ERROR_DFA_RECURSE:
257 case PCRE_ERROR_RECURSIONLIMIT:
258 return _("recursion limit reached");
259 case PCRE_ERROR_NULLWSLIMIT:
260 return _("workspace limit for empty substrings reached");
261 case PCRE_ERROR_BADNEWLINE:
262 return _("invalid combination of newline flags");
263 case PCRE_ERROR_BADOFFSET:
264 return _("bad offset");
265 case PCRE_ERROR_SHORTUTF8:
266 return _("short utf8");
267 case PCRE_ERROR_RECURSELOOP:
268 return _("recursion loop");
272 return _("unknown error");
276 translate_compile_error (gint *errcode, const gchar **errmsg)
278 /* Compile errors are created adding 100 to the error code returned
280 * If errcode is known we put the translatable error message in
281 * erromsg. If errcode is unknown we put the generic
282 * G_REGEX_ERROR_COMPILE error code in errcode and keep the
283 * untranslated error message returned by PCRE.
284 * Note that there can be more PCRE errors with the same GRegexError
285 * and that some PCRE errors are useless for us.
291 case G_REGEX_ERROR_STRAY_BACKSLASH:
292 *errmsg = _("\\ at end of pattern");
294 case G_REGEX_ERROR_MISSING_CONTROL_CHAR:
295 *errmsg = _("\\c at end of pattern");
297 case G_REGEX_ERROR_UNRECOGNIZED_ESCAPE:
298 *errmsg = _("unrecognized character follows \\");
300 case G_REGEX_ERROR_QUANTIFIERS_OUT_OF_ORDER:
301 *errmsg = _("numbers out of order in {} quantifier");
303 case G_REGEX_ERROR_QUANTIFIER_TOO_BIG:
304 *errmsg = _("number too big in {} quantifier");
306 case G_REGEX_ERROR_UNTERMINATED_CHARACTER_CLASS:
307 *errmsg = _("missing terminating ] for character class");
309 case G_REGEX_ERROR_INVALID_ESCAPE_IN_CHARACTER_CLASS:
310 *errmsg = _("invalid escape sequence in character class");
312 case G_REGEX_ERROR_RANGE_OUT_OF_ORDER:
313 *errmsg = _("range out of order in character class");
315 case G_REGEX_ERROR_NOTHING_TO_REPEAT:
316 *errmsg = _("nothing to repeat");
318 case 111: /* internal error: unexpected repeat */
319 *errcode = G_REGEX_ERROR_INTERNAL;
320 *errmsg = _("unexpected repeat");
322 case G_REGEX_ERROR_UNRECOGNIZED_CHARACTER:
323 *errmsg = _("unrecognized character after (? or (?-");
325 case G_REGEX_ERROR_POSIX_NAMED_CLASS_OUTSIDE_CLASS:
326 *errmsg = _("POSIX named classes are supported only within a class");
328 case G_REGEX_ERROR_UNMATCHED_PARENTHESIS:
329 *errmsg = _("missing terminating )");
331 case G_REGEX_ERROR_INEXISTENT_SUBPATTERN_REFERENCE:
332 *errmsg = _("reference to non-existent subpattern");
334 case G_REGEX_ERROR_UNTERMINATED_COMMENT:
335 *errmsg = _("missing ) after comment");
337 case G_REGEX_ERROR_EXPRESSION_TOO_LARGE:
338 *errmsg = _("regular expression is too large");
340 case G_REGEX_ERROR_MEMORY_ERROR:
341 *errmsg = _("failed to get memory");
343 case 122: /* unmatched parentheses */
344 *errcode = G_REGEX_ERROR_UNMATCHED_PARENTHESIS;
345 *errmsg = _(") without opening (");
347 case 123: /* internal error: code overflow */
348 *errcode = G_REGEX_ERROR_INTERNAL;
349 *errmsg = _("code overflow");
351 case 124: /* "unrecognized character after (?<\0 */
352 *errcode = G_REGEX_ERROR_UNRECOGNIZED_CHARACTER;
353 *errmsg = _("unrecognized character after (?<");
355 case G_REGEX_ERROR_VARIABLE_LENGTH_LOOKBEHIND:
356 *errmsg = _("lookbehind assertion is not fixed length");
358 case G_REGEX_ERROR_MALFORMED_CONDITION:
359 *errmsg = _("malformed number or name after (?(");
361 case G_REGEX_ERROR_TOO_MANY_CONDITIONAL_BRANCHES:
362 *errmsg = _("conditional group contains more than two branches");
364 case G_REGEX_ERROR_ASSERTION_EXPECTED:
365 *errmsg = _("assertion expected after (?(");
368 *errcode = G_REGEX_ERROR_UNMATCHED_PARENTHESIS;
369 /* translators: '(?R' and '(?[+-]digits' are both meant as (groups of)
370 * sequences here, '(?-54' would be an example for the second group.
372 *errmsg = _("(?R or (?[+-]digits must be followed by )");
374 case G_REGEX_ERROR_UNKNOWN_POSIX_CLASS_NAME:
375 *errmsg = _("unknown POSIX class name");
377 case G_REGEX_ERROR_POSIX_COLLATING_ELEMENTS_NOT_SUPPORTED:
378 *errmsg = _("POSIX collating elements are not supported");
380 case G_REGEX_ERROR_HEX_CODE_TOO_LARGE:
381 *errmsg = _("character value in \\x{...} sequence is too large");
383 case G_REGEX_ERROR_INVALID_CONDITION:
384 *errmsg = _("invalid condition (?(0)");
386 case G_REGEX_ERROR_SINGLE_BYTE_MATCH_IN_LOOKBEHIND:
387 *errmsg = _("\\C not allowed in lookbehind assertion");
389 case 137: /* PCRE does not support \\L, \\l, \\N{name}, \\U, or \\u\0 */
390 /* A number of Perl escapes are not handled by PCRE.
391 * Therefore it explicitly raises ERR37.
393 *errcode = G_REGEX_ERROR_UNRECOGNIZED_ESCAPE;
394 *errmsg = _("escapes \\L, \\l, \\N{name}, \\U, and \\u are not supported");
396 case G_REGEX_ERROR_INFINITE_LOOP:
397 *errmsg = _("recursive call could loop indefinitely");
399 case 141: /* unrecognized character after (?P\0 */
400 *errcode = G_REGEX_ERROR_UNRECOGNIZED_CHARACTER;
401 *errmsg = _("unrecognized character after (?P");
403 case G_REGEX_ERROR_MISSING_SUBPATTERN_NAME_TERMINATOR:
404 *errmsg = _("missing terminator in subpattern name");
406 case G_REGEX_ERROR_DUPLICATE_SUBPATTERN_NAME:
407 *errmsg = _("two named subpatterns have the same name");
409 case G_REGEX_ERROR_MALFORMED_PROPERTY:
410 *errmsg = _("malformed \\P or \\p sequence");
412 case G_REGEX_ERROR_UNKNOWN_PROPERTY:
413 *errmsg = _("unknown property name after \\P or \\p");
415 case G_REGEX_ERROR_SUBPATTERN_NAME_TOO_LONG:
416 *errmsg = _("subpattern name is too long (maximum 32 characters)");
418 case G_REGEX_ERROR_TOO_MANY_SUBPATTERNS:
419 *errmsg = _("too many named subpatterns (maximum 10,000)");
421 case G_REGEX_ERROR_INVALID_OCTAL_VALUE:
422 *errmsg = _("octal value is greater than \\377");
424 case 152: /* internal error: overran compiling workspace */
425 *errcode = G_REGEX_ERROR_INTERNAL;
426 *errmsg = _("overran compiling workspace");
428 case 153: /* internal error: previously-checked referenced subpattern not found */
429 *errcode = G_REGEX_ERROR_INTERNAL;
430 *errmsg = _("previously-checked referenced subpattern not found");
432 case G_REGEX_ERROR_TOO_MANY_BRANCHES_IN_DEFINE:
433 *errmsg = _("DEFINE group contains more than one branch");
435 case G_REGEX_ERROR_INCONSISTENT_NEWLINE_OPTIONS:
436 *errmsg = _("inconsistent NEWLINE options");
438 case G_REGEX_ERROR_MISSING_BACK_REFERENCE:
439 *errmsg = _("\\g is not followed by a braced, angle-bracketed, or quoted name or "
440 "number, or by a plain number");
442 case G_REGEX_ERROR_INVALID_RELATIVE_REFERENCE:
443 *errmsg = _("a numbered reference must not be zero");
445 case G_REGEX_ERROR_BACKTRACKING_CONTROL_VERB_ARGUMENT_FORBIDDEN:
446 *errmsg = _("an argument is not allowed for (*ACCEPT), (*FAIL), or (*COMMIT)");
448 case G_REGEX_ERROR_UNKNOWN_BACKTRACKING_CONTROL_VERB:
449 *errmsg = _("(*VERB) not recognized");
451 case G_REGEX_ERROR_NUMBER_TOO_BIG:
452 *errmsg = _("number is too bug");
454 case G_REGEX_ERROR_MISSING_SUBPATTERN_NAME:
455 *errmsg = _("missing subpattern name after (?&");
457 case G_REGEX_ERROR_MISSING_DIGIT:
458 *errmsg = _("digit expected after (?+");
460 case G_REGEX_ERROR_EXTRA_SUBPATTERN_NAME:
461 *errmsg = _("different names for subpatterns of the same number are not allowed");
463 case G_REGEX_ERROR_BACKTRACKING_CONTROL_VERB_ARGUMENT_REQUIRED:
464 *errmsg = _("(*MARK) must have an argument");
466 case G_REGEX_ERROR_INVALID_CONTROL_CHAR:
467 *errmsg = _( "\\c must be followed by an ASCII character");
469 case G_REGEX_ERROR_MISSING_NAME:
470 *errmsg = _("\\k is not followed by a braced, angle-bracketed, or quoted name");
472 case G_REGEX_ERROR_NOT_SUPPORTED_IN_CLASS:
473 *errmsg = _("\\N is not supported in a class");
475 case G_REGEX_ERROR_TOO_MANY_FORWARD_REFERENCES:
476 *errmsg = _("too many forward references");
478 case G_REGEX_ERROR_NAME_TOO_LONG:
479 *errmsg = _("name is too long in (*MARK), (*PRUNE), (*SKIP), or (*THEN)");
482 case 116: /* erroffset passed as NULL */
483 /* This should not happen as we never pass a NULL erroffset */
484 g_warning ("erroffset passed as NULL");
485 *errcode = G_REGEX_ERROR_COMPILE;
487 case 117: /* unknown option bit(s) set */
488 /* This should not happen as we check options before passing them
489 * to pcre_compile2() */
490 g_warning ("unknown option bit(s) set");
491 *errcode = G_REGEX_ERROR_COMPILE;
493 case 132: /* this version of PCRE is compiled without UTF support */
494 case 144: /* invalid UTF-8 string */
495 case 145: /* support for \\P, \\p, and \\X has not been compiled */
496 case 167: /* this version of PCRE is not compiled with Unicode property support */
497 case 173: /* disallowed Unicode code point (>= 0xd800 && <= 0xdfff) */
498 case 174: /* invalid UTF-16 string */
499 /* These errors should not happen as we are using an UTF-8 and UCP-enabled PCRE
500 * and we do not check if strings are valid */
501 case 164: /* ] is an invalid data character in JavaScript compatibility mode */
502 /* This should not happen as we don't use PCRE_JAVASCRIPT_COMPAT */
503 g_warning ("%s", *errmsg);
504 *errcode = G_REGEX_ERROR_COMPILE;
506 case 170: /* internal error: unknown opcode in find_fixedlength() */
507 *errcode = G_REGEX_ERROR_INTERNAL;
511 *errcode = G_REGEX_ERROR_COMPILE;
518 match_info_new (const GRegex *regex,
525 GMatchInfo *match_info;
528 string_len = strlen (string);
530 match_info = g_new0 (GMatchInfo, 1);
531 match_info->ref_count = 1;
532 match_info->regex = g_regex_ref ((GRegex *)regex);
533 match_info->string = string;
534 match_info->string_len = string_len;
535 match_info->matches = PCRE_ERROR_NOMATCH;
536 match_info->pos = start_position;
537 match_info->match_opts = match_options;
541 /* These values should be enough for most cases, if they are not
542 * enough g_regex_match_all_full() will expand them. */
543 match_info->n_offsets = 24;
544 match_info->n_workspace = 100;
545 match_info->workspace = g_new (gint, match_info->n_workspace);
550 pcre_fullinfo (regex->pcre_re, regex->extra,
551 PCRE_INFO_CAPTURECOUNT, &capture_count);
552 match_info->n_offsets = (capture_count + 1) * 3;
555 match_info->offsets = g_new0 (gint, match_info->n_offsets);
556 /* Set an invalid position for the previous match. */
557 match_info->offsets[0] = -1;
558 match_info->offsets[1] = -1;
564 * g_match_info_get_regex:
565 * @match_info: a #GMatchInfo
567 * Returns #GRegex object used in @match_info. It belongs to Glib
568 * and must not be freed. Use g_regex_ref() if you need to keep it
569 * after you free @match_info object.
571 * Returns: #GRegex object used in @match_info
576 g_match_info_get_regex (const GMatchInfo *match_info)
578 g_return_val_if_fail (match_info != NULL, NULL);
579 return match_info->regex;
583 * g_match_info_get_string:
584 * @match_info: a #GMatchInfo
586 * Returns the string searched with @match_info. This is the
587 * string passed to g_regex_match() or g_regex_replace() so
588 * you may not free it before calling this function.
590 * Returns: the string searched with @match_info
595 g_match_info_get_string (const GMatchInfo *match_info)
597 g_return_val_if_fail (match_info != NULL, NULL);
598 return match_info->string;
603 * @match_info: a #GMatchInfo
605 * Increases reference count of @match_info by 1.
607 * Returns: @match_info
612 g_match_info_ref (GMatchInfo *match_info)
614 g_return_val_if_fail (match_info != NULL, NULL);
615 g_atomic_int_inc (&match_info->ref_count);
620 * g_match_info_unref:
621 * @match_info: a #GMatchInfo
623 * Decreases reference count of @match_info by 1. When reference count drops
624 * to zero, it frees all the memory associated with the match_info structure.
629 g_match_info_unref (GMatchInfo *match_info)
631 if (g_atomic_int_dec_and_test (&match_info->ref_count))
633 g_regex_unref (match_info->regex);
634 g_free (match_info->offsets);
635 g_free (match_info->workspace);
642 * @match_info: (allow-none): a #GMatchInfo, or %NULL
644 * If @match_info is not %NULL, calls g_match_info_unref(); otherwise does
650 g_match_info_free (GMatchInfo *match_info)
652 if (match_info == NULL)
655 g_match_info_unref (match_info);
660 * @match_info: a #GMatchInfo structure
661 * @error: location to store the error occurring, or %NULL to ignore errors
663 * Scans for the next match using the same parameters of the previous
664 * call to g_regex_match_full() or g_regex_match() that returned
667 * The match is done on the string passed to the match function, so you
668 * cannot free it before calling this function.
670 * Returns: %TRUE is the string matched, %FALSE otherwise
675 g_match_info_next (GMatchInfo *match_info,
678 gint prev_match_start;
681 g_return_val_if_fail (match_info != NULL, FALSE);
682 g_return_val_if_fail (error == NULL || *error == NULL, FALSE);
683 g_return_val_if_fail (match_info->pos >= 0, FALSE);
685 prev_match_start = match_info->offsets[0];
686 prev_match_end = match_info->offsets[1];
688 if (match_info->pos > match_info->string_len)
690 /* we have reached the end of the string */
691 match_info->pos = -1;
692 match_info->matches = PCRE_ERROR_NOMATCH;
696 match_info->matches = pcre_exec (match_info->regex->pcre_re,
697 match_info->regex->extra,
699 match_info->string_len,
701 match_info->regex->match_opts | match_info->match_opts,
703 match_info->n_offsets);
704 if (IS_PCRE_ERROR (match_info->matches))
706 g_set_error (error, G_REGEX_ERROR, G_REGEX_ERROR_MATCH,
707 _("Error while matching regular expression %s: %s"),
708 match_info->regex->pattern, match_error (match_info->matches));
712 /* avoid infinite loops if the pattern is an empty string or something
714 if (match_info->pos == match_info->offsets[1])
716 if (match_info->pos > match_info->string_len)
718 /* we have reached the end of the string */
719 match_info->pos = -1;
720 match_info->matches = PCRE_ERROR_NOMATCH;
724 match_info->pos = NEXT_CHAR (match_info->regex,
725 &match_info->string[match_info->pos]) -
730 match_info->pos = match_info->offsets[1];
733 /* it's possible to get two identical matches when we are matching
734 * empty strings, for instance if the pattern is "(?=[A-Z0-9])" and
735 * the string is "RegExTest" we have:
736 * - search at position 0: match from 0 to 0
737 * - search at position 1: match from 3 to 3
738 * - search at position 3: match from 3 to 3 (duplicate)
739 * - search at position 4: match from 5 to 5
740 * - search at position 5: match from 5 to 5 (duplicate)
741 * - search at position 6: no match -> stop
742 * so we have to ignore the duplicates.
743 * see bug #515944: http://bugzilla.gnome.org/show_bug.cgi?id=515944 */
744 if (match_info->matches >= 0 &&
745 prev_match_start == match_info->offsets[0] &&
746 prev_match_end == match_info->offsets[1])
748 /* ignore this match and search the next one */
749 return g_match_info_next (match_info, error);
752 return match_info->matches >= 0;
756 * g_match_info_matches:
757 * @match_info: a #GMatchInfo structure
759 * Returns whether the previous match operation succeeded.
761 * Returns: %TRUE if the previous match operation succeeded,
767 g_match_info_matches (const GMatchInfo *match_info)
769 g_return_val_if_fail (match_info != NULL, FALSE);
771 return match_info->matches >= 0;
775 * g_match_info_get_match_count:
776 * @match_info: a #GMatchInfo structure
778 * Retrieves the number of matched substrings (including substring 0,
779 * that is the whole matched text), so 1 is returned if the pattern
780 * has no substrings in it and 0 is returned if the match failed.
782 * If the last match was obtained using the DFA algorithm, that is
783 * using g_regex_match_all() or g_regex_match_all_full(), the retrieved
784 * count is not that of the number of capturing parentheses but that of
785 * the number of matched substrings.
787 * Returns: Number of matched substrings, or -1 if an error occurred
792 g_match_info_get_match_count (const GMatchInfo *match_info)
794 g_return_val_if_fail (match_info, -1);
796 if (match_info->matches == PCRE_ERROR_NOMATCH)
799 else if (match_info->matches < PCRE_ERROR_NOMATCH)
804 return match_info->matches;
808 * g_match_info_is_partial_match:
809 * @match_info: a #GMatchInfo structure
811 * Usually if the string passed to g_regex_match*() matches as far as
812 * it goes, but is too short to match the entire pattern, %FALSE is
813 * returned. There are circumstances where it might be helpful to
814 * distinguish this case from other cases in which there is no match.
816 * Consider, for example, an application where a human is required to
817 * type in data for a field with specific formatting requirements. An
818 * example might be a date in the form ddmmmyy, defined by the pattern
819 * "^\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d$".
820 * If the application sees the user’s keystrokes one by one, and can
821 * check that what has been typed so far is potentially valid, it is
822 * able to raise an error as soon as a mistake is made.
824 * GRegex supports the concept of partial matching by means of the
825 * #G_REGEX_MATCH_PARTIAL flag. When this is set the return code for
826 * g_regex_match() or g_regex_match_full() is, as usual, %TRUE
827 * for a complete match, %FALSE otherwise. But, when these functions
828 * return %FALSE, you can check if the match was partial calling
829 * g_match_info_is_partial_match().
831 * When using partial matching you cannot use g_match_info_fetch*().
833 * Because of the way certain internal optimizations are implemented
834 * the partial matching algorithm cannot be used with all patterns.
835 * So repeated single characters such as "a{2,4}" and repeated single
836 * meta-sequences such as "\d+" are not permitted if the maximum number
837 * of occurrences is greater than one. Optional items such as "\d?"
838 * (where the maximum is one) are permitted. Quantifiers with any values
839 * are permitted after parentheses, so the invalid examples above can be
840 * coded thus "(a){2,4}" and "(\d)+". If #G_REGEX_MATCH_PARTIAL is set
841 * for a pattern that does not conform to the restrictions, matching
842 * functions return an error.
844 * Returns: %TRUE if the match was partial, %FALSE otherwise
849 g_match_info_is_partial_match (const GMatchInfo *match_info)
851 g_return_val_if_fail (match_info != NULL, FALSE);
853 return match_info->matches == PCRE_ERROR_PARTIAL;
857 * g_match_info_expand_references:
858 * @match_info: (allow-none): a #GMatchInfo or %NULL
859 * @string_to_expand: the string to expand
860 * @error: location to store the error occurring, or %NULL to ignore errors
862 * Returns a new string containing the text in @string_to_expand with
863 * references and escape sequences expanded. References refer to the last
864 * match done with @string against @regex and have the same syntax used by
867 * The @string_to_expand must be UTF-8 encoded even if #G_REGEX_RAW was
868 * passed to g_regex_new().
870 * The backreferences are extracted from the string passed to the match
871 * function, so you cannot call this function after freeing the string.
873 * @match_info may be %NULL in which case @string_to_expand must not
874 * contain references. For instance "foo\n" does not refer to an actual
875 * pattern and '\n' merely will be replaced with \n character,
876 * while to expand "\0" (whole match) one needs the result of a match.
877 * Use g_regex_check_replacement() to find out whether @string_to_expand
878 * contains references.
880 * Returns: (allow-none): the expanded string, or %NULL if an error occurred
885 g_match_info_expand_references (const GMatchInfo *match_info,
886 const gchar *string_to_expand,
891 GError *tmp_error = NULL;
893 g_return_val_if_fail (string_to_expand != NULL, NULL);
894 g_return_val_if_fail (error == NULL || *error == NULL, NULL);
896 list = split_replacement (string_to_expand, &tmp_error);
897 if (tmp_error != NULL)
899 g_propagate_error (error, tmp_error);
903 if (!match_info && interpolation_list_needs_match (list))
905 g_critical ("String '%s' contains references to the match, can't "
906 "expand references without GMatchInfo object",
911 result = g_string_sized_new (strlen (string_to_expand));
912 interpolate_replacement (match_info, result, list);
914 g_list_free_full (list, (GDestroyNotify) free_interpolation_data);
916 return g_string_free (result, FALSE);
920 * g_match_info_fetch:
921 * @match_info: #GMatchInfo structure
922 * @match_num: number of the sub expression
924 * Retrieves the text matching the @match_num<!-- -->'th capturing
925 * parentheses. 0 is the full text of the match, 1 is the first paren
926 * set, 2 the second, and so on.
928 * If @match_num is a valid sub pattern but it didn't match anything
929 * (e.g. sub pattern 1, matching "b" against "(a)?b") then an empty
930 * string is returned.
932 * If the match was obtained using the DFA algorithm, that is using
933 * g_regex_match_all() or g_regex_match_all_full(), the retrieved
934 * string is not that of a set of parentheses but that of a matched
935 * substring. Substrings are matched in reverse order of length, so
936 * 0 is the longest match.
938 * The string is fetched from the string passed to the match function,
939 * so you cannot call this function after freeing the string.
941 * Returns: (allow-none): The matched substring, or %NULL if an error
942 * occurred. You have to free the string yourself
947 g_match_info_fetch (const GMatchInfo *match_info,
950 /* we cannot use pcre_get_substring() because it allocates the
951 * string using pcre_malloc(). */
955 g_return_val_if_fail (match_info != NULL, NULL);
956 g_return_val_if_fail (match_num >= 0, NULL);
958 /* match_num does not exist or it didn't matched, i.e. matching "b"
959 * against "(a)?b" then group 0 is empty. */
960 if (!g_match_info_fetch_pos (match_info, match_num, &start, &end))
962 else if (start == -1)
963 match = g_strdup ("");
965 match = g_strndup (&match_info->string[start], end - start);
971 * g_match_info_fetch_pos:
972 * @match_info: #GMatchInfo structure
973 * @match_num: number of the sub expression
974 * @start_pos: (out) (allow-none): pointer to location where to store
975 * the start position, or %NULL
976 * @end_pos: (out) (allow-none): pointer to location where to store
977 * the end position, or %NULL
979 * Retrieves the position in bytes of the @match_num<!-- -->'th capturing
980 * parentheses. 0 is the full text of the match, 1 is the first
981 * paren set, 2 the second, and so on.
983 * If @match_num is a valid sub pattern but it didn't match anything
984 * (e.g. sub pattern 1, matching "b" against "(a)?b") then @start_pos
985 * and @end_pos are set to -1 and %TRUE is returned.
987 * If the match was obtained using the DFA algorithm, that is using
988 * g_regex_match_all() or g_regex_match_all_full(), the retrieved
989 * position is not that of a set of parentheses but that of a matched
990 * substring. Substrings are matched in reverse order of length, so
991 * 0 is the longest match.
993 * Returns: %TRUE if the position was fetched, %FALSE otherwise. If
994 * the position cannot be fetched, @start_pos and @end_pos are left
1000 g_match_info_fetch_pos (const GMatchInfo *match_info,
1005 g_return_val_if_fail (match_info != NULL, FALSE);
1006 g_return_val_if_fail (match_num >= 0, FALSE);
1008 /* make sure the sub expression number they're requesting is less than
1009 * the total number of sub expressions that were matched. */
1010 if (match_num >= match_info->matches)
1013 if (start_pos != NULL)
1014 *start_pos = match_info->offsets[2 * match_num];
1016 if (end_pos != NULL)
1017 *end_pos = match_info->offsets[2 * match_num + 1];
1023 * Returns number of first matched subpattern with name @name.
1024 * There may be more than one in case when DUPNAMES is used,
1025 * and not all subpatterns with that name match;
1026 * pcre_get_stringnumber() does not work in that case.
1029 get_matched_substring_number (const GMatchInfo *match_info,
1033 gchar *first, *last;
1036 if (!(match_info->regex->compile_opts & G_REGEX_DUPNAMES))
1037 return pcre_get_stringnumber (match_info->regex->pcre_re, name);
1039 /* This code is copied from pcre_get.c: get_first_set() */
1040 entrysize = pcre_get_stringtable_entries (match_info->regex->pcre_re,
1048 for (entry = (guchar*) first; entry <= (guchar*) last; entry += entrysize)
1050 gint n = (entry[0] << 8) + entry[1];
1051 if (match_info->offsets[n*2] >= 0)
1055 return (first[0] << 8) + first[1];
1059 * g_match_info_fetch_named:
1060 * @match_info: #GMatchInfo structure
1061 * @name: name of the subexpression
1063 * Retrieves the text matching the capturing parentheses named @name.
1065 * If @name is a valid sub pattern name but it didn't match anything
1066 * (e.g. sub pattern "X", matching "b" against "(?P<X>a)?b")
1067 * then an empty string is returned.
1069 * The string is fetched from the string passed to the match function,
1070 * so you cannot call this function after freeing the string.
1072 * Returns: (allow-none): The matched substring, or %NULL if an error
1073 * occurred. You have to free the string yourself
1078 g_match_info_fetch_named (const GMatchInfo *match_info,
1081 /* we cannot use pcre_get_named_substring() because it allocates the
1082 * string using pcre_malloc(). */
1085 g_return_val_if_fail (match_info != NULL, NULL);
1086 g_return_val_if_fail (name != NULL, NULL);
1088 num = get_matched_substring_number (match_info, name);
1092 return g_match_info_fetch (match_info, num);
1096 * g_match_info_fetch_named_pos:
1097 * @match_info: #GMatchInfo structure
1098 * @name: name of the subexpression
1099 * @start_pos: (out) (allow-none): pointer to location where to store
1100 * the start position, or %NULL
1101 * @end_pos: (out) (allow-none): pointer to location where to store
1102 * the end position, or %NULL
1104 * Retrieves the position in bytes of the capturing parentheses named @name.
1106 * If @name is a valid sub pattern name but it didn't match anything
1107 * (e.g. sub pattern "X", matching "b" against "(?P<X>a)?b")
1108 * then @start_pos and @end_pos are set to -1 and %TRUE is returned.
1110 * Returns: %TRUE if the position was fetched, %FALSE otherwise.
1111 * If the position cannot be fetched, @start_pos and @end_pos
1112 * are left unchanged.
1117 g_match_info_fetch_named_pos (const GMatchInfo *match_info,
1124 g_return_val_if_fail (match_info != NULL, FALSE);
1125 g_return_val_if_fail (name != NULL, FALSE);
1127 num = get_matched_substring_number (match_info, name);
1131 return g_match_info_fetch_pos (match_info, num, start_pos, end_pos);
1135 * g_match_info_fetch_all:
1136 * @match_info: a #GMatchInfo structure
1138 * Bundles up pointers to each of the matching substrings from a match
1139 * and stores them in an array of gchar pointers. The first element in
1140 * the returned array is the match number 0, i.e. the entire matched
1143 * If a sub pattern didn't match anything (e.g. sub pattern 1, matching
1144 * "b" against "(a)?b") then an empty string is inserted.
1146 * If the last match was obtained using the DFA algorithm, that is using
1147 * g_regex_match_all() or g_regex_match_all_full(), the retrieved
1148 * strings are not that matched by sets of parentheses but that of the
1149 * matched substring. Substrings are matched in reverse order of length,
1150 * so the first one is the longest match.
1152 * The strings are fetched from the string passed to the match function,
1153 * so you cannot call this function after freeing the string.
1155 * Returns: (allow-none): a %NULL-terminated array of gchar * pointers.
1156 * It must be freed using g_strfreev(). If the previous match failed
1162 g_match_info_fetch_all (const GMatchInfo *match_info)
1164 /* we cannot use pcre_get_substring_list() because the returned value
1165 * isn't suitable for g_strfreev(). */
1169 g_return_val_if_fail (match_info != NULL, NULL);
1171 if (match_info->matches < 0)
1174 result = g_new (gchar *, match_info->matches + 1);
1175 for (i = 0; i < match_info->matches; i++)
1176 result[i] = g_match_info_fetch (match_info, i);
1186 g_regex_error_quark (void)
1188 static GQuark error_quark = 0;
1190 if (error_quark == 0)
1191 error_quark = g_quark_from_static_string ("g-regex-error-quark");
1200 * Increases reference count of @regex by 1.
1207 g_regex_ref (GRegex *regex)
1209 g_return_val_if_fail (regex != NULL, NULL);
1210 g_atomic_int_inc (®ex->ref_count);
1218 * Decreases reference count of @regex by 1. When reference count drops
1219 * to zero, it frees all the memory associated with the regex structure.
1224 g_regex_unref (GRegex *regex)
1226 g_return_if_fail (regex != NULL);
1228 if (g_atomic_int_dec_and_test (®ex->ref_count))
1230 g_free (regex->pattern);
1231 if (regex->pcre_re != NULL)
1232 pcre_free (regex->pcre_re);
1233 if (regex->extra != NULL)
1234 pcre_free (regex->extra);
1241 * @pattern: the regular expression
1242 * @compile_options: compile options for the regular expression, or 0
1243 * @match_options: match options for the regular expression, or 0
1244 * @error: return location for a #GError
1246 * Compiles the regular expression to an internal form, and does
1247 * the initial setup of the #GRegex structure.
1249 * Returns: a #GRegex structure. Call g_regex_unref() when you
1255 g_regex_new (const gchar *pattern,
1256 GRegexCompileFlags compile_options,
1257 GRegexMatchFlags match_options,
1262 const gchar *errmsg;
1265 gboolean optimize = FALSE;
1266 static gsize initialised;
1267 unsigned long int pcre_compile_options;
1269 g_return_val_if_fail (pattern != NULL, NULL);
1270 g_return_val_if_fail (error == NULL || *error == NULL, NULL);
1271 g_return_val_if_fail ((compile_options & ~G_REGEX_COMPILE_MASK) == 0, NULL);
1272 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, NULL);
1274 if (g_once_init_enter (&initialised))
1279 pcre_config (PCRE_CONFIG_UTF8, &support);
1282 msg = N_("PCRE library is compiled without UTF8 support");
1283 g_critical ("%s", msg);
1284 g_set_error_literal (error, G_REGEX_ERROR, G_REGEX_ERROR_COMPILE, gettext (msg));
1288 pcre_config (PCRE_CONFIG_UNICODE_PROPERTIES, &support);
1291 msg = N_("PCRE library is compiled without UTF8 properties support");
1292 g_critical ("%s", msg);
1293 g_set_error_literal (error, G_REGEX_ERROR, G_REGEX_ERROR_COMPILE, gettext (msg));
1297 g_once_init_leave (&initialised, TRUE);
1300 /* G_REGEX_OPTIMIZE has the same numeric value of PCRE_NO_UTF8_CHECK,
1301 * as we do not need to wrap PCRE_NO_UTF8_CHECK. */
1302 if (compile_options & G_REGEX_OPTIMIZE)
1305 /* In GRegex the string are, by default, UTF-8 encoded. PCRE
1306 * instead uses UTF-8 only if required with PCRE_UTF8. */
1307 if (compile_options & G_REGEX_RAW)
1310 compile_options &= ~G_REGEX_RAW;
1315 compile_options |= PCRE_UTF8 | PCRE_NO_UTF8_CHECK;
1316 match_options |= PCRE_NO_UTF8_CHECK;
1319 /* PCRE_NEWLINE_ANY is the default for the internal PCRE but
1320 * not for the system one. */
1321 if (!(compile_options & G_REGEX_NEWLINE_CR) &&
1322 !(compile_options & G_REGEX_NEWLINE_LF))
1324 compile_options |= PCRE_NEWLINE_ANY;
1327 compile_options |= PCRE_UCP;
1329 /* compile the pattern */
1330 re = pcre_compile2 (pattern, compile_options, &errcode,
1331 &errmsg, &erroffset, NULL);
1333 /* if the compilation failed, set the error member and return
1339 /* Translate the PCRE error code to GRegexError and use a translated
1340 * error message if possible */
1341 translate_compile_error (&errcode, &errmsg);
1343 /* PCRE uses byte offsets but we want to show character offsets */
1344 erroffset = g_utf8_pointer_to_offset (pattern, &pattern[erroffset]);
1346 tmp_error = g_error_new (G_REGEX_ERROR, errcode,
1347 _("Error while compiling regular "
1348 "expression %s at char %d: %s"),
1349 pattern, erroffset, errmsg);
1350 g_propagate_error (error, tmp_error);
1355 /* For options set at the beginning of the pattern, pcre puts them into
1356 * compile options, e.g. "(?i)foo" will make the pcre structure store
1357 * PCRE_CASELESS even though it wasn't explicitly given for compilation. */
1358 pcre_fullinfo (re, NULL, PCRE_INFO_OPTIONS, &pcre_compile_options);
1359 compile_options = pcre_compile_options;
1361 if (!(compile_options & G_REGEX_DUPNAMES))
1363 gboolean jchanged = FALSE;
1364 pcre_fullinfo (re, NULL, PCRE_INFO_JCHANGED, &jchanged);
1366 compile_options |= G_REGEX_DUPNAMES;
1369 regex = g_new0 (GRegex, 1);
1370 regex->ref_count = 1;
1371 regex->pattern = g_strdup (pattern);
1372 regex->pcre_re = re;
1373 regex->compile_opts = compile_options;
1374 regex->match_opts = match_options;
1378 regex->extra = pcre_study (regex->pcre_re, 0, &errmsg);
1381 GError *tmp_error = g_error_new (G_REGEX_ERROR,
1382 G_REGEX_ERROR_OPTIMIZE,
1383 _("Error while optimizing "
1384 "regular expression %s: %s"),
1387 g_propagate_error (error, tmp_error);
1389 g_regex_unref (regex);
1398 * g_regex_get_pattern:
1399 * @regex: a #GRegex structure
1401 * Gets the pattern string associated with @regex, i.e. a copy of
1402 * the string passed to g_regex_new().
1404 * Returns: the pattern of @regex
1409 g_regex_get_pattern (const GRegex *regex)
1411 g_return_val_if_fail (regex != NULL, NULL);
1413 return regex->pattern;
1417 * g_regex_get_max_backref:
1420 * Returns the number of the highest back reference
1421 * in the pattern, or 0 if the pattern does not contain
1424 * Returns: the number of the highest back reference
1429 g_regex_get_max_backref (const GRegex *regex)
1433 pcre_fullinfo (regex->pcre_re, regex->extra,
1434 PCRE_INFO_BACKREFMAX, &value);
1440 * g_regex_get_capture_count:
1443 * Returns the number of capturing subpatterns in the pattern.
1445 * Returns: the number of capturing subpatterns
1450 g_regex_get_capture_count (const GRegex *regex)
1454 pcre_fullinfo (regex->pcre_re, regex->extra,
1455 PCRE_INFO_CAPTURECOUNT, &value);
1461 * g_regex_get_compile_flags:
1464 * Returns the compile options that @regex was created with.
1466 * Returns: flags from #GRegexCompileFlags
1471 g_regex_get_compile_flags (const GRegex *regex)
1473 g_return_val_if_fail (regex != NULL, 0);
1475 return regex->compile_opts;
1479 * g_regex_get_match_flags:
1482 * Returns the match options that @regex was created with.
1484 * Returns: flags from #GRegexMatchFlags
1489 g_regex_get_match_flags (const GRegex *regex)
1491 g_return_val_if_fail (regex != NULL, 0);
1493 return regex->match_opts;
1497 * g_regex_match_simple:
1498 * @pattern: the regular expression
1499 * @string: the string to scan for matches
1500 * @compile_options: compile options for the regular expression, or 0
1501 * @match_options: match options, or 0
1503 * Scans for a match in @string for @pattern.
1505 * This function is equivalent to g_regex_match() but it does not
1506 * require to compile the pattern with g_regex_new(), avoiding some
1507 * lines of code when you need just to do a match without extracting
1508 * substrings, capture counts, and so on.
1510 * If this function is to be called on the same @pattern more than
1511 * once, it's more efficient to compile the pattern once with
1512 * g_regex_new() and then use g_regex_match().
1514 * Returns: %TRUE if the string matched, %FALSE otherwise
1519 g_regex_match_simple (const gchar *pattern,
1520 const gchar *string,
1521 GRegexCompileFlags compile_options,
1522 GRegexMatchFlags match_options)
1527 regex = g_regex_new (pattern, compile_options, 0, NULL);
1530 result = g_regex_match_full (regex, string, -1, 0, match_options, NULL, NULL);
1531 g_regex_unref (regex);
1537 * @regex: a #GRegex structure from g_regex_new()
1538 * @string: the string to scan for matches
1539 * @match_options: match options
1540 * @match_info: (out) (allow-none): pointer to location where to store
1541 * the #GMatchInfo, or %NULL if you do not need it
1543 * Scans for a match in string for the pattern in @regex.
1544 * The @match_options are combined with the match options specified
1545 * when the @regex structure was created, letting you have more
1546 * flexibility in reusing #GRegex structures.
1548 * A #GMatchInfo structure, used to get information on the match,
1549 * is stored in @match_info if not %NULL. Note that if @match_info
1550 * is not %NULL then it is created even if the function returns %FALSE,
1551 * i.e. you must free it regardless if regular expression actually matched.
1553 * To retrieve all the non-overlapping matches of the pattern in
1554 * string you can use g_match_info_next().
1558 * print_uppercase_words (const gchar *string)
1560 * /* Print all uppercase-only words. */
1562 * GMatchInfo *match_info;
1564 * regex = g_regex_new ("[A-Z]+", 0, 0, NULL);
1565 * g_regex_match (regex, string, 0, &match_info);
1566 * while (g_match_info_matches (match_info))
1568 * gchar *word = g_match_info_fetch (match_info, 0);
1569 * g_print ("Found: %s\n", word);
1571 * g_match_info_next (match_info, NULL);
1573 * g_match_info_free (match_info);
1574 * g_regex_unref (regex);
1578 * @string is not copied and is used in #GMatchInfo internally. If
1579 * you use any #GMatchInfo method (except g_match_info_free()) after
1580 * freeing or modifying @string then the behaviour is undefined.
1582 * Returns: %TRUE is the string matched, %FALSE otherwise
1587 g_regex_match (const GRegex *regex,
1588 const gchar *string,
1589 GRegexMatchFlags match_options,
1590 GMatchInfo **match_info)
1592 return g_regex_match_full (regex, string, -1, 0, match_options,
1597 * g_regex_match_full:
1598 * @regex: a #GRegex structure from g_regex_new()
1599 * @string: (array length=string_len): the string to scan for matches
1600 * @string_len: the length of @string, or -1 if @string is nul-terminated
1601 * @start_position: starting index of the string to match
1602 * @match_options: match options
1603 * @match_info: (out) (allow-none): pointer to location where to store
1604 * the #GMatchInfo, or %NULL if you do not need it
1605 * @error: location to store the error occurring, or %NULL to ignore errors
1607 * Scans for a match in string for the pattern in @regex.
1608 * The @match_options are combined with the match options specified
1609 * when the @regex structure was created, letting you have more
1610 * flexibility in reusing #GRegex structures.
1612 * Setting @start_position differs from just passing over a shortened
1613 * string and setting #G_REGEX_MATCH_NOTBOL in the case of a pattern
1614 * that begins with any kind of lookbehind assertion, such as "\b".
1616 * A #GMatchInfo structure, used to get information on the match, is
1617 * stored in @match_info if not %NULL. Note that if @match_info is
1618 * not %NULL then it is created even if the function returns %FALSE,
1619 * i.e. you must free it regardless if regular expression actually
1622 * @string is not copied and is used in #GMatchInfo internally. If
1623 * you use any #GMatchInfo method (except g_match_info_free()) after
1624 * freeing or modifying @string then the behaviour is undefined.
1626 * To retrieve all the non-overlapping matches of the pattern in
1627 * string you can use g_match_info_next().
1631 * print_uppercase_words (const gchar *string)
1633 * /* Print all uppercase-only words. */
1635 * GMatchInfo *match_info;
1636 * GError *error = NULL;
1638 * regex = g_regex_new ("[A-Z]+", 0, 0, NULL);
1639 * g_regex_match_full (regex, string, -1, 0, 0, &match_info, &error);
1640 * while (g_match_info_matches (match_info))
1642 * gchar *word = g_match_info_fetch (match_info, 0);
1643 * g_print ("Found: %s\n", word);
1645 * g_match_info_next (match_info, &error);
1647 * g_match_info_free (match_info);
1648 * g_regex_unref (regex);
1649 * if (error != NULL)
1651 * g_printerr ("Error while matching: %s\n", error->message);
1652 * g_error_free (error);
1657 * Returns: %TRUE is the string matched, %FALSE otherwise
1662 g_regex_match_full (const GRegex *regex,
1663 const gchar *string,
1665 gint start_position,
1666 GRegexMatchFlags match_options,
1667 GMatchInfo **match_info,
1673 g_return_val_if_fail (regex != NULL, FALSE);
1674 g_return_val_if_fail (string != NULL, FALSE);
1675 g_return_val_if_fail (start_position >= 0, FALSE);
1676 g_return_val_if_fail (error == NULL || *error == NULL, FALSE);
1677 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, FALSE);
1679 info = match_info_new (regex, string, string_len, start_position,
1680 match_options, FALSE);
1681 match_ok = g_match_info_next (info, error);
1682 if (match_info != NULL)
1685 g_match_info_free (info);
1691 * g_regex_match_all:
1692 * @regex: a #GRegex structure from g_regex_new()
1693 * @string: the string to scan for matches
1694 * @match_options: match options
1695 * @match_info: (out) (allow-none): pointer to location where to store
1696 * the #GMatchInfo, or %NULL if you do not need it
1698 * Using the standard algorithm for regular expression matching only
1699 * the longest match in the string is retrieved. This function uses
1700 * a different algorithm so it can retrieve all the possible matches.
1701 * For more documentation see g_regex_match_all_full().
1703 * A #GMatchInfo structure, used to get information on the match, is
1704 * stored in @match_info if not %NULL. Note that if @match_info is
1705 * not %NULL then it is created even if the function returns %FALSE,
1706 * i.e. you must free it regardless if regular expression actually
1709 * @string is not copied and is used in #GMatchInfo internally. If
1710 * you use any #GMatchInfo method (except g_match_info_free()) after
1711 * freeing or modifying @string then the behaviour is undefined.
1713 * Returns: %TRUE is the string matched, %FALSE otherwise
1718 g_regex_match_all (const GRegex *regex,
1719 const gchar *string,
1720 GRegexMatchFlags match_options,
1721 GMatchInfo **match_info)
1723 return g_regex_match_all_full (regex, string, -1, 0, match_options,
1728 * g_regex_match_all_full:
1729 * @regex: a #GRegex structure from g_regex_new()
1730 * @string: (array length=string_len): the string to scan for matches
1731 * @string_len: the length of @string, or -1 if @string is nul-terminated
1732 * @start_position: starting index of the string to match
1733 * @match_options: match options
1734 * @match_info: (out) (allow-none): pointer to location where to store
1735 * the #GMatchInfo, or %NULL if you do not need it
1736 * @error: location to store the error occurring, or %NULL to ignore errors
1738 * Using the standard algorithm for regular expression matching only
1739 * the longest match in the string is retrieved, it is not possible
1740 * to obtain all the available matches. For instance matching
1741 * "<a> <b> <c>" against the pattern "<.*>"
1742 * you get "<a> <b> <c>".
1744 * This function uses a different algorithm (called DFA, i.e. deterministic
1745 * finite automaton), so it can retrieve all the possible matches, all
1746 * starting at the same point in the string. For instance matching
1747 * "<a> <b> <c>" against the pattern "<.*>"
1748 * you would obtain three matches: "<a> <b> <c>",
1749 * "<a> <b>" and "<a>".
1751 * The number of matched strings is retrieved using
1752 * g_match_info_get_match_count(). To obtain the matched strings and
1753 * their position you can use, respectively, g_match_info_fetch() and
1754 * g_match_info_fetch_pos(). Note that the strings are returned in
1755 * reverse order of length; that is, the longest matching string is
1758 * Note that the DFA algorithm is slower than the standard one and it
1759 * is not able to capture substrings, so backreferences do not work.
1761 * Setting @start_position differs from just passing over a shortened
1762 * string and setting #G_REGEX_MATCH_NOTBOL in the case of a pattern
1763 * that begins with any kind of lookbehind assertion, such as "\b".
1765 * A #GMatchInfo structure, used to get information on the match, is
1766 * stored in @match_info if not %NULL. Note that if @match_info is
1767 * not %NULL then it is created even if the function returns %FALSE,
1768 * i.e. you must free it regardless if regular expression actually
1771 * @string is not copied and is used in #GMatchInfo internally. If
1772 * you use any #GMatchInfo method (except g_match_info_free()) after
1773 * freeing or modifying @string then the behaviour is undefined.
1775 * Returns: %TRUE is the string matched, %FALSE otherwise
1780 g_regex_match_all_full (const GRegex *regex,
1781 const gchar *string,
1783 gint start_position,
1784 GRegexMatchFlags match_options,
1785 GMatchInfo **match_info,
1791 g_return_val_if_fail (regex != NULL, FALSE);
1792 g_return_val_if_fail (string != NULL, FALSE);
1793 g_return_val_if_fail (start_position >= 0, FALSE);
1794 g_return_val_if_fail (error == NULL || *error == NULL, FALSE);
1795 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, FALSE);
1797 info = match_info_new (regex, string, string_len, start_position,
1798 match_options, TRUE);
1804 info->matches = pcre_dfa_exec (regex->pcre_re, regex->extra,
1805 info->string, info->string_len,
1807 regex->match_opts | match_options,
1808 info->offsets, info->n_offsets,
1809 info->workspace, info->n_workspace);
1810 if (info->matches == PCRE_ERROR_DFA_WSSIZE)
1812 /* info->workspace is too small. */
1813 info->n_workspace *= 2;
1814 info->workspace = g_realloc (info->workspace,
1815 info->n_workspace * sizeof (gint));
1818 else if (info->matches == 0)
1820 /* info->offsets is too small. */
1821 info->n_offsets *= 2;
1822 info->offsets = g_realloc (info->offsets,
1823 info->n_offsets * sizeof (gint));
1826 else if (IS_PCRE_ERROR (info->matches))
1828 g_set_error (error, G_REGEX_ERROR, G_REGEX_ERROR_MATCH,
1829 _("Error while matching regular expression %s: %s"),
1830 regex->pattern, match_error (info->matches));
1834 /* set info->pos to -1 so that a call to g_match_info_next() fails. */
1837 if (match_info != NULL)
1840 g_match_info_free (info);
1842 return info->matches >= 0;
1846 * g_regex_get_string_number:
1847 * @regex: #GRegex structure
1848 * @name: name of the subexpression
1850 * Retrieves the number of the subexpression named @name.
1852 * Returns: The number of the subexpression or -1 if @name
1858 g_regex_get_string_number (const GRegex *regex,
1863 g_return_val_if_fail (regex != NULL, -1);
1864 g_return_val_if_fail (name != NULL, -1);
1866 num = pcre_get_stringnumber (regex->pcre_re, name);
1867 if (num == PCRE_ERROR_NOSUBSTRING)
1874 * g_regex_split_simple:
1875 * @pattern: the regular expression
1876 * @string: the string to scan for matches
1877 * @compile_options: compile options for the regular expression, or 0
1878 * @match_options: match options, or 0
1880 * Breaks the string on the pattern, and returns an array of
1881 * the tokens. If the pattern contains capturing parentheses,
1882 * then the text for each of the substrings will also be returned.
1883 * If the pattern does not match anywhere in the string, then the
1884 * whole string is returned as the first token.
1886 * This function is equivalent to g_regex_split() but it does
1887 * not require to compile the pattern with g_regex_new(), avoiding
1888 * some lines of code when you need just to do a split without
1889 * extracting substrings, capture counts, and so on.
1891 * If this function is to be called on the same @pattern more than
1892 * once, it's more efficient to compile the pattern once with
1893 * g_regex_new() and then use g_regex_split().
1895 * As a special case, the result of splitting the empty string ""
1896 * is an empty vector, not a vector containing a single string.
1897 * The reason for this special case is that being able to represent
1898 * a empty vector is typically more useful than consistent handling
1899 * of empty elements. If you do need to represent empty elements,
1900 * you'll need to check for the empty string before calling this
1903 * A pattern that can match empty strings splits @string into
1904 * separate characters wherever it matches the empty string between
1905 * characters. For example splitting "ab c" using as a separator
1906 * "\s*", you will get "a", "b" and "c".
1908 * Returns: a %NULL-terminated array of strings. Free it using g_strfreev()
1913 g_regex_split_simple (const gchar *pattern,
1914 const gchar *string,
1915 GRegexCompileFlags compile_options,
1916 GRegexMatchFlags match_options)
1921 regex = g_regex_new (pattern, compile_options, 0, NULL);
1925 result = g_regex_split_full (regex, string, -1, 0, match_options, 0, NULL);
1926 g_regex_unref (regex);
1932 * @regex: a #GRegex structure
1933 * @string: the string to split with the pattern
1934 * @match_options: match time option flags
1936 * Breaks the string on the pattern, and returns an array of the tokens.
1937 * If the pattern contains capturing parentheses, then the text for each
1938 * of the substrings will also be returned. If the pattern does not match
1939 * anywhere in the string, then the whole string is returned as the first
1942 * As a special case, the result of splitting the empty string "" is an
1943 * empty vector, not a vector containing a single string. The reason for
1944 * this special case is that being able to represent a empty vector is
1945 * typically more useful than consistent handling of empty elements. If
1946 * you do need to represent empty elements, you'll need to check for the
1947 * empty string before calling this function.
1949 * A pattern that can match empty strings splits @string into separate
1950 * characters wherever it matches the empty string between characters.
1951 * For example splitting "ab c" using as a separator "\s*", you will get
1954 * Returns: a %NULL-terminated gchar ** array. Free it using g_strfreev()
1959 g_regex_split (const GRegex *regex,
1960 const gchar *string,
1961 GRegexMatchFlags match_options)
1963 return g_regex_split_full (regex, string, -1, 0,
1964 match_options, 0, NULL);
1968 * g_regex_split_full:
1969 * @regex: a #GRegex structure
1970 * @string: (array length=string_len): the string to split with the pattern
1971 * @string_len: the length of @string, or -1 if @string is nul-terminated
1972 * @start_position: starting index of the string to match
1973 * @match_options: match time option flags
1974 * @max_tokens: the maximum number of tokens to split @string into.
1975 * If this is less than 1, the string is split completely
1976 * @error: return location for a #GError
1978 * Breaks the string on the pattern, and returns an array of the tokens.
1979 * If the pattern contains capturing parentheses, then the text for each
1980 * of the substrings will also be returned. If the pattern does not match
1981 * anywhere in the string, then the whole string is returned as the first
1984 * As a special case, the result of splitting the empty string "" is an
1985 * empty vector, not a vector containing a single string. The reason for
1986 * this special case is that being able to represent a empty vector is
1987 * typically more useful than consistent handling of empty elements. If
1988 * you do need to represent empty elements, you'll need to check for the
1989 * empty string before calling this function.
1991 * A pattern that can match empty strings splits @string into separate
1992 * characters wherever it matches the empty string between characters.
1993 * For example splitting "ab c" using as a separator "\s*", you will get
1996 * Setting @start_position differs from just passing over a shortened
1997 * string and setting #G_REGEX_MATCH_NOTBOL in the case of a pattern
1998 * that begins with any kind of lookbehind assertion, such as "\b".
2000 * Returns: a %NULL-terminated gchar ** array. Free it using g_strfreev()
2005 g_regex_split_full (const GRegex *regex,
2006 const gchar *string,
2008 gint start_position,
2009 GRegexMatchFlags match_options,
2013 GError *tmp_error = NULL;
2014 GMatchInfo *match_info;
2019 /* position of the last separator. */
2020 gint last_separator_end;
2021 /* was the last match 0 bytes long? */
2022 gboolean last_match_is_empty;
2023 /* the returned array of char **s */
2024 gchar **string_list;
2026 g_return_val_if_fail (regex != NULL, NULL);
2027 g_return_val_if_fail (string != NULL, NULL);
2028 g_return_val_if_fail (start_position >= 0, NULL);
2029 g_return_val_if_fail (error == NULL || *error == NULL, NULL);
2030 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, NULL);
2032 if (max_tokens <= 0)
2033 max_tokens = G_MAXINT;
2036 string_len = strlen (string);
2038 /* zero-length string */
2039 if (string_len - start_position == 0)
2040 return g_new0 (gchar *, 1);
2042 if (max_tokens == 1)
2044 string_list = g_new0 (gchar *, 2);
2045 string_list[0] = g_strndup (&string[start_position],
2046 string_len - start_position);
2052 last_separator_end = start_position;
2053 last_match_is_empty = FALSE;
2055 match_ok = g_regex_match_full (regex, string, string_len, start_position,
2056 match_options, &match_info, &tmp_error);
2058 while (tmp_error == NULL)
2062 last_match_is_empty =
2063 (match_info->offsets[0] == match_info->offsets[1]);
2065 /* we need to skip empty separators at the same position of the end
2066 * of another separator. e.g. the string is "a b" and the separator
2067 * is " *", so from 1 to 2 we have a match and at position 2 we have
2068 * an empty match. */
2069 if (last_separator_end != match_info->offsets[1])
2074 token = g_strndup (string + last_separator_end,
2075 match_info->offsets[0] - last_separator_end);
2076 list = g_list_prepend (list, token);
2079 /* if there were substrings, these need to be added to
2081 match_count = g_match_info_get_match_count (match_info);
2082 if (match_count > 1)
2084 for (i = 1; i < match_count; i++)
2085 list = g_list_prepend (list, g_match_info_fetch (match_info, i));
2091 /* if there was no match, copy to end of string. */
2092 if (!last_match_is_empty)
2094 gchar *token = g_strndup (string + last_separator_end,
2095 match_info->string_len - last_separator_end);
2096 list = g_list_prepend (list, token);
2098 /* no more tokens, end the loop. */
2102 /* -1 to leave room for the last part. */
2103 if (token_count >= max_tokens - 1)
2105 /* we have reached the maximum number of tokens, so we copy
2106 * the remaining part of the string. */
2107 if (last_match_is_empty)
2109 /* the last match was empty, so we have moved one char
2110 * after the real position to avoid empty matches at the
2112 match_info->pos = PREV_CHAR (regex, &string[match_info->pos]) - string;
2114 /* the if is needed in the case we have terminated the available
2115 * tokens, but we are at the end of the string, so there are no
2116 * characters left to copy. */
2117 if (string_len > match_info->pos)
2119 gchar *token = g_strndup (string + match_info->pos,
2120 string_len - match_info->pos);
2121 list = g_list_prepend (list, token);
2127 last_separator_end = match_info->pos;
2128 if (last_match_is_empty)
2129 /* if the last match was empty, g_match_info_next() has moved
2130 * forward to avoid infinite loops, but we still need to copy that
2132 last_separator_end = PREV_CHAR (regex, &string[last_separator_end]) - string;
2134 match_ok = g_match_info_next (match_info, &tmp_error);
2136 g_match_info_free (match_info);
2137 if (tmp_error != NULL)
2139 g_propagate_error (error, tmp_error);
2140 g_list_free_full (list, g_free);
2141 match_info->pos = -1;
2145 string_list = g_new (gchar *, g_list_length (list) + 1);
2147 for (last = g_list_last (list); last; last = g_list_previous (last))
2148 string_list[i++] = last->data;
2149 string_list[i] = NULL;
2158 REPL_TYPE_CHARACTER,
2159 REPL_TYPE_SYMBOLIC_REFERENCE,
2160 REPL_TYPE_NUMERIC_REFERENCE,
2161 REPL_TYPE_CHANGE_CASE
2166 CHANGE_CASE_NONE = 1 << 0,
2167 CHANGE_CASE_UPPER = 1 << 1,
2168 CHANGE_CASE_LOWER = 1 << 2,
2169 CHANGE_CASE_UPPER_SINGLE = 1 << 3,
2170 CHANGE_CASE_LOWER_SINGLE = 1 << 4,
2171 CHANGE_CASE_SINGLE_MASK = CHANGE_CASE_UPPER_SINGLE | CHANGE_CASE_LOWER_SINGLE,
2172 CHANGE_CASE_LOWER_MASK = CHANGE_CASE_LOWER | CHANGE_CASE_LOWER_SINGLE,
2173 CHANGE_CASE_UPPER_MASK = CHANGE_CASE_UPPER | CHANGE_CASE_UPPER_SINGLE
2176 struct _InterpolationData
2182 ChangeCase change_case;
2186 free_interpolation_data (InterpolationData *data)
2188 g_free (data->text);
2192 static const gchar *
2193 expand_escape (const gchar *replacement,
2195 InterpolationData *data,
2200 const gchar *error_detail;
2202 GError *tmp_error = NULL;
2210 data->type = REPL_TYPE_CHARACTER;
2215 data->type = REPL_TYPE_CHARACTER;
2220 data->type = REPL_TYPE_CHARACTER;
2225 data->type = REPL_TYPE_CHARACTER;
2230 data->type = REPL_TYPE_CHARACTER;
2235 data->type = REPL_TYPE_CHARACTER;
2240 data->type = REPL_TYPE_CHARACTER;
2245 data->type = REPL_TYPE_CHARACTER;
2255 h = g_ascii_xdigit_value (*p);
2258 error_detail = _("hexadecimal digit or '}' expected");
2269 for (i = 0; i < 2; i++)
2271 h = g_ascii_xdigit_value (*p);
2274 error_detail = _("hexadecimal digit expected");
2281 data->type = REPL_TYPE_STRING;
2282 data->text = g_new0 (gchar, 8);
2283 g_unichar_to_utf8 (x, data->text);
2287 data->type = REPL_TYPE_CHANGE_CASE;
2288 data->change_case = CHANGE_CASE_LOWER_SINGLE;
2292 data->type = REPL_TYPE_CHANGE_CASE;
2293 data->change_case = CHANGE_CASE_UPPER_SINGLE;
2297 data->type = REPL_TYPE_CHANGE_CASE;
2298 data->change_case = CHANGE_CASE_LOWER;
2302 data->type = REPL_TYPE_CHANGE_CASE;
2303 data->change_case = CHANGE_CASE_UPPER;
2307 data->type = REPL_TYPE_CHANGE_CASE;
2308 data->change_case = CHANGE_CASE_NONE;
2314 error_detail = _("missing '<' in symbolic reference");
2323 error_detail = _("unfinished symbolic reference");
2330 error_detail = _("zero-length symbolic reference");
2333 if (g_ascii_isdigit (*q))
2338 h = g_ascii_digit_value (*q);
2341 error_detail = _("digit expected");
2350 data->type = REPL_TYPE_NUMERIC_REFERENCE;
2357 if (!g_ascii_isalnum (*r))
2359 error_detail = _("illegal symbolic reference");
2366 data->text = g_strndup (q, p - q);
2367 data->type = REPL_TYPE_SYMBOLIC_REFERENCE;
2372 /* if \0 is followed by a number is an octal number representing a
2373 * character, else it is a numeric reference. */
2374 if (g_ascii_digit_value (*g_utf8_next_char (p)) >= 0)
2377 p = g_utf8_next_char (p);
2390 for (i = 0; i < 3; i++)
2392 h = g_ascii_digit_value (*p);
2402 if (i == 2 && base == 10)
2408 if (base == 8 || i == 3)
2410 data->type = REPL_TYPE_STRING;
2411 data->text = g_new0 (gchar, 8);
2412 g_unichar_to_utf8 (x, data->text);
2416 data->type = REPL_TYPE_NUMERIC_REFERENCE;
2421 error_detail = _("stray final '\\'");
2425 error_detail = _("unknown escape sequence");
2432 /* G_GSSIZE_FORMAT doesn't work with gettext, so we use %lu */
2433 tmp_error = g_error_new (G_REGEX_ERROR,
2434 G_REGEX_ERROR_REPLACE,
2435 _("Error while parsing replacement "
2436 "text \"%s\" at char %lu: %s"),
2438 (gulong)(p - replacement),
2440 g_propagate_error (error, tmp_error);
2446 split_replacement (const gchar *replacement,
2450 InterpolationData *data;
2451 const gchar *p, *start;
2453 start = p = replacement;
2458 data = g_new0 (InterpolationData, 1);
2459 start = p = expand_escape (replacement, p, data, error);
2462 g_list_free_full (list, (GDestroyNotify) free_interpolation_data);
2463 free_interpolation_data (data);
2467 list = g_list_prepend (list, data);
2472 if (*p == '\\' || *p == '\0')
2476 data = g_new0 (InterpolationData, 1);
2477 data->text = g_strndup (start, p - start);
2478 data->type = REPL_TYPE_STRING;
2479 list = g_list_prepend (list, data);
2485 return g_list_reverse (list);
2488 /* Change the case of c based on change_case. */
2489 #define CHANGE_CASE(c, change_case) \
2490 (((change_case) & CHANGE_CASE_LOWER_MASK) ? \
2491 g_unichar_tolower (c) : \
2492 g_unichar_toupper (c))
2495 string_append (GString *string,
2497 ChangeCase *change_case)
2501 if (text[0] == '\0')
2504 if (*change_case == CHANGE_CASE_NONE)
2506 g_string_append (string, text);
2508 else if (*change_case & CHANGE_CASE_SINGLE_MASK)
2510 c = g_utf8_get_char (text);
2511 g_string_append_unichar (string, CHANGE_CASE (c, *change_case));
2512 g_string_append (string, g_utf8_next_char (text));
2513 *change_case = CHANGE_CASE_NONE;
2517 while (*text != '\0')
2519 c = g_utf8_get_char (text);
2520 g_string_append_unichar (string, CHANGE_CASE (c, *change_case));
2521 text = g_utf8_next_char (text);
2527 interpolate_replacement (const GMatchInfo *match_info,
2532 InterpolationData *idata;
2534 ChangeCase change_case = CHANGE_CASE_NONE;
2536 for (list = data; list; list = list->next)
2539 switch (idata->type)
2541 case REPL_TYPE_STRING:
2542 string_append (result, idata->text, &change_case);
2544 case REPL_TYPE_CHARACTER:
2545 g_string_append_c (result, CHANGE_CASE (idata->c, change_case));
2546 if (change_case & CHANGE_CASE_SINGLE_MASK)
2547 change_case = CHANGE_CASE_NONE;
2549 case REPL_TYPE_NUMERIC_REFERENCE:
2550 match = g_match_info_fetch (match_info, idata->num);
2553 string_append (result, match, &change_case);
2557 case REPL_TYPE_SYMBOLIC_REFERENCE:
2558 match = g_match_info_fetch_named (match_info, idata->text);
2561 string_append (result, match, &change_case);
2565 case REPL_TYPE_CHANGE_CASE:
2566 change_case = idata->change_case;
2574 /* whether actual match_info is needed for replacement, i.e.
2575 * whether there are references
2578 interpolation_list_needs_match (GList *list)
2580 while (list != NULL)
2582 InterpolationData *data = list->data;
2584 if (data->type == REPL_TYPE_SYMBOLIC_REFERENCE ||
2585 data->type == REPL_TYPE_NUMERIC_REFERENCE)
2598 * @regex: a #GRegex structure
2599 * @string: (array length=string_len): the string to perform matches against
2600 * @string_len: the length of @string, or -1 if @string is nul-terminated
2601 * @start_position: starting index of the string to match
2602 * @replacement: text to replace each match with
2603 * @match_options: options for the match
2604 * @error: location to store the error occurring, or %NULL to ignore errors
2606 * Replaces all occurrences of the pattern in @regex with the
2607 * replacement text. Backreferences of the form '\number' or
2608 * '\g<number>' in the replacement text are interpolated by the
2609 * number-th captured subexpression of the match, '\g<name>' refers
2610 * to the captured subexpression with the given name. '\0' refers to the
2611 * complete match, but '\0' followed by a number is the octal representation
2612 * of a character. To include a literal '\' in the replacement, write '\\'.
2613 * There are also escapes that changes the case of the following text:
2616 * <varlistentry><term>\l</term>
2618 * <para>Convert to lower case the next character</para>
2621 * <varlistentry><term>\u</term>
2623 * <para>Convert to upper case the next character</para>
2626 * <varlistentry><term>\L</term>
2628 * <para>Convert to lower case till \E</para>
2631 * <varlistentry><term>\U</term>
2633 * <para>Convert to upper case till \E</para>
2636 * <varlistentry><term>\E</term>
2638 * <para>End case modification</para>
2643 * If you do not need to use backreferences use g_regex_replace_literal().
2645 * The @replacement string must be UTF-8 encoded even if #G_REGEX_RAW was
2646 * passed to g_regex_new(). If you want to use not UTF-8 encoded stings
2647 * you can use g_regex_replace_literal().
2649 * Setting @start_position differs from just passing over a shortened
2650 * string and setting #G_REGEX_MATCH_NOTBOL in the case of a pattern that
2651 * begins with any kind of lookbehind assertion, such as "\b".
2653 * Returns: a newly allocated string containing the replacements
2658 g_regex_replace (const GRegex *regex,
2659 const gchar *string,
2661 gint start_position,
2662 const gchar *replacement,
2663 GRegexMatchFlags match_options,
2668 GError *tmp_error = NULL;
2670 g_return_val_if_fail (regex != NULL, NULL);
2671 g_return_val_if_fail (string != NULL, NULL);
2672 g_return_val_if_fail (start_position >= 0, NULL);
2673 g_return_val_if_fail (replacement != NULL, NULL);
2674 g_return_val_if_fail (error == NULL || *error == NULL, NULL);
2675 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, NULL);
2677 list = split_replacement (replacement, &tmp_error);
2678 if (tmp_error != NULL)
2680 g_propagate_error (error, tmp_error);
2684 result = g_regex_replace_eval (regex,
2685 string, string_len, start_position,
2687 interpolate_replacement,
2690 if (tmp_error != NULL)
2691 g_propagate_error (error, tmp_error);
2693 g_list_free_full (list, (GDestroyNotify) free_interpolation_data);
2699 literal_replacement (const GMatchInfo *match_info,
2703 g_string_append (result, data);
2708 * g_regex_replace_literal:
2709 * @regex: a #GRegex structure
2710 * @string: (array length=string_len): the string to perform matches against
2711 * @string_len: the length of @string, or -1 if @string is nul-terminated
2712 * @start_position: starting index of the string to match
2713 * @replacement: text to replace each match with
2714 * @match_options: options for the match
2715 * @error: location to store the error occurring, or %NULL to ignore errors
2717 * Replaces all occurrences of the pattern in @regex with the
2718 * replacement text. @replacement is replaced literally, to
2719 * include backreferences use g_regex_replace().
2721 * Setting @start_position differs from just passing over a
2722 * shortened string and setting #G_REGEX_MATCH_NOTBOL in the
2723 * case of a pattern that begins with any kind of lookbehind
2724 * assertion, such as "\b".
2726 * Returns: a newly allocated string containing the replacements
2731 g_regex_replace_literal (const GRegex *regex,
2732 const gchar *string,
2734 gint start_position,
2735 const gchar *replacement,
2736 GRegexMatchFlags match_options,
2739 g_return_val_if_fail (replacement != NULL, NULL);
2740 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, NULL);
2742 return g_regex_replace_eval (regex,
2743 string, string_len, start_position,
2745 literal_replacement,
2746 (gpointer)replacement,
2751 * g_regex_replace_eval:
2752 * @regex: a #GRegex structure from g_regex_new()
2753 * @string: (array length=string_len): string to perform matches against
2754 * @string_len: the length of @string, or -1 if @string is nul-terminated
2755 * @start_position: starting index of the string to match
2756 * @match_options: options for the match
2757 * @eval: a function to call for each match
2758 * @user_data: user data to pass to the function
2759 * @error: location to store the error occurring, or %NULL to ignore errors
2761 * Replaces occurrences of the pattern in regex with the output of
2762 * @eval for that occurrence.
2764 * Setting @start_position differs from just passing over a shortened
2765 * string and setting #G_REGEX_MATCH_NOTBOL in the case of a pattern
2766 * that begins with any kind of lookbehind assertion, such as "\b".
2768 * The following example uses g_regex_replace_eval() to replace multiple
2772 * eval_cb (const GMatchInfo *info,
2779 * match = g_match_info_fetch (info, 0);
2780 * r = g_hash_table_lookup ((GHashTable *)data, match);
2781 * g_string_append (res, r);
2793 * h = g_hash_table_new (g_str_hash, g_str_equal);
2795 * g_hash_table_insert (h, "1", "ONE");
2796 * g_hash_table_insert (h, "2", "TWO");
2797 * g_hash_table_insert (h, "3", "THREE");
2798 * g_hash_table_insert (h, "4", "FOUR");
2800 * reg = g_regex_new ("1|2|3|4", 0, 0, NULL);
2801 * res = g_regex_replace_eval (reg, text, -1, 0, 0, eval_cb, h, NULL);
2802 * g_hash_table_destroy (h);
2807 * Returns: a newly allocated string containing the replacements
2812 g_regex_replace_eval (const GRegex *regex,
2813 const gchar *string,
2815 gint start_position,
2816 GRegexMatchFlags match_options,
2817 GRegexEvalCallback eval,
2821 GMatchInfo *match_info;
2824 gboolean done = FALSE;
2825 GError *tmp_error = NULL;
2827 g_return_val_if_fail (regex != NULL, NULL);
2828 g_return_val_if_fail (string != NULL, NULL);
2829 g_return_val_if_fail (start_position >= 0, NULL);
2830 g_return_val_if_fail (eval != NULL, NULL);
2831 g_return_val_if_fail ((match_options & ~G_REGEX_MATCH_MASK) == 0, NULL);
2834 string_len = strlen (string);
2836 result = g_string_sized_new (string_len);
2838 /* run down the string making matches. */
2839 g_regex_match_full (regex, string, string_len, start_position,
2840 match_options, &match_info, &tmp_error);
2841 while (!done && g_match_info_matches (match_info))
2843 g_string_append_len (result,
2845 match_info->offsets[0] - str_pos);
2846 done = (*eval) (match_info, result, user_data);
2847 str_pos = match_info->offsets[1];
2848 g_match_info_next (match_info, &tmp_error);
2850 g_match_info_free (match_info);
2851 if (tmp_error != NULL)
2853 g_propagate_error (error, tmp_error);
2854 g_string_free (result, TRUE);
2858 g_string_append_len (result, string + str_pos, string_len - str_pos);
2859 return g_string_free (result, FALSE);
2863 * g_regex_check_replacement:
2864 * @replacement: the replacement string
2865 * @has_references: (out) (allow-none): location to store information about
2866 * references in @replacement or %NULL
2867 * @error: location to store error
2869 * Checks whether @replacement is a valid replacement string
2870 * (see g_regex_replace()), i.e. that all escape sequences in
2873 * If @has_references is not %NULL then @replacement is checked
2874 * for pattern references. For instance, replacement text 'foo\n'
2875 * does not contain references and may be evaluated without information
2876 * about actual match, but '\0\1' (whole match followed by first
2877 * subpattern) requires valid #GMatchInfo object.
2879 * Returns: whether @replacement is a valid replacement string
2884 g_regex_check_replacement (const gchar *replacement,
2885 gboolean *has_references,
2891 list = split_replacement (replacement, &tmp);
2895 g_propagate_error (error, tmp);
2900 *has_references = interpolation_list_needs_match (list);
2902 g_list_free_full (list, (GDestroyNotify) free_interpolation_data);
2908 * g_regex_escape_nul:
2909 * @string: the string to escape
2910 * @length: the length of @string
2912 * Escapes the nul characters in @string to "\x00". It can be used
2913 * to compile a regex with embedded nul characters.
2915 * For completeness, @length can be -1 for a nul-terminated string.
2916 * In this case the output string will be of course equal to @string.
2918 * Returns: a newly-allocated escaped string
2923 g_regex_escape_nul (const gchar *string,
2927 const gchar *p, *piece_start, *end;
2930 g_return_val_if_fail (string != NULL, NULL);
2933 return g_strdup (string);
2935 end = string + length;
2936 p = piece_start = string;
2937 escaped = g_string_sized_new (length + 1);
2945 if (p != piece_start)
2947 /* copy the previous piece. */
2948 g_string_append_len (escaped, piece_start, p - piece_start);
2950 if ((backslashes & 1) == 0)
2951 g_string_append_c (escaped, '\\');
2952 g_string_append_c (escaped, 'x');
2953 g_string_append_c (escaped, '0');
2954 g_string_append_c (escaped, '0');
2964 p = g_utf8_next_char (p);
2969 if (piece_start < end)
2970 g_string_append_len (escaped, piece_start, end - piece_start);
2972 return g_string_free (escaped, FALSE);
2976 * g_regex_escape_string:
2977 * @string: (array length=length): the string to escape
2978 * @length: the length of @string, or -1 if @string is nul-terminated
2980 * Escapes the special characters used for regular expressions
2981 * in @string, for instance "a.b*c" becomes "a\.b\*c". This
2982 * function is useful to dynamically generate regular expressions.
2984 * @string can contain nul characters that are replaced with "\0",
2985 * in this case remember to specify the correct length of @string
2988 * Returns: a newly-allocated escaped string
2993 g_regex_escape_string (const gchar *string,
2997 const char *p, *piece_start, *end;
2999 g_return_val_if_fail (string != NULL, NULL);
3002 length = strlen (string);
3004 end = string + length;
3005 p = piece_start = string;
3006 escaped = g_string_sized_new (length + 1);
3027 if (p != piece_start)
3028 /* copy the previous piece. */
3029 g_string_append_len (escaped, piece_start, p - piece_start);
3030 g_string_append_c (escaped, '\\');
3032 g_string_append_c (escaped, '0');
3034 g_string_append_c (escaped, *p);
3038 p = g_utf8_next_char (p);
3043 if (piece_start < end)
3044 g_string_append_len (escaped, piece_start, end - piece_start);
3046 return g_string_free (escaped, FALSE);