]>
Commit | Line | Data |
---|---|---|
f05951fe | 1 | /* Definitions for data structures and routines for the regular |
d18f76dc ÆAB |
2 | expression library. |
3 | Copyright (C) 1985,1989-93,1995-98,2000,2001,2002,2003,2005,2006,2008 | |
4 | Free Software Foundation, Inc. | |
5 | This file is part of the GNU C Library. | |
f05951fe | 6 | |
d18f76dc ÆAB |
7 | The GNU C 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. | |
f05951fe | 11 | |
d18f76dc | 12 | The GNU C Library is distributed in the hope that it will be useful, |
f05951fe | 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
d18f76dc ÆAB |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
15 | Lesser General Public License for more details. | |
f05951fe | 16 | |
d18f76dc ÆAB |
17 | You should have received a copy of the GNU Lesser General Public |
18 | License along with the GNU C Library; if not, write to the Free | |
19 | Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA | |
20 | 02110-1301 USA. */ | |
f05951fe | 21 | |
d18f76dc ÆAB |
22 | #ifndef _REGEX_H |
23 | #define _REGEX_H 1 | |
f05951fe | 24 | |
d18f76dc | 25 | #ifdef HAVE_STDDEF_H |
f05951fe JS |
26 | #include <stddef.h> |
27 | #endif | |
28 | ||
d18f76dc ÆAB |
29 | #ifdef HAVE_SYS_TYPES_H |
30 | #include <sys/types.h> | |
31 | #endif | |
32 | ||
33 | #ifndef _LIBC | |
34 | #define __USE_GNU 1 | |
35 | #endif | |
36 | ||
37 | /* Allow the use in C++ code. */ | |
38 | #ifdef __cplusplus | |
39 | extern "C" { | |
40 | #endif | |
41 | ||
42 | /* The following two types have to be signed and unsigned integer type | |
43 | wide enough to hold a value of a pointer. For most ANSI compilers | |
44 | ptrdiff_t and size_t should be likely OK. Still size of these two | |
45 | types is 2 for Microsoft C. Ugh... */ | |
46 | typedef long int s_reg_t; | |
47 | typedef unsigned long int active_reg_t; | |
f05951fe JS |
48 | |
49 | /* The following bits are used to determine the regexp syntax we | |
50 | recognize. The set/not-set meanings are chosen so that Emacs syntax | |
51 | remains the value 0. The bits are given in alphabetical order, and | |
52 | the definitions shifted by one from the previous bit; thus, when we | |
53 | add or remove a bit, only one other definition need change. */ | |
d18f76dc | 54 | typedef unsigned long int reg_syntax_t; |
f05951fe | 55 | |
d18f76dc | 56 | #ifdef __USE_GNU |
f05951fe JS |
57 | /* If this bit is not set, then \ inside a bracket expression is literal. |
58 | If set, then such a \ quotes the following character. */ | |
d18f76dc | 59 | # define RE_BACKSLASH_ESCAPE_IN_LISTS ((unsigned long int) 1) |
f05951fe JS |
60 | |
61 | /* If this bit is not set, then + and ? are operators, and \+ and \? are | |
62 | literals. | |
63 | If set, then \+ and \? are operators and + and ? are literals. */ | |
d18f76dc | 64 | # define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1) |
f05951fe JS |
65 | |
66 | /* If this bit is set, then character classes are supported. They are: | |
67 | [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:], | |
68 | [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:]. | |
69 | If not set, then character classes are not supported. */ | |
d18f76dc | 70 | # define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1) |
f05951fe JS |
71 | |
72 | /* If this bit is set, then ^ and $ are always anchors (outside bracket | |
73 | expressions, of course). | |
74 | If this bit is not set, then it depends: | |
d18f76dc ÆAB |
75 | ^ is an anchor if it is at the beginning of a regular |
76 | expression or after an open-group or an alternation operator; | |
77 | $ is an anchor if it is at the end of a regular expression, or | |
78 | before a close-group or an alternation operator. | |
f05951fe JS |
79 | |
80 | This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because | |
81 | POSIX draft 11.2 says that * etc. in leading positions is undefined. | |
82 | We already implemented a previous draft which made those constructs | |
83 | invalid, though, so we haven't changed the code back. */ | |
d18f76dc | 84 | # define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1) |
f05951fe JS |
85 | |
86 | /* If this bit is set, then special characters are always special | |
87 | regardless of where they are in the pattern. | |
88 | If this bit is not set, then special characters are special only in | |
89 | some contexts; otherwise they are ordinary. Specifically, | |
90 | * + ? and intervals are only special when not after the beginning, | |
91 | open-group, or alternation operator. */ | |
d18f76dc | 92 | # define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1) |
f05951fe JS |
93 | |
94 | /* If this bit is set, then *, +, ?, and { cannot be first in an re or | |
95 | immediately after an alternation or begin-group operator. */ | |
d18f76dc | 96 | # define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1) |
f05951fe JS |
97 | |
98 | /* If this bit is set, then . matches newline. | |
99 | If not set, then it doesn't. */ | |
d18f76dc | 100 | # define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1) |
f05951fe JS |
101 | |
102 | /* If this bit is set, then . doesn't match NUL. | |
103 | If not set, then it does. */ | |
d18f76dc | 104 | # define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1) |
f05951fe JS |
105 | |
106 | /* If this bit is set, nonmatching lists [^...] do not match newline. | |
107 | If not set, they do. */ | |
d18f76dc | 108 | # define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1) |
f05951fe JS |
109 | |
110 | /* If this bit is set, either \{...\} or {...} defines an | |
111 | interval, depending on RE_NO_BK_BRACES. | |
112 | If not set, \{, \}, {, and } are literals. */ | |
d18f76dc | 113 | # define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1) |
f05951fe JS |
114 | |
115 | /* If this bit is set, +, ? and | aren't recognized as operators. | |
116 | If not set, they are. */ | |
d18f76dc | 117 | # define RE_LIMITED_OPS (RE_INTERVALS << 1) |
f05951fe JS |
118 | |
119 | /* If this bit is set, newline is an alternation operator. | |
120 | If not set, newline is literal. */ | |
d18f76dc | 121 | # define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1) |
f05951fe JS |
122 | |
123 | /* If this bit is set, then `{...}' defines an interval, and \{ and \} | |
124 | are literals. | |
125 | If not set, then `\{...\}' defines an interval. */ | |
d18f76dc | 126 | # define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1) |
f05951fe JS |
127 | |
128 | /* If this bit is set, (...) defines a group, and \( and \) are literals. | |
129 | If not set, \(...\) defines a group, and ( and ) are literals. */ | |
d18f76dc | 130 | # define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1) |
f05951fe JS |
131 | |
132 | /* If this bit is set, then \<digit> matches <digit>. | |
133 | If not set, then \<digit> is a back-reference. */ | |
d18f76dc | 134 | # define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1) |
f05951fe JS |
135 | |
136 | /* If this bit is set, then | is an alternation operator, and \| is literal. | |
137 | If not set, then \| is an alternation operator, and | is literal. */ | |
d18f76dc | 138 | # define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1) |
f05951fe JS |
139 | |
140 | /* If this bit is set, then an ending range point collating higher | |
141 | than the starting range point, as in [z-a], is invalid. | |
142 | If not set, then when ending range point collates higher than the | |
143 | starting range point, the range is ignored. */ | |
d18f76dc | 144 | # define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1) |
f05951fe JS |
145 | |
146 | /* If this bit is set, then an unmatched ) is ordinary. | |
147 | If not set, then an unmatched ) is invalid. */ | |
d18f76dc ÆAB |
148 | # define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1) |
149 | ||
150 | /* If this bit is set, succeed as soon as we match the whole pattern, | |
151 | without further backtracking. */ | |
152 | # define RE_NO_POSIX_BACKTRACKING (RE_UNMATCHED_RIGHT_PAREN_ORD << 1) | |
153 | ||
154 | /* If this bit is set, do not process the GNU regex operators. | |
155 | If not set, then the GNU regex operators are recognized. */ | |
156 | # define RE_NO_GNU_OPS (RE_NO_POSIX_BACKTRACKING << 1) | |
157 | ||
158 | /* If this bit is set, a syntactically invalid interval is treated as | |
159 | a string of ordinary characters. For example, the ERE 'a{1' is | |
160 | treated as 'a\{1'. */ | |
161 | # define RE_INVALID_INTERVAL_ORD (RE_NO_GNU_OPS << 1) | |
162 | ||
163 | /* If this bit is set, then ignore case when matching. | |
164 | If not set, then case is significant. */ | |
165 | # define RE_ICASE (RE_INVALID_INTERVAL_ORD << 1) | |
166 | ||
167 | /* This bit is used internally like RE_CONTEXT_INDEP_ANCHORS but only | |
168 | for ^, because it is difficult to scan the regex backwards to find | |
169 | whether ^ should be special. */ | |
170 | # define RE_CARET_ANCHORS_HERE (RE_ICASE << 1) | |
171 | ||
172 | /* If this bit is set, then \{ cannot be first in an bre or | |
173 | immediately after an alternation or begin-group operator. */ | |
174 | # define RE_CONTEXT_INVALID_DUP (RE_CARET_ANCHORS_HERE << 1) | |
175 | ||
176 | /* If this bit is set, then no_sub will be set to 1 during | |
177 | re_compile_pattern. */ | |
178 | #define RE_NO_SUB (RE_CONTEXT_INVALID_DUP << 1) | |
179 | #endif | |
f05951fe JS |
180 | |
181 | /* This global variable defines the particular regexp syntax to use (for | |
182 | some interfaces). When a regexp is compiled, the syntax used is | |
183 | stored in the pattern buffer, so changing this does not affect | |
184 | already-compiled regexps. */ | |
185 | extern reg_syntax_t re_syntax_options; | |
186 | \f | |
d18f76dc | 187 | #ifdef __USE_GNU |
f05951fe JS |
188 | /* Define combinations of the above bits for the standard possibilities. |
189 | (The [[[ comments delimit what gets put into the Texinfo file, so | |
190 | don't delete them!) */ | |
191 | /* [[[begin syntaxes]]] */ | |
192 | #define RE_SYNTAX_EMACS 0 | |
193 | ||
194 | #define RE_SYNTAX_AWK \ | |
d18f76dc ÆAB |
195 | (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \ |
196 | | RE_NO_BK_PARENS | RE_NO_BK_REFS \ | |
197 | | RE_NO_BK_VBAR | RE_NO_EMPTY_RANGES \ | |
198 | | RE_DOT_NEWLINE | RE_CONTEXT_INDEP_ANCHORS \ | |
199 | | RE_UNMATCHED_RIGHT_PAREN_ORD | RE_NO_GNU_OPS) | |
200 | ||
201 | #define RE_SYNTAX_GNU_AWK \ | |
202 | ((RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS \ | |
203 | | RE_INVALID_INTERVAL_ORD) \ | |
204 | & ~(RE_DOT_NOT_NULL | RE_CONTEXT_INDEP_OPS \ | |
205 | | RE_CONTEXT_INVALID_OPS )) | |
206 | ||
207 | #define RE_SYNTAX_POSIX_AWK \ | |
208 | (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS \ | |
209 | | RE_INTERVALS | RE_NO_GNU_OPS \ | |
210 | | RE_INVALID_INTERVAL_ORD) | |
f05951fe JS |
211 | |
212 | #define RE_SYNTAX_GREP \ | |
213 | (RE_BK_PLUS_QM | RE_CHAR_CLASSES \ | |
214 | | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \ | |
215 | | RE_NEWLINE_ALT) | |
216 | ||
217 | #define RE_SYNTAX_EGREP \ | |
218 | (RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \ | |
219 | | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \ | |
220 | | RE_NEWLINE_ALT | RE_NO_BK_PARENS \ | |
221 | | RE_NO_BK_VBAR) | |
222 | ||
223 | #define RE_SYNTAX_POSIX_EGREP \ | |
d18f76dc ÆAB |
224 | (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES \ |
225 | | RE_INVALID_INTERVAL_ORD) | |
f05951fe JS |
226 | |
227 | /* P1003.2/D11.2, section 4.20.7.1, lines 5078ff. */ | |
228 | #define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC | |
229 | ||
230 | #define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC | |
231 | ||
232 | /* Syntax bits common to both basic and extended POSIX regex syntax. */ | |
233 | #define _RE_SYNTAX_POSIX_COMMON \ | |
234 | (RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \ | |
235 | | RE_INTERVALS | RE_NO_EMPTY_RANGES) | |
236 | ||
237 | #define RE_SYNTAX_POSIX_BASIC \ | |
d18f76dc | 238 | (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM | RE_CONTEXT_INVALID_DUP) |
f05951fe JS |
239 | |
240 | /* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes | |
241 | RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this | |
242 | isn't minimal, since other operators, such as \`, aren't disabled. */ | |
243 | #define RE_SYNTAX_POSIX_MINIMAL_BASIC \ | |
244 | (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS) | |
245 | ||
246 | #define RE_SYNTAX_POSIX_EXTENDED \ | |
d18f76dc ÆAB |
247 | (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ |
248 | | RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \ | |
249 | | RE_NO_BK_PARENS | RE_NO_BK_VBAR \ | |
250 | | RE_CONTEXT_INVALID_OPS | RE_UNMATCHED_RIGHT_PAREN_ORD) | |
f05951fe | 251 | |
d18f76dc ÆAB |
252 | /* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INDEP_OPS is |
253 | removed and RE_NO_BK_REFS is added. */ | |
f05951fe JS |
254 | #define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \ |
255 | (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ | |
256 | | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \ | |
257 | | RE_NO_BK_PARENS | RE_NO_BK_REFS \ | |
258 | | RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD) | |
259 | /* [[[end syntaxes]]] */ | |
260 | \f | |
261 | /* Maximum number of duplicates an interval can allow. Some systems | |
262 | (erroneously) define this in other header files, but we want our | |
263 | value, so remove any previous define. */ | |
d18f76dc ÆAB |
264 | # ifdef RE_DUP_MAX |
265 | # undef RE_DUP_MAX | |
266 | # endif | |
267 | /* If sizeof(int) == 2, then ((1 << 15) - 1) overflows. */ | |
268 | # define RE_DUP_MAX (0x7fff) | |
f05951fe | 269 | #endif |
f05951fe JS |
270 | |
271 | ||
272 | /* POSIX `cflags' bits (i.e., information for `regcomp'). */ | |
273 | ||
274 | /* If this bit is set, then use extended regular expression syntax. | |
275 | If not set, then use basic regular expression syntax. */ | |
276 | #define REG_EXTENDED 1 | |
277 | ||
278 | /* If this bit is set, then ignore case when matching. | |
279 | If not set, then case is significant. */ | |
280 | #define REG_ICASE (REG_EXTENDED << 1) | |
281 | ||
282 | /* If this bit is set, then anchors do not match at newline | |
283 | characters in the string. | |
284 | If not set, then anchors do match at newlines. */ | |
285 | #define REG_NEWLINE (REG_ICASE << 1) | |
286 | ||
287 | /* If this bit is set, then report only success or fail in regexec. | |
288 | If not set, then returns differ between not matching and errors. */ | |
289 | #define REG_NOSUB (REG_NEWLINE << 1) | |
290 | ||
291 | ||
292 | /* POSIX `eflags' bits (i.e., information for regexec). */ | |
293 | ||
294 | /* If this bit is set, then the beginning-of-line operator doesn't match | |
295 | the beginning of the string (presumably because it's not the | |
296 | beginning of a line). | |
297 | If not set, then the beginning-of-line operator does match the | |
298 | beginning of the string. */ | |
299 | #define REG_NOTBOL 1 | |
300 | ||
301 | /* Like REG_NOTBOL, except for the end-of-line. */ | |
302 | #define REG_NOTEOL (1 << 1) | |
303 | ||
d18f76dc ÆAB |
304 | /* Use PMATCH[0] to delimit the start and end of the search in the |
305 | buffer. */ | |
306 | #define REG_STARTEND (1 << 2) | |
307 | ||
f05951fe JS |
308 | |
309 | /* If any error codes are removed, changed, or added, update the | |
310 | `re_error_msg' table in regex.c. */ | |
311 | typedef enum | |
312 | { | |
d18f76dc ÆAB |
313 | #if defined _XOPEN_SOURCE || defined __USE_XOPEN2K |
314 | REG_ENOSYS = -1, /* This will never happen for this implementation. */ | |
315 | #endif | |
316 | ||
f05951fe JS |
317 | REG_NOERROR = 0, /* Success. */ |
318 | REG_NOMATCH, /* Didn't find a match (for regexec). */ | |
319 | ||
320 | /* POSIX regcomp return error codes. (In the order listed in the | |
321 | standard.) */ | |
322 | REG_BADPAT, /* Invalid pattern. */ | |
d18f76dc | 323 | REG_ECOLLATE, /* Inalid collating element. */ |
f05951fe JS |
324 | REG_ECTYPE, /* Invalid character class name. */ |
325 | REG_EESCAPE, /* Trailing backslash. */ | |
326 | REG_ESUBREG, /* Invalid back reference. */ | |
327 | REG_EBRACK, /* Unmatched left bracket. */ | |
328 | REG_EPAREN, /* Parenthesis imbalance. */ | |
329 | REG_EBRACE, /* Unmatched \{. */ | |
330 | REG_BADBR, /* Invalid contents of \{\}. */ | |
331 | REG_ERANGE, /* Invalid range end. */ | |
332 | REG_ESPACE, /* Ran out of memory. */ | |
333 | REG_BADRPT, /* No preceding re for repetition op. */ | |
334 | ||
335 | /* Error codes we've added. */ | |
336 | REG_EEND, /* Premature end. */ | |
337 | REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */ | |
338 | REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */ | |
339 | } reg_errcode_t; | |
340 | \f | |
341 | /* This data structure represents a compiled pattern. Before calling | |
342 | the pattern compiler, the fields `buffer', `allocated', `fastmap', | |
343 | `translate', and `no_sub' can be set. After the pattern has been | |
344 | compiled, the `re_nsub' field is available. All other fields are | |
345 | private to the regex routines. */ | |
346 | ||
d18f76dc ÆAB |
347 | #ifndef RE_TRANSLATE_TYPE |
348 | # define __RE_TRANSLATE_TYPE unsigned char * | |
349 | # ifdef __USE_GNU | |
350 | # define RE_TRANSLATE_TYPE __RE_TRANSLATE_TYPE | |
351 | # endif | |
352 | #endif | |
353 | ||
354 | #ifdef __USE_GNU | |
355 | # define __REPB_PREFIX(name) name | |
356 | #else | |
357 | # define __REPB_PREFIX(name) __##name | |
358 | #endif | |
359 | ||
f05951fe JS |
360 | struct re_pattern_buffer |
361 | { | |
d18f76dc ÆAB |
362 | /* Space that holds the compiled pattern. It is declared as |
363 | `unsigned char *' because its elements are sometimes used as | |
364 | array indexes. */ | |
365 | unsigned char *__REPB_PREFIX(buffer); | |
f05951fe | 366 | |
d18f76dc ÆAB |
367 | /* Number of bytes to which `buffer' points. */ |
368 | unsigned long int __REPB_PREFIX(allocated); | |
f05951fe | 369 | |
d18f76dc ÆAB |
370 | /* Number of bytes actually used in `buffer'. */ |
371 | unsigned long int __REPB_PREFIX(used); | |
f05951fe | 372 | |
d18f76dc ÆAB |
373 | /* Syntax setting with which the pattern was compiled. */ |
374 | reg_syntax_t __REPB_PREFIX(syntax); | |
f05951fe | 375 | |
d18f76dc ÆAB |
376 | /* Pointer to a fastmap, if any, otherwise zero. re_search uses the |
377 | fastmap, if there is one, to skip over impossible starting points | |
378 | for matches. */ | |
379 | char *__REPB_PREFIX(fastmap); | |
f05951fe | 380 | |
d18f76dc ÆAB |
381 | /* Either a translate table to apply to all characters before |
382 | comparing them, or zero for no translation. The translation is | |
383 | applied to a pattern when it is compiled and to a string when it | |
384 | is matched. */ | |
385 | __RE_TRANSLATE_TYPE __REPB_PREFIX(translate); | |
f05951fe | 386 | |
d18f76dc | 387 | /* Number of subexpressions found by the compiler. */ |
f05951fe JS |
388 | size_t re_nsub; |
389 | ||
d18f76dc ÆAB |
390 | /* Zero if this pattern cannot match the empty string, one else. |
391 | Well, in truth it's used only in `re_search_2', to see whether or | |
392 | not we should use the fastmap, so we don't set this absolutely | |
393 | perfectly; see `re_compile_fastmap' (the `duplicate' case). */ | |
394 | unsigned __REPB_PREFIX(can_be_null) : 1; | |
395 | ||
396 | /* If REGS_UNALLOCATED, allocate space in the `regs' structure | |
397 | for `max (RE_NREGS, re_nsub + 1)' groups. | |
398 | If REGS_REALLOCATE, reallocate space if necessary. | |
399 | If REGS_FIXED, use what's there. */ | |
400 | #ifdef __USE_GNU | |
401 | # define REGS_UNALLOCATED 0 | |
402 | # define REGS_REALLOCATE 1 | |
403 | # define REGS_FIXED 2 | |
404 | #endif | |
405 | unsigned __REPB_PREFIX(regs_allocated) : 2; | |
f05951fe | 406 | |
d18f76dc ÆAB |
407 | /* Set to zero when `regex_compile' compiles a pattern; set to one |
408 | by `re_compile_fastmap' if it updates the fastmap. */ | |
409 | unsigned __REPB_PREFIX(fastmap_accurate) : 1; | |
410 | ||
411 | /* If set, `re_match_2' does not return information about | |
412 | subexpressions. */ | |
413 | unsigned __REPB_PREFIX(no_sub) : 1; | |
f05951fe | 414 | |
d18f76dc ÆAB |
415 | /* If set, a beginning-of-line anchor doesn't match at the beginning |
416 | of the string. */ | |
417 | unsigned __REPB_PREFIX(not_bol) : 1; | |
418 | ||
419 | /* Similarly for an end-of-line anchor. */ | |
420 | unsigned __REPB_PREFIX(not_eol) : 1; | |
421 | ||
422 | /* If true, an anchor at a newline matches. */ | |
423 | unsigned __REPB_PREFIX(newline_anchor) : 1; | |
424 | }; | |
f05951fe | 425 | |
d18f76dc | 426 | typedef struct re_pattern_buffer regex_t; |
f05951fe JS |
427 | \f |
428 | /* Type for byte offsets within the string. POSIX mandates this. */ | |
429 | typedef int regoff_t; | |
430 | ||
431 | ||
d18f76dc | 432 | #ifdef __USE_GNU |
f05951fe JS |
433 | /* This is the structure we store register match data in. See |
434 | regex.texinfo for a full description of what registers match. */ | |
435 | struct re_registers | |
436 | { | |
437 | unsigned num_regs; | |
438 | regoff_t *start; | |
439 | regoff_t *end; | |
440 | }; | |
441 | ||
442 | ||
443 | /* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer, | |
444 | `re_match_2' returns information about at least this many registers | |
445 | the first time a `regs' structure is passed. */ | |
d18f76dc ÆAB |
446 | # ifndef RE_NREGS |
447 | # define RE_NREGS 30 | |
448 | # endif | |
f05951fe JS |
449 | #endif |
450 | ||
451 | ||
452 | /* POSIX specification for registers. Aside from the different names than | |
453 | `re_registers', POSIX uses an array of structures, instead of a | |
454 | structure of arrays. */ | |
455 | typedef struct | |
456 | { | |
457 | regoff_t rm_so; /* Byte offset from string's start to substring's start. */ | |
458 | regoff_t rm_eo; /* Byte offset from string's start to substring's end. */ | |
459 | } regmatch_t; | |
460 | \f | |
461 | /* Declarations for routines. */ | |
462 | ||
d18f76dc | 463 | #ifdef __USE_GNU |
f05951fe JS |
464 | /* Sets the current default syntax to SYNTAX, and return the old syntax. |
465 | You can also simply assign to the `re_syntax_options' variable. */ | |
d18f76dc | 466 | extern reg_syntax_t re_set_syntax (reg_syntax_t __syntax); |
f05951fe JS |
467 | |
468 | /* Compile the regular expression PATTERN, with length LENGTH | |
469 | and syntax given by the global `re_syntax_options', into the buffer | |
470 | BUFFER. Return NULL if successful, and an error string if not. */ | |
d18f76dc ÆAB |
471 | extern const char *re_compile_pattern (const char *__pattern, size_t __length, |
472 | struct re_pattern_buffer *__buffer); | |
f05951fe JS |
473 | |
474 | ||
475 | /* Compile a fastmap for the compiled pattern in BUFFER; used to | |
476 | accelerate searches. Return 0 if successful and -2 if was an | |
477 | internal error. */ | |
d18f76dc | 478 | extern int re_compile_fastmap (struct re_pattern_buffer *__buffer); |
f05951fe JS |
479 | |
480 | ||
481 | /* Search in the string STRING (with length LENGTH) for the pattern | |
482 | compiled into BUFFER. Start searching at position START, for RANGE | |
483 | characters. Return the starting position of the match, -1 for no | |
484 | match, or -2 for an internal error. Also return register | |
485 | information in REGS (if REGS and BUFFER->no_sub are nonzero). */ | |
d18f76dc ÆAB |
486 | extern int re_search (struct re_pattern_buffer *__buffer, const char *__cstring, |
487 | int __length, int __start, int __range, | |
488 | struct re_registers *__regs); | |
f05951fe JS |
489 | |
490 | ||
491 | /* Like `re_search', but search in the concatenation of STRING1 and | |
492 | STRING2. Also, stop searching at index START + STOP. */ | |
d18f76dc ÆAB |
493 | extern int re_search_2 (struct re_pattern_buffer *__buffer, |
494 | const char *__string1, int __length1, | |
495 | const char *__string2, int __length2, int __start, | |
496 | int __range, struct re_registers *__regs, int __stop); | |
f05951fe JS |
497 | |
498 | ||
499 | /* Like `re_search', but return how many characters in STRING the regexp | |
500 | in BUFFER matched, starting at position START. */ | |
d18f76dc ÆAB |
501 | extern int re_match (struct re_pattern_buffer *__buffer, const char *__cstring, |
502 | int __length, int __start, struct re_registers *__regs); | |
f05951fe JS |
503 | |
504 | ||
505 | /* Relates to `re_match' as `re_search_2' relates to `re_search'. */ | |
d18f76dc ÆAB |
506 | extern int re_match_2 (struct re_pattern_buffer *__buffer, |
507 | const char *__string1, int __length1, | |
508 | const char *__string2, int __length2, int __start, | |
509 | struct re_registers *__regs, int __stop); | |
f05951fe JS |
510 | |
511 | ||
512 | /* Set REGS to hold NUM_REGS registers, storing them in STARTS and | |
513 | ENDS. Subsequent matches using BUFFER and REGS will use this memory | |
514 | for recording register information. STARTS and ENDS must be | |
515 | allocated with malloc, and must each be at least `NUM_REGS * sizeof | |
516 | (regoff_t)' bytes long. | |
517 | ||
518 | If NUM_REGS == 0, then subsequent matches should allocate their own | |
519 | register data. | |
520 | ||
521 | Unless this function is called, the first search or match using | |
522 | PATTERN_BUFFER will allocate its own register data, without | |
523 | freeing the old data. */ | |
d18f76dc ÆAB |
524 | extern void re_set_registers (struct re_pattern_buffer *__buffer, |
525 | struct re_registers *__regs, | |
526 | unsigned int __num_regs, | |
527 | regoff_t *__starts, regoff_t *__ends); | |
528 | #endif /* Use GNU */ | |
529 | ||
530 | #if defined _REGEX_RE_COMP || (defined _LIBC && defined __USE_BSD) | |
531 | # ifndef _CRAY | |
f05951fe | 532 | /* 4.2 bsd compatibility. */ |
d18f76dc ÆAB |
533 | extern char *re_comp (const char *); |
534 | extern int re_exec (const char *); | |
535 | # endif | |
536 | #endif | |
537 | ||
538 | /* GCC 2.95 and later have "__restrict"; C99 compilers have | |
539 | "restrict", and "configure" may have defined "restrict". */ | |
540 | #ifndef __restrict | |
541 | # if ! (2 < __GNUC__ || (2 == __GNUC__ && 95 <= __GNUC_MINOR__)) | |
542 | # if defined restrict || 199901L <= __STDC_VERSION__ | |
543 | # define __restrict restrict | |
544 | # else | |
545 | # define __restrict | |
546 | # endif | |
547 | # endif | |
548 | #endif | |
549 | /* gcc 3.1 and up support the [restrict] syntax. */ | |
550 | #ifndef __restrict_arr | |
551 | # if (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)) \ | |
552 | && !defined __GNUG__ | |
553 | # define __restrict_arr __restrict | |
554 | # else | |
555 | # define __restrict_arr | |
556 | # endif | |
557 | #endif | |
f05951fe JS |
558 | |
559 | /* POSIX compatibility. */ | |
d18f76dc ÆAB |
560 | extern int regcomp (regex_t *__restrict __preg, |
561 | const char *__restrict __pattern, | |
562 | int __cflags); | |
563 | ||
564 | extern int regexec (const regex_t *__restrict __preg, | |
565 | const char *__restrict __cstring, size_t __nmatch, | |
566 | regmatch_t __pmatch[__restrict_arr], | |
567 | int __eflags); | |
568 | ||
569 | extern size_t regerror (int __errcode, const regex_t *__restrict __preg, | |
570 | char *__restrict __errbuf, size_t __errbuf_size); | |
571 | ||
572 | extern void regfree (regex_t *__preg); | |
573 | ||
574 | ||
575 | #ifdef __cplusplus | |
576 | } | |
577 | #endif /* C++ */ | |
578 | ||
579 | #endif /* regex.h */ |