OpenCores
URL https://opencores.org/ocsvn/or1k/or1k/trunk

Subversion Repositories or1k

[/] [or1k/] [trunk/] [gdb-5.0/] [gdb/] [gnu-regex.h] - Blame information for rev 1765

Details | Compare with Previous | View Log

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

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.