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