#include "tcl.h"
#include "expect_cf.h"
#include "exp_prog.h"
#include "tclRegexp.h"
#include "exp_regexp.h"
#include "string.h"
#define NOTSTATIC
#define END 0
#define BOL 1
#define EOL 2
#define ANY 3
#define ANYOF 4
#define ANYBUT 5
#define BRANCH 6
#define BACK 7
#define EXACTLY 8
#define NOTHING 9
#define STAR 10
#define PLUS 11
#define OPEN 20
#define CLOSE (OPEN+NSUBEXP)
#define OP(p) (*(p))
#define NEXT(p) (((*((p)+1)&0377)<<8) + (*((p)+2)&0377))
#define OPERAND(p) ((p) + 3)
#ifndef CHARBITS
#define UCHARAT(p) ((int)*(unsigned char *)(p))
#else
#define UCHARAT(p) ((int)*(p)&CHARBITS)
#endif
#define FAIL(m) { regerror(m); return(NULL); }
#define ISMULT(c) ((c) == '*' || (c) == '+' || (c) == '?')
#define META "^$.[()|?+*\\"
#define HASWIDTH 01
#define SIMPLE 02
#define SPSTART 04
#define WORST 0
static char *regparse;
static int regnpar;
static char regdummy;
static char *regcode;
static long regsize;
#define MAGIC 0234
#ifndef STATIC
#define STATIC static
#endif
STATIC char *reg();
STATIC char *regbranch();
STATIC char *regpiece();
STATIC char *regatom();
STATIC char *regnode();
STATIC char *regnext();
STATIC void regc();
STATIC void reginsert();
STATIC void regtail();
STATIC void regoptail();
#ifdef STRCSPN
STATIC int strcspn();
#endif
static char *
reg(paren, flagp)
int paren;
int *flagp;
{
register char *ret;
register char *br;
register char *ender;
register int parno = 0;
int flags;
*flagp = HASWIDTH;
if (paren) {
if (regnpar >= NSUBEXP)
FAIL("too many ()");
parno = regnpar;
regnpar++;
ret = regnode(OPEN+parno);
} else
ret = NULL;
br = regbranch(&flags);
if (br == NULL)
return(NULL);
if (ret != NULL)
regtail(ret, br);
else
ret = br;
if (!(flags&HASWIDTH))
*flagp &= ~HASWIDTH;
*flagp |= flags&SPSTART;
while (*regparse == '|') {
regparse++;
br = regbranch(&flags);
if (br == NULL)
return(NULL);
regtail(ret, br);
if (!(flags&HASWIDTH))
*flagp &= ~HASWIDTH;
*flagp |= flags&SPSTART;
}
ender = regnode((paren) ? CLOSE+parno : END);
regtail(ret, ender);
for (br = ret; br != NULL; br = regnext(br))
regoptail(br, ender);
if (paren && *regparse++ != ')') {
FAIL("unmatched ()");
} else if (!paren && *regparse != '\0') {
if (*regparse == ')') {
FAIL("unmatched ()");
} else
FAIL("junk on end");
}
return(ret);
}
static char *
regbranch(flagp)
int *flagp;
{
register char *ret;
register char *chain;
register char *latest;
int flags;
*flagp = WORST;
ret = regnode(BRANCH);
chain = NULL;
while (*regparse != '\0' && *regparse != '|' && *regparse != ')') {
latest = regpiece(&flags);
if (latest == NULL)
return(NULL);
*flagp |= flags&HASWIDTH;
if (chain == NULL)
*flagp |= flags&SPSTART;
else
regtail(chain, latest);
chain = latest;
}
if (chain == NULL)
(void) regnode(NOTHING);
return(ret);
}
static char *
regpiece(flagp)
int *flagp;
{
register char *ret;
register char op;
register char *next;
int flags;
ret = regatom(&flags);
if (ret == NULL)
return(NULL);
op = *regparse;
if (!ISMULT(op)) {
*flagp = flags;
return(ret);
}
if (!(flags&HASWIDTH) && op != '?')
FAIL("*+ operand could be empty");
*flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
if (op == '*' && (flags&SIMPLE))
reginsert(STAR, ret);
else if (op == '*') {
reginsert(BRANCH, ret);
regoptail(ret, regnode(BACK));
regoptail(ret, ret);
regtail(ret, regnode(BRANCH));
regtail(ret, regnode(NOTHING));
} else if (op == '+' && (flags&SIMPLE))
reginsert(PLUS, ret);
else if (op == '+') {
next = regnode(BRANCH);
regtail(ret, next);
regtail(regnode(BACK), ret);
regtail(next, regnode(BRANCH));
regtail(ret, regnode(NOTHING));
} else if (op == '?') {
reginsert(BRANCH, ret);
regtail(ret, regnode(BRANCH));
next = regnode(NOTHING);
regtail(ret, next);
regoptail(ret, next);
}
regparse++;
if (ISMULT(*regparse))
FAIL("nested *?+");
return(ret);
}
static char *
regatom(flagp)
int *flagp;
{
register char *ret;
int flags;
*flagp = WORST;
switch (*regparse++) {
case '^':
ret = regnode(BOL);
break;
case '$':
ret = regnode(EOL);
break;
case '.':
ret = regnode(ANY);
*flagp |= HASWIDTH|SIMPLE;
break;
case '[': {
register int clss;
register int classend;
if (*regparse == '^') {
ret = regnode(ANYBUT);
regparse++;
} else
ret = regnode(ANYOF);
if (*regparse == ']' || *regparse == '-')
regc(*regparse++);
while (*regparse != '\0' && *regparse != ']') {
if (*regparse == '-') {
regparse++;
if (*regparse == ']' || *regparse == '\0')
regc('-');
else {
clss = UCHARAT(regparse-2)+1;
classend = UCHARAT(regparse);
if (clss > classend+1)
FAIL("invalid [] range");
for (; clss <= classend; clss++)
regc((char)clss);
regparse++;
}
} else
regc(*regparse++);
}
regc('\0');
if (*regparse != ']')
FAIL("unmatched []");
regparse++;
*flagp |= HASWIDTH|SIMPLE;
}
break;
case '(':
ret = reg(1, &flags);
if (ret == NULL)
return(NULL);
*flagp |= flags&(HASWIDTH|SPSTART);
break;
case '\0':
case '|':
case ')':
FAIL("internal urp");
break;
case '?':
case '+':
case '*':
FAIL("?+* follows nothing");
break;
case '\\':
if (*regparse == '\0')
FAIL("trailing \\");
ret = regnode(EXACTLY);
regc(*regparse++);
regc('\0');
*flagp |= HASWIDTH|SIMPLE;
break;
default: {
register int len;
register char ender;
regparse--;
len = strcspn(regparse, META);
if (len <= 0)
FAIL("internal disaster");
ender = *(regparse+len);
if (len > 1 && ISMULT(ender))
len--;
*flagp |= HASWIDTH;
if (len == 1)
*flagp |= SIMPLE;
ret = regnode(EXACTLY);
while (len > 0) {
regc(*regparse++);
len--;
}
regc('\0');
}
break;
}
return(ret);
}
static char *
regnode(op)
int op;
{
register char *ret;
register char *ptr;
ret = regcode;
if (ret == ®dummy) {
regsize += 3;
return(ret);
}
ptr = ret;
*ptr++ = (char)op;
*ptr++ = '\0';
*ptr++ = '\0';
regcode = ptr;
return(ret);
}
static void
regc(b)
int b;
{
if (regcode != ®dummy)
*regcode++ = (char)b;
else
regsize++;
}
static void
reginsert(op, opnd)
int op;
char *opnd;
{
register char *src;
register char *dst;
register char *place;
if (regcode == ®dummy) {
regsize += 3;
return;
}
src = regcode;
regcode += 3;
dst = regcode;
while (src > opnd)
*--dst = *--src;
place = opnd;
*place++ = (char)op;
*place++ = '\0';
*place = '\0';
}
static void
regtail(p, val)
char *p;
char *val;
{
register char *scan;
register char *temp;
register int offset;
if (p == ®dummy)
return;
scan = p;
for (;;) {
temp = regnext(scan);
if (temp == NULL)
break;
scan = temp;
}
if (OP(scan) == BACK)
offset = scan - val;
else
offset = val - scan;
*(scan+1) = (char)(offset>>8)&0377;
*(scan+2) = (char)offset&0377;
}
static void
regoptail(p, val)
char *p;
char *val;
{
if (p == NULL || p == ®dummy || OP(p) != BRANCH)
return;
regtail(OPERAND(p), val);
}
static char *reginput;
NOTSTATIC char *regbol;
static char **regstartp;
static char **regendp;
NOTSTATIC int regtry();
STATIC int regmatch();
STATIC int regrepeat();
#ifdef DEBUG
int regnarrate = 0;
void regdump();
STATIC char *regprop();
#endif
#if 0
int
regexec(prog, string, stringlength, matchlength)
register regexp *prog;
register char *string;
int stringlength;
int *matchlength;
{
register char *s;
extern char *strchr();
if (prog == NULL || string == NULL) {
regerror("NULL parameter");
return(EXP_TCLERROR);
}
if (UCHARAT(prog->program) != MAGIC) {
regerror("corrupted program");
return(EXP_KM_ERROR);
}
#if THIS_RUINS_EXP
if (prog->regmust != NULL) {
s = string;
while ((s = strchr(s, prog->regmust[0])) != NULL) {
if (strncmp(s, prog->regmust, prog->regmlen) == 0)
break;
s++;
}
if (s == NULL)
return(0);
}
#endif
regbol = string;
if (prog->reganch) {
int r = regtry(prog,string,matchlength);
if (r == CANT_MATCH) *matchlength = stringlength;
return(r);
}
s = string;
if (prog->regstart != '\0') {
register char *s2 = s;
while (1) {
int r;
s2 = strchr(s2,prog->regstart);
if (s2 == 0) {
*matchlength = stringlength;
return(CANT_MATCH);
}
r = regtry(prog,s2,matchlength);
if (r == CANT_MATCH) {
s2++;
continue;
}
if (s2 == s) return(r);
*matchlength = s2-s;
return CANT_MATCH;
}
} else {
register char *s2 = s;
int r = regtry(prog,s,matchlength);
if (r == EXP_MATCH) return(r);
else if (r == EXP_CANMATCH) return(r);
for (s2++;*s2;s2++) {
r = regtry(prog,s2,matchlength);
if (r == CANT_MATCH) continue;
*matchlength = s2-s;
return(CANT_MATCH);
}
*matchlength = stringlength;
return(CANT_MATCH);
}
}
#endif
int
regtry(prog, string, matchlength)
regexp *prog;
char *string;
int *matchlength;
{
register int i;
register char **sp;
register char **ep;
int r;
reginput = string;
regstartp = prog->startp;
regendp = prog->endp;
sp = prog->startp;
ep = prog->endp;
for (i = NSUBEXP; i > 0; i--) {
*sp++ = NULL;
*ep++ = NULL;
}
r = regmatch(prog->program + 1);
if (EXP_MATCH == r) {
prog->startp[0] = string;
prog->endp[0] = reginput;
*matchlength = reginput-string;
return(EXP_MATCH);
}
return(r);
}
static int
regmatch(prog)
char *prog;
{
register char *scan;
char *next;
#ifndef strchr
extern char *strchr();
#endif
scan = prog;
#ifdef DEBUG
if (scan != NULL && regnarrate)
fprintf(stderr, "%s(\n", regprop(scan));
#endif
while (scan != NULL) {
#ifdef DEBUG
if (regnarrate)
fprintf(stderr, "%s...\n", regprop(scan));
#endif
next = regnext(scan);
switch (OP(scan)) {
case BOL:
if (reginput != regbol)
return(EXP_CANTMATCH);
break;
case EOL:
if (*reginput != '\0')
return(EXP_CANTMATCH);
break;
case ANY:
if (*reginput == '\0')
return(EXP_CANMATCH);
reginput++;
break;
case EXACTLY: {
register char *opnd;
opnd = OPERAND(scan);
do {
if (*opnd != *reginput) {
if (*reginput == '\0') {
return EXP_CANMATCH;
} else return EXP_CANTMATCH;
}
reginput++;
opnd++;
} while (*opnd != '\0');
}
break;
case ANYOF:
if (*reginput == '\0')
return(EXP_CANMATCH);
if (strchr(OPERAND(scan),*reginput) == NULL)
return(EXP_CANTMATCH);
reginput++;
break;
case ANYBUT:
if (*reginput == '\0')
return(EXP_CANMATCH);
if (strchr(OPERAND(scan),*reginput) != NULL)
return(EXP_CANTMATCH);
reginput++;
break;
case NOTHING:
break;
case BACK:
break;
case OPEN+1:
case OPEN+2:
case OPEN+3:
case OPEN+4:
case OPEN+5:
case OPEN+6:
case OPEN+7:
case OPEN+8:
case OPEN+9: {
register int no;
register char *save;
int r;
doOpen:
no = OP(scan) - OPEN;
save = reginput;
r = regmatch(next);
if (r == EXP_MATCH) {
if (regstartp[no] == NULL)
regstartp[no] = save;
}
return(r);
}
break;
case CLOSE+1:
case CLOSE+2:
case CLOSE+3:
case CLOSE+4:
case CLOSE+5:
case CLOSE+6:
case CLOSE+7:
case CLOSE+8:
case CLOSE+9: {
register int no;
register char *save;
int r;
doClose:
no = OP(scan) - CLOSE;
save = reginput;
r = regmatch(next);
if (r == EXP_MATCH) {
if (regendp[no] == NULL)
regendp[no] = save;
}
return(r);
}
break;
case BRANCH: {
register char *save;
int match_status;
if (OP(next) != BRANCH)
next = OPERAND(scan);
else {
match_status = EXP_CANTMATCH;
do {
int r;
save = reginput;
r = regmatch(OPERAND(scan));
if (r == EXP_MATCH) return(r);
if (r == EXP_CANMATCH) {
match_status = r;
}
reginput = save;
scan = regnext(scan);
} while (scan != NULL && OP(scan) == BRANCH);
return(match_status);
}
}
break;
case STAR:
case PLUS: {
register char nextch;
register int no;
register char *save;
register int min;
int match_status;
match_status = EXP_CANTMATCH;
nextch = '\0';
if (OP(next) == EXACTLY)
nextch = *OPERAND(next);
min = (OP(scan) == STAR) ? 0 : 1;
save = reginput;
no = regrepeat(OPERAND(scan));
while (no >= min) {
if (nextch == '\0' || *reginput == nextch || *reginput == '\0') {
int r = regmatch(next);
if (r == EXP_MATCH)
return(EXP_MATCH);
if (r == EXP_CANMATCH)
match_status = r;
}
no--;
reginput = save + no;
}
return(match_status);
}
break;
case END:
return(EXP_MATCH);
break;
default:
if (OP(scan) > OPEN && OP(scan) < OPEN+NSUBEXP) {
goto doOpen;
} else if (OP(scan) > CLOSE && OP(scan) < CLOSE+NSUBEXP) {
goto doClose;
}
regerror("memory corruption");
return(EXP_TCLERROR);
break;
}
scan = next;
}
regerror("corrupted pointers");
return(EXP_TCLERROR);
}
static int
regrepeat(p)
char *p;
{
register int count = 0;
register char *scan;
register char *opnd;
#ifndef strchr
extern char *strchr();
#endif
scan = reginput;
opnd = OPERAND(p);
switch (OP(p)) {
case ANY:
count = strlen(scan);
scan += count;
break;
case EXACTLY:
while (*opnd == *scan) {
count++;
scan++;
}
break;
case ANYOF:
while (*scan != '\0' && strchr(opnd, *scan) != NULL) {
count++;
scan++;
}
break;
case ANYBUT:
while (*scan != '\0' && strchr(opnd, *scan) == NULL) {
count++;
scan++;
}
break;
default:
regerror("internal foulup");
count = 0;
break;
}
reginput = scan;
return(count);
}
static char *
regnext(p)
register char *p;
{
register int offset;
if (p == ®dummy)
return(NULL);
offset = NEXT(p);
if (offset == 0)
return(NULL);
if (OP(p) == BACK)
return(p-offset);
else
return(p+offset);
}
#ifdef DEBUG
STATIC char *regprop();
void
regdump(r)
regexp *r;
{
register char *s;
register char op = EXACTLY;
register char *next;
extern char *strchr();
s = r->program + 1;
while (op != END) {
op = OP(s);
printf("%2d%s", s-r->program, regprop(s));
next = regnext(s);
if (next == NULL)
printf("(0)");
else
printf("(%d)", (s-r->program)+(next-s));
s += 3;
if (op == ANYOF || op == ANYBUT || op == EXACTLY) {
while (*s != '\0') {
putchar(*s);
s++;
}
s++;
}
putchar('\n');
}
if (r->regstart != '\0')
printf("start `%c' ", r->regstart);
if (r->reganch)
printf("anchored ");
if (r->regmust != NULL)
printf("must have \"%s\"", r->regmust);
printf("\n");
}
static char *
regprop(op)
char *op;
{
register char *p;
static char buf[50];
(void) strcpy(buf, ":");
switch (OP(op)) {
case BOL:
p = "BOL";
break;
case EOL:
p = "EOL";
break;
case ANY:
p = "ANY";
break;
case ANYOF:
p = "ANYOF";
break;
case ANYBUT:
p = "ANYBUT";
break;
case BRANCH:
p = "BRANCH";
break;
case EXACTLY:
p = "EXACTLY";
break;
case NOTHING:
p = "NOTHING";
break;
case BACK:
p = "BACK";
break;
case END:
p = "END";
break;
case OPEN+1:
case OPEN+2:
case OPEN+3:
case OPEN+4:
case OPEN+5:
case OPEN+6:
case OPEN+7:
case OPEN+8:
case OPEN+9:
sprintf(buf+strlen(buf), "OPEN%d", OP(op)-OPEN);
p = NULL;
break;
case CLOSE+1:
case CLOSE+2:
case CLOSE+3:
case CLOSE+4:
case CLOSE+5:
case CLOSE+6:
case CLOSE+7:
case CLOSE+8:
case CLOSE+9:
sprintf(buf+strlen(buf), "CLOSE%d", OP(op)-CLOSE);
p = NULL;
break;
case STAR:
p = "STAR";
break;
case PLUS:
p = "PLUS";
break;
default:
if (OP(op) > OPEN && OP(op) < OPEN+NSUBEXP) {
sprintf(buf+strlen(buf), "OPEN%d", OP(op)-OPEN);
p = NULL;
break;
} else if (OP(op) > CLOSE && OP(op) < CLOSE+NSUBEXP) {
sprintf(buf+strlen(buf), "CLOSE%d", OP(op)-CLOSE);
p = NULL;
} else {
TclRegError("corrupted opcode");
}
break;
}
if (p != NULL)
(void) strcat(buf, p);
return(buf);
}
#endif
#ifdef STRCSPN
static int
strcspn(s1, s2)
char *s1;
char *s2;
{
register char *scan1;
register char *scan2;
register int count;
count = 0;
for (scan1 = s1; *scan1 != '\0'; scan1++) {
for (scan2 = s2; *scan2 != '\0';)
if (*scan1 == *scan2++)
return(count);
count++;
}
return(count);
}
#endif