1*3e12c5d1SDavid du Colombier #include <stdlib.h> 2*3e12c5d1SDavid du Colombier #include <stdio.h> 3*3e12c5d1SDavid du Colombier #include "regexp.h" 4*3e12c5d1SDavid du Colombier #include "regcomp.h" 5*3e12c5d1SDavid du Colombier 6*3e12c5d1SDavid du Colombier static Resublist sempty; /* empty set of matches */ 7*3e12c5d1SDavid du Colombier 8*3e12c5d1SDavid du Colombier /* 9*3e12c5d1SDavid du Colombier * return 0 if no match 10*3e12c5d1SDavid du Colombier * >0 if a match 11*3e12c5d1SDavid du Colombier * <0 if we ran out of _relist space 12*3e12c5d1SDavid du Colombier */ 13*3e12c5d1SDavid du Colombier static int 14*3e12c5d1SDavid du Colombier rregexec1(Reprog *progp, /* program to run */ 15*3e12c5d1SDavid du Colombier wchar_t *bol, /* string to run machine on */ 16*3e12c5d1SDavid du Colombier Resub *mp, /* subexpression elements */ 17*3e12c5d1SDavid du Colombier int ms, /* number of elements at mp */ 18*3e12c5d1SDavid du Colombier wchar_t *starts, 19*3e12c5d1SDavid du Colombier wchar_t *eol, 20*3e12c5d1SDavid du Colombier wchar_t startchar) 21*3e12c5d1SDavid du Colombier { 22*3e12c5d1SDavid du Colombier int flag=0; 23*3e12c5d1SDavid du Colombier Reinst *inst; 24*3e12c5d1SDavid du Colombier Relist *tlp; 25*3e12c5d1SDavid du Colombier wchar_t *s; 26*3e12c5d1SDavid du Colombier int i, checkstart; 27*3e12c5d1SDavid du Colombier wchar_t r, *rp, *ep; 28*3e12c5d1SDavid du Colombier int n; 29*3e12c5d1SDavid du Colombier Relist* tl; /* This list, next list */ 30*3e12c5d1SDavid du Colombier Relist* nl; 31*3e12c5d1SDavid du Colombier Relist* tle; /* ends of this and next list */ 32*3e12c5d1SDavid du Colombier Relist* nle; 33*3e12c5d1SDavid du Colombier int match; 34*3e12c5d1SDavid du Colombier 35*3e12c5d1SDavid du Colombier match = 0; 36*3e12c5d1SDavid du Colombier checkstart = startchar; 37*3e12c5d1SDavid du Colombier sempty.m[0].s.rsp = 0; 38*3e12c5d1SDavid du Colombier if(mp!=0) 39*3e12c5d1SDavid du Colombier for(i=0; i<ms; i++) 40*3e12c5d1SDavid du Colombier mp[i].s.rsp = mp[i].e.rep = 0; 41*3e12c5d1SDavid du Colombier _relist[0][0].inst = _relist[1][0].inst = 0; 42*3e12c5d1SDavid du Colombier 43*3e12c5d1SDavid du Colombier /* Execute machine once for each character, including terminal NUL */ 44*3e12c5d1SDavid du Colombier s = starts; 45*3e12c5d1SDavid du Colombier do{ 46*3e12c5d1SDavid du Colombier r = *s; 47*3e12c5d1SDavid du Colombier 48*3e12c5d1SDavid du Colombier /* fast check for first char */ 49*3e12c5d1SDavid du Colombier if(checkstart && r!=startchar){ 50*3e12c5d1SDavid du Colombier s++; 51*3e12c5d1SDavid du Colombier continue; 52*3e12c5d1SDavid du Colombier } 53*3e12c5d1SDavid du Colombier 54*3e12c5d1SDavid du Colombier /* switch run lists */ 55*3e12c5d1SDavid du Colombier tl = _relist[flag]; 56*3e12c5d1SDavid du Colombier tle = _reliste[flag]; 57*3e12c5d1SDavid du Colombier nl = _relist[flag^=1]; 58*3e12c5d1SDavid du Colombier nle = _reliste[flag]; 59*3e12c5d1SDavid du Colombier nl->inst = 0; 60*3e12c5d1SDavid du Colombier 61*3e12c5d1SDavid du Colombier /* Add first instruction to current list */ 62*3e12c5d1SDavid du Colombier sempty.m[0].s.rsp = s; 63*3e12c5d1SDavid du Colombier _renewthread(tl, progp->startinst, &sempty); 64*3e12c5d1SDavid du Colombier 65*3e12c5d1SDavid du Colombier /* Execute machine until current list is empty */ 66*3e12c5d1SDavid du Colombier for(tlp=tl; tlp->inst; tlp++){ /* assignment = */ 67*3e12c5d1SDavid du Colombier if(s == eol) 68*3e12c5d1SDavid du Colombier break; 69*3e12c5d1SDavid du Colombier 70*3e12c5d1SDavid du Colombier for(inst=tlp->inst; ; inst = inst->l.next){ 71*3e12c5d1SDavid du Colombier switch(inst->type){ 72*3e12c5d1SDavid du Colombier case RUNE: /* regular character */ 73*3e12c5d1SDavid du Colombier if(inst->r.r == r) 74*3e12c5d1SDavid du Colombier if(_renewthread(nl, inst->l.next, &tlp->se)==nle) 75*3e12c5d1SDavid du Colombier return -1; 76*3e12c5d1SDavid du Colombier break; 77*3e12c5d1SDavid du Colombier case LBRA: 78*3e12c5d1SDavid du Colombier tlp->se.m[inst->r.subid].s.rsp = s; 79*3e12c5d1SDavid du Colombier continue; 80*3e12c5d1SDavid du Colombier case RBRA: 81*3e12c5d1SDavid du Colombier tlp->se.m[inst->r.subid].e.rep = s; 82*3e12c5d1SDavid du Colombier continue; 83*3e12c5d1SDavid du Colombier case ANY: 84*3e12c5d1SDavid du Colombier if(r != '\n') 85*3e12c5d1SDavid du Colombier if(_renewthread(nl, inst->l.next, &tlp->se)==nle) 86*3e12c5d1SDavid du Colombier return -1; 87*3e12c5d1SDavid du Colombier break; 88*3e12c5d1SDavid du Colombier case ANYNL: 89*3e12c5d1SDavid du Colombier if(_renewthread(nl, inst->l.next, &tlp->se)==nle) 90*3e12c5d1SDavid du Colombier return -1; 91*3e12c5d1SDavid du Colombier break; 92*3e12c5d1SDavid du Colombier case BOL: 93*3e12c5d1SDavid du Colombier if(s == bol || *(s-1) == '\n') 94*3e12c5d1SDavid du Colombier continue; 95*3e12c5d1SDavid du Colombier break; 96*3e12c5d1SDavid du Colombier case EOL: 97*3e12c5d1SDavid du Colombier if(r == 0 || r == '\n') 98*3e12c5d1SDavid du Colombier continue; 99*3e12c5d1SDavid du Colombier break; 100*3e12c5d1SDavid du Colombier case CCLASS: 101*3e12c5d1SDavid du Colombier ep = inst->r.cp->end; 102*3e12c5d1SDavid du Colombier for(rp = inst->r.cp->spans; rp < ep; rp += 2) 103*3e12c5d1SDavid du Colombier if(r >= rp[0] && r <= rp[1]){ 104*3e12c5d1SDavid du Colombier if(_renewthread(nl, inst->l.next, &tlp->se)==nle) 105*3e12c5d1SDavid du Colombier return -1; 106*3e12c5d1SDavid du Colombier break; 107*3e12c5d1SDavid du Colombier } 108*3e12c5d1SDavid du Colombier break; 109*3e12c5d1SDavid du Colombier case NCCLASS: 110*3e12c5d1SDavid du Colombier ep = inst->r.cp->end; 111*3e12c5d1SDavid du Colombier for(rp = inst->r.cp->spans; rp < ep; rp += 2) 112*3e12c5d1SDavid du Colombier if(r >= rp[0] && r <= rp[1]) 113*3e12c5d1SDavid du Colombier break; 114*3e12c5d1SDavid du Colombier if(rp == ep) 115*3e12c5d1SDavid du Colombier if(_renewthread(nl, inst->l.next, &tlp->se)==nle) 116*3e12c5d1SDavid du Colombier return -1; 117*3e12c5d1SDavid du Colombier break; 118*3e12c5d1SDavid du Colombier case OR: 119*3e12c5d1SDavid du Colombier /* evaluate right choice later */ 120*3e12c5d1SDavid du Colombier if(_renewthread(tlp, inst->r.right, &tlp->se) == tle) 121*3e12c5d1SDavid du Colombier return -1; 122*3e12c5d1SDavid du Colombier /* efficiency: advance and re-evaluate */ 123*3e12c5d1SDavid du Colombier continue; 124*3e12c5d1SDavid du Colombier case END: /* Match! */ 125*3e12c5d1SDavid du Colombier match = 1; 126*3e12c5d1SDavid du Colombier tlp->se.m[0].e.rep = s; 127*3e12c5d1SDavid du Colombier if(mp != 0) 128*3e12c5d1SDavid du Colombier _renewmatch(mp, ms, &tlp->se); 129*3e12c5d1SDavid du Colombier break; 130*3e12c5d1SDavid du Colombier } 131*3e12c5d1SDavid du Colombier break; 132*3e12c5d1SDavid du Colombier } 133*3e12c5d1SDavid du Colombier } 134*3e12c5d1SDavid du Colombier checkstart = startchar && nl->inst==0; 135*3e12c5d1SDavid du Colombier s++; 136*3e12c5d1SDavid du Colombier }while(r); 137*3e12c5d1SDavid du Colombier return match; 138*3e12c5d1SDavid du Colombier } 139*3e12c5d1SDavid du Colombier 140*3e12c5d1SDavid du Colombier extern int 141*3e12c5d1SDavid du Colombier rregexec(Reprog *progp, /* program to run */ 142*3e12c5d1SDavid du Colombier wchar_t *bol, /* string to run machine on */ 143*3e12c5d1SDavid du Colombier Resub *mp, /* subexpression elements */ 144*3e12c5d1SDavid du Colombier int ms) /* number of elements at mp */ 145*3e12c5d1SDavid du Colombier { 146*3e12c5d1SDavid du Colombier wchar_t *starts; /* where to start match */ 147*3e12c5d1SDavid du Colombier wchar_t *eol; /* where to end match */ 148*3e12c5d1SDavid du Colombier wchar_t startchar; 149*3e12c5d1SDavid du Colombier int rv; 150*3e12c5d1SDavid du Colombier 151*3e12c5d1SDavid du Colombier /* 152*3e12c5d1SDavid du Colombier * use user-specified starting/ending location if specified 153*3e12c5d1SDavid du Colombier */ 154*3e12c5d1SDavid du Colombier starts = bol; 155*3e12c5d1SDavid du Colombier eol = 0; 156*3e12c5d1SDavid du Colombier if(mp && ms>0){ 157*3e12c5d1SDavid du Colombier if(mp->s.rsp) 158*3e12c5d1SDavid du Colombier starts = mp->s.rsp; 159*3e12c5d1SDavid du Colombier if(mp->e.rep) 160*3e12c5d1SDavid du Colombier eol = mp->e.rep; 161*3e12c5d1SDavid du Colombier } 162*3e12c5d1SDavid du Colombier startchar = progp->startinst->type == RUNE ? progp->startinst->r.r : 0; 163*3e12c5d1SDavid du Colombier 164*3e12c5d1SDavid du Colombier /* keep trying till we have enough list space to terminate */ 165*3e12c5d1SDavid du Colombier for(;;){ 166*3e12c5d1SDavid du Colombier if(_relist[0] == 0){ 167*3e12c5d1SDavid du Colombier _relist[0] = malloc(2*_relistsize*sizeof(Relist)); 168*3e12c5d1SDavid du Colombier _relist[1] = _relist[0] + _relistsize; 169*3e12c5d1SDavid du Colombier _reliste[0] = _relist[0] + _relistsize - 1; 170*3e12c5d1SDavid du Colombier _reliste[1] = _relist[1] + _relistsize - 1; 171*3e12c5d1SDavid du Colombier if(_relist[0] == 0) 172*3e12c5d1SDavid du Colombier regerror("_relist overflow"); 173*3e12c5d1SDavid du Colombier } 174*3e12c5d1SDavid du Colombier rv = rregexec1(progp, bol, mp, ms, starts, eol, startchar); 175*3e12c5d1SDavid du Colombier if(rv >= 0) 176*3e12c5d1SDavid du Colombier return rv; 177*3e12c5d1SDavid du Colombier free(_relist[0]); 178*3e12c5d1SDavid du Colombier _relist[0] = 0; 179*3e12c5d1SDavid du Colombier _relistsize += LISTINCREMENT; 180*3e12c5d1SDavid du Colombier } 181*3e12c5d1SDavid du Colombier } 182