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