30c99da306a497b23be7e95df9f8b6e6365d99f9
* Copyright (c) 1992 Henry Spencer.
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
* This code is derived from software contributed to Berkeley by
* Henry Spencer of the University of Toronto.
* %sccs.include.redist.c%
* @(#)regexec.c 8.1 (Berkeley) %G%
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid
[] = "@(#)regexec.c 8.1 (Berkeley) %G%";
#endif /* LIBC_SCCS and not lint */
* the outer shell of regexec()
* This file includes engine.c *twice*, after muchos fiddling with the
* macros that code uses. This lets the same code operate on two different
* representations for state sets.
static int nope
= 0; /* for use in asserts; shuts lint up */
/* macros for manipulating states, small version */
#define states1 states /* for later use in regexec() decision */
#define CLEAR(v) ((v) = 0)
#define SET0(v, n) ((v) &= ~(1 << (n)))
#define SET1(v, n) ((v) |= 1 << (n))
#define ISSET(v, n) ((v) & (1 << (n)))
#define ASSIGN(d, s) ((d) = (s))
#define EQ(a, b) ((a) == (b))
#define STATEVARS int dummy /* dummy version */
#define STATESETUP(m, n) /* nothing */
#define STATETEARDOWN(m) /* nothing */
#define SETUP(v) ((v) = 0)
#define INIT(o, n) ((o) = (unsigned)1 << (n))
#define INC(o) ((o) <<= 1)
#define ISSTATEIN(v, o) ((v) & (o))
/* some abbreviations; note that some of these know variable names! */
/* do "if I'm here, I can also be there" etc without branches */
#define FWD(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) << (n))
#define BACK(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) >> (n))
#define ISSETBACK(v, n) ((v) & ((unsigned)here >> (n)))
#define SNAMES /* engine.c looks after details */
/* macros for manipulating states, large version */
#define CLEAR(v) memset(v, 0, m->g->nstates)
#define SET0(v, n) ((v)[n] = 0)
#define SET1(v, n) ((v)[n] = 1)
#define ISSET(v, n) ((v)[n])
#define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
#define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
#define STATEVARS int vn; char *space
#define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
if ((m)->space == NULL) return(REG_ESPACE); \
#define STATETEARDOWN(m) { free((m)->space); }
#define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
#define INIT(o, n) ((o) = (n))
#define ISSTATEIN(v, o) ((v)[o])
/* some abbreviations; note that some of these know variable names! */
/* do "if I'm here, I can also be there" etc without branches */
#define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here])
#define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here])
#define ISSETBACK(v, n) ((v)[here - (n)])
#define LNAMES /* flag */
- regexec - interface for matching
= extern int regexec(const regex_t *preg, const char *string, size_t nmatch, \
= regmatch_t pmatch[], int eflags);
= #define REG_NOTBOL 00001
= #define REG_NOTEOL 00002
= #define REG_STARTEND 00004
= #define REG_TRACE 00400 // tracing of execution
= #define REG_LARGE 01000 // force large representation
= #define REG_BACKR 02000 // force use of backref code
* We put this here so we can exploit knowledge of the state representation
* when choosing which matcher to call. Also, by this point the matchers
int /* 0 success, REG_NOMATCH failure */
regexec(preg
, string
, nmatch
, pmatch
, eflags
)
register struct re_guts
*g
= preg
->re_g
;
# define GOODFLAGS(f) (f)
# define GOODFLAGS(f) ((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND))
if (preg
->re_magic
!= MAGIC1
|| g
->magic
!= MAGIC2
)
assert(!(g
->iflags
&BAD
));
if (g
->iflags
&BAD
) /* backstop for no-debug case */
if (eflags
!= GOODFLAGS(eflags
))
if (g
->nstates
<= CHAR_BIT
*sizeof(states1
) && !(eflags
®_LARGE
))
return(smatcher(g
, (char *)string
, nmatch
, pmatch
, eflags
));
return(lmatcher(g
, (char *)string
, nmatch
, pmatch
, eflags
));