/misc/src/release/graphviz-2.18-1/src/graphviz-2.18/lib/gvc/regex_win32.h

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

Generated on Mon Mar 31 19:03:27 2008 for Graphviz by  doxygen 1.5.1