Back to index

cell-binutils  2.17cvs20070401
xregex2.h
Go to the documentation of this file.
00001 /* Definitions for data structures and routines for the regular
00002    expression library, version 0.12.
00003 
00004    Copyright (C) 1985, 1989, 1990, 1991, 1992, 1993, 1995, 1996, 1997,
00005    1998, 2000, 2005 Free Software Foundation, Inc.
00006 
00007    This file is part of the GNU C Library.  Its master source is NOT part of
00008    the C library, however.  The master source lives in /gd/gnu/lib.
00009 
00010    The GNU C Library is free software; you can redistribute it and/or
00011    modify it under the terms of the GNU Lesser General Public
00012    License as published by the Free Software Foundation; either
00013    version 2.1 of the License, or (at your option) any later version.
00014 
00015    The GNU C Library 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 GNU
00018    Lesser General Public License for more details.
00019 
00020    You should have received a copy of the GNU Lesser General Public
00021    License along with the GNU C Library; if not, write to the Free
00022    Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
00023    02110-1301 USA.  */
00024 
00025 #ifndef _REGEX_H
00026 #define _REGEX_H 1
00027 
00028 /* Allow the use in C++ code.  */
00029 #ifdef __cplusplus
00030 extern "C" {
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 /* If this bit is set, a syntactically invalid interval is treated as
00166    a string of ordinary characters.  For example, the ERE 'a{1' is
00167    treated as 'a\{1'.  */
00168 #define RE_INVALID_INTERVAL_ORD (RE_DEBUG << 1)
00169 
00170 /* This global variable defines the particular regexp syntax to use (for
00171    some interfaces).  When a regexp is compiled, the syntax used is
00172    stored in the pattern buffer, so changing this does not affect
00173    already-compiled regexps.  */
00174 extern reg_syntax_t re_syntax_options;
00175 
00176 /* Define combinations of the above bits for the standard possibilities.
00177    (The [[[ comments delimit what gets put into the Texinfo file, so
00178    don't delete them!)  */
00179 /* [[[begin syntaxes]]] */
00180 #define RE_SYNTAX_EMACS 0
00181 
00182 #define RE_SYNTAX_AWK                                                 \
00183   (RE_BACKSLASH_ESCAPE_IN_LISTS   | RE_DOT_NOT_NULL                   \
00184    | RE_NO_BK_PARENS              | RE_NO_BK_REFS                     \
00185    | RE_NO_BK_VBAR                | RE_NO_EMPTY_RANGES                \
00186    | RE_DOT_NEWLINE           | RE_CONTEXT_INDEP_ANCHORS              \
00187    | RE_UNMATCHED_RIGHT_PAREN_ORD | RE_NO_GNU_OPS)
00188 
00189 #define RE_SYNTAX_GNU_AWK                                      \
00190   ((RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DEBUG)      \
00191    & ~(RE_DOT_NOT_NULL | RE_INTERVALS | RE_CONTEXT_INDEP_OPS))
00192 
00193 #define RE_SYNTAX_POSIX_AWK                                           \
00194   (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS            \
00195    | RE_INTERVALS        | RE_NO_GNU_OPS)
00196 
00197 #define RE_SYNTAX_GREP                                                \
00198   (RE_BK_PLUS_QM              | RE_CHAR_CLASSES                       \
00199    | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS                          \
00200    | RE_NEWLINE_ALT)
00201 
00202 #define RE_SYNTAX_EGREP                                               \
00203   (RE_CHAR_CLASSES        | RE_CONTEXT_INDEP_ANCHORS                  \
00204    | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE                  \
00205    | RE_NEWLINE_ALT       | RE_NO_BK_PARENS                           \
00206    | RE_NO_BK_VBAR)
00207 
00208 #define RE_SYNTAX_POSIX_EGREP                                         \
00209   (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES                   \
00210    | RE_INVALID_INTERVAL_ORD)
00211 
00212 /* P1003.2/D11.2, section 4.20.7.1, lines 5078ff.  */
00213 #define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC
00214 
00215 #define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC
00216 
00217 /* Syntax bits common to both basic and extended POSIX regex syntax.  */
00218 #define _RE_SYNTAX_POSIX_COMMON                                       \
00219   (RE_CHAR_CLASSES | RE_DOT_NEWLINE      | RE_DOT_NOT_NULL            \
00220    | RE_INTERVALS  | RE_NO_EMPTY_RANGES)
00221 
00222 #define RE_SYNTAX_POSIX_BASIC                                         \
00223   (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM)
00224 
00225 /* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes
00226    RE_LIMITED_OPS, i.e., \? \+ \| are not recognized.  Actually, this
00227    isn't minimal, since other operators, such as \`, aren't disabled.  */
00228 #define RE_SYNTAX_POSIX_MINIMAL_BASIC                                 \
00229   (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS)
00230 
00231 #define RE_SYNTAX_POSIX_EXTENDED                               \
00232   (_RE_SYNTAX_POSIX_COMMON  | RE_CONTEXT_INDEP_ANCHORS                \
00233    | RE_CONTEXT_INDEP_OPS   | RE_NO_BK_BRACES                         \
00234    | RE_NO_BK_PARENS        | RE_NO_BK_VBAR                           \
00235    | RE_CONTEXT_INVALID_OPS | RE_UNMATCHED_RIGHT_PAREN_ORD)
00236 
00237 /* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INDEP_OPS is
00238    removed and RE_NO_BK_REFS is added.  */
00239 #define RE_SYNTAX_POSIX_MINIMAL_EXTENDED                       \
00240   (_RE_SYNTAX_POSIX_COMMON  | RE_CONTEXT_INDEP_ANCHORS                \
00241    | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES                         \
00242    | RE_NO_BK_PARENS        | RE_NO_BK_REFS                           \
00243    | RE_NO_BK_VBAR       | RE_UNMATCHED_RIGHT_PAREN_ORD)
00244 /* [[[end syntaxes]]] */
00245 
00246 /* Maximum number of duplicates an interval can allow.  Some systems
00247    (erroneously) define this in other header files, but we want our
00248    value, so remove any previous define.  */
00249 #ifdef RE_DUP_MAX
00250 # undef RE_DUP_MAX
00251 #endif
00252 /* If sizeof(int) == 2, then ((1 << 15) - 1) overflows.  */
00253 #define RE_DUP_MAX (0x7fff)
00254 
00255 
00256 /* POSIX `cflags' bits (i.e., information for `regcomp').  */
00257 
00258 /* If this bit is set, then use extended regular expression syntax.
00259    If not set, then use basic regular expression syntax.  */
00260 #define REG_EXTENDED 1
00261 
00262 /* If this bit is set, then ignore case when matching.
00263    If not set, then case is significant.  */
00264 #define REG_ICASE (REG_EXTENDED << 1)
00265 
00266 /* If this bit is set, then anchors do not match at newline
00267      characters in the string.
00268    If not set, then anchors do match at newlines.  */
00269 #define REG_NEWLINE (REG_ICASE << 1)
00270 
00271 /* If this bit is set, then report only success or fail in regexec.
00272    If not set, then returns differ between not matching and errors.  */
00273 #define REG_NOSUB (REG_NEWLINE << 1)
00274 
00275 
00276 /* POSIX `eflags' bits (i.e., information for regexec).  */
00277 
00278 /* If this bit is set, then the beginning-of-line operator doesn't match
00279      the beginning of the string (presumably because it's not the
00280      beginning of a line).
00281    If not set, then the beginning-of-line operator does match the
00282      beginning of the string.  */
00283 #define REG_NOTBOL 1
00284 
00285 /* Like REG_NOTBOL, except for the end-of-line.  */
00286 #define REG_NOTEOL (1 << 1)
00287 
00288 
00289 /* If any error codes are removed, changed, or added, update the
00290    `re_error_msg' table in regex.c.  */
00291 typedef enum
00292 {
00293 #ifdef _XOPEN_SOURCE
00294   REG_ENOSYS = -1,   /* This will never happen for this implementation.  */
00295 #endif
00296 
00297   REG_NOERROR = 0,   /* Success.  */
00298   REG_NOMATCH,              /* Didn't find a match (for regexec).  */
00299 
00300   /* POSIX regcomp return error codes.  (In the order listed in the
00301      standard.)  */
00302   REG_BADPAT,        /* Invalid pattern.  */
00303   REG_ECOLLATE,             /* Not implemented.  */
00304   REG_ECTYPE,        /* Invalid character class name.  */
00305   REG_EESCAPE,              /* Trailing backslash.  */
00306   REG_ESUBREG,              /* Invalid back reference.  */
00307   REG_EBRACK,        /* Unmatched left bracket.  */
00308   REG_EPAREN,        /* Parenthesis imbalance.  */
00309   REG_EBRACE,        /* Unmatched \{.  */
00310   REG_BADBR,         /* Invalid contents of \{\}.  */
00311   REG_ERANGE,        /* Invalid range end.  */
00312   REG_ESPACE,        /* Ran out of memory.  */
00313   REG_BADRPT,        /* No preceding re for repetition op.  */
00314 
00315   /* Error codes we've added.  */
00316   REG_EEND,          /* Premature end.  */
00317   REG_ESIZE,         /* Compiled pattern bigger than 2^16 bytes.  */
00318   REG_ERPAREN        /* Unmatched ) or \); not returned from regcomp.  */
00319 } reg_errcode_t;
00320 
00321 /* This data structure represents a compiled pattern.  Before calling
00322    the pattern compiler, the fields `buffer', `allocated', `fastmap',
00323    `translate', and `no_sub' can be set.  After the pattern has been
00324    compiled, the `re_nsub' field is available.  All other fields are
00325    private to the regex routines.  */
00326 
00327 #ifndef RE_TRANSLATE_TYPE
00328 # define RE_TRANSLATE_TYPE char *
00329 #endif
00330 
00331 struct re_pattern_buffer
00332 {
00333 /* [[[begin pattern_buffer]]] */
00334        /* Space that holds the compiled pattern.  It is declared as
00335           `unsigned char *' because its elements are
00336            sometimes used as array indexes.  */
00337   unsigned char *buffer;
00338 
00339        /* Number of bytes to which `buffer' points.  */
00340   unsigned long int allocated;
00341 
00342        /* Number of bytes actually used in `buffer'.  */
00343   unsigned long int used;
00344 
00345         /* Syntax setting with which the pattern was compiled.  */
00346   reg_syntax_t syntax;
00347 
00348         /* Pointer to a fastmap, if any, otherwise zero.  re_search uses
00349            the fastmap, if there is one, to skip over impossible
00350            starting points for matches.  */
00351   char *fastmap;
00352 
00353         /* Either a translate table to apply to all characters before
00354            comparing them, or zero for no translation.  The translation
00355            is applied to a pattern when it is compiled and to a string
00356            when it is matched.  */
00357   RE_TRANSLATE_TYPE translate;
00358 
00359        /* Number of subexpressions found by the compiler.  */
00360   size_t re_nsub;
00361 
00362         /* Zero if this pattern cannot match the empty string, one else.
00363            Well, in truth it's used only in `re_search_2', to see
00364            whether or not we should use the fastmap, so we don't set
00365            this absolutely perfectly; see `re_compile_fastmap' (the
00366            `duplicate' case).  */
00367   unsigned can_be_null : 1;
00368 
00369         /* If REGS_UNALLOCATED, allocate space in the `regs' structure
00370              for `max (RE_NREGS, re_nsub + 1)' groups.
00371            If REGS_REALLOCATE, reallocate space if necessary.
00372            If REGS_FIXED, use what's there.  */
00373 #define REGS_UNALLOCATED 0
00374 #define REGS_REALLOCATE 1
00375 #define REGS_FIXED 2
00376   unsigned regs_allocated : 2;
00377 
00378         /* Set to zero when `regex_compile' compiles a pattern; set to one
00379            by `re_compile_fastmap' if it updates the fastmap.  */
00380   unsigned fastmap_accurate : 1;
00381 
00382         /* If set, `re_match_2' does not return information about
00383            subexpressions.  */
00384   unsigned no_sub : 1;
00385 
00386         /* If set, a beginning-of-line anchor doesn't match at the
00387            beginning of the string.  */
00388   unsigned not_bol : 1;
00389 
00390         /* Similarly for an end-of-line anchor.  */
00391   unsigned not_eol : 1;
00392 
00393         /* If true, an anchor at a newline matches.  */
00394   unsigned newline_anchor : 1;
00395 
00396 /* [[[end pattern_buffer]]] */
00397 };
00398 
00399 typedef struct re_pattern_buffer regex_t;
00400 
00401 /* Type for byte offsets within the string.  POSIX mandates this.  */
00402 typedef int regoff_t;
00403 
00404 
00405 /* This is the structure we store register match data in.  See
00406    regex.texinfo for a full description of what registers match.  */
00407 struct re_registers
00408 {
00409   unsigned num_regs;
00410   regoff_t *start;
00411   regoff_t *end;
00412 };
00413 
00414 
00415 /* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer,
00416    `re_match_2' returns information about at least this many registers
00417    the first time a `regs' structure is passed.  */
00418 #ifndef RE_NREGS
00419 # define RE_NREGS 30
00420 #endif
00421 
00422 
00423 /* POSIX specification for registers.  Aside from the different names than
00424    `re_registers', POSIX uses an array of structures, instead of a
00425    structure of arrays.  */
00426 typedef struct
00427 {
00428   regoff_t rm_so;  /* Byte offset from string's start to substring's start.  */
00429   regoff_t rm_eo;  /* Byte offset from string's start to substring's end.  */
00430 } regmatch_t;
00431 
00432 /* Declarations for routines.  */
00433 
00434 /* To avoid duplicating every routine declaration -- once with a
00435    prototype (if we are ANSI), and once without (if we aren't) -- we
00436    use the following macro to declare argument types.  This
00437    unfortunately clutters up the declarations a bit, but I think it's
00438    worth it.  */
00439 
00440 /* Sets the current default syntax to SYNTAX, and return the old syntax.
00441    You can also simply assign to the `re_syntax_options' variable.  */
00442 extern reg_syntax_t re_set_syntax (reg_syntax_t syntax);
00443 
00444 /* Compile the regular expression PATTERN, with length LENGTH
00445    and syntax given by the global `re_syntax_options', into the buffer
00446    BUFFER.  Return NULL if successful, and an error string if not.  */
00447 extern const char *re_compile_pattern (const char *pattern, size_t length,
00448                                        struct re_pattern_buffer *buffer);
00449 
00450 
00451 /* Compile a fastmap for the compiled pattern in BUFFER; used to
00452    accelerate searches.  Return 0 if successful and -2 if was an
00453    internal error.  */
00454 extern int re_compile_fastmap (struct re_pattern_buffer *buffer);
00455 
00456 
00457 /* Search in the string STRING (with length LENGTH) for the pattern
00458    compiled into BUFFER.  Start searching at position START, for RANGE
00459    characters.  Return the starting position of the match, -1 for no
00460    match, or -2 for an internal error.  Also return register
00461    information in REGS (if REGS and BUFFER->no_sub are nonzero).  */
00462 extern int re_search (struct re_pattern_buffer *buffer, const char *string,
00463                       int length, int start, int range,
00464                       struct re_registers *regs);
00465 
00466 
00467 /* Like `re_search', but search in the concatenation of STRING1 and
00468    STRING2.  Also, stop searching at index START + STOP.  */
00469 extern int re_search_2 (struct re_pattern_buffer *buffer, const char *string1,
00470                         int length1, const char *string2, int length2,
00471                         int start, int range, struct re_registers *regs,
00472                         int stop);
00473 
00474 
00475 /* Like `re_search', but return how many characters in STRING the regexp
00476    in BUFFER matched, starting at position START.  */
00477 extern int re_match (struct re_pattern_buffer *buffer, const char *string,
00478                      int length, int start, struct re_registers *regs);
00479 
00480 
00481 /* Relates to `re_match' as `re_search_2' relates to `re_search'.  */
00482 extern int re_match_2 (struct re_pattern_buffer *buffer, const char *string1,
00483                        int length1, const char *string2, int length2,
00484                        int start, struct re_registers *regs, int stop);
00485 
00486 
00487 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and
00488    ENDS.  Subsequent matches using BUFFER and REGS will use this memory
00489    for recording register information.  STARTS and ENDS must be
00490    allocated with malloc, and must each be at least `NUM_REGS * sizeof
00491    (regoff_t)' bytes long.
00492 
00493    If NUM_REGS == 0, then subsequent matches should allocate their own
00494    register data.
00495 
00496    Unless this function is called, the first search or match using
00497    PATTERN_BUFFER will allocate its own register data, without
00498    freeing the old data.  */
00499 extern void re_set_registers (struct re_pattern_buffer *buffer,
00500                               struct re_registers *regs,
00501                               unsigned num_regs, regoff_t *starts,
00502                               regoff_t *ends);
00503 
00504 #if defined _REGEX_RE_COMP || defined _LIBC
00505 # ifndef _CRAY
00506 /* 4.2 bsd compatibility.  */
00507 extern char *re_comp (const char *);
00508 extern int re_exec (const char *);
00509 # endif
00510 #endif
00511 
00512 /* GCC 2.95 and later have "__restrict"; C99 compilers have
00513    "restrict", and "configure" may have defined "restrict".  */
00514 #ifndef __restrict
00515 # if ! (2 < __GNUC__ || (2 == __GNUC__ && 95 <= __GNUC_MINOR__))
00516 #  if defined restrict || 199901L <= __STDC_VERSION__
00517 #   define __restrict restrict
00518 #  else
00519 #   define __restrict
00520 #  endif
00521 # endif
00522 #endif
00523 
00524 /* GCC 3.1 and later support declaring arrays as non-overlapping
00525    using the syntax array_name[restrict]  */
00526 #ifndef __restrict_arr
00527 # if ! (3 < __GNUC__ || (3 == __GNUC__ && 1 <= __GNUC_MINOR__)) || defined (__GNUG__)
00528 #  define __restrict_arr
00529 # else
00530 #  define __restrict_arr __restrict
00531 # endif
00532 #endif
00533 
00534 /* POSIX compatibility.  */
00535 extern int regcomp (regex_t *__restrict __preg,
00536                     const char *__restrict __pattern,
00537                     int __cflags);
00538 
00539 #if (__GNUC__)
00540 __extension__
00541 #endif
00542 extern int regexec (const regex_t *__restrict __preg,
00543                     const char *__restrict __string, size_t __nmatch,
00544                     regmatch_t __pmatch[__restrict_arr],
00545                     int __eflags);
00546 
00547 extern size_t regerror (int __errcode, const regex_t *__preg,
00548                         char *__errbuf, size_t __errbuf_size);
00549 
00550 extern void regfree (regex_t *__preg);
00551 
00552 
00553 #ifdef __cplusplus
00554 }
00555 #endif /* C++ */
00556 
00557 #endif /* regex.h */
00558 
00559 /*
00560 Local variables:
00561 make-backup-files: t
00562 version-control: t
00563 trim-versions-without-asking: nil
00564 End:
00565 */