1 /* LGPLd GNU regex for Native WIN32 */ 2 3 /* Part of the ht://Dig package <http://www.htdig.org/> */ 4 /* Copyright (c) 2003 The ht://Dig Group */ 5 /* For copyright details, see the file COPYING in your distribution */ 6 /* or the GNU Library General Public License (LGPL) version 2 or later or later */ 7 /* <http://www.gnu.org/copyleft/lgpl.html> */ 8 9 /* Added June 2003 Neal Richter, RightNow Technologies */ 10 11 /* note that this version is significantly different from the original */ 12 /* version 0.12 GNU source code. It compiles and works on Native WIN32. */ 13 14 /* Definitions for data structures and routines for the regular 15 expression library, version 0.12. 16 Copyright (C) 1985,89,90,91,92,93,95,96,97 Free Software Foundation, Inc. 17 18 This file is part of the GNU C Library. Its master source is NOT part of 19 the C library, however. The master source lives in /gd/gnu/lib. 20 21 The GNU C Library is free software; you can redistribute it and/or 22 modify it under the terms of the GNU Library General Public License as 23 published by the Free Software Foundation; either version 2 of the 24 License, or (at your option) any later version. 25 26 The GNU C Library is distributed in the hope that it will be useful, 27 but WITHOUT ANY WARRANTY; without even the implied warranty of 28 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 29 Library General Public License for more details. 30 31 You should have received a copy of the GNU Library General Public 32 License along with the GNU C Library; see the file COPYING.LIB. If not, 33 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, 34 Boston, MA 02111-1307, USA. */ 35 36 #ifndef __REGEXP_LIBRARY_H__ 37 #define __REGEXP_LIBRARY_H__ 38 39 /* Allow the use in C++ code. */ 40 #ifdef __cplusplus 41 extern "C" { 42 #endif 43 44 #include <stdlib.h> 45 /* POSIX says that <sys/types.h> must be included (by the caller) before 46 <regex.h>. */ 47 48 #if !defined (_POSIX_C_SOURCE) && !defined (_POSIX_SOURCE) && defined (VMS) 49 /* VMS doesn't have `size_t' in <sys/types.h>, even though POSIX says it 50 should be there. */ 51 #include <stddef.h> 52 #endif 53 54 /* The following two types have to be signed and unsigned integer type 55 wide enough to hold a value of a pointer. For most ANSI compilers 56 ptrdiff_t and size_t should be likely OK. Still size of these two 57 types is 2 for Microsoft C. Ugh... */ 58 typedef long int s_reg_t; 59 typedef unsigned long int active_reg_t; 60 61 /* The following bits are used to determine the regexp syntax we 62 recognize. The set/not-set meanings are chosen so that Emacs syntax 63 remains the value 0. The bits are given in alphabetical order, and 64 the definitions shifted by one from the previous bit; thus, when we 65 add or remove a bit, only one other definition need change. */ 66 typedef unsigned long int reg_syntax_t; 67 68 /* If this bit is not set, then \ inside a bracket expression is literal. 69 If set, then such a \ quotes the following character. */ 70 #define RE_BACKSLASH_ESCAPE_IN_LISTS ((unsigned long int) 1) 71 72 /* If this bit is not set, then + and ? are operators, and \+ and \? are 73 literals. 74 If set, then \+ and \? are operators and + and ? are literals. */ 75 #define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1) 76 77 /* If this bit is set, then character classes are supported. They are: 78 [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:], 79 [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:]. 80 If not set, then character classes are not supported. */ 81 #define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1) 82 83 /* If this bit is set, then ^ and $ are always anchors (outside bracket 84 expressions, of course). 85 If this bit is not set, then it depends: 86 ^ is an anchor if it is at the beginning of a regular 87 expression or after an open-group or an alternation operator; 88 $ is an anchor if it is at the end of a regular expression, or 89 before a close-group or an alternation operator. 90 91 This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because 92 POSIX draft 11.2 says that * etc. in leading positions is undefined. 93 We already implemented a previous draft which made those constructs 94 invalid, though, so we haven't changed the code back. */ 95 #define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1) 96 97 /* If this bit is set, then special characters are always special 98 regardless of where they are in the pattern. 99 If this bit is not set, then special characters are special only in 100 some contexts; otherwise they are ordinary. Specifically, 101 * + ? and intervals are only special when not after the beginning, 102 open-group, or alternation operator. */ 103 #define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1) 104 105 /* If this bit is set, then *, +, ?, and { cannot be first in an re or 106 immediately after an alternation or begin-group operator. */ 107 #define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1) 108 109 /* If this bit is set, then . matches newline. 110 If not set, then it doesn't. */ 111 #define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1) 112 113 /* If this bit is set, then . doesn't match NUL. 114 If not set, then it does. */ 115 #define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1) 116 117 /* If this bit is set, nonmatching lists [^...] do not match newline. 118 If not set, they do. */ 119 #define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1) 120 121 /* If this bit is set, either \{...\} or {...} defines an 122 interval, depending on RE_NO_BK_BRACES. 123 If not set, \{, \}, {, and } are literals. */ 124 #define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1) 125 126 /* If this bit is set, +, ? and | aren't recognized as operators. 127 If not set, they are. */ 128 #define RE_LIMITED_OPS (RE_INTERVALS << 1) 129 130 /* If this bit is set, newline is an alternation operator. 131 If not set, newline is literal. */ 132 #define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1) 133 134 /* If this bit is set, then `{...}' defines an interval, and \{ and \} 135 are literals. 136 If not set, then `\{...\}' defines an interval. */ 137 #define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1) 138 139 /* If this bit is set, (...) defines a group, and \( and \) are literals. 140 If not set, \(...\) defines a group, and ( and ) are literals. */ 141 #define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1) 142 143 /* If this bit is set, then \<digit> matches <digit>. 144 If not set, then \<digit> is a back-reference. */ 145 #define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1) 146 147 /* If this bit is set, then | is an alternation operator, and \| is literal. 148 If not set, then \| is an alternation operator, and | is literal. */ 149 #define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1) 150 151 /* If this bit is set, then an ending range point collating higher 152 than the starting range point, as in [z-a], is invalid. 153 If not set, then when ending range point collates higher than the 154 starting range point, the range is ignored. */ 155 #define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1) 156 157 /* If this bit is set, then an unmatched ) is ordinary. 158 If not set, then an unmatched ) is invalid. */ 159 #define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1) 160 161 /* If this bit is set, succeed as soon as we match the whole pattern, 162 without further backtracking. */ 163 #define RE_NO_POSIX_BACKTRACKING (RE_UNMATCHED_RIGHT_PAREN_ORD << 1) 164 165 /* If this bit is set, do not process the GNU regex operators. 166 If not set, then the GNU regex operators are recognized. */ 167 #define RE_NO_GNU_OPS (RE_NO_POSIX_BACKTRACKING << 1) 168 169 /* If this bit is set, turn on internal regex debugging. 170 If not set, and debugging was on, turn it off. 171 This only works if regex.c is compiled -DDEBUG. 172 We define this bit always, so that all that's needed to turn on 173 debugging is to recompile regex.c; the calling code can always have 174 this bit set, and it won't affect anything in the normal case. */ 175 #define RE_DEBUG (RE_NO_GNU_OPS << 1) 176 177 /* This global variable defines the particular regexp syntax to use (for 178 some interfaces). When a regexp is compiled, the syntax used is 179 stored in the pattern buffer, so changing this does not affect 180 already-compiled regexps. */ 181 extern reg_syntax_t re_syntax_options; 182 183 /* Define combinations of the above bits for the standard possibilities. 184 (The [[[ comments delimit what gets put into the Texinfo file, so 185 don't delete them!) */ 186 /* [[[begin syntaxes]]] */ 187 #define RE_SYNTAX_EMACS 0 188 189 #define RE_SYNTAX_AWK \ 190 (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \ 191 | RE_NO_BK_PARENS | RE_NO_BK_REFS \ 192 | RE_NO_BK_VBAR | RE_NO_EMPTY_RANGES \ 193 | RE_DOT_NEWLINE | RE_CONTEXT_INDEP_ANCHORS \ 194 | RE_UNMATCHED_RIGHT_PAREN_ORD | RE_NO_GNU_OPS) 195 196 #define RE_SYNTAX_GNU_AWK \ 197 ((RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DEBUG) \ 198 & ~(RE_DOT_NOT_NULL | RE_INTERVALS | RE_CONTEXT_INDEP_OPS)) 199 200 #define RE_SYNTAX_POSIX_AWK \ 201 (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS \ 202 | RE_INTERVALS | RE_NO_GNU_OPS) 203 204 #define RE_SYNTAX_GREP \ 205 (RE_BK_PLUS_QM | RE_CHAR_CLASSES \ 206 | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \ 207 | RE_NEWLINE_ALT) 208 209 #define RE_SYNTAX_EGREP \ 210 (RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \ 211 | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \ 212 | RE_NEWLINE_ALT | RE_NO_BK_PARENS \ 213 | RE_NO_BK_VBAR) 214 215 #define RE_SYNTAX_POSIX_EGREP \ 216 (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES) 217 218 /* P1003.2/D11.2, section 4.20.7.1, lines 5078ff. */ 219 #define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC 220 221 #define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC 222 223 /* Syntax bits common to both basic and extended POSIX regex syntax. */ 224 #define _RE_SYNTAX_POSIX_COMMON \ 225 (RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \ 226 | RE_INTERVALS | RE_NO_EMPTY_RANGES) 227 228 #define RE_SYNTAX_POSIX_BASIC \ 229 (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM) 230 231 /* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes 232 RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this 233 isn't minimal, since other operators, such as \`, aren't disabled. */ 234 #define RE_SYNTAX_POSIX_MINIMAL_BASIC \ 235 (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS) 236 237 #define RE_SYNTAX_POSIX_EXTENDED \ 238 (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ 239 | RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \ 240 | RE_NO_BK_PARENS | RE_NO_BK_VBAR \ 241 | RE_UNMATCHED_RIGHT_PAREN_ORD) 242 243 /* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS 244 replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added. */ 245 #define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \ 246 (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ 247 | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \ 248 | RE_NO_BK_PARENS | RE_NO_BK_REFS \ 249 | RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD) 250 /* [[[end syntaxes]]] */ 251 252 /* Maximum number of duplicates an interval can allow. Some systems 253 (erroneously) define this in other header files, but we want our 254 value, so remove any previous define. */ 255 #ifdef RE_DUP_MAX 256 #undef RE_DUP_MAX 257 #endif 258 /* If sizeof(int) == 2, then ((1 << 15) - 1) overflows. */ 259 #define RE_DUP_MAX (0x7fff) 260 261 262 /* POSIX `cflags' bits (i.e., information for `regcomp'). */ 263 264 /* If this bit is set, then use extended regular expression syntax. 265 If not set, then use basic regular expression syntax. */ 266 #define REG_EXTENDED 1 267 268 /* If this bit is set, then ignore case when matching. 269 If not set, then case is significant. */ 270 #define REG_ICASE (REG_EXTENDED << 1) 271 272 /* If this bit is set, then anchors do not match at newline 273 characters in the string. 274 If not set, then anchors do match at newlines. */ 275 #define REG_NEWLINE (REG_ICASE << 1) 276 277 /* If this bit is set, then report only success or fail in regexec. 278 If not set, then returns differ between not matching and errors. */ 279 #define REG_NOSUB (REG_NEWLINE << 1) 280 281 282 /* POSIX `eflags' bits (i.e., information for regexec). */ 283 284 /* If this bit is set, then the beginning-of-line operator doesn't match 285 the beginning of the string (presumably because it's not the 286 beginning of a line). 287 If not set, then the beginning-of-line operator does match the 288 beginning of the string. */ 289 #define REG_NOTBOL 1 290 291 /* Like REG_NOTBOL, except for the end-of-line. */ 292 #define REG_NOTEOL (1 << 1) 293 294 295 /* If any error codes are removed, changed, or added, update the 296 `re_error_msg' table in regex.c. */ 297 typedef enum 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 unsigned can_be_null : 1; 370 371 /* If REGS_UNALLOCATED, allocate space in the `regs' structure 372 for `max (RE_NREGS, re_nsub + 1)' groups. 373 If REGS_REALLOCATE, reallocate space if necessary. 374 If REGS_FIXED, use what's there. */ 375 #define REGS_UNALLOCATED 0 376 #define REGS_REALLOCATE 1 377 #define REGS_FIXED 2 378 unsigned regs_allocated : 2; 379 380 /* Set to zero when `regex_compile' compiles a pattern; set to one 381 by `re_compile_fastmap' if it updates the fastmap. */ 382 unsigned fastmap_accurate : 1; 383 384 /* If set, `re_match_2' does not return information about 385 subexpressions. */ 386 unsigned no_sub : 1; 387 388 /* If set, a beginning-of-line anchor doesn't match at the 389 beginning of the string. */ 390 unsigned not_bol : 1; 391 392 /* Similarly for an end-of-line anchor. */ 393 unsigned not_eol : 1; 394 395 /* If true, an anchor at a newline matches. */ 396 unsigned newline_anchor : 1; 397 398 /* [[[end pattern_buffer]]] */ 399 }; 400 401 typedef struct re_pattern_buffer regex_t; 402 403 /* Type for byte offsets within the string. POSIX mandates this. */ 404 typedef int regoff_t; 405 406 407 /* This is the structure we store register match data in. See 408 regex.texinfo for a full description of what registers match. */ 409 struct re_registers 410 { 411 unsigned num_regs; 412 regoff_t *start; 413 regoff_t *end; 414 }; 415 416 417 /* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer, 418 `re_match_2' returns information about at least this many registers 419 the first time a `regs' structure is passed. */ 420 #ifndef RE_NREGS 421 #define RE_NREGS 30 422 #endif 423 424 425 /* POSIX specification for registers. Aside from the different names than 426 `re_registers', POSIX uses an array of structures, instead of a 427 structure of arrays. */ 428 typedef struct 429 { 430 regoff_t rm_so; /* Byte offset from string's start to substring's start. */ 431 regoff_t rm_eo; /* Byte offset from string's start to substring's end. */ 432 } regmatch_t; 433 434 /* Declarations for routines. */ 435 436 /* To avoid duplicating every routine declaration -- once with a 437 prototype (if we are ANSI), and once without (if we aren't) -- we 438 use the following macro to declare argument types. This 439 unfortunately clutters up the declarations a bit, but I think it's 440 worth it. */ 441 442 #if defined(__STDC__) || defined(_WIN32) 443 #define _RE_ARGS(args) args 444 445 #else /* not __STDC__ */ 446 447 #define _RE_ARGS(args) () 448 449 #endif /* not __STDC__ */ 450 451 /* Sets the current default syntax to SYNTAX, and return the old syntax. 452 You can also simply assign to the `re_syntax_options' variable. */ 453 extern reg_syntax_t re_set_syntax _RE_ARGS ((reg_syntax_t syntax)); 454 455 /* Compile the regular expression PATTERN, with length LENGTH 456 and syntax given by the global `re_syntax_options', into the buffer 457 BUFFER. Return NULL if successful, and an error string if not. */ 458 extern const char *re_compile_pattern 459 _RE_ARGS ((const char *pattern, size_t length, 460 struct re_pattern_buffer *buffer)); 461 462 463 /* Compile a fastmap for the compiled pattern in BUFFER; used to 464 accelerate searches. Return 0 if successful and -2 if was an 465 internal error. */ 466 extern int re_compile_fastmap _RE_ARGS ((struct re_pattern_buffer *buffer)); 467 468 469 /* Search in the string STRING (with length LENGTH) for the pattern 470 compiled into BUFFER. Start searching at position START, for RANGE 471 characters. Return the starting position of the match, -1 for no 472 match, or -2 for an internal error. Also return register 473 information in REGS (if REGS and BUFFER->no_sub are nonzero). */ 474 extern int re_search 475 _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string, 476 int length, int start, int range, struct re_registers *regs)); 477 478 479 /* Like `re_search', but search in the concatenation of STRING1 and 480 STRING2. Also, stop searching at index START + STOP. */ 481 extern int re_search_2 482 _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1, 483 int length1, const char *string2, int length2, 484 int start, int range, struct re_registers *regs, int stop)); 485 486 487 /* Like `re_search', but return how many characters in STRING the regexp 488 in BUFFER matched, starting at position START. */ 489 extern int re_match 490 _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string, 491 int length, int start, struct re_registers *regs)); 492 493 494 /* Relates to `re_match' as `re_search_2' relates to `re_search'. */ 495 extern int re_match_2 496 _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1, 497 int length1, const char *string2, int length2, 498 int start, struct re_registers *regs, int stop)); 499 500 501 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and 502 ENDS. Subsequent matches using BUFFER and REGS will use this memory 503 for recording register information. STARTS and ENDS must be 504 allocated with malloc, and must each be at least `NUM_REGS * sizeof 505 (regoff_t)' bytes long. 506 507 If NUM_REGS == 0, then subsequent matches should allocate their own 508 register data. 509 510 Unless this function is called, the first search or match using 511 PATTERN_BUFFER will allocate its own register data, without 512 freeing the old data. */ 513 extern void re_set_registers 514 _RE_ARGS ((struct re_pattern_buffer *buffer, struct re_registers *regs, 515 unsigned num_regs, regoff_t *starts, regoff_t *ends)); 516 517 #ifdef _REGEX_RE_COMP 518 #ifndef _CRAY 519 /* 4.2 bsd compatibility. */ 520 extern char *re_comp _RE_ARGS ((const char *)); 521 extern int re_exec _RE_ARGS ((const char *)); 522 #endif 523 #endif 524 525 /* POSIX compatibility. */ 526 int regcomp _RE_ARGS ((regex_t *preg, const char *pattern, int cflags)); 527 int regexec 528 _RE_ARGS ((const regex_t *preg, const char *string, size_t nmatch, 529 regmatch_t pmatch[], int eflags)); 530 size_t regerror 531 _RE_ARGS ((int errcode, const regex_t *preg, char *errbuf, 532 size_t errbuf_size)); 533 void regfree _RE_ARGS ((regex_t *preg)); 534 535 536 #ifdef __cplusplus 537 } 538 #endif /* C++ */ 539 540 #endif /* not __REGEXP_LIBRARY_H__ */ 541 542 /* 543 Local variables: 544 make-backup-files: t 545 version-control: t 546 trim-versions-without-asking: nil 547 End: 548 */ 549