00001 /* Definitions for data structures and routines for the regular
00002 expression library, version 0.12.
00003 Copyright (C) 1985,89,90,91,92,93,95,96,97 Free Software Foundation, Inc.
00004
00005 the C library, however. The master source lives in /gd/gnu/lib.
00006
00007 NOTE: The canonical source of this file is maintained with the
00008 GNU C Library. Bugs can be reported to bug-glibc@prep.ai.mit.edu.
00009
00010 This program is free software; you can redistribute it and/or modify it
00011 under the terms of the GNU General Public License as published by the
00012 Free Software Foundation; either version 2, or (at your option) any
00013 later version.
00014
00015 This program is distributed in the hope that it will be useful,
00016 but WITHOUT ANY WARRANTY; without even the implied warranty of
00017 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
00018 GNU General Public License for more details.
00019
00020 You should have received a copy of the GNU General Public License
00021 along with this program; if not, write to the Free Software Foundation,
00022 Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
00023
00024 #ifndef _REGEX_H
00025 #define _REGEX_H 1
00026
00027 /* Allow the use in C++ code. */
00028 #ifdef __cplusplus
00029 extern "C"
00030 {
00031 #endif
00032
00033 /* POSIX says that <sys/types.h> must be included (by the caller) before
00034 <regex.h>. */
00035
00036 #if !defined (_POSIX_C_SOURCE) && !defined (_POSIX_SOURCE) && defined (VMS)
00037 /* VMS doesn't have `size_t' in <sys/types.h>, even though POSIX says it
00038 should be there. */
00039 #include <stddef.h>
00040 #endif
00041
00042 /* The following two types have to be signed and unsigned integer type
00043 wide enough to hold a value of a pointer. For most ANSI compilers
00044 ptrdiff_t and size_t should be likely OK. Still size of these two
00045 types is 2 for Microsoft C. Ugh... */
00046 typedef long int s_reg_t;
00047 typedef unsigned long int active_reg_t;
00048
00049 /* The following bits are used to determine the regexp syntax we
00050 recognize. The set/not-set meanings are chosen so that Emacs syntax
00051 remains the value 0. The bits are given in alphabetical order, and
00052 the definitions shifted by one from the previous bit; thus, when we
00053 add or remove a bit, only one other definition need change. */
00054 typedef unsigned long int reg_syntax_t;
00055
00056 /* If this bit is not set, then \ inside a bracket expression is literal.
00057 If set, then such a \ quotes the following character. */
00058 #define RE_BACKSLASH_ESCAPE_IN_LISTS ((unsigned long int) 1)
00059
00060 /* If this bit is not set, then + and ? are operators, and \+ and \? are
00061 literals.
00062 If set, then \+ and \? are operators and + and ? are literals. */
00063 #define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1)
00064
00065 /* If this bit is set, then character classes are supported. They are:
00066 [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:],
00067 [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:].
00068 If not set, then character classes are not supported. */
00069 #define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1)
00070
00071 /* If this bit is set, then ^ and $ are always anchors (outside bracket
00072 expressions, of course).
00073 If this bit is not set, then it depends:
00074 ^ is an anchor if it is at the beginning of a regular
00075 expression or after an open-group or an alternation operator;
00076 $ is an anchor if it is at the end of a regular expression, or
00077 before a close-group or an alternation operator.
00078
00079 This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because
00080 POSIX draft 11.2 says that * etc. in leading positions is undefined.
00081 We already implemented a previous draft which made those constructs
00082 invalid, though, so we haven't changed the code back. */
00083 #define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1)
00084
00085 /* If this bit is set, then special characters are always special
00086 regardless of where they are in the pattern.
00087 If this bit is not set, then special characters are special only in
00088 some contexts; otherwise they are ordinary. Specifically,
00089 * + ? and intervals are only special when not after the beginning,
00090 open-group, or alternation operator. */
00091 #define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1)
00092
00093 /* If this bit is set, then *, +, ?, and { cannot be first in an re or
00094 immediately after an alternation or begin-group operator. */
00095 #define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1)
00096
00097 /* If this bit is set, then . matches newline.
00098 If not set, then it doesn't. */
00099 #define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1)
00100
00101 /* If this bit is set, then . doesn't match NUL.
00102 If not set, then it does. */
00103 #define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1)
00104
00105 /* If this bit is set, nonmatching lists [^...] do not match newline.
00106 If not set, they do. */
00107 #define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1)
00108
00109 /* If this bit is set, either \{...\} or {...} defines an
00110 interval, depending on RE_NO_BK_BRACES.
00111 If not set, \{, \}, {, and } are literals. */
00112 #define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1)
00113
00114 /* If this bit is set, +, ? and | aren't recognized as operators.
00115 If not set, they are. */
00116 #define RE_LIMITED_OPS (RE_INTERVALS << 1)
00117
00118 /* If this bit is set, newline is an alternation operator.
00119 If not set, newline is literal. */
00120 #define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1)
00121
00122 /* If this bit is set, then `{...}' defines an interval, and \{ and \}
00123 are literals.
00124 If not set, then `\{...\}' defines an interval. */
00125 #define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1)
00126
00127 /* If this bit is set, (...) defines a group, and \( and \) are literals.
00128 If not set, \(...\) defines a group, and ( and ) are literals. */
00129 #define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1)
00130
00131 /* If this bit is set, then <digit> matches <digit>.
00132 If not set, then <digit> is a back-reference. */
00133 #define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1)
00134
00135 /* If this bit is set, then | is an alternation operator, and \| is literal.
00136 If not set, then \| is an alternation operator, and | is literal. */
00137 #define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1)
00138
00139 /* If this bit is set, then an ending range point collating higher
00140 than the starting range point, as in [z-a], is invalid.
00141 If not set, then when ending range point collates higher than the
00142 starting range point, the range is ignored. */
00143 #define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1)
00144
00145 /* If this bit is set, then an unmatched ) is ordinary.
00146 If not set, then an unmatched ) is invalid. */
00147 #define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1)
00148
00149 /* If this bit is set, succeed as soon as we match the whole pattern,
00150 without further backtracking. */
00151 #define RE_NO_POSIX_BACKTRACKING (RE_UNMATCHED_RIGHT_PAREN_ORD << 1)
00152
00153 /* If this bit is set, do not process the GNU regex operators.
00154 If not set, then the GNU regex operators are recognized. */
00155 #define RE_NO_GNU_OPS (RE_NO_POSIX_BACKTRACKING << 1)
00156
00157 /* If this bit is set, turn on internal regex debugging.
00158 If not set, and debugging was on, turn it off.
00159 This only works if regex.c is compiled -DDEBUG.
00160 We define this bit always, so that all that's needed to turn on
00161 debugging is to recompile regex.c; the calling code can always have
00162 this bit set, and it won't affect anything in the normal case. */
00163 #define RE_DEBUG (RE_NO_GNU_OPS << 1)
00164
00165 /* This global variable defines the particular regexp syntax to use (for
00166 some interfaces). When a regexp is compiled, the syntax used is
00167 stored in the pattern buffer, so changing this does not affect
00168 already-compiled regexps. */
00169 extern reg_syntax_t re_syntax_options;
00170
00171 /* Define combinations of the above bits for the standard possibilities.
00172 (The [[[ comments delimit what gets put into the Texinfo file, so
00173 don't delete them!) */
00174 /* [[[begin syntaxes]]] */
00175 #define RE_SYNTAX_EMACS 0
00176
00177 #define RE_SYNTAX_AWK \
00178 (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \
00179 | RE_NO_BK_PARENS | RE_NO_BK_REFS \
00180 | RE_NO_BK_VBAR | RE_NO_EMPTY_RANGES \
00181 | RE_DOT_NEWLINE | RE_CONTEXT_INDEP_ANCHORS \
00182 | RE_UNMATCHED_RIGHT_PAREN_ORD | RE_NO_GNU_OPS)
00183
00184 #define RE_SYNTAX_GNU_AWK \
00185 ((RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DEBUG) \
00186 & ~(RE_DOT_NOT_NULL | RE_INTERVALS | RE_CONTEXT_INDEP_OPS))
00187
00188 #define RE_SYNTAX_POSIX_AWK \
00189 (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS \
00190 | RE_INTERVALS | RE_NO_GNU_OPS)
00191
00192 #define RE_SYNTAX_GREP \
00193 (RE_BK_PLUS_QM | RE_CHAR_CLASSES \
00194 | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \
00195 | RE_NEWLINE_ALT)
00196
00197 #define RE_SYNTAX_EGREP \
00198 (RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \
00199 | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \
00200 | RE_NEWLINE_ALT | RE_NO_BK_PARENS \
00201 | RE_NO_BK_VBAR)
00202
00203 #define RE_SYNTAX_POSIX_EGREP \
00204 (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES)
00205
00206 /* P1003.2/D11.2, section 4.20.7.1, lines 5078ff. */
00207 #define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC
00208
00209 #define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC
00210
00211 /* Syntax bits common to both basic and extended POSIX regex syntax. */
00212 #define _RE_SYNTAX_POSIX_COMMON \
00213 (RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \
00214 | RE_INTERVALS | RE_NO_EMPTY_RANGES)
00215
00216 #define RE_SYNTAX_POSIX_BASIC \
00217 (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM)
00218
00219 /* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes
00220 RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this
00221 isn't minimal, since other operators, such as \`, aren't disabled. */
00222 #define RE_SYNTAX_POSIX_MINIMAL_BASIC \
00223 (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS)
00224
00225 #define RE_SYNTAX_POSIX_EXTENDED \
00226 (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \
00227 | RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \
00228 | RE_NO_BK_PARENS | RE_NO_BK_VBAR \
00229 | RE_UNMATCHED_RIGHT_PAREN_ORD)
00230
00231 /* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS
00232 replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added. */
00233 #define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \
00234 (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \
00235 | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \
00236 | RE_NO_BK_PARENS | RE_NO_BK_REFS \
00237 | RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD)
00238 /* [[[end syntaxes]]] */
00239
00240 /* Maximum number of duplicates an interval can allow. Some systems
00241 (erroneously) define this in other header files, but we want our
00242 value, so remove any previous define. */
00243 #ifdef RE_DUP_MAX
00244 #undef RE_DUP_MAX
00245 #endif
00246 /* If sizeof(int) == 2, then ((1 << 15) - 1) overflows. */
00247 #define RE_DUP_MAX (0x7fff)
00248
00249
00250 /* POSIX `cflags' bits (i.e., information for `regcomp'). */
00251
00252 /* If this bit is set, then use extended regular expression syntax.
00253 If not set, then use basic regular expression syntax. */
00254 #define REG_EXTENDED 1
00255
00256 /* If this bit is set, then ignore case when matching.
00257 If not set, then case is significant. */
00258 #define REG_ICASE (REG_EXTENDED << 1)
00259
00260 /* If this bit is set, then anchors do not match at newline
00261 characters in the string.
00262 If not set, then anchors do match at newlines. */
00263 #define REG_NEWLINE (REG_ICASE << 1)
00264
00265 /* If this bit is set, then report only success or fail in regexec.
00266 If not set, then returns differ between not matching and errors. */
00267 #define REG_NOSUB (REG_NEWLINE << 1)
00268
00269
00270 /* POSIX `eflags' bits (i.e., information for regexec). */
00271
00272 /* If this bit is set, then the beginning-of-line operator doesn't match
00273 the beginning of the string (presumably because it's not the
00274 beginning of a line).
00275 If not set, then the beginning-of-line operator does match the
00276 beginning of the string. */
00277 #define REG_NOTBOL 1
00278
00279 /* Like REG_NOTBOL, except for the end-of-line. */
00280 #define REG_NOTEOL (1 << 1)
00281
00282
00283 /* If any error codes are removed, changed, or added, update the
00284 `re_error_msg' table in regex.c. */
00285 typedef enum
00286 {
00287 REG_NOERROR = 0, /* Success. */
00288 REG_NOMATCH, /* Didn't find a match (for regexec). */
00289
00290 /* POSIX regcomp return error codes. (In the order listed in the
00291 standard.) */
00292 REG_BADPAT, /* Invalid pattern. */
00293 REG_ECOLLATE, /* Not implemented. */
00294 REG_ECTYPE, /* Invalid character class name. */
00295 REG_EESCAPE, /* Trailing backslash. */
00296 REG_ESUBREG, /* Invalid back reference. */
00297 REG_EBRACK, /* Unmatched left bracket. */
00298 REG_EPAREN, /* Parenthesis imbalance. */
00299 REG_EBRACE, /* Unmatched \{. */
00300 REG_BADBR, /* Invalid contents of \{\}. */
00301 REG_ERANGE, /* Invalid range end. */
00302 REG_ESPACE, /* Ran out of memory. */
00303 REG_BADRPT, /* No preceding re for repetition op. */
00304
00305 /* Error codes we've added. */
00306 REG_EEND, /* Premature end. */
00307 REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */
00308 REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */
00309 }
00310 reg_errcode_t;
00311
00312 /* This data structure represents a compiled pattern. Before calling
00313 the pattern compiler, the fields `buffer', `allocated', `fastmap',
00314 `translate', and `no_sub' can be set. After the pattern has been
00315 compiled, the `re_nsub' field is available. All other fields are
00316 private to the regex routines. */
00317
00318 #ifndef RE_TRANSLATE_TYPE
00319 #define RE_TRANSLATE_TYPE char *
00320 #endif
00321
00322 struct re_pattern_buffer
00323 {
00324 /* [[[begin pattern_buffer]]] */
00325 /* Space that holds the compiled pattern. It is declared as
00326 `unsigned char *' because its elements are
00327 sometimes used as array indexes. */
00328 unsigned char *buffer;
00329
00330 /* Number of bytes to which `buffer' points. */
00331 unsigned long int allocated;
00332
00333 /* Number of bytes actually used in `buffer'. */
00334 unsigned long int used;
00335
00336 /* Syntax setting with which the pattern was compiled. */
00337 reg_syntax_t syntax;
00338
00339 /* Pointer to a fastmap, if any, otherwise zero. re_search uses
00340 the fastmap, if there is one, to skip over impossible
00341 starting points for matches. */
00342 char *fastmap;
00343
00344 /* Either a translate table to apply to all characters before
00345 comparing them, or zero for no translation. The translation
00346 is applied to a pattern when it is compiled and to a string
00347 when it is matched. */
00348 RE_TRANSLATE_TYPE translate;
00349
00350 /* Number of subexpressions found by the compiler. */
00351 size_t re_nsub;
00352
00353 /* Zero if this pattern cannot match the empty string, one else.
00354 Well, in truth it's used only in `re_search_2', to see
00355 whether or not we should use the fastmap, so we don't set
00356 this absolutely perfectly; see `re_compile_fastmap' (the
00357 `duplicate' case). */
00358 unsigned can_be_null:1;
00359
00360 /* If REGS_UNALLOCATED, allocate space in the `regs' structure
00361 for `max (RE_NREGS, re_nsub + 1)' groups.
00362 If REGS_REALLOCATE, reallocate space if necessary.
00363 If REGS_FIXED, use what's there. */
00364 #define REGS_UNALLOCATED 0
00365 #define REGS_REALLOCATE 1
00366 #define REGS_FIXED 2
00367 unsigned regs_allocated:2;
00368
00369 /* Set to zero when `regex_compile' compiles a pattern; set to one
00370 by `re_compile_fastmap' if it updates the fastmap. */
00371 unsigned fastmap_accurate:1;
00372
00373 /* If set, `re_match_2' does not return information about
00374 subexpressions. */
00375 unsigned no_sub:1;
00376
00377 /* If set, a beginning-of-line anchor doesn't match at the
00378 beginning of the string. */
00379 unsigned not_bol:1;
00380
00381 /* Similarly for an end-of-line anchor. */
00382 unsigned not_eol:1;
00383
00384 /* If true, an anchor at a newline matches. */
00385 unsigned newline_anchor:1;
00386
00387 /* [[[end pattern_buffer]]] */
00388 };
00389
00390 typedef struct re_pattern_buffer regex_t;
00391
00392 /* Type for byte offsets within the string. POSIX mandates this. */
00393 typedef int regoff_t;
00394
00395
00396 /* This is the structure we store register match data in. See
00397 regex.texinfo for a full description of what registers match. */
00398 struct re_registers
00399 {
00400 unsigned num_regs;
00401 regoff_t *start;
00402 regoff_t *end;
00403 };
00404
00405
00406 /* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer,
00407 `re_match_2' returns information about at least this many registers
00408 the first time a `regs' structure is passed. */
00409 #ifndef RE_NREGS
00410 #define RE_NREGS 30
00411 #endif
00412
00413
00414 /* POSIX specification for registers. Aside from the different names than
00415 `re_registers', POSIX uses an array of structures, instead of a
00416 structure of arrays. */
00417 typedef struct
00418 {
00419 regoff_t rm_so; /* Byte offset from string's start to substring's start. */
00420 regoff_t rm_eo; /* Byte offset from string's start to substring's end. */
00421 }
00422 regmatch_t;
00423
00424 /* Declarations for routines. */
00425
00426 /* To avoid duplicating every routine declaration -- once with a
00427 prototype (if we are ANSI), and once without (if we aren't) -- we
00428 use the following macro to declare argument types. This
00429 unfortunately clutters up the declarations a bit, but I think it's
00430 worth it. */
00431 #ifndef __STDC__
00432 #define __STDC__ 1
00433 #endif
00434 #if __STDC__
00435
00436 #define _RE_ARGS(args) args
00437
00438 #else /* not __STDC__ */
00439
00440 #define _RE_ARGS(args) ()
00441
00442 #endif /* not __STDC__ */
00443
00444 /* Sets the current default syntax to SYNTAX, and return the old syntax.
00445 You can also simply assign to the `re_syntax_options' variable. */
00446 extern reg_syntax_t re_set_syntax _RE_ARGS ((reg_syntax_t syntax));
00447
00448 /* Compile the regular expression PATTERN, with length LENGTH
00449 and syntax given by the global `re_syntax_options', into the buffer
00450 BUFFER. Return NULL if successful, and an error string if not. */
00451 extern const char *re_compile_pattern
00452 _RE_ARGS ((const char *pattern, size_t length,
00453 struct re_pattern_buffer * buffer));
00454
00455
00456 /* Compile a fastmap for the compiled pattern in BUFFER; used to
00457 accelerate searches. Return 0 if successful and -2 if was an
00458 internal error. */
00459 extern int re_compile_fastmap
00460 _RE_ARGS ((struct re_pattern_buffer * buffer));
00461
00462
00463 /* Search in the string STRING (with length LENGTH) for the pattern
00464 compiled into BUFFER. Start searching at position START, for RANGE
00465 characters. Return the starting position of the match, -1 for no
00466 match, or -2 for an internal error. Also return register
00467 information in REGS (if REGS and BUFFER->no_sub are nonzero). */
00468 extern int re_search
00469 _RE_ARGS ((struct re_pattern_buffer * buffer, const char *string,
00470 int length, int start, int range, struct re_registers * regs));
00471
00472
00473 /* Like `re_search', but search in the concatenation of STRING1 and
00474 STRING2. Also, stop searching at index START + STOP. */
00475 extern int re_search_2
00476 _RE_ARGS ((struct re_pattern_buffer * buffer, const char *string1,
00477 int length1, const char *string2, int length2,
00478 int start, int range, struct re_registers * regs, int stop));
00479
00480
00481 /* Like `re_search', but return how many characters in STRING the regexp
00482 in BUFFER matched, starting at position START. */
00483 extern int re_match
00484 _RE_ARGS ((struct re_pattern_buffer * buffer, const char *string,
00485 int length, int start, struct re_registers * regs));
00486
00487
00488 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */
00489 extern int re_match_2
00490 _RE_ARGS ((struct re_pattern_buffer * buffer, const char *string1,
00491 int length1, const char *string2, int length2,
00492 int start, struct re_registers * regs, int stop));
00493
00494
00495 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and
00496 ENDS. Subsequent matches using BUFFER and REGS will use this memory
00497 for recording register information. STARTS and ENDS must be
00498 allocated with malloc, and must each be at least `NUM_REGS * sizeof
00499 (regoff_t)' bytes long.
00500
00501 If NUM_REGS == 0, then subsequent matches should allocate their own
00502 register data.
00503
00504 Unless this function is called, the first search or match using
00505 PATTERN_BUFFER will allocate its own register data, without
00506 freeing the old data. */
00507 extern void re_set_registers
00508 _RE_ARGS ((struct re_pattern_buffer * buffer, struct re_registers * regs,
00509 unsigned num_regs, regoff_t * starts, regoff_t * ends));
00510
00511 #ifdef _REGEX_RE_COMP
00512 #ifndef _CRAY
00513 /* 4.2 bsd compatibility. */
00514 extern char *re_comp _RE_ARGS ((const char *));
00515 extern int re_exec _RE_ARGS ((const char *));
00516 #endif
00517 #endif
00518
00519 /* POSIX compatibility. */
00520 extern int regcomp
00521 _RE_ARGS ((regex_t * preg, const char *pattern, int cflags));
00522 extern int regexec
00523 _RE_ARGS (
00524 (const regex_t * preg, const char *string, size_t nmatch,
00525 regmatch_t pmatch[], int eflags));
00526 extern size_t regerror
00527 _RE_ARGS (
00528 (int errcode, const regex_t * preg, char *errbuf,
00529 size_t errbuf_size));
00530 extern void regfree _RE_ARGS ((regex_t * preg));
00531
00532
00533 #ifdef __cplusplus
00534 }
00535 #endif /* C++ */
00536
00537 #endif /* regex.h */
00538
00539 /*
00540 Local variables:
00541 make-backup-files: t
00542 version-control: t
00543 trim-versions-without-asking: nil
00544 End:
00545 */
1.2.9.1 written by Dimitri van Heesch,
© 1997-2001