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