[apple/libc.git] / regex / FreeBSD / regexec.c

/*-
 * Copyright (c) 1992, 1993, 1994 Henry Spencer.
 * Copyright (c) 1992, 1993, 1994
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Henry Spencer.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)regexec.c	8.3 (Berkeley) 3/20/94
 */

#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)regexec.c	8.3 (Berkeley) 3/20/94";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD: src/lib/libc/regex/regexec.c,v 1.6 2004/07/12 07:35:59 tjr Exp $");

/*
 * the outer shell of regexec()
 *
 * This file includes engine.c three times, after muchos fiddling with the
 * macros that code uses.  This lets the same code operate on two different
 * representations for state sets and characters.
 */
#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <ctype.h>
#include <regex.h>
#include <wchar.h>
#include <wctype.h>

#include "utils.h"
#include "regex2.h"

static int nope __unused = 0;	/* for use in asserts; shuts lint up */

static __inline size_t
xmbrtowc(wi, s, n, mbs, dummy)
wint_t *wi;
const char *s;
size_t n;
mbstate_t *mbs;
wint_t dummy;
{
	size_t nr;
	wchar_t wc;

	nr = mbrtowc(&wc, s, n, mbs);
	if (wi != NULL)
		*wi = wc;
	if (nr == 0)
		return (1);
	else if (nr == (size_t)-1 || nr == (size_t)-2) {
		memset(mbs, 0, sizeof(*mbs));
		if (wi != NULL)
			*wi = dummy;
		return (1);
	} else
                return (nr);
}

static __inline size_t
xmbrtowc_dummy(wi, s, n, mbs, dummy)
wint_t *wi;
const char *s;
size_t n __unused;
mbstate_t *mbs __unused;
wint_t dummy __unused;
{

	if (wi != NULL)
		*wi = (unsigned char)*s;
	return (1);
}

/* macros for manipulating states, small version */
#define	states	long
#define	states1	states		/* for later use in regexec() decision */
#define	CLEAR(v)	((v) = 0)
#define	SET0(v, n)	((v) &= ~((unsigned long)1 << (n)))
#define	SET1(v, n)	((v) |= (unsigned long)1 << (n))
#define	ISSET(v, n)	(((v) & ((unsigned long)1 << (n))) != 0)
#define	ASSIGN(d, s)	((d) = (s))
#define	EQ(a, b)	((a) == (b))
#define	STATEVARS	long dummy	/* dummy version */
#define	STATESETUP(m, n)	/* nothing */
#define	STATETEARDOWN(m)	/* nothing */
#define	SETUP(v)	((v) = 0)
#define	onestate	long
#define	INIT(o, n)	((o) = (unsigned long)1 << (n))
#define	INC(o)	((o) <<= 1)
#define	ISSTATEIN(v, o)	(((v) & (o)) != 0)
/* 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 long)(src)&(here)) << (n))
#define	BACK(dst, src, n)	((dst) |= ((unsigned long)(src)&(here)) >> (n))
#define	ISSETBACK(v, n)	(((v) & ((unsigned long)here >> (n))) != 0)
/* no multibyte support */
#define	XMBRTOWC	xmbrtowc_dummy
#define	ZAPSTATE(mbs)	((void)(mbs))
/* function names */
#define SNAMES			/* engine.c looks after details */

#include "engine.c"

/* now undo things */
#undef	states
#undef	CLEAR
#undef	SET0
#undef	SET1
#undef	ISSET
#undef	ASSIGN
#undef	EQ
#undef	STATEVARS
#undef	STATESETUP
#undef	STATETEARDOWN
#undef	SETUP
#undef	onestate
#undef	INIT
#undef	INC
#undef	ISSTATEIN
#undef	FWD
#undef	BACK
#undef	ISSETBACK
#undef	SNAMES
#undef	XMBRTOWC
#undef	ZAPSTATE

/* macros for manipulating states, large version */
#define	states	char *
#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	long vn; char *space
#define	STATESETUP(m, nv)	{ (m)->space = malloc((nv)*(m)->g->nstates); \
				if ((m)->space == NULL) return(REG_ESPACE); \
				(m)->vn = 0; }
#define	STATETEARDOWN(m)	{ free((m)->space); }
#define	SETUP(v)	((v) = &m->space[m->vn++ * m->g->nstates])
#define	onestate	long
#define	INIT(o, n)	((o) = (n))
#define	INC(o)	((o)++)
#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)])
/* no multibyte support */
#define	XMBRTOWC	xmbrtowc_dummy
#define	ZAPSTATE(mbs)	((void)(mbs))
/* function names */
#define	LNAMES			/* flag */

#include "engine.c"

/* multibyte character & large states version */
#undef	LNAMES
#undef	XMBRTOWC
#undef	ZAPSTATE
#define	XMBRTOWC	xmbrtowc
#define	ZAPSTATE(mbs)	memset((mbs), 0, sizeof(*(mbs)))
#define	MNAMES

#include "engine.c"

/*
 - regexec - interface for matching
 = extern int regexec(const regex_t *, const char *, size_t, \
 =					regmatch_t [], int);
 = #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
 * have been prototyped.
 */
int				/* 0 success, REG_NOMATCH failure */
regexec(preg, string, nmatch, pmatch, eflags)
const regex_t * __restrict preg;
const char * __restrict string;
size_t nmatch;
regmatch_t pmatch[__restrict];
int eflags;
{
	struct re_guts *g = preg->re_g;
#ifdef REDEBUG
#	define	GOODFLAGS(f)	(f)
#else
#	define	GOODFLAGS(f)	((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND))
#endif

	if (preg->re_magic != MAGIC1 || g->magic != MAGIC2)
		return(REG_BADPAT);
	assert(!(g->iflags&BAD));
	if (g->iflags&BAD)		/* backstop for no-debug case */
		return(REG_BADPAT);
	eflags = GOODFLAGS(eflags);

	if (MB_CUR_MAX > 1)
		return(mmatcher(g, (char *)string, nmatch, pmatch, eflags));
	else if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags&REG_LARGE))
		return(smatcher(g, (char *)string, nmatch, pmatch, eflags));
	else
		return(lmatcher(g, (char *)string, nmatch, pmatch, eflags));
}
Commit	Line	Data
9385eb3d A	1	/*-
9385eb3d A	2	* Copyright (c) 1992, 1993, 1994 Henry Spencer.
e9ce8d39 A	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.
9385eb3d A	36	*
9385eb3d A	37	* @(#)regexec.c 8.3 (Berkeley) 3/20/94
e9ce8d39 A	38	*/
e9ce8d39 A	39
9385eb3d A	40	#if defined(LIBC_SCCS) && !defined(lint)
	41	static char sccsid[] = "@(#)regexec.c 8.3 (Berkeley) 3/20/94";
	42	#endif /* LIBC_SCCS and not lint */
	43	#include <sys/cdefs.h>
3d9156a7	44	__FBSDID("$FreeBSD: src/lib/libc/regex/regexec.c,v 1.6 2004/07/12 07:35:59 tjr Exp $");
9385eb3d	45
e9ce8d39 A	46	/*
	47	* the outer shell of regexec()
	48	*
3d9156a7	49	* This file includes engine.c three times, after muchos fiddling with the
e9ce8d39	50	* macros that code uses. This lets the same code operate on two different
3d9156a7	51	* representations for state sets and characters.
e9ce8d39 A	52	*/
	53	#include <sys/types.h>
	54	#include <stdio.h>
	55	#include <stdlib.h>
	56	#include <string.h>
	57	#include <limits.h>
	58	#include <ctype.h>
	59	#include <regex.h>
3d9156a7 A	60	#include <wchar.h>
3d9156a7 A	61	#include <wctype.h>
e9ce8d39 A	62
	63	#include "utils.h"
	64	#include "regex2.h"
	65
9385eb3d	66	static int nope __unused = 0; /* for use in asserts; shuts lint up */
e9ce8d39	67
3d9156a7 A	68	static __inline size_t
	69	xmbrtowc(wi, s, n, mbs, dummy)
	70	wint_t *wi;
	71	const char *s;
	72	size_t n;
	73	mbstate_t *mbs;
	74	wint_t dummy;
	75	{
	76	size_t nr;
	77	wchar_t wc;
	78
	79	nr = mbrtowc(&wc, s, n, mbs);
	80	if (wi != NULL)
	81	*wi = wc;
	82	if (nr == 0)
	83	return (1);
	84	else if (nr == (size_t)-1 \|\| nr == (size_t)-2) {
	85	memset(mbs, 0, sizeof(*mbs));
	86	if (wi != NULL)
	87	*wi = dummy;
	88	return (1);
	89	} else
	90	return (nr);
	91	}
	92
	93	static __inline size_t
	94	xmbrtowc_dummy(wi, s, n, mbs, dummy)
	95	wint_t *wi;
	96	const char *s;
	97	size_t n __unused;
	98	mbstate_t *mbs __unused;
	99	wint_t dummy __unused;
	100	{
	101
	102	if (wi != NULL)
	103	wi = (unsigned char)s;
	104	return (1);
	105	}
	106
e9ce8d39 A	107	/* macros for manipulating states, small version */
	108	#define states long
	109	#define states1 states /* for later use in regexec() decision */
	110	#define CLEAR(v) ((v) = 0)
9385eb3d A	111	#define SET0(v, n) ((v) &= ~((unsigned long)1 << (n)))
	112	#define SET1(v, n) ((v) \|= (unsigned long)1 << (n))
	113	#define ISSET(v, n) (((v) & ((unsigned long)1 << (n))) != 0)
e9ce8d39 A	114	#define ASSIGN(d, s) ((d) = (s))
e9ce8d39 A	115	#define EQ(a, b) ((a) == (b))
9385eb3d	116	#define STATEVARS long dummy /* dummy version */
e9ce8d39 A	117	#define STATESETUP(m, n) /* nothing */
	118	#define STATETEARDOWN(m) /* nothing */
	119	#define SETUP(v) ((v) = 0)
9385eb3d A	120	#define onestate long
9385eb3d A	121	#define INIT(o, n) ((o) = (unsigned long)1 << (n))
e9ce8d39	122	#define INC(o) ((o) <<= 1)
9385eb3d	123	#define ISSTATEIN(v, o) (((v) & (o)) != 0)
e9ce8d39 A	124	/* some abbreviations; note that some of these know variable names! */
e9ce8d39 A	125	/* do "if I'm here, I can also be there" etc without branches */
9385eb3d A	126	#define FWD(dst, src, n) ((dst) \|= ((unsigned long)(src)&(here)) << (n))
	127	#define BACK(dst, src, n) ((dst) \|= ((unsigned long)(src)&(here)) >> (n))
	128	#define ISSETBACK(v, n) (((v) & ((unsigned long)here >> (n))) != 0)
3d9156a7 A	129	/* no multibyte support */
	130	#define XMBRTOWC xmbrtowc_dummy
	131	#define ZAPSTATE(mbs) ((void)(mbs))
e9ce8d39 A	132	/* function names */
	133	#define SNAMES /* engine.c looks after details */
	134
	135	#include "engine.c"
	136
	137	/* now undo things */
	138	#undef states
	139	#undef CLEAR
	140	#undef SET0
	141	#undef SET1
	142	#undef ISSET
	143	#undef ASSIGN
	144	#undef EQ
	145	#undef STATEVARS
	146	#undef STATESETUP
	147	#undef STATETEARDOWN
	148	#undef SETUP
	149	#undef onestate
	150	#undef INIT
	151	#undef INC
	152	#undef ISSTATEIN
	153	#undef FWD
	154	#undef BACK
	155	#undef ISSETBACK
	156	#undef SNAMES
3d9156a7 A	157	#undef XMBRTOWC
3d9156a7 A	158	#undef ZAPSTATE
e9ce8d39 A	159
	160	/* macros for manipulating states, large version */
	161	#define states char *
	162	#define CLEAR(v) memset(v, 0, m->g->nstates)
	163	#define SET0(v, n) ((v)[n] = 0)
	164	#define SET1(v, n) ((v)[n] = 1)
	165	#define ISSET(v, n) ((v)[n])
	166	#define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
	167	#define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
9385eb3d	168	#define STATEVARS long vn; char *space
e9ce8d39 A	169	#define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
	170	if ((m)->space == NULL) return(REG_ESPACE); \
	171	(m)->vn = 0; }
	172	#define STATETEARDOWN(m) { free((m)->space); }
	173	#define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
9385eb3d	174	#define onestate long
e9ce8d39 A	175	#define INIT(o, n) ((o) = (n))
	176	#define INC(o) ((o)++)
	177	#define ISSTATEIN(v, o) ((v)[o])
	178	/* some abbreviations; note that some of these know variable names! */
	179	/* do "if I'm here, I can also be there" etc without branches */
	180	#define FWD(dst, src, n) ((dst)[here+(n)] \|= (src)[here])
	181	#define BACK(dst, src, n) ((dst)[here-(n)] \|= (src)[here])
	182	#define ISSETBACK(v, n) ((v)[here - (n)])
3d9156a7 A	183	/* no multibyte support */
	184	#define XMBRTOWC xmbrtowc_dummy
	185	#define ZAPSTATE(mbs) ((void)(mbs))
e9ce8d39 A	186	/* function names */
	187	#define LNAMES /* flag */
	188
	189	#include "engine.c"
	190
3d9156a7 A	191	/* multibyte character & large states version */
	192	#undef LNAMES
	193	#undef XMBRTOWC
	194	#undef ZAPSTATE
	195	#define XMBRTOWC xmbrtowc
	196	#define ZAPSTATE(mbs) memset((mbs), 0, sizeof(*(mbs)))
	197	#define MNAMES
	198
	199	#include "engine.c"
	200
e9ce8d39 A	201	/*
	202	- regexec - interface for matching
	203	= extern int regexec(const regex_t , const char , size_t, \
	204	= regmatch_t [], int);
	205	= #define REG_NOTBOL 00001
	206	= #define REG_NOTEOL 00002
	207	= #define REG_STARTEND 00004
	208	= #define REG_TRACE 00400 // tracing of execution
	209	= #define REG_LARGE 01000 // force large representation
	210	= #define REG_BACKR 02000 // force use of backref code
	211	*
	212	* We put this here so we can exploit knowledge of the state representation
	213	* when choosing which matcher to call. Also, by this point the matchers
	214	* have been prototyped.
	215	*/
	216	int /* 0 success, REG_NOMATCH failure */
	217	regexec(preg, string, nmatch, pmatch, eflags)
9385eb3d A	218	const regex_t * __restrict preg;
9385eb3d A	219	const char * __restrict string;
e9ce8d39	220	size_t nmatch;
9385eb3d	221	regmatch_t pmatch[__restrict];
e9ce8d39 A	222	int eflags;
e9ce8d39 A	223	{
9385eb3d	224	struct re_guts *g = preg->re_g;
e9ce8d39 A	225	#ifdef REDEBUG
	226	# define GOODFLAGS(f) (f)
	227	#else
	228	# define GOODFLAGS(f) ((f)&(REG_NOTBOL\|REG_NOTEOL\|REG_STARTEND))
	229	#endif
	230
	231	if (preg->re_magic != MAGIC1 \|\| g->magic != MAGIC2)
	232	return(REG_BADPAT);
	233	assert(!(g->iflags&BAD));
	234	if (g->iflags&BAD) /* backstop for no-debug case */
	235	return(REG_BADPAT);
	236	eflags = GOODFLAGS(eflags);
	237
3d9156a7 A	238	if (MB_CUR_MAX > 1)
	239	return(mmatcher(g, (char *)string, nmatch, pmatch, eflags));
	240	else if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags&REG_LARGE))
e9ce8d39 A	241	return(smatcher(g, (char *)string, nmatch, pmatch, eflags));
	242	else
	243	return(lmatcher(g, (char *)string, nmatch, pmatch, eflags));
	244	}