headers/private/mail/regex.h

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