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