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