#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)regcomp.c 8.5 (Berkeley) 3/20/94";
#endif
#include <sys/cdefs.h>
__FBSDID("$FreeBSD: src/lib/libc/regex/regcomp.c,v 1.36 2007/06/11 03:05:54 delphij Exp $");
#include "xlocale_private.h"
#include <sys/types.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <limits.h>
#include <stdlib.h>
#include <regex.h>
#include <runetype.h>
#include <wchar.h>
#include <wctype.h>
#include "collate.h"
#include "utils.h"
#include "regex2.h"
#include "cname.h"
struct parse {
char *next;
char *end;
int error;
sop *strip;
sopno ssize;
sopno slen;
int ncsalloc;
#if __DARWIN_UNIX03
int zerorepeats;
#endif
struct re_guts *g;
# define NPAREN 10
sopno pbegin[NPAREN];
sopno pend[NPAREN];
};
#ifdef __cplusplus
extern "C" {
#endif
static void p_ere(struct parse *p, wint_t stop);
static void p_ere_exp(struct parse *p);
static void p_str(struct parse *p);
static void p_bre(struct parse *p, wint_t end1, wint_t end2);
static int p_simp_re(struct parse *p, int starordinary);
static int p_count(struct parse *p);
static void p_bracket(struct parse *p);
static void p_b_term(struct parse *p, cset *cs);
static void p_b_cclass(struct parse *p, cset *cs);
static void p_b_eclass(struct parse *p, cset *cs);
static wint_t p_b_symbol(struct parse *p);
static wint_t p_b_coll_elem(struct parse *p, wint_t endc);
static wint_t othercase(wint_t ch, locale_t loc);
static void bothcases(struct parse *p, wint_t ch);
static void ordinary(struct parse *p, wint_t ch);
static void nonnewline(struct parse *p);
static void repeat(struct parse *p, sopno start, int from, int to);
static int seterr(struct parse *p, int e);
static cset *allocset(struct parse *p);
static void freeset(struct parse *p, cset *cs);
static void CHadd(struct parse *p, cset *cs, wint_t ch);
static void CHaddrange(struct parse *p, cset *cs, wint_t min, wint_t max);
static void CHaddtype(struct parse *p, cset *cs, wctype_t wct);
static wint_t singleton(cset *cs, locale_t loc);
static sopno dupl(struct parse *p, sopno start, sopno finish);
static void doemit(struct parse *p, sop op, size_t opnd);
static void doinsert(struct parse *p, sop op, size_t opnd, sopno pos);
static void dofwd(struct parse *p, sopno pos, sop value);
static void enlarge(struct parse *p, sopno size);
static void stripsnug(struct parse *p, struct re_guts *g);
static void findmust(struct parse *p, struct re_guts *g);
static int altoffset(sop *scan, int offset);
static void computejumps(struct parse *p, struct re_guts *g);
static void computematchjumps(struct parse *p, struct re_guts *g);
static sopno pluscount(struct parse *p, struct re_guts *g);
static wint_t wgetnext(struct parse *p);
#ifdef __cplusplus
}
#endif
static char nuls[10];
#define PEEK() (*p->next)
#define PEEK2() (*(p->next+1))
#define MORE() (p->next < p->end)
#define MORE2() (p->next+1 < p->end)
#define SEE(c) (MORE() && PEEK() == (c))
#define SEETWO(a, b) (MORE() && MORE2() && PEEK() == (a) && PEEK2() == (b))
#define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
#define EATTWO(a, b) ((SEETWO(a, b)) ? (NEXT2(), 1) : 0)
#define NEXT() (p->next++)
#define NEXT2() (p->next += 2)
#define NEXTn(n) (p->next += (n))
#define GETNEXT() (*p->next++)
#define WGETNEXT() wgetnext(p)
#define SETERROR(e) seterr(p, (e))
#define REQUIRE(co, e) ((co) || SETERROR(e))
#define MUSTSEE(c, e) (REQUIRE(MORE() && PEEK() == (c), e))
#define MUSTEAT(c, e) (REQUIRE(MORE() && GETNEXT() == (c), e))
#define MUSTNOTSEE(c, e) (REQUIRE(!MORE() || PEEK() != (c), e))
#define EMIT(op, sopnd) doemit(p, (sop)(op), (size_t)(sopnd))
#define INSERT(op, pos) doinsert(p, (sop)(op), HERE()-(pos)+1, pos)
#define AHEAD(pos) dofwd(p, pos, HERE()-(pos))
#define ASTERN(sop, pos) EMIT(sop, HERE()-pos)
#define HERE() (p->slen)
#define THERE() (p->slen - 1)
#define THERETHERE() (p->slen - 2)
#define DROP(n) (p->slen -= (n))
#ifndef NDEBUG
static int never = 0;
#else
#define never 0
#endif
#define MIN(a,b) ((a)<(b)?(a):(b))
int
regcomp(regex_t * __restrict preg,
const char * __restrict pattern,
int cflags)
{
struct parse pa;
struct re_guts *g;
struct parse *p = &pa;
int i;
size_t len;
#ifdef REDEBUG
# define GOODFLAGS(f) (f)
#else
# define GOODFLAGS(f) ((f)&~REG_DUMP)
#endif
cflags = GOODFLAGS(cflags);
if ((cflags®_EXTENDED) && (cflags®_NOSPEC))
return(REG_INVARG);
if (cflags®_PEND) {
if (preg->re_endp < pattern)
return(REG_INVARG);
len = preg->re_endp - pattern;
} else
len = strlen((char *)pattern);
g = (struct re_guts *)malloc(sizeof(struct re_guts));
if (g == NULL)
return(REG_ESPACE);
p->ssize = len/(size_t)2*(size_t)3 + (size_t)1;
p->strip = (sop *)malloc(p->ssize * sizeof(sop));
p->slen = 0;
if (p->strip == NULL) {
free((char *)g);
return(REG_ESPACE);
}
p->g = g;
p->next = (char *)pattern;
p->end = p->next + len;
p->error = 0;
p->ncsalloc = 0;
#if __DARWIN_UNIX03
p->zerorepeats = 0;
#endif
for (i = 0; i < NPAREN; i++) {
p->pbegin[i] = 0;
p->pend[i] = 0;
}
g->loc = __current_locale();
g->sets = NULL;
g->ncsets = 0;
g->cflags = cflags;
g->iflags = 0;
g->nbol = 0;
g->neol = 0;
g->must = NULL;
g->moffset = -1;
g->charjump = NULL;
g->matchjump = NULL;
g->mlen = 0;
g->nsub = 0;
g->backrefs = 0;
EMIT(OEND, 0);
g->firststate = THERE();
if (cflags®_EXTENDED)
p_ere(p, OUT);
else if (cflags®_NOSPEC)
p_str(p);
else
p_bre(p, OUT, OUT);
EMIT(OEND, 0);
g->laststate = THERE();
stripsnug(p, g);
findmust(p, g);
if(g->mlen > 3) {
computejumps(p, g);
computematchjumps(p, g);
if(g->matchjump == NULL && g->charjump != NULL) {
free(g->charjump);
g->charjump = NULL;
}
}
g->nplus = pluscount(p, g);
g->magic = MAGIC2;
preg->re_nsub = g->nsub;
preg->re_g = g;
preg->re_magic = MAGIC1;
#ifndef REDEBUG
if (g->iflags&BAD)
SETERROR(REG_ASSERT);
#endif
if (p->error != 0)
regfree(preg);
return(p->error);
}
static void
p_ere(struct parse *p,
int stop)
{
char c;
sopno prevback;
sopno prevfwd;
sopno conc;
int first = 1;
for (;;) {
conc = HERE();
while (MORE() && (c = PEEK()) != '|' && c != stop)
p_ere_exp(p);
#if __DARWIN_UNIX03
if (!p->zerorepeats) REQUIRE(HERE() != conc, REG_EMPTY);
else p->zerorepeats--;
#else
(void)REQUIRE(HERE() != conc, REG_EMPTY);
#endif
if (!EAT('|'))
break;
if (first) {
INSERT(OCH_, conc);
prevfwd = conc;
prevback = conc;
first = 0;
}
ASTERN(OOR1, prevback);
prevback = THERE();
AHEAD(prevfwd);
prevfwd = HERE();
EMIT(OOR2, 0);
}
if (!first) {
AHEAD(prevfwd);
ASTERN(O_CH, prevback);
}
assert(!MORE() || SEE(stop));
}
static void
p_ere_exp(struct parse *p)
{
char c;
wint_t wc;
sopno pos;
int count;
int count2;
sopno subno;
int wascaret = 0;
assert(MORE());
c = GETNEXT();
pos = HERE();
switch (c) {
case '(':
(void)REQUIRE(MORE(), REG_EPAREN);
p->g->nsub++;
subno = p->g->nsub;
if (subno < NPAREN)
p->pbegin[subno] = HERE();
EMIT(OLPAREN, subno);
if (!SEE(')'))
p_ere(p, ')');
if (subno < NPAREN) {
p->pend[subno] = HERE();
assert(p->pend[subno] != 0);
}
EMIT(ORPAREN, subno);
(void)MUSTEAT(')', REG_EPAREN);
break;
#ifndef POSIX_MISTAKE
case ')':
SETERROR(REG_EPAREN);
break;
#endif
case '^':
EMIT(OBOL, 0);
p->g->iflags |= USEBOL;
p->g->nbol++;
wascaret = 1;
break;
case '$':
EMIT(OEOL, 0);
p->g->iflags |= USEEOL;
p->g->neol++;
break;
case '|':
SETERROR(REG_EMPTY);
break;
case '*':
case '+':
case '?':
SETERROR(REG_BADRPT);
break;
case '.':
if (p->g->cflags®_NEWLINE)
nonnewline(p);
else
EMIT(OANY, 0);
break;
case '[':
p_bracket(p);
break;
case '\\':
(void)REQUIRE(MORE(), REG_EESCAPE);
wc = WGETNEXT();
ordinary(p, wc);
break;
case '{':
(void)REQUIRE(!MORE() || !isdigit_l((uch)PEEK(), p->g->loc), REG_BADRPT);
default:
p->next--;
wc = WGETNEXT();
ordinary(p, wc);
break;
}
if (!MORE())
return;
c = PEEK();
if (!( c == '*' || c == '+' || c == '?' ||
(c == '{' && MORE2() && isdigit_l((uch)PEEK2(), p->g->loc)) ))
return;
NEXT();
(void)REQUIRE(!wascaret, REG_BADRPT);
switch (c) {
case '*':
INSERT(OPLUS_, pos);
ASTERN(O_PLUS, pos);
INSERT(OQUEST_, pos);
ASTERN(O_QUEST, pos);
break;
case '+':
INSERT(OPLUS_, pos);
ASTERN(O_PLUS, pos);
break;
case '?':
INSERT(OCH_, pos);
ASTERN(OOR1, pos);
AHEAD(pos);
EMIT(OOR2, 0);
AHEAD(THERE());
ASTERN(O_CH, THERETHERE());
break;
case '{':
count = p_count(p);
if (EAT(',')) {
if (isdigit_l((uch)PEEK(), p->g->loc)) {
count2 = p_count(p);
(void)REQUIRE(count <= count2, REG_BADBR);
} else
count2 = INFINITY;
} else
count2 = count;
repeat(p, pos, count, count2);
if (!EAT('}')) {
while (MORE() && PEEK() != '}')
NEXT();
(void)REQUIRE(MORE(), REG_EBRACE);
SETERROR(REG_BADBR);
}
break;
}
if (!MORE())
return;
c = PEEK();
if (!( c == '*' || c == '+' || c == '?' ||
(c == '{' && MORE2() && isdigit_l((uch)PEEK2(), p->g->loc)) ) )
return;
SETERROR(REG_BADRPT);
}
static void
p_str(struct parse *p)
{
#if __DARWIN_UNIX03
if (!p->zerorepeats) REQUIRE(MORE(), REG_EMPTY);
else p->zerorepeats--;
#else
(void)REQUIRE(MORE(), REG_EMPTY);
#endif
while (MORE())
ordinary(p, WGETNEXT());
}
static void
p_bre(struct parse *p,
int end1,
int end2)
{
sopno start = HERE();
int first = 1;
int wasdollar = 0;
if (EAT('^')) {
EMIT(OBOL, 0);
p->g->iflags |= USEBOL;
p->g->nbol++;
}
while (MORE() && !SEETWO(end1, end2)) {
wasdollar = p_simp_re(p, first);
first = 0;
}
if (wasdollar) {
DROP(1);
EMIT(OEOL, 0);
p->g->iflags |= USEEOL;
p->g->neol++;
}
#if __DARWIN_UNIX03
if (!p->zerorepeats) REQUIRE(HERE() != start, REG_EMPTY);
else p->zerorepeats--;
#else
(void)REQUIRE(HERE() != start, REG_EMPTY);
#endif
}
static int
p_simp_re(struct parse *p,
int starordinary)
{
int c;
int count;
int count2;
sopno pos;
int i;
wint_t wc;
sopno subno;
# define BACKSL (1<<CHAR_BIT)
pos = HERE();
assert(MORE());
c = GETNEXT();
if (c == '\\') {
(void)REQUIRE(MORE(), REG_EESCAPE);
c = BACKSL | GETNEXT();
}
switch (c) {
case '.':
if (p->g->cflags®_NEWLINE)
nonnewline(p);
else
EMIT(OANY, 0);
break;
case '[':
p_bracket(p);
break;
case BACKSL|'{':
SETERROR(REG_BADRPT);
break;
case BACKSL|'(':
p->g->nsub++;
subno = p->g->nsub;
if (subno < NPAREN)
p->pbegin[subno] = HERE();
EMIT(OLPAREN, subno);
if (MORE() && !SEETWO('\\', ')'))
p_bre(p, '\\', ')');
if (subno < NPAREN) {
p->pend[subno] = HERE();
assert(p->pend[subno] != 0);
}
EMIT(ORPAREN, subno);
(void)REQUIRE(EATTWO('\\', ')'), REG_EPAREN);
break;
case BACKSL|')':
case BACKSL|'}':
SETERROR(REG_EPAREN);
break;
case BACKSL|'1':
case BACKSL|'2':
case BACKSL|'3':
case BACKSL|'4':
case BACKSL|'5':
case BACKSL|'6':
case BACKSL|'7':
case BACKSL|'8':
case BACKSL|'9':
i = (c&~BACKSL) - '0';
assert(i < NPAREN);
if (p->pend[i] != 0) {
#if __DARWIN_UNIX03
int skip = 1;
#endif
assert(i <= p->g->nsub);
EMIT(OBACK_, i);
assert(p->pbegin[i] != 0);
assert(OP(p->strip[p->pbegin[i]]) == OLPAREN);
assert(OP(p->strip[p->pend[i]]) == ORPAREN);
#if __DARWIN_UNIX03
if (OP(p->strip[p->pbegin[i]+skip]) == OBOL) {
skip++;
}
(void) dupl(p, p->pbegin[i]+skip, p->pend[i]);
#else
(void) dupl(p, p->pbegin[i]+1, p->pend[i]);
#endif
EMIT(O_BACK, i);
} else
SETERROR(REG_ESUBREG);
p->g->backrefs = 1;
break;
case '*':
(void)REQUIRE(starordinary, REG_BADRPT);
default:
p->next--;
wc = WGETNEXT();
ordinary(p, wc);
break;
}
if (EAT('*')) {
INSERT(OPLUS_, pos);
ASTERN(O_PLUS, pos);
INSERT(OQUEST_, pos);
ASTERN(O_QUEST, pos);
} else if (EATTWO('\\', '{')) {
(void)REQUIRE(MORE(), REG_EBRACE);
count = p_count(p);
if (EAT(',')) {
if (MORE() && isdigit_l((uch)PEEK(), p->g->loc)) {
count2 = p_count(p);
(void)REQUIRE(count <= count2, REG_BADBR);
} else
count2 = INFINITY;
} else
count2 = count;
repeat(p, pos, count, count2);
if (!EATTWO('\\', '}')) {
while (MORE() && !SEETWO('\\', '}'))
NEXT();
(void)REQUIRE(MORE(), REG_EBRACE);
SETERROR(REG_BADBR);
}
} else if (c == '$')
return(1);
return(0);
}
static int
p_count(struct parse *p)
{
int count = 0;
int ndigits = 0;
while (MORE() && isdigit_l((uch)PEEK(), p->g->loc) && count <= DUPMAX) {
count = count*10 + (GETNEXT() - '0');
ndigits++;
}
(void)REQUIRE(ndigits > 0 && count <= DUPMAX, REG_BADBR);
return(count);
}
static void
p_bracket(struct parse *p)
{
cset *cs;
wint_t ch;
if (p->next + 5 < p->end && strncmp(p->next, "[:<:]]", 6) == 0) {
EMIT(OBOW, 0);
NEXTn(6);
return;
}
if (p->next + 5 < p->end && strncmp(p->next, "[:>:]]", 6) == 0) {
EMIT(OEOW, 0);
NEXTn(6);
return;
}
if ((cs = allocset(p)) == NULL)
return;
if (p->g->cflags®_ICASE)
cs->icase = 1;
if (EAT('^'))
cs->invert = 1;
#if __DARWIN_UNIX03
if (PEEK2() != '-' && PEEK2() != ']') {
if (EAT(']'))
CHadd(p, cs, ']');
else if (EAT('-'))
CHadd(p, cs, '-');
}
if (MORE() && !SEETWO('-',']'))
p_b_term(p, cs);
#else
if (EAT(']'))
CHadd(p, cs, ']');
else if (EAT('-'))
CHadd(p, cs, '-');
#endif
while (MORE() && PEEK() != ']' && !SEETWO('-', ']'))
p_b_term(p, cs);
if (EAT('-'))
CHadd(p, cs, '-');
(void)MUSTEAT(']', REG_EBRACK);
if (p->error != 0)
return;
if (cs->invert && p->g->cflags®_NEWLINE)
cs->bmp['\n' >> 3] |= 1 << ('\n' & 7);
if ((ch = singleton(cs, p->g->loc)) != OUT) {
ordinary(p, ch);
freeset(p, cs);
} else
EMIT(OANYOF, (int)(cs - p->g->sets));
}
static void
p_b_term(struct parse *p, cset *cs)
{
char c;
wint_t start, finish;
wint_t i;
switch ((MORE()) ? PEEK() : '\0') {
case '[':
c = (MORE2()) ? PEEK2() : '\0';
break;
case '-':
#if __DARWIN_UNIX03
if (PEEK2() != '-') {
SETERROR(REG_ERANGE);
return;
} else
c = '-';
#else
SETERROR(REG_ERANGE);
return;
#endif
break;
default:
c = '\0';
break;
}
switch (c) {
case ':':
NEXT2();
(void)REQUIRE(MORE(), REG_EBRACK);
c = PEEK();
(void)REQUIRE(c != '-' && c != ']', REG_ECTYPE);
p_b_cclass(p, cs);
(void)REQUIRE(MORE(), REG_EBRACK);
(void)REQUIRE(EATTWO(':', ']'), REG_ECTYPE);
break;
case '=':
NEXT2();
(void)REQUIRE(MORE(), REG_EBRACK);
c = PEEK();
#if __DARWIN_UNIX03
REQUIRE(c != '-', REG_ECOLLATE);
#else
(void)REQUIRE(c != '-' && c != ']', REG_ECOLLATE);
#endif
p_b_eclass(p, cs);
(void)REQUIRE(MORE(), REG_EBRACK);
(void)REQUIRE(EATTWO('=', ']'), REG_ECOLLATE);
break;
default:
start = p_b_symbol(p);
if (SEE('-') && MORE2() && PEEK2() != ']') {
NEXT();
if (EAT('-'))
finish = '-';
else
finish = p_b_symbol(p);
} else
finish = start;
if (start == finish)
CHadd(p, cs, start);
else {
if (p->g->loc->__collate_load_error) {
(void)REQUIRE((uch)start <= (uch)finish, REG_ERANGE);
CHaddrange(p, cs, start, finish);
} else {
(void)REQUIRE(__collate_range_cmp(start, finish, p->g->loc) <= 0, REG_ERANGE);
for (i = 0; i <= UCHAR_MAX; i++) {
if ( __collate_range_cmp(start, i, p->g->loc) <= 0
&& __collate_range_cmp(i, finish, p->g->loc) <= 0
)
CHadd(p, cs, i);
}
}
}
break;
}
}
static void
p_b_cclass(struct parse *p, cset *cs)
{
char *sp = p->next;
size_t len;
wctype_t wct;
char clname[16];
while (MORE() && isalpha_l((uch)PEEK(), p->g->loc))
NEXT();
len = p->next - sp;
if (len >= sizeof(clname) - 1) {
SETERROR(REG_ECTYPE);
return;
}
memcpy(clname, sp, len);
clname[len] = '\0';
if ((wct = wctype_l(clname, p->g->loc)) == 0) {
SETERROR(REG_ECTYPE);
return;
}
CHaddtype(p, cs, wct);
}
static void
p_b_eclass(struct parse *p, cset *cs)
{
char *sp = p->next;
int len, ec;
mbstate_t mbs;
int *newequiv_classes;
wint_t c;
while (MORE() && !SEETWO('=', ']'))
NEXT();
if (!MORE()) {
SETERROR(REG_EBRACK);
return;
}
len = p->next - sp;
memset(&mbs, 0, sizeof(mbs));
ec = __collate_equiv_class(sp, len, &mbs, p->g->loc);
if (ec > 0) {
newequiv_classes = realloc(cs->equiv_classes,
(cs->nequiv_classes + 1) * sizeof(*cs->equiv_classes));
if (newequiv_classes == NULL) {
SETERROR(REG_ESPACE);
return;
}
cs->equiv_classes = newequiv_classes;
cs->equiv_classes[cs->nequiv_classes++] = ec;
return;
}
p->next = sp;
c = p_b_coll_elem(p, '=');
CHadd(p, cs, c);
}
static wint_t
p_b_symbol(struct parse *p)
{
wint_t value;
(void)REQUIRE(MORE(), REG_EBRACK);
if (!EATTWO('[', '.'))
return(WGETNEXT());
value = p_b_coll_elem(p, '.');
(void)REQUIRE(EATTWO('.', ']'), REG_ECOLLATE);
return(value);
}
static wint_t
p_b_coll_elem(struct parse *p,
wint_t endc)
{
char *sp = p->next;
const struct cname *cp;
int len;
mbstate_t mbs;
wchar_t wbuf[16];
size_t clen;
while (MORE() && !SEETWO(endc, ']'))
NEXT();
if (!MORE()) {
SETERROR(REG_EBRACK);
return(0);
}
len = p->next - sp;
for (cp = cnames; cp->name != NULL; cp++)
if (strncmp(cp->name, sp, len) == 0 && cp->name[len] == '\0')
return(cp->code);
memset(&mbs, 0, sizeof(mbs));
clen = __collate_collating_symbol(wbuf, 16, sp, len, &mbs, p->g->loc);
if (clen == 1)
return (*wbuf);
else if (clen == (size_t)-1)
SETERROR(REG_ILLSEQ);
else
SETERROR(REG_ECOLLATE);
return(0);
}
static wint_t
othercase(wint_t ch, locale_t loc)
{
assert(iswalpha_l(ch, loc));
if (iswupper_l(ch, loc))
return(towlower_l(ch, loc));
else if (iswlower_l(ch, loc))
return(towupper_l(ch, loc));
else
return(ch);
}
static void
bothcases(struct parse *p, wint_t ch)
{
char *oldnext = p->next;
char *oldend = p->end;
char bracket[3 + MB_LEN_MAX];
size_t n;
mbstate_t mbs;
assert(othercase(ch, p->g->loc) != ch);
p->next = bracket;
memset(&mbs, 0, sizeof(mbs));
n = wcrtomb_l(bracket, ch, &mbs, p->g->loc);
assert(n != (size_t)-1);
bracket[n] = ']';
bracket[n + 1] = '\0';
p->end = bracket+n+1;
p_bracket(p);
assert(p->next == p->end);
p->next = oldnext;
p->end = oldend;
}
static void
ordinary(struct parse *p, wint_t ch)
{
cset *cs;
if ((p->g->cflags®_ICASE) && iswalpha_l(ch, p->g->loc) && othercase(ch, p->g->loc) != ch)
bothcases(p, ch);
else if ((ch & OPDMASK) == ch)
EMIT(OCHAR, ch);
else {
if ((cs = allocset(p)) == NULL)
return;
CHadd(p, cs, ch);
EMIT(OANYOF, (int)(cs - p->g->sets));
}
}
static void
nonnewline(struct parse *p)
{
char *oldnext = p->next;
char *oldend = p->end;
char bracket[4];
p->next = bracket;
p->end = bracket+3;
bracket[0] = '^';
bracket[1] = '\n';
bracket[2] = ']';
bracket[3] = '\0';
p_bracket(p);
assert(p->next == bracket+3);
p->next = oldnext;
p->end = oldend;
}
static void
repeat(struct parse *p,
sopno start,
int from,
int to)
{
sopno finish = HERE();
# define N 2
# define INF 3
# define REP(f, t) ((f)*8 + (t))
# define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
sopno copy;
if (p->error != 0)
return;
assert(from <= to);
switch (REP(MAP(from), MAP(to))) {
case REP(0, 0):
DROP(finish-start);
#if __DARWIN_UNIX03
p->zerorepeats++;
#endif
break;
case REP(0, INF):
#if __DARWIN_UNIX03
INSERT(OPLUS_, start);
ASTERN(O_PLUS, start);
INSERT(OQUEST_, start);
ASTERN(O_QUEST, start);
break;
#endif
case REP(0, 1):
case REP(0, N):
INSERT(OCH_, start);
repeat(p, start+1, 1, to);
ASTERN(OOR1, start);
AHEAD(start);
EMIT(OOR2, 0);
AHEAD(THERE());
ASTERN(O_CH, THERETHERE());
break;
case REP(1, 1):
break;
case REP(1, N):
#if __DARWIN_UNIX03
INSERT(OQUEST_, start);
ASTERN(O_QUEST, start);
#else
INSERT(OCH_, start);
ASTERN(OOR1, start);
AHEAD(start);
EMIT(OOR2, 0);
AHEAD(THERE());
ASTERN(O_CH, THERETHERE());
#endif
copy = dupl(p, start+1, finish+1);
assert(copy == finish+4);
repeat(p, copy, 1, to-1);
break;
case REP(1, INF):
INSERT(OPLUS_, start);
ASTERN(O_PLUS, start);
break;
case REP(N, N):
copy = dupl(p, start, finish);
repeat(p, copy, from-1, to-1);
break;
case REP(N, INF):
copy = dupl(p, start, finish);
repeat(p, copy, from-1, to);
break;
default:
SETERROR(REG_ASSERT);
break;
}
}
static wint_t
wgetnext(struct parse *p)
{
mbstate_t mbs;
wchar_t wc;
size_t n;
memset(&mbs, 0, sizeof(mbs));
n = mbrtowc_l(&wc, p->next, p->end - p->next, &mbs, p->g->loc);
if (n == (size_t)-1 || n == (size_t)-2) {
SETERROR(REG_ILLSEQ);
return (0);
}
if (n == 0)
n = 1;
p->next += n;
return (wc);
}
static int
seterr(struct parse *p, int e)
{
if (p->error == 0)
p->error = e;
p->next = nuls;
p->end = nuls;
return(0);
}
static cset *
allocset(struct parse *p)
{
cset *cs, *ncs;
ncs = realloc(p->g->sets, (p->g->ncsets + 1) * sizeof(*ncs));
if (ncs == NULL) {
SETERROR(REG_ESPACE);
return (NULL);
}
p->g->sets = ncs;
cs = &p->g->sets[p->g->ncsets++];
memset(cs, 0, sizeof(*cs));
return(cs);
}
static void
freeset(struct parse *p, cset *cs)
{
cset *top = &p->g->sets[p->g->ncsets];
free(cs->wides);
free(cs->ranges);
free(cs->types);
memset(cs, 0, sizeof(*cs));
if (cs == top-1)
p->g->ncsets--;
}
static wint_t
singleton(cset *cs, locale_t loc)
{
wint_t i, s, n;
for (i = n = 0; i < NC; i++)
if (CHIN(cs, i, loc)) {
n++;
s = i;
}
if (n == 1)
return (s);
if (cs->nwides == 1 && cs->nranges == 0 && cs->ntypes == 0 &&
cs->icase == 0)
return (cs->wides[0]);
return (OUT);
}
static void
CHadd(struct parse *p, cset *cs, wint_t ch)
{
wint_t nch, *newwides;
assert(ch >= 0);
if (ch < NC)
cs->bmp[ch >> 3] |= 1 << (ch & 7);
else {
newwides = realloc(cs->wides, (cs->nwides + 1) *
sizeof(*cs->wides));
if (newwides == NULL) {
SETERROR(REG_ESPACE);
return;
}
cs->wides = newwides;
cs->wides[cs->nwides++] = ch;
}
if (cs->icase) {
if ((nch = towlower_l(ch, p->g->loc)) < NC)
cs->bmp[nch >> 3] |= 1 << (nch & 7);
if ((nch = towupper_l(ch, p->g->loc)) < NC)
cs->bmp[nch >> 3] |= 1 << (nch & 7);
}
}
static void
CHaddrange(struct parse *p, cset *cs, wint_t min, wint_t max)
{
crange *newranges;
for (; min < NC && min <= max; min++)
CHadd(p, cs, min);
if (min >= max)
return;
newranges = realloc(cs->ranges, (cs->nranges + 1) *
sizeof(*cs->ranges));
if (newranges == NULL) {
SETERROR(REG_ESPACE);
return;
}
cs->ranges = newranges;
cs->ranges[cs->nranges].min = min;
cs->ranges[cs->nranges].min = max;
cs->nranges++;
}
static void
CHaddtype(struct parse *p, cset *cs, wctype_t wct)
{
wint_t i;
wctype_t *newtypes;
for (i = 0; i < NC; i++)
if (iswctype_l(i, wct, p->g->loc))
CHadd(p, cs, i);
newtypes = realloc(cs->types, (cs->ntypes + 1) *
sizeof(*cs->types));
if (newtypes == NULL) {
SETERROR(REG_ESPACE);
return;
}
cs->types = newtypes;
cs->types[cs->ntypes++] = wct;
}
static sopno
dupl(struct parse *p,
sopno start,
sopno finish)
{
sopno ret = HERE();
sopno len = finish - start;
assert(finish >= start);
if (len == 0)
return(ret);
enlarge(p, p->ssize + len);
assert(p->ssize >= p->slen + len);
(void) memcpy((char *)(p->strip + p->slen),
(char *)(p->strip + start), (size_t)len*sizeof(sop));
p->slen += len;
return(ret);
}
static void
doemit(struct parse *p, sop op, size_t opnd)
{
if (p->error != 0)
return;
assert(opnd < 1<<OPSHIFT);
if (p->slen >= p->ssize)
enlarge(p, (p->ssize+1) / 2 * 3);
assert(p->slen < p->ssize);
p->strip[p->slen++] = SOP(op, opnd);
}
static void
doinsert(struct parse *p, sop op, size_t opnd, sopno pos)
{
sopno sn;
sop s;
int i;
if (p->error != 0)
return;
sn = HERE();
EMIT(op, opnd);
assert(HERE() == sn+1);
s = p->strip[sn];
assert(pos > 0);
for (i = 1; i < NPAREN; i++) {
if (p->pbegin[i] >= pos) {
p->pbegin[i]++;
}
if (p->pend[i] >= pos) {
p->pend[i]++;
}
}
memmove((char *)&p->strip[pos+1], (char *)&p->strip[pos],
(HERE()-pos-1)*sizeof(sop));
p->strip[pos] = s;
}
static void
dofwd(struct parse *p, sopno pos, sop value)
{
if (p->error != 0)
return;
assert(value < 1<<OPSHIFT);
p->strip[pos] = OP(p->strip[pos]) | value;
}
static void
enlarge(struct parse *p, sopno size)
{
sop *sp;
if (p->ssize >= size)
return;
sp = (sop *)realloc(p->strip, size*sizeof(sop));
if (sp == NULL) {
SETERROR(REG_ESPACE);
return;
}
p->strip = sp;
p->ssize = size;
}
static void
stripsnug(struct parse *p, struct re_guts *g)
{
g->nstates = p->slen;
g->strip = (sop *)realloc((char *)p->strip, p->slen * sizeof(sop));
if (g->strip == NULL) {
SETERROR(REG_ESPACE);
g->strip = p->strip;
}
}
static void
findmust(struct parse *p, struct re_guts *g)
{
sop *scan;
sop *start;
sop *newstart;
sopno newlen;
sop s;
char *cp;
int offset;
char buf[MB_LEN_MAX];
size_t clen;
mbstate_t mbs;
struct __xlocale_st_runelocale *rl = p->g->loc->__lc_ctype;
if (p->error != 0)
return;
if (rl->__mb_cur_max > 1 &&
strcmp(rl->_CurrentRuneLocale.__encoding, "UTF-8") != 0)
return;
newlen = 0;
offset = 0;
g->moffset = 0;
scan = g->strip + 1;
do {
s = *scan++;
switch (OP(s)) {
case OCHAR:
if (newlen == 0) {
memset(&mbs, 0, sizeof(mbs));
newstart = scan - 1;
}
clen = wcrtomb_l(buf, OPND(s), &mbs, p->g->loc);
if (clen == (size_t)-1)
goto toohard;
newlen += clen;
break;
case OPLUS_:
case OLPAREN:
case ORPAREN:
break;
case OQUEST_:
case OCH_:
offset = altoffset(scan, offset);
scan--;
do {
scan += OPND(s);
s = *scan;
if (OP(s) != O_QUEST && OP(s) != O_CH &&
OP(s) != OOR2) {
g->iflags |= BAD;
return;
}
} while (OP(s) != O_QUEST && OP(s) != O_CH);
case OBOW:
case OEOW:
case OBOL:
case OEOL:
case O_QUEST:
case O_CH:
case OEND:
if (newlen > g->mlen) {
start = newstart;
g->mlen = newlen;
if (offset > -1) {
g->moffset += offset;
offset = newlen;
} else
g->moffset = offset;
} else {
if (offset > -1)
offset += newlen;
}
newlen = 0;
break;
case OANY:
if (newlen > g->mlen) {
start = newstart;
g->mlen = newlen;
if (offset > -1) {
g->moffset += offset;
offset = newlen;
} else
g->moffset = offset;
} else {
if (offset > -1)
offset += newlen;
}
if (offset > -1)
offset++;
newlen = 0;
break;
case OANYOF:
if (newlen > g->mlen) {
start = newstart;
g->mlen = newlen;
if (offset > -1) {
g->moffset += offset;
offset = newlen;
} else
g->moffset = offset;
} else {
if (offset > -1)
offset += newlen;
}
if (offset > -1)
offset++;
newlen = 0;
break;
toohard:
default:
if (newlen > g->mlen) {
start = newstart;
g->mlen = newlen;
if (offset > -1)
g->moffset += offset;
else
g->moffset = offset;
}
offset = -1;
newlen = 0;
break;
}
} while (OP(s) != OEND);
if (g->mlen == 0) {
g->moffset = -1;
return;
}
g->must = malloc((size_t)g->mlen + 1);
if (g->must == NULL) {
g->mlen = 0;
g->moffset = -1;
return;
}
cp = g->must;
scan = start;
memset(&mbs, 0, sizeof(mbs));
while (cp < g->must + g->mlen) {
while (OP(s = *scan++) != OCHAR)
continue;
clen = wcrtomb_l(cp, OPND(s), &mbs, p->g->loc);
assert(clen != (size_t)-1);
cp += clen;
}
assert(cp == g->must + g->mlen);
*cp++ = '\0';
}
static int
altoffset(sop *scan, int offset)
{
int largest;
int try;
sop s;
if (offset == -1)
return -1;
largest = 0;
try = 0;
s = *scan++;
while (OP(s) != O_QUEST && OP(s) != O_CH) {
switch (OP(s)) {
case OOR1:
if (try > largest)
largest = try;
try = 0;
break;
case OQUEST_:
case OCH_:
try = altoffset(scan, try);
if (try == -1)
return -1;
scan--;
do {
scan += OPND(s);
s = *scan;
if (OP(s) != O_QUEST && OP(s) != O_CH &&
OP(s) != OOR2)
return -1;
} while (OP(s) != O_QUEST && OP(s) != O_CH);
scan++;
break;
case OANYOF:
case OCHAR:
case OANY:
try++;
case OBOW:
case OEOW:
case OLPAREN:
case ORPAREN:
case OOR2:
break;
default:
try = -1;
break;
}
if (try == -1)
return -1;
s = *scan++;
}
if (try > largest)
largest = try;
return largest+offset;
}
static void
computejumps(struct parse *p, struct re_guts *g)
{
int ch;
int mindex;
if (p->error != 0)
return;
g->charjump = (int*) malloc((NC + 1) * sizeof(int));
if (g->charjump == NULL)
return;
g->charjump = &g->charjump[-(CHAR_MIN)];
for (ch = CHAR_MIN; ch < (CHAR_MAX + 1); ch++)
g->charjump[ch] = g->mlen;
for (mindex = 0; mindex < g->mlen; mindex++)
g->charjump[(int)g->must[mindex]] = g->mlen - mindex - 1;
}
static void
computematchjumps(struct parse *p, struct re_guts *g)
{
int mindex;
int suffix;
int ssuffix;
int* pmatches;
if (p->error != 0)
return;
pmatches = (int*) malloc(g->mlen * sizeof(unsigned int));
if (pmatches == NULL) {
g->matchjump = NULL;
return;
}
g->matchjump = (int*) malloc(g->mlen * sizeof(unsigned int));
if (g->matchjump == NULL)
return;
for (mindex = 0; mindex < g->mlen; mindex++)
g->matchjump[mindex] = 2*g->mlen - mindex - 1;
for (mindex = g->mlen - 1, suffix = g->mlen; mindex >= 0;
mindex--, suffix--) {
pmatches[mindex] = suffix;
while (suffix < g->mlen
&& g->must[mindex] != g->must[suffix]) {
g->matchjump[suffix] = MIN(g->matchjump[suffix],
g->mlen - mindex - 1);
suffix = pmatches[suffix];
}
}
for (mindex = 0; mindex <= suffix; mindex++)
g->matchjump[mindex] = MIN(g->matchjump[mindex],
g->mlen + suffix - mindex);
ssuffix = pmatches[suffix];
while (suffix < g->mlen) {
while (suffix <= ssuffix && suffix < g->mlen) {
g->matchjump[suffix] = MIN(g->matchjump[suffix],
g->mlen + ssuffix - suffix);
suffix++;
}
if (suffix < g->mlen)
ssuffix = pmatches[ssuffix];
}
free(pmatches);
}
static sopno
pluscount(struct parse *p, struct re_guts *g)
{
sop *scan;
sop s;
sopno plusnest = 0;
sopno maxnest = 0;
if (p->error != 0)
return(0);
scan = g->strip + 1;
do {
s = *scan++;
switch (OP(s)) {
case OPLUS_:
plusnest++;
break;
case O_PLUS:
if (plusnest > maxnest)
maxnest = plusnest;
plusnest--;
break;
}
} while (OP(s) != OEND);
if (plusnest != 0)
g->iflags |= BAD;
return(maxnest);
}