| 1 |
207 |
jeremybenn |
/*-
|
| 2 |
|
|
* Copyright (c) 1992, 1993, 1994 Henry Spencer.
|
| 3 |
|
|
* Copyright (c) 1992, 1993, 1994
|
| 4 |
|
|
* The Regents of the University of California. All rights reserved.
|
| 5 |
|
|
*
|
| 6 |
|
|
* This code is derived from software contributed to Berkeley by
|
| 7 |
|
|
* Henry Spencer.
|
| 8 |
|
|
*
|
| 9 |
|
|
* Redistribution and use in source and binary forms, with or without
|
| 10 |
|
|
* modification, are permitted provided that the following conditions
|
| 11 |
|
|
* are met:
|
| 12 |
|
|
* 1. Redistributions of source code must retain the above copyright
|
| 13 |
|
|
* notice, this list of conditions and the following disclaimer.
|
| 14 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
| 15 |
|
|
* notice, this list of conditions and the following disclaimer in the
|
| 16 |
|
|
* documentation and/or other materials provided with the distribution.
|
| 17 |
|
|
* 3. All advertising materials mentioning features or use of this software
|
| 18 |
|
|
* must display the following acknowledgement:
|
| 19 |
|
|
* This product includes software developed by the University of
|
| 20 |
|
|
* California, Berkeley and its contributors.
|
| 21 |
|
|
* 4. Neither the name of the University nor the names of its contributors
|
| 22 |
|
|
* may be used to endorse or promote products derived from this software
|
| 23 |
|
|
* without specific prior written permission.
|
| 24 |
|
|
*
|
| 25 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
| 26 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 27 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 28 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
| 29 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 30 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
| 31 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
| 32 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
| 33 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
| 34 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
| 35 |
|
|
* SUCH DAMAGE.
|
| 36 |
|
|
*
|
| 37 |
|
|
* @(#)regex2.h 8.4 (Berkeley) 3/20/94
|
| 38 |
|
|
* $FreeBSD: src/lib/libc/regex/regex2.h,v 1.6 2002/03/22 23:41:56 obrien Exp $
|
| 39 |
|
|
*/
|
| 40 |
|
|
|
| 41 |
|
|
/*
|
| 42 |
|
|
* First, the stuff that ends up in the outside-world include file
|
| 43 |
|
|
= typedef off_t regoff_t;
|
| 44 |
|
|
= typedef struct {
|
| 45 |
|
|
= int re_magic;
|
| 46 |
|
|
= size_t re_nsub; // number of parenthesized subexpressions
|
| 47 |
|
|
= const char *re_endp; // end pointer for REG_PEND
|
| 48 |
|
|
= struct re_guts *re_g; // none of your business :-)
|
| 49 |
|
|
= } regex_t;
|
| 50 |
|
|
= typedef struct {
|
| 51 |
|
|
= regoff_t rm_so; // start of match
|
| 52 |
|
|
= regoff_t rm_eo; // end of match
|
| 53 |
|
|
= } regmatch_t;
|
| 54 |
|
|
*/
|
| 55 |
|
|
/*
|
| 56 |
|
|
* internals of regex_t
|
| 57 |
|
|
*/
|
| 58 |
|
|
#define MAGIC1 ((('r'^0200)<<8) | 'e')
|
| 59 |
|
|
|
| 60 |
|
|
/*
|
| 61 |
|
|
* The internal representation is a *strip*, a sequence of
|
| 62 |
|
|
* operators ending with an endmarker. (Some terminology etc. is a
|
| 63 |
|
|
* historical relic of earlier versions which used multiple strips.)
|
| 64 |
|
|
* Certain oddities in the representation are there to permit running
|
| 65 |
|
|
* the machinery backwards; in particular, any deviation from sequential
|
| 66 |
|
|
* flow must be marked at both its source and its destination. Some
|
| 67 |
|
|
* fine points:
|
| 68 |
|
|
*
|
| 69 |
|
|
* - OPLUS_ and O_PLUS are *inside* the loop they create.
|
| 70 |
|
|
* - OQUEST_ and O_QUEST are *outside* the bypass they create.
|
| 71 |
|
|
* - OCH_ and O_CH are *outside* the multi-way branch they create, while
|
| 72 |
|
|
* OOR1 and OOR2 are respectively the end and the beginning of one of
|
| 73 |
|
|
* the branches. Note that there is an implicit OOR2 following OCH_
|
| 74 |
|
|
* and an implicit OOR1 preceding O_CH.
|
| 75 |
|
|
*
|
| 76 |
|
|
* In state representations, an operator's bit is on to signify a state
|
| 77 |
|
|
* immediately *preceding* "execution" of that operator.
|
| 78 |
|
|
*/
|
| 79 |
|
|
typedef unsigned long sop; /* strip operator */
|
| 80 |
|
|
typedef long sopno;
|
| 81 |
|
|
#define OPRMASK 0xf8000000L
|
| 82 |
|
|
#define OPDMASK 0x07ffffffL
|
| 83 |
|
|
#define OPSHIFT ((unsigned)27)
|
| 84 |
|
|
#define OP(n) ((n)&OPRMASK)
|
| 85 |
|
|
#define OPND(n) ((n)&OPDMASK)
|
| 86 |
|
|
#define SOP(op, opnd) ((op)|(opnd))
|
| 87 |
|
|
/* operators meaning operand */
|
| 88 |
|
|
/* (back, fwd are offsets) */
|
| 89 |
|
|
#define OEND (1L<<OPSHIFT) /* endmarker - */
|
| 90 |
|
|
#define OCHAR (2L<<OPSHIFT) /* character unsigned char */
|
| 91 |
|
|
#define OBOL (3L<<OPSHIFT) /* left anchor - */
|
| 92 |
|
|
#define OEOL (4L<<OPSHIFT) /* right anchor - */
|
| 93 |
|
|
#define OANY (5L<<OPSHIFT) /* . - */
|
| 94 |
|
|
#define OANYOF (6L<<OPSHIFT) /* [...] set number */
|
| 95 |
|
|
#define OBACK_ (7L<<OPSHIFT) /* begin \d paren number */
|
| 96 |
|
|
#define O_BACK (8L<<OPSHIFT) /* end \d paren number */
|
| 97 |
|
|
#define OPLUS_ (9L<<OPSHIFT) /* + prefix fwd to suffix */
|
| 98 |
|
|
#define O_PLUS (10L<<OPSHIFT) /* + suffix back to prefix */
|
| 99 |
|
|
#define OQUEST_ (11L<<OPSHIFT) /* ? prefix fwd to suffix */
|
| 100 |
|
|
#define O_QUEST (12L<<OPSHIFT) /* ? suffix back to prefix */
|
| 101 |
|
|
#define OLPAREN (13L<<OPSHIFT) /* ( fwd to ) */
|
| 102 |
|
|
#define ORPAREN (14L<<OPSHIFT) /* ) back to ( */
|
| 103 |
|
|
#define OCH_ (15L<<OPSHIFT) /* begin choice fwd to OOR2 */
|
| 104 |
|
|
#define OOR1 (16L<<OPSHIFT) /* | pt. 1 back to OOR1 or OCH_ */
|
| 105 |
|
|
#define OOR2 (17L<<OPSHIFT) /* | pt. 2 fwd to OOR2 or O_CH */
|
| 106 |
|
|
#define O_CH (18L<<OPSHIFT) /* end choice back to OOR1 */
|
| 107 |
|
|
#define OBOW (19L<<OPSHIFT) /* begin word - */
|
| 108 |
|
|
#define OEOW (20L<<OPSHIFT) /* end word - */
|
| 109 |
|
|
|
| 110 |
|
|
/*
|
| 111 |
|
|
* Structure for [] character-set representation. Character sets are
|
| 112 |
|
|
* done as bit vectors, grouped 8 to a byte vector for compactness.
|
| 113 |
|
|
* The individual set therefore has both a pointer to the byte vector
|
| 114 |
|
|
* and a mask to pick out the relevant bit of each byte. A hash code
|
| 115 |
|
|
* simplifies testing whether two sets could be identical.
|
| 116 |
|
|
*
|
| 117 |
|
|
* This will get trickier for multicharacter collating elements. As
|
| 118 |
|
|
* preliminary hooks for dealing with such things, we also carry along
|
| 119 |
|
|
* a string of multi-character elements, and decide the size of the
|
| 120 |
|
|
* vectors at run time.
|
| 121 |
|
|
*/
|
| 122 |
|
|
typedef struct {
|
| 123 |
|
|
uch *ptr; /* -> uch [csetsize] */
|
| 124 |
|
|
uch mask; /* bit within array */
|
| 125 |
|
|
short hash; /* hash code */
|
| 126 |
|
|
size_t smultis;
|
| 127 |
|
|
char *multis; /* -> char[smulti] ab\0cd\0ef\0\0 */
|
| 128 |
|
|
} cset;
|
| 129 |
|
|
/* note that CHadd and CHsub are unsafe, and CHIN doesn't yield 0/1 */
|
| 130 |
|
|
#define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (uch)(c))
|
| 131 |
|
|
#define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (uch)(c))
|
| 132 |
|
|
#define CHIN(cs, c) ((cs)->ptr[(uch)(c)] & (cs)->mask)
|
| 133 |
|
|
#define MCadd(p, cs, cp) mcadd(p, cs, cp) /* regcomp() internal fns */
|
| 134 |
|
|
#define MCsub(p, cs, cp) mcsub(p, cs, cp)
|
| 135 |
|
|
#define MCin(p, cs, cp) mcin(p, cs, cp)
|
| 136 |
|
|
|
| 137 |
|
|
/* stuff for character categories */
|
| 138 |
|
|
typedef unsigned char cat_t;
|
| 139 |
|
|
|
| 140 |
|
|
/*
|
| 141 |
|
|
* main compiled-expression structure
|
| 142 |
|
|
*/
|
| 143 |
|
|
struct re_guts {
|
| 144 |
|
|
int magic;
|
| 145 |
|
|
# define MAGIC2 ((('R'^0200)<<8)|'E')
|
| 146 |
|
|
sop *strip; /* malloced area for strip */
|
| 147 |
|
|
int csetsize; /* number of bits in a cset vector */
|
| 148 |
|
|
int ncsets; /* number of csets in use */
|
| 149 |
|
|
cset *sets; /* -> cset [ncsets] */
|
| 150 |
|
|
uch *setbits; /* -> uch[csetsize][ncsets/CHAR_BIT] */
|
| 151 |
|
|
int cflags; /* copy of regcomp() cflags argument */
|
| 152 |
|
|
sopno nstates; /* = number of sops */
|
| 153 |
|
|
sopno firststate; /* the initial OEND (normally 0) */
|
| 154 |
|
|
sopno laststate; /* the final OEND */
|
| 155 |
|
|
int iflags; /* internal flags */
|
| 156 |
|
|
# define USEBOL 01 /* used ^ */
|
| 157 |
|
|
# define USEEOL 02 /* used $ */
|
| 158 |
|
|
# define BAD 04 /* something wrong */
|
| 159 |
|
|
int nbol; /* number of ^ used */
|
| 160 |
|
|
int neol; /* number of $ used */
|
| 161 |
|
|
int ncategories; /* how many character categories */
|
| 162 |
|
|
cat_t *categories; /* ->catspace[-CHAR_MIN] */
|
| 163 |
|
|
char *must; /* match must contain this string */
|
| 164 |
|
|
int moffset; /* latest point at which must may be located */
|
| 165 |
|
|
int *charjump; /* Boyer-Moore char jump table */
|
| 166 |
|
|
int *matchjump; /* Boyer-Moore match jump table */
|
| 167 |
|
|
int mlen; /* length of must */
|
| 168 |
|
|
size_t nsub; /* copy of re_nsub */
|
| 169 |
|
|
int backrefs; /* does it use back references? */
|
| 170 |
|
|
sopno nplus; /* how deep does it nest +s? */
|
| 171 |
|
|
/* catspace must be last */
|
| 172 |
|
|
cat_t catspace[1]; /* actually [NC] */
|
| 173 |
|
|
};
|
| 174 |
|
|
|
| 175 |
|
|
/* misc utilities */
|
| 176 |
|
|
#define OUT (CHAR_MAX+1) /* a non-character value */
|
| 177 |
|
|
#define ISWORD(c) (isalnum((uch)(c)) || (c) == '_')
|
