1f0957ccaSPeter Wemm /* $NetBSD: regexec.c,v 1.4 2009/10/31 20:11:53 dsl Exp $ */
2f0957ccaSPeter Wemm
3f0957ccaSPeter Wemm /*-
4f0957ccaSPeter Wemm * Copyright (c) 1992, 1993, 1994 Henry Spencer.
5f0957ccaSPeter Wemm * Copyright (c) 1992, 1993, 1994
6f0957ccaSPeter Wemm * The Regents of the University of California. All rights reserved.
7f0957ccaSPeter Wemm *
8f0957ccaSPeter Wemm * This code is derived from software contributed to Berkeley by
9f0957ccaSPeter Wemm * Henry Spencer of the University of Toronto.
10f0957ccaSPeter Wemm *
11f0957ccaSPeter Wemm * Redistribution and use in source and binary forms, with or without
12f0957ccaSPeter Wemm * modification, are permitted provided that the following conditions
13f0957ccaSPeter Wemm * are met:
14f0957ccaSPeter Wemm * 1. Redistributions of source code must retain the above copyright
15f0957ccaSPeter Wemm * notice, this list of conditions and the following disclaimer.
16f0957ccaSPeter Wemm * 2. Redistributions in binary form must reproduce the above copyright
17f0957ccaSPeter Wemm * notice, this list of conditions and the following disclaimer in the
18f0957ccaSPeter Wemm * documentation and/or other materials provided with the distribution.
19c271fa92SBaptiste Daroussin * 3. Neither the name of the University nor the names of its contributors
20f0957ccaSPeter Wemm * may be used to endorse or promote products derived from this software
21f0957ccaSPeter Wemm * without specific prior written permission.
22f0957ccaSPeter Wemm *
23f0957ccaSPeter Wemm * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24f0957ccaSPeter Wemm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25f0957ccaSPeter Wemm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26f0957ccaSPeter Wemm * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27f0957ccaSPeter Wemm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28f0957ccaSPeter Wemm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29f0957ccaSPeter Wemm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30f0957ccaSPeter Wemm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31f0957ccaSPeter Wemm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32f0957ccaSPeter Wemm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33f0957ccaSPeter Wemm * SUCH DAMAGE.
34f0957ccaSPeter Wemm *
35f0957ccaSPeter Wemm * @(#)regexec.c 8.2 (Berkeley) 3/16/94
36f0957ccaSPeter Wemm */
37f0957ccaSPeter Wemm
38f0957ccaSPeter Wemm #if defined(LIBC_SCCS) && !defined(lint)
39f0957ccaSPeter Wemm static char sccsid[] = "@(#)regexec.c 8.2 (Berkeley) 3/16/94";
40f0957ccaSPeter Wemm #endif /* LIBC_SCCS and not lint */
41f0957ccaSPeter Wemm
42f0957ccaSPeter Wemm /*
43f0957ccaSPeter Wemm * the outer shell of regexec()
44f0957ccaSPeter Wemm *
45f0957ccaSPeter Wemm * This file includes engine.c *twice*, after muchos fiddling with the
46f0957ccaSPeter Wemm * macros that code uses. This lets the same code operate on two different
47f0957ccaSPeter Wemm * representations for state sets.
48f0957ccaSPeter Wemm */
49f0957ccaSPeter Wemm #include <sys/types.h>
50f0957ccaSPeter Wemm #include <stdio.h>
51f0957ccaSPeter Wemm #include <stdlib.h>
52f0957ccaSPeter Wemm #include <string.h>
53f0957ccaSPeter Wemm #include <limits.h>
54f0957ccaSPeter Wemm #include <ctype.h>
55f0957ccaSPeter Wemm #include <regex.h>
56f0957ccaSPeter Wemm
57f0957ccaSPeter Wemm #include "utils.h"
58f0957ccaSPeter Wemm #include "regex2.h"
59f0957ccaSPeter Wemm
60f0957ccaSPeter Wemm /* macros for manipulating states, small version */
61f0957ccaSPeter Wemm #define states int
62f0957ccaSPeter Wemm #define states1 int /* for later use in regexec() decision */
63f0957ccaSPeter Wemm #define CLEAR(v) ((v) = 0)
64f0957ccaSPeter Wemm #define SET0(v, n) ((v) &= ~(1 << (n)))
65f0957ccaSPeter Wemm #define SET1(v, n) ((v) |= 1 << (n))
66f0957ccaSPeter Wemm #define ISSET(v, n) ((v) & (1 << (n)))
67f0957ccaSPeter Wemm #define ASSIGN(d, s) ((d) = (s))
68f0957ccaSPeter Wemm #define EQ(a, b) ((a) == (b))
69f0957ccaSPeter Wemm #define STATEVARS int dummy /* dummy version */
70f0957ccaSPeter Wemm #define STATESETUP(m, n) /* nothing */
71f0957ccaSPeter Wemm #define STATETEARDOWN(m) /* nothing */
72f0957ccaSPeter Wemm #define SETUP(v) ((v) = 0)
73f0957ccaSPeter Wemm #define onestate int
74f0957ccaSPeter Wemm #define INIT(o, n) ((o) = (unsigned)1 << (n))
75f0957ccaSPeter Wemm #define INC(o) ((o) <<= 1)
76f0957ccaSPeter Wemm #define ISSTATEIN(v, o) ((v) & (o))
77f0957ccaSPeter Wemm /* some abbreviations; note that some of these know variable names! */
78f0957ccaSPeter Wemm /* do "if I'm here, I can also be there" etc without branches */
79f0957ccaSPeter Wemm #define FWD(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) << (n))
80f0957ccaSPeter Wemm #define BACK(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) >> (n))
81f0957ccaSPeter Wemm #define ISSETBACK(v, n) ((v) & ((unsigned)here >> (n)))
82f0957ccaSPeter Wemm /* function names */
83f0957ccaSPeter Wemm #define SNAMES /* engine.c looks after details */
84f0957ccaSPeter Wemm
85f0957ccaSPeter Wemm #include "engine.c"
86f0957ccaSPeter Wemm
87f0957ccaSPeter Wemm /* now undo things */
88f0957ccaSPeter Wemm #undef states
89f0957ccaSPeter Wemm #undef CLEAR
90f0957ccaSPeter Wemm #undef SET0
91f0957ccaSPeter Wemm #undef SET1
92f0957ccaSPeter Wemm #undef ISSET
93f0957ccaSPeter Wemm #undef ASSIGN
94f0957ccaSPeter Wemm #undef EQ
95f0957ccaSPeter Wemm #undef STATEVARS
96f0957ccaSPeter Wemm #undef STATESETUP
97f0957ccaSPeter Wemm #undef STATETEARDOWN
98f0957ccaSPeter Wemm #undef SETUP
99f0957ccaSPeter Wemm #undef onestate
100f0957ccaSPeter Wemm #undef INIT
101f0957ccaSPeter Wemm #undef INC
102f0957ccaSPeter Wemm #undef ISSTATEIN
103f0957ccaSPeter Wemm #undef FWD
104f0957ccaSPeter Wemm #undef BACK
105f0957ccaSPeter Wemm #undef ISSETBACK
106f0957ccaSPeter Wemm #undef SNAMES
107f0957ccaSPeter Wemm
108f0957ccaSPeter Wemm /* macros for manipulating states, large version */
109f0957ccaSPeter Wemm #define states char *
110f0957ccaSPeter Wemm #define CLEAR(v) memset(v, 0, m->g->nstates)
111f0957ccaSPeter Wemm #define SET0(v, n) ((v)[n] = 0)
112f0957ccaSPeter Wemm #define SET1(v, n) ((v)[n] = 1)
113f0957ccaSPeter Wemm #define ISSET(v, n) ((v)[n])
114f0957ccaSPeter Wemm #define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
115f0957ccaSPeter Wemm #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
116f0957ccaSPeter Wemm #define STATEVARS int vn; char *space
117*755cc40cSBaptiste Daroussin #define STATESETUP(m, nv) do { (m)->space = malloc((nv)*(m)->g->nstates); \
118f0957ccaSPeter Wemm if ((m)->space == NULL) return(REG_ESPACE); \
119*755cc40cSBaptiste Daroussin (m)->vn = 0; } while (0)
120*755cc40cSBaptiste Daroussin #define STATETEARDOWN(m) free((m)->space)
121f0957ccaSPeter Wemm #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
122f0957ccaSPeter Wemm #define onestate int
123f0957ccaSPeter Wemm #define INIT(o, n) ((o) = (n))
124f0957ccaSPeter Wemm #define INC(o) ((o)++)
125f0957ccaSPeter Wemm #define ISSTATEIN(v, o) ((v)[o])
126f0957ccaSPeter Wemm /* some abbreviations; note that some of these know variable names! */
127f0957ccaSPeter Wemm /* do "if I'm here, I can also be there" etc without branches */
128f0957ccaSPeter Wemm #define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here])
129f0957ccaSPeter Wemm #define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here])
130f0957ccaSPeter Wemm #define ISSETBACK(v, n) ((v)[here - (n)])
131f0957ccaSPeter Wemm /* function names */
132f0957ccaSPeter Wemm #define LNAMES /* flag */
133f0957ccaSPeter Wemm
134f0957ccaSPeter Wemm #include "engine.c"
135f0957ccaSPeter Wemm
136f0957ccaSPeter Wemm /*
137f0957ccaSPeter Wemm - regexec - interface for matching
138f0957ccaSPeter Wemm = extern int regexec(const regex_t *, const char *, size_t, \
139f0957ccaSPeter Wemm = regmatch_t [], int);
140f0957ccaSPeter Wemm = #define REG_NOTBOL 00001
141f0957ccaSPeter Wemm = #define REG_NOTEOL 00002
142f0957ccaSPeter Wemm = #define REG_STARTEND 00004
143f0957ccaSPeter Wemm = #define REG_TRACE 00400 // tracing of execution
144f0957ccaSPeter Wemm = #define REG_LARGE 01000 // force large representation
145f0957ccaSPeter Wemm = #define REG_BACKR 02000 // force use of backref code
146f0957ccaSPeter Wemm *
147f0957ccaSPeter Wemm * We put this here so we can exploit knowledge of the state representation
148f0957ccaSPeter Wemm * when choosing which matcher to call. Also, by this point the matchers
149f0957ccaSPeter Wemm * have been prototyped.
150f0957ccaSPeter Wemm */
151f0957ccaSPeter Wemm int /* 0 success, REG_NOMATCH failure */
regexec(const regex_t * preg,const RCHAR_T * string,size_t nmatch,regmatch_t * pmatch,int eflags)152c271fa92SBaptiste Daroussin regexec(const regex_t *preg, const RCHAR_T *string, size_t nmatch,
153c271fa92SBaptiste Daroussin regmatch_t *pmatch, int eflags)
154f0957ccaSPeter Wemm {
155c271fa92SBaptiste Daroussin struct re_guts *g = preg->re_g;
156f0957ccaSPeter Wemm #ifdef REDEBUG
157f0957ccaSPeter Wemm # define GOODFLAGS(f) (f)
158f0957ccaSPeter Wemm #else
159f0957ccaSPeter Wemm # define GOODFLAGS(f) ((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND))
160f0957ccaSPeter Wemm #endif
161f0957ccaSPeter Wemm
162f0957ccaSPeter Wemm if (preg->re_magic != MAGIC1 || g->magic != MAGIC2)
163f0957ccaSPeter Wemm return(REG_BADPAT);
164f0957ccaSPeter Wemm assert(!(g->iflags&BAD));
165f0957ccaSPeter Wemm if (g->iflags&BAD) /* backstop for no-debug case */
166f0957ccaSPeter Wemm return(REG_BADPAT);
167f0957ccaSPeter Wemm eflags = GOODFLAGS(eflags);
168f0957ccaSPeter Wemm
169f0957ccaSPeter Wemm if (g->nstates <= (int)(CHAR_BIT*sizeof(states1)) && !(eflags®_LARGE))
170f0957ccaSPeter Wemm return(smatcher(g, string, nmatch, pmatch, eflags));
171f0957ccaSPeter Wemm else
172f0957ccaSPeter Wemm return(lmatcher(g, string, nmatch, pmatch, eflags));
173f0957ccaSPeter Wemm }
174