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