+++ /dev/null
-#ifndef REGEX2_H
-#define REGEX2_H
-
-/*
- * First, the stuff that ends up in the outside-world include file
- = typedef off_t regoff_t;
- = typedef struct {
- = int re_magic;
- = size_t re_nsub; // number of parenthesized subexpressions
- = const char *re_endp; // end pointer for REG_PEND
- = struct re_guts *re_g; // none of your business :-)
- = } regex_t;
- = typedef struct {
- = regoff_t rm_so; // start of match
- = regoff_t rm_eo; // end of match
- = } regmatch_t;
- */
-/*
- * internals of regex_t
- */
-#define MAGIC1 ((('r'^0200)<<8) | 'e')
-
-/*
- * The internal representation is a *strip*, a sequence of
- * operators ending with an endmarker. (Some terminology etc. is a
- * historical relic of earlier versions which used multiple strips.)
- * Certain oddities in the representation are there to permit running
- * the machinery backwards; in particular, any deviation from sequential
- * flow must be marked at both its source and its destination. Some
- * fine points:
- *
- * - OPLUS_ and O_PLUS are *inside* the loop they create.
- * - OQUEST_ and O_QUEST are *outside* the bypass they create.
- * - OCH_ and O_CH are *outside* the multi-way branch they create, while
- * OOR1 and OOR2 are respectively the end and the beginning of one of
- * the branches. Note that there is an implicit OOR2 following OCH_
- * and an implicit OOR1 preceding O_CH.
- *
- * In state representations, an operator's bit is on to signify a state
- * immediately *preceding* "execution" of that operator.
- */
-typedef unsigned long sop; /* strip operator */
-typedef unsigned long sopno;
-#define OPRMASK 0xf8000000
-#define OPDMASK 0x07ffffff
-#define OPSHIFT ((unsigned)27)
-#define OP(n) ((n)&OPRMASK)
-#define OPND(n) ((n)&OPDMASK)
-#define SOP(op, opnd) ((op)|(opnd))
-
-#ifndef UNSIGNEDLONG1
-#ifndef NO_UL_CNSTS
-#define UNSIGNEDLONG1 1ul
-#else
-#define UNSIGNEDLONG1 ((unsigned long)1)
-#endif
-#endif
-
-#define MAKE_UNSIGNED_LONG(num) (UNSIGNEDLONG1*num)
-#define SHIFTED_UL(num) (MAKE_UNSIGNED_LONG(num) << OPSHIFT)
-
-/* operators meaning operand */
-/* (back, fwd are offsets) */
-#define OEND (SHIFTED_UL(1)) /* endmarker - */
-#define OCHAR (SHIFTED_UL(2)) /* character unsigned char */
-#define OBOL (SHIFTED_UL(3)) /* left anchor - */
-#define OEOL (SHIFTED_UL(4)) /* right anchor - */
-#define OANY (SHIFTED_UL(5)) /* . - */
-#define OANYOF (SHIFTED_UL(6)) /* [...] set number */
-#define OBACK_ (SHIFTED_UL(7)) /* begin \d paren number */
-#define O_BACK (SHIFTED_UL(8)) /* end \d paren number */
-#define OPLUS_ (SHIFTED_UL(9)) /* + prefix fwd to suffix */
-#define O_PLUS (SHIFTED_UL(10)) /* + suffix back to prefix */
-#define OQUEST_ (SHIFTED_UL(11)) /* ? prefix fwd to suffix */
-#define O_QUEST (SHIFTED_UL(12)) /* ? suffix back to prefix */
-#define OLPAREN (SHIFTED_UL(13)) /* ( fwd to ) */
-#define ORPAREN (SHIFTED_UL(14)) /* ) back to ( */
-#define OCH_ (SHIFTED_UL(15)) /* begin choice fwd to OOR2 */
-#define OOR1 (SHIFTED_UL(16)) /* | pt. 1 back to OOR1 or OCH_ */
-#define OOR2 (SHIFTED_UL(17)) /* | pt. 2 fwd to OOR2 or O_CH */
-#define O_CH (SHIFTED_UL(18)) /* end choice back to OOR1 */
-#define OBOW (SHIFTED_UL(19)) /* begin word - */
-#define OEOW (SHIFTED_UL(20)) /* end word - */
-
-/*
- * Structure for [] character-set representation. Character sets are
- * done as bit vectors, grouped 8 to a byte vector for compactness.
- * The individual set therefore has both a pointer to the byte vector
- * and a mask to pick out the relevant bit of each byte. A hash code
- * simplifies testing whether two sets could be identical.
- *
- * This will get trickier for multicharacter collating elements. As
- * preliminary hooks for dealing with such things, we also carry along
- * a string of multi-character elements, and decide the size of the
- * vectors at run time.
- */
-typedef struct {
- uch *ptr; /* -> uch [csetsize] */
- uch mask; /* bit within array */
- uch hash; /* hash code */
- size_t smultis;
- char *multis; /* -> char[smulti] ab\0cd\0ef\0\0 */
-} cset;
-/* note that CHadd and CHsub are unsafe, and CHIN doesn't yield 0/1 */
-#define CHadd(cs, c) do { \
- (cs)->ptr[(uch)(c)] = (uch)((cs)->ptr[(uch)(c)] | (cs)->mask); \
- (cs)->hash = (uch)((cs)->hash + (c)); \
-} while (0)
-
-#define CHsub(cs, c) do { \
- (cs)->ptr[(uch)(c)] = (uch)((cs)->ptr[(uch)(c)] & ~(cs)->mask); \
- (cs)->hash = (uch)((cs)->hash - (c)); \
-} while (0)
-
-#define CHIN(cs, c) ((cs)->ptr[(uch)(c)] & (cs)->mask)
-#define MCadd(p, cs, cp) mcadd(p, cs, cp) /* regcomp() internal fns */
-#define MCsub(p, cs, cp) mcsub(p, cs, cp)
-#define MCin(p, cs, cp) mcin(p, cs, cp)
-
-/* stuff for character categories */
-typedef unsigned char cat_t;
-
-/*
- * main compiled-expression structure
- */
-struct re_guts {
- int magic;
-# define MAGIC2 ((('R'^0200)<<8)|'E')
- sop *strip; /* malloced area for strip */
- int csetsize; /* number of bits in a cset vector */
- int ncsets; /* number of csets in use */
- cset *sets; /* -> cset [ncsets] */
- uch *setbits; /* -> uch[csetsize][ncsets/CHAR_BIT] */
- int cflags; /* copy of regcomp() cflags argument */
- sopno nstates; /* = number of sops */
- sopno firststate; /* the initial OEND (normally 0) */
- sopno laststate; /* the final OEND */
- int iflags; /* internal flags */
-# define USEBOL 01 /* used ^ */
-# define USEEOL 02 /* used $ */
-# define BAD 04 /* something wrong */
- int nbol; /* number of ^ used */
- int neol; /* number of $ used */
- int ncategories; /* how many character categories */
- cat_t *categories; /* ->catspace[-CHAR_MIN] */
- char *must; /* match must contain this string */
- sopno mlen; /* length of must */
- size_t nsub; /* copy of re_nsub */
- int backrefs; /* does it use back references? */
- sopno nplus; /* how deep does it nest +s? */
- /* catspace must be last */
- cat_t catspace[1]; /* actually [NC] */
-};
-
-/* misc utilities */
-#define OUT (CHAR_MAX+1) /* a non-character value */
-#define ISWORD(c) (isalnum(c) || (c) == '_')
-
-#endif /* !REGEX2_H */
projects / debian / amanda / blobdiff